Search

We consider a downlink multi-user scenario and investigate the use of reconfigurable intelligent surfaces (RISs) to maximize the dirty-paper-coding (DPC) sum rate of the RIS-assisted broadcast channel. Different from prior works, which maximize the rate achievable by linear precoders, we assume a capacity-achieving DPC scheme is employed at the transmitter and optimize the transmit covariances and RIS reflection coefficients to directly maximize the sum capacity of the broadcast channel. We propose an optimization algorithm that iteratively alternates between optimizing the transmit covariances using convex optimization and the RIS reflection coefficients using Riemannian manifold optimization. Our results show that the proposed technique can be used to effectively improve the sum capacity in a variety of scenarios compared to benchmark schemes.

The expected development of the future generation of wireless communications systems such as 6G aims to achieve an ultrareliable and low-latency communications (URLLCs) while maximizing the data rates. These requirements push research into developing new advanced technologies. To this end, massive multiple input multiple output (MMIMO) is introduced as a promising transmission approach to fulfill these requirements. However, maximizing the downlink-achievable sum rate (DASR) in MMIMO with a frequency division duplex (FDD) transmission mode and limited coherence time (LCT) is very challenging. To address this challenge, this paper proposes a DASR maximization approach using a feasible power allocation optimization method. The proposed approach is based on smartly allocating the total transmit power between the data transmission and training sequence transmission for channel estimation. This can be achieved by allocating more energy to the training signal than the data transmission during the channel estimation process to improve the quality of channel estimation without compromising more training sequence length, thus maximizing the DASR. Additionally, the theory of random matrix approach is exploited to derive an asymptotic closed-form expression for the DASR with a regularized zero-forcing precoder (RZFP), which allows the power optimization process to be achieved without the need for computationally complex Monte Carlo simulations. The results provided in this paper indicate that a considerable enhancement in the DASR performance is achieved using the proposed power allocation method in comparison with the conventional uniform power allocation method. [ABSTRACT FROM AUTHOR]

Bluetooth Low Energy Mesh (BLE Mesh) enables Bluetooth flexibility and coverage by introducing Low-Power Nodes (LPNs) and enhanced networking protocol. It is also a commonly used communication method in sensor networks. In BLE Mesh, LPNs are periodically woken to exchange messages in a stop-and-wait way, where the tradeoff between energy and efficiency is a hard problem. Related works have reduced the energy consumption of LPNs mainly in the direction of changing the bearer layer, improving time synchronization and broadcast channel utilization. These algorithms improve communication efficiency; however, they cause energy loss, especially for the LPNs. In this paper, we propose a constrained flooding algorithm based on time series prediction and lightweight GBN (Go-Back-N). On the one hand, the wake-up cycle of the LPNs is determined by the time series prediction of the surrounding load. On the other, LPNs exchange messages through lightweight GBN, which improves the window and ACK mechanisms. Simulation results validate the effectiveness of the Time series Prediction and LlightWeight GBN (TP-LW) algorithm in energy consumption and throughput. Compared with the original algorithm of BLE Mesh, when fewer packets are transmitted, the throughput is increased by 214.71%, and the energy consumption is reduced by 65.14%. [ABSTRACT FROM AUTHOR]

In this paper, we want to investigate classical-quantum multiple access wiretap channels (CQ-MA-WTC) under one-shot setting. In this regard, we analyze the CQ-MA-WTC using a simultaneous position-based decoder for reliable decoding and using a newly introduced technique to decode securely. Also, for the sake of comparison, we analyze the CQ-MA-WTC using Sen's one-shot joint typicality lemma for reliable decoding. The simultaneous position-based decoder tends to a multiple hypothesis testing problem. Also, using convex splitting to analyze the privacy criteria in a simultaneous scenario becomes problematic. To overcome both problems, we first introduce a new channel that can be considered as a dual to the CQ-MA-WTC. This channel is called a point-to-point quantum wiretap channel with multiple messages (PP-QWTC). In the following, as a strategy to solve the problem, we also investigate and analyze quantum broadcast channels (QBC) in the one-shot regime. [ABSTRACT FROM AUTHOR]

Uplink-downlink duality refers to the fact that under a sum-power constraint, the capacity regions of a Gaussian multiple-access channel and a Gaussian broadcast channel with Hermitian transposed channel matrices are identical. This paper generalizes this result to a cooperative cellular network, in which remote access-points are deployed as relays in serving the users under the coordination of a central processor (CP). In this model, the users and the relays are connected over noisy wireless links, while the relays and the CP are connected over noiseless but rate-limited fronthaul links. Based on a Lagrangian technique, this paper establishes a duality relationship between such a multiple-access relay channel and broadcast relay channel, under the assumption that the relays use compression-based strategies. Specifically, we show that under the same total transmit power constraint and individual fronthaul rate constraints, the achievable rate regions of the Gaussian multiple-access and broadcast relay channels are identical, when either independent compression or Wyner-Ziv and multivariate compression strategies are used. The key observations are that if the beamforming vectors at the relays are fixed, the sum-power minimization problems under the achievable rate and fronthaul constraints in both the uplink and the downlink can be transformed into either a linear programming or a semidefinite programming problem depending on the compression technique, and that the uplink and downlink problems are Lagrangian duals of each other. Moreover, the dual variables corresponding to the downlink rate constraints become the uplink powers; the dual variables corresponding to the downlink fronthaul constraints become the uplink quantization noises. This duality relationship enables an efficient algorithm for optimizing the downlink transmission and relaying strategies based on the uplink. [ABSTRACT FROM AUTHOR]

THIS PAPER EXPLORES HOW REVISIONIST AUTOCRATIC GOVERNMENTS USE GLOBAL BROADCASTING NEWS CHANNELS TO COUNTER THE SO-CALLED WESTERN HEGEMONY NARRATIVE. IT FOCUSES ON HOW AND WHY THE SPANISH-SPEAKING WORLD WAS TARGETED BY INTERNATIONAL BROADCASTERS FOUNDED BY AUTOCRATIC AND REVISIONIST GOVERNMENTS AND HOW THE WAR WAGED BY THE RUSSIAN FEDERATION AGAINST UKRAINE IS PRESENTED IN THREE SO-CALLED 'ANTI-HEGEMONY' MEDIA NETWORKS: CHINA GLOBAL TELEVISION NETWORK EN ESPAÑOL (CGTN), TELESUR AND HISPAN TV. BY USING QUALITATIVE RESEARCH METHODS SUCH AS CONTENT ANALYSIS AND CHRONOLOGICAL ANALYSIS OF NEWS COVERING THE RUSSIAN INVASION OF UKRAINE PRESENTED BY TELESUR, HISPAN TV AND CGTN IN SPANISH SINCE 24 FEBRUARY 2022, THIS PAPER ARGUES THAT ALL THREE MEDIA CHANNELS PROMOTE IN DIFFERENT SHADES A KREMLIN-BASED NARRATIVE. THE ARTICLE FURTHER DEBATES THE PROFOUND FOREIGN POLICY IMPLICATIONS OF THIS TACIT MEDIA ALLIANCE AND SUPPORTS THE CONCLUSION THAT THE CURRENT WAR WAGED BY RUSSIA IN UKRAINE IS USED IN DIFFERENT WAYS BY REVISIONIST AND ASSERTIVE GOVERNMENTS TO PROMOTE THEIR OWN REVISIONIST AGENDAS BOTH DOMESTICALLY AND ABROAD. [ABSTRACT FROM AUTHOR]

In this paper, we consider a status updating system where updates are generated at a constant rate at $K$ sources and sent to the corresponding recipients through a noise-free broadcast channel. We assume that perfect channel state information (CSI) is available at the transmitter before each transmission, and the transmitter is able to utilize the CSI to precode the updates. Our object is to design optimal precoding schemes to minimize the summed average age of information (AoI) at the recipients. Under various assumptions on the size of each update $B$ , the number of transmit antennas $M$ , and the number of receive antennas $N$ at each user, this paper identifies the corresponding age-optimal precoding and transmission scheduling strategies. Specifically, for the case when $N=1$ , a round-robin based updating scheme is shown to be optimal. For the two-user systems with $N>B$ or $M\notin [N:2N]$ , framed updating schemes are proven to be optimal. For other cases in the two-user systems, a framed alternating updating scheme is proven to be 2-optimal. [ABSTRACT FROM AUTHOR]

In this paper, the Half-Duplex Relay Channel (HDRC) is thoroughly investigated. Even though this channel model is widely studied, the capacity is not yet fully understood and particularly has not been tightly expressed. In this work, a new capacity expression of the discrete memoryless HDRC is explicitly established. In particular, a new expression of the achievable rate is derived by taking advantage of the well-known capacity results of both the degraded broadcast channel and the multiple access channel. Specifi- cally, in order to obtain the achievable rate, the transmission from the source to destination is operated over two phases. In the first phase, the broadcast phase, the source broadcasts to both relay and destination. In the second phase, both source and relay transmit to destination to form multiple access channel. Then, we prove that the new achievable rate meets the cut-set outer bound such that the capacity of the discrete memoryless HDRC is attained. Next, the new derived capacity result is extended to the case of additive Gaussian channel. Further, the attained capacity is analytically and then numerically shown to encompass all well-known available findings in the literature. Additional numerical examples are also shown to present the cases in which the relay is beneficial and how the achievable capacity varies with the source-relay and relay-destination channel gains. [ABSTRACT FROM AUTHOR]

In this paper, we investigate joint retrospective interference alignment (RIA) and caching schemes for multiple-input single-output (MISO) broadcast channels (BC) with delayed channel state information at the transmitter (CSIT). By exploiting the cached content, we propose one sophisticated cache-aided RIA scheme to cancel the interference. Importantly, our scheme takes the number of symbols in a packet into account, as different number of symbols in a packet result in different system configuration, which may have significant impact on the design of the transmission scheme and achievable degrees of freedom (DoF). Furthermore, we present two theorems to quantify the achievable sum DoF of the proposed cached-aided RIA scheme for different system configuration. Moreover, the system configuration of the existing cache-aided RIA scheme with mixed CSIT can be treated as a special case in our paper. And also our scheme can simultaneously support more users than the existing cache-aided RIA scheme with mixed CSIT to invoke zero forcing (ZF) precoding, which limits the number of users simultaneously supported. [ABSTRACT FROM AUTHOR]

Copyright of TEME: Casopis za Društvene Nauke is the property of TEME: Casopis za Drustvene Nauke and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Copyright of Socioloski Pregled is the property of Srpsko Sociolosko Drustvo and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

This paper describes a process that integrates behavioral and decision science methods to design and evaluate interventions to disrupt illicit behaviors. We developed this process by extending a framework used to study systems with uncertain outcomes, where only partial information is observable, and wherein there are multiple participating parties with competing goals. The extended framework that we propose builds from artefactual data collection, thematic analysis, and descriptive analysis, toward predictive modeling and agent-based modeling. We use agent-based modeling to characterize and predict interactions between system participants for the purpose of improving our understanding of interventional targets in a virtual environment before piloting them in the field. We apply our extended framework to an exploratory case study that examines the potential of worker centers as a venue for deploying interventions to address labor exploitation and human trafficking. This case study focuses on reducing wage theft, the most prevalent form of exploitation experienced by day laborers and applies the first three steps of the extended framework. Specifically, the case study makes a preliminary assessment of two types of social interventions designed to disrupt exploitative processes and improve the experiences of day laborers, namely: (1) advocates training day laborers about their workers' rights and options that they have for addressing wage theft and (2) media campaigns designed to disseminate similar educational messages about workers' rights and options to address wage theft through broadcast channels. Applying the extended framework to this case study of day laborers at a worker center demonstrates how digital technology could be used to monitor, evaluate, and support collaborations between worker center staff and day laborers. Ideally, these collaborations could be improved to mitigate the risks and costs of wage theft, build trust between worker center stakeholders, and address communication challenges between day laborers and employers, in the context of temporary work. Based on the application of the extended framework to this case study of worker center day laborers, we discuss how next steps in the research framework should prioritize understanding how and why employers make decisions to participate in wage theft and the potential for restorative justice and equity matching as a relationship model for employers and laborers in a well-being economy. [ABSTRACT FROM AUTHOR]

The purpose of this paper is to introduce a simple, low-cost methodology for estimating a conservative value of the maximum field level that can be radiated by a 5G base station useful for human exposure assessment. The method is based on a Maximum Power Extrapolation (MPE) approach and requires the measurement of a reference quantity associated with the SS-PBCH, such as Primary Synchronization Signal (PSS), Secondary Synchronization Signal (SSS), Physical Broadcast CHannel (PBCH), or PBCH Demodulation Reference Signal (PBCH-DMRS). This step requires a simple spectrum analyzer and allows one to obtain the Resource Element (RE) power of a signal transmitted through broadcast beams. In the second phase, the RE power of the signal transmitted through the traffic beam is estimated using the Cumulative Distribution Function (CDF) of the antenna boost factor obtained from the broadcast and the traffic envelope radiation patterns made available by the base station vendor. The use of the CDF allows us to mitigate the problems related to the exact estimation of the direction of the measurement point with respect to the beam of the 5G antenna. The method is applied to a real 5G communication system, and the result is compared with the value given by other MPE methods proposed in the literature. [ABSTRACT FROM AUTHOR]

Copyright of Mediterranean Journal of Communication / Revista Mediterránea de Comunicación is the property of Revista Mediterranea de Comunicacion / Mediterranean Journal of Communication and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

With the increasing number of Internet of Things (IoT), Industry 4.0 (I4.0), and mobile devices, it can be expected that base stations will have to serve more and more clients with a limited number of antennas. For their broadcast channels, nonorthogonal multiple access (NOMA) and blind interference alignment (BIA) are two efficient and commonly adopted transmission schemes. This paper conducts a comparison study on these techniques on a 3-user 2 × 1 multiple-input single-output (MISO) broadcast channel with a limited number of transmit antennas. Specifically, space-time block coding based NOMA (STBC-NOMA) and NOMA-assisted beamforming (NOMA-BF) are compared with BIA. Both perfect and imperfect successive interference cancellation (SIC) have been considered for NOMA-based schemes, and the theoretical achievable rates of all schemes have been derived. Furthermore, with a given fairness constraint among end users, the power allocation (PA) problems have been solved for cases when accurate channel state information is available at the transmitter (CSIT) as well as when only path loss information is available. Numerical results show the following: (1) none of the schemes under this study can always outperform the others under different SNR regions. (2) With imperfect SIC, NOMA-BF, and STBC-NOMA both suffer from a significant performance loss under a high SNR condition. (3) Fairness PA with only path loss information provides similar performance as that with perfect CSIT, thus partial CSIT is adequate for system or scheme designs in practice. [ABSTRACT FROM AUTHOR]

This article deals with the analysis of the multi-cell association setup, and it exploits the possibility of enhancing coverage in the envisioned sixth generation (6G) large-scale cellular networks. Specifically, we propose a simple, effective approach for finding a closed-form solution to the coverage probability of a given user in a multi-cell association regime of downlink multiple-user multiple-input multiple-output (MU-MIMO) systems. In particular, a Rayleigh fading channel is considered, wherein the transmitter has only the knowledge of the second-order statistics of the channel. The proposed work uses an indefinite quadratic formulation method and thereby investigates the effect of cell association in a correlated downlink broadcast channel with co-channel interference, additive white noise, and multiple transceiver antenna elements. In the results, we show that a predefined signal-to-interference-plus-noise ratio (SINR) threshold dictates an effective multi-cell association setup, and we identify the region in which a multi-cell association performs better that a single association-based network. The derived theoretical expressions in this paper are validated by the same means of simulation. [ABSTRACT FROM AUTHOR]

When the users in a MIMO broadcast channel experience different spatial transmit correlation matrices, a class of gains is produced that is denoted transmit correlation diversity. This idea was conceived for channels in which transmit correlation matrices have mutually exclusive eigenspaces, allowing non-interfering training and transmission. This paper broadens the scope of transmit correlation diversity to the case of partially and fully overlapping eigenspaces and introduces techniques to harvest these generalized gains. For the two-user MIMO broadcast channel, we derive achievable degrees of freedom (DoF) and achievable rate regions with/without channel state information at the receiver (CSIR). When CSIR is available, the proposed achievable DoF region is tight in some configurations of the number of receive antennas and the channel correlation ranks. We then extend the DoF results to the $K$ -user case by analyzing the interference graph that characterizes the overlapping structure of the eigenspaces. Our achievability results employ a combination of product superposition in the common part of the eigenspaces, and pre-beamforming (rate splitting) to create multiple data streams in non-overlapping parts of the eigenspaces. Massive MIMO is a natural example in which spatially correlated link gains are likely to occur. We study the achievable downlink sum rate for a frequency-division duplex massive MIMO system under transmit correlation diversity. [ABSTRACT FROM AUTHOR]

The channel state information at the transmitter (CSIT) play an important role in the performance of wireless networks. The CSIT model can be delayed and imperfect‐quality, since the feedback link has a delay and the channel state information (CSI) feedback has distortion. In this paper, the degrees‐of‐freedom (DoF) region of the two‐user multiple‐input multiple‐output (MIMO) broadcast channel are characterised with delayed imperfect‐quality CSIT, where the antenna configurations can be arbitrary. The converse proof of DoF region is based on the enhancement of physically degraded channel. The achievability proof of DoF region is through a novel transmission scheme design, where the duration of each phase and the amount of transmitted symbols are configured based on the imperfect‐quality of delayed CSIT. As a result, it is shown that the DoF region with delayed imperfect‐quality CSIT is located between the DoF region with no CSIT and the DoF region with delayed CSIT. [ABSTRACT FROM AUTHOR]

In Multiple-input multiple-output (MIMO) broadcast channels (BCs), the transmitter simultaneously broadcasts signals to multiple receivers at same frequency band, resulting in that the communication capacity is affected by both interference, channel fading and random noise. Although channel fading can be mitigated by transceivers, the signal-to-noise-ratio (SNR) of the practical communication system is still dynamically changing due to the randomly changing noise. Traditional MIMO transceiver optimization algorithms can not flexibly adapt to the dynamic changes of SNR, resulting in large performance degradation. In this paper, we comprehensively consider signal power and signal space dimensions of the received signal in MIMO BCs, and propose two transceiver optimization algorithms which can dynamically adapt to the variance of SNRs. In the proposed algorithms, SNR is adopted to be an adjustment factor to cope with its variance. When SNR is low, i.e, large noise, the algorithm parameters are automatically adjusted so that the signal power is preserved as much as possible to combat the loss of communication capacity caused by large random noise. Correspondingly, under the condition of high SNR environment, the algorithm parameters are adjusted automatically to effectively compress the inter-user-interference (IUI) and intra-user-inter-stream-interference (ISI) by optimizing signal space dimensions. Simulation results show that in different SNR environments, the proposed algorithms can automatically adjust the focus of optimization, so that the optimization of signal power and signal space dimensions can automatically adapt to different SNRs. Compared with traditional transceiver optimization algorithms, the proposed algorithms can improve the communication capacity within a large dynamic range of SNR. [ABSTRACT FROM AUTHOR]

This paper employs auxiliary receivers as a mathematical tool to identify Gallager-type auxiliary random variables and write outer bounds for some basic multiuser settings. This approach is then applied to the relay, interference, and broadcast channel settings, yielding new outer bounds that improve on existing outer bounds and strictly outperform classical outer bounds. For instance, we strictly improve on: the cutset outer bound for the scalar Gaussian relay channel, the outer bounds for the Gaussian Z-interference channel, and the outer bounds for the two receiver broadcast channel. [ABSTRACT FROM AUTHOR]

Broadcasting is one of the basic ways to access XML data via mobile wireless networks. In these networks, XML data are disseminated over a wireless broadcast channel and mobile clients can connect to this channel via portable devices and receive the XML data they need. To date, various indexing methods have been proposed to broadcast the XML data over mobile wireless broadcast networks, each of which attempts to reduce the latency and energy consumption of mobile devices in processing the different types of XML queries. Most of the proposed indexing methods use only a single wireless broadcast channel for XML data dissemination. Due to the sequential data access over a wireless broadcast channel, the access time to retrieve the desired XML data over a broadcast channel is longer if the length of generated XML data stream is large. This paper proposes two new XML data placement schemes to disseminate the XML data over multiple wireless broadcast channels by partitioning the XML data stream into several partitions and placing them into multiple wireless broadcast channels. The goal of both of which is a further reduction of the access time during the process of XML querying over the broadcast channels. According to the experimental results, the proposed XML data placement schemes have achieved the goal of further reducing the access time, especially when the size of XML document to be disseminated is large. [ABSTRACT FROM AUTHOR]

Copyright of Communication & Culture Online / Komunikacija i Kultura Online is the property of FOKUS: Forum za Interkulturnu Komunikaciju and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Multimedia Broadcast Multicast Service (MBMS)-dedicated cell is a Long Term Evolution (LTE) based broadcast transmission mode with both high transmission efficiency and good compatibility with LTE unicast systems. However, since the physical design of Cell Acquisition Subframe (CAS), which is the control part of an MBMS-dedicated cell transmission period, does not take into account the long delay spread channels in Medium Tower Medium Power (MTMP) and High Tower High Power (HTHP) cells, receivers would probably suffer from multipath aliasing errors in practical transmission. This paper analyzes the impact of aliasing errors on channel estimation (CHE) accuracy and proposes an Aliasing-Elimination CHE algorithm for CAS reception. In the proposed algorithm, the pre-decoded Physical Broadcast Channel (PBCH) is reconstructed and utilized to generate a complete multipath distribution within the entire OFDM symbol length. By using this full-symbol length multipath distribution, the proposed algorithm eliminates aliasing errors effectively. Simulation results and complexity analysis show that the proposed CHE algorithm achieves a significant performance improvement compared to conventional CHE algorithms in long delay spread channels, with acceptable increment in complexity. [ABSTRACT FROM AUTHOR]

Methods for information-theoretic control for networks of sensors are of interest for enabling the development of autonomous sensor systems. In this paper we revisit the fundamentals of information theoretic-based control for multi-target systems and present a systematic approach for determining information-theoretic situational awareness based on mutual information for point processes. The extension to multi-sensor systems is developed using the concept of a broadcast channel from information theory. Analytic results are presented for linear-Gaussian systems which enable low complexity solutions for determining information from multiple sensors and we consider a large number of potential sensor configurations. We consider extensions of single-target methods to multi-target scenarios and present results in simulations. [ABSTRACT FROM AUTHOR]

Copyright of Canadian Journal of Economics is the property of Wiley-Blackwell and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Copyright of Dixit. Comunicación, Profesión, Conocimiento is the property of Universidad Catolica del Uruguay Damaso Antonio Larranaga and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Disasters vary in many characteristics, but their amount of forewarning-the amount of time remaining until the disaster strikes-is a crucial factor affecting the dissemination of emergency warnings. People can be warned by public safety officials through broadcast channels, such as commercial TV and radio, that transmit simultaneous warnings to mass audiences. In addition, however, warnings are also transmitted by peers through informal warning networks that operate through contagion from one person to another. This paper establishes an interdisciplinary agent-based model with Monte Carlo simulations to assess the relative effects of these broadcast and contagion processes in a multiplex social network. This multiplex approach models multiple channels of informal communication-phone,word-of-mouth, and social media-that vary in their attribute values. Each agent is an individual in a threatened community who, once warned, has a probability of warning others in their social network using one of these channels. The probability of an individual warning others is based on their warning source and the time remaining until disaster impact, among other variables. We model warning dissemination using simulation parameter values chosen from empirical studies of disaster warnings along with the spatial aspects of the Coos Bay, OR, USA and Seaside, OR, USA communities. Results indicate that the initial broadcast size has a negative correlation with the critical percolation threshold, which varies from approximately 1-5%, depending on the size of an initial broadcast. A sensitivity analysis on the model parameters indicates that, along with initial broadcast size and sharing probability, forewarning and confidence in the warning significantly affect the total number of warning recipients. The results generated from this study identify areas for future research and can inform community officials about the effects of event and community characteristics on the dissemination of emergency warnings in their communities. [ABSTRACT FROM AUTHOR]

With the increasing use of portable devices, whenever information is sent through broadcasting channel, security re-lated challenges may occur so that the attackers can listen the information shared in the broadcasting channels such as Radio, TV and Wireless Adhoc Networks (WAN). To prevent such attacks, many cyber security-based algo-rithms are developed to enhance the security between the transmitter and receivers, but still the privacy attacks like man-in-the-middle attack, brute force attack etc occur. In this paper a technology called cross layer authentication is proposed where it uses the third party called server to authenticate between transmitter and receiver. The cross-layer authentication generates a group key by using the users (subscribers) identity information and channel (publisher) information and broadcasts the information to channels and users. The group key will continuously update and broadcasts the information to all the users in the channel whenever a user is added or deleted. Since the group key changes frequently, it will be quite challenging for the attackers to track the shared information. Hence, the proposed method avoids the attacks between transmitter and receiver by generating a group key using ECDSA algorithm and the information is encrypted by AES-128 bit. [ABSTRACT FROM AUTHOR]

The location verification of the vehicles interacting during the process of communication needs to be cooperatively determined under Non Line Of Sight (NLOS) situations for facilitating risk free environment with the least degree of congestion. The vehicular nodes in NLOS conditions possess the possibility of introducing channel congestion and broadcast storm into the network either intentionally or unintentionally during the event of emergency message dissemination in the vehicular network. Thus, the NLOS vehicular nodes of the network need to be detected through direct interaction and neighbourhood collaboration such that the rate of emergency message dissemination is sustained to the maximum degree. In this paper, a Rank Criteria Improved Confidence-based Centroid Scheme (RCICCS) is proposed for potential localization of NLOS nodes. This proposed RCICCS scheme uses an integrated cost, computed using the primitive cost and penalty cost in order to increase the effectiveness in localizing NLOS nodes. Thus effective location of NLOS nodes is determined based on rank criterion-based neighbor confidence measure that are iteratively enhanced during the process of perturbation using the method of gradients. The experimental analysis of the proposed RCICCS scheme confirmed a remarkable enhancement rate of emergency message delivery and neighbourhood awareness under NLOS conditions. [ABSTRACT FROM AUTHOR]

We derive universal classical-quantum superposition coding and universal classical-quantum multiple access channel coding by using generalized packing lemmas for the type method. Using our classical-quantum universal superposition code, we establish the capacity region of a classical-quantum compound broadcast channel with degraded message sets. Our universal classical-quantum multiple access channel codes have two types of codes. One is a code with joint decoding and the other is a code with separate decoding. It is not so easy to construct a former code that universally achieves general points of the capacity region beyond corner points. First, we construct the latter code that universally achieves general points of the capacity region. Then, converting the latter code to the former coder, we construct the above desired code with the former type. [ABSTRACT FROM AUTHOR]

The celebrated Blahut–Arimoto algorithm computes the capacity of a discrete memoryless point-to-point channel by alternately maximizing the objective function of a maximization problem. This algorithm has been applied to degraded broadcast channels, in which the supporting hyperplanes of the capacity region are again cast as maximization problems. In this work, we consider general broadcast channels and extend this algorithm to compute inner and outer bounds on the capacity regions. Our main contributions are as follows: first, we show that the optimization problems are max–min problems and that the exchange of minimum and maximum holds; second, we design Blahut–Arimoto algorithms for the maximization part and gradient descent algorithms for the minimization part; third, we provide convergence analysis for both parts. Numerical experiments validate the effectiveness of our algorithms. [ABSTRACT FROM AUTHOR]

TRAAK channels are mechano-gated two-pore-domain K+ channels. Up to now, activity of these channels has been reported in neurons but not in skeletal muscle, yet an archetype of tissue challenged by mechanical stress. Using patch clamp methods on isolated skeletal muscle fibers from adult zebrafish, we show here that single channels sharing properties of TRAAK channels, i.e., selective to K+ ions, of 56 pS unitary conductance in the presence of 5 mM external K+, activated by membrane stretch, heat, arachidonic acid, and internal alkaline pH, are present in enzymatically isolated fast skeletal muscle fibers from adult zebrafish. The kcnk4b transcript encoding for TRAAK channels was cloned and found, concomitantly with activity of mechano-gated K+ channels, to be absent in zebrafish fast skeletal muscles at the larval stage but arising around 1 mo of age. The transfer of the kcnk4b gene in HEK cells and in the adult mouse muscle, that do not express functional TRAAK channels, led to expression and activity of mechano-gated K+ channels displaying properties comparable to native zebrafish TRAAK channels. In whole-cell voltage-clamp and current-clamp conditions, membrane stretch and heat led to activation of macroscopic K+ currents and to acceleration of the repolarization phase of action potentials respectively, suggesting that heat production and membrane deformation associated with skeletal muscle activity can control muscle excitability through TRAAK channel activation. TRAAK channels may represent a teleost-specific evolutionary product contributing to improve swimming performance for escaping predators and capturing prey at a critical stage of development. [ABSTRACT FROM AUTHOR]

The 5G New Radio synchronization procedure is the first step that the user must complete to access the mobile network. It mainly consists of the detection of the primary and secondary synchronization signals (PSS and SSS, respectively) and the decoding of the physical broadcast channel (PBCH). Our goal is to provide a comprehensive study of the synchronization procedure and investigate different techniques and approaches, through the implementation of a 5G New Radio-compliant simulator. Of significant interest is the investigation of impairments such as the fading channel, the frequency offset, and the delay spread. The results are provided in terms of detection probability for the PSS and SSS detection, and in terms of block error rate for the PBCH. From the data collected, there is evidence that choosing M-sequences for the PSS leads to an appreciably robust solution against frequency offset. The structure of the Gold sequences for SSS generation can be exploited to reduce the detection complexity, and different approaches can be chosen to improve reliability against delay spread. Moreover, the polar coding for 5G PBCH outperforms the former 4G coding technique, but they are still sensible to frequency offset. Finally, the simulator functionalities are validated through real captures of 5G signals. [ABSTRACT FROM AUTHOR]

This paper focuses on K-receiver discrete-time memoryless broadcast channels (DM-BCs) with private messages, where the transmitter wishes to convey K private messages to K receivers. A general inner bound on the capacity region is proposed based on an exhaustive message splitting and a K-level modified Marton's coding. The key idea is to split every message into ∑ j = 1 K K j − 1 submessages each corresponding to a set of users who are assigned to recover them, and then send these submessages via codewords chosen from a K-level structure codebooks. To guarantee the joint typicality among all transmitted codewords, a sufficient condition on the subcodebooks' sizes is derived through a newly establishing hierarchical covering lemma, which extends the 2-level multivariate covering lemma to the K-level case with more intricate dependences. As the number of auxiliary random variables and rate conditions both increase exponentially with K, the standard Fourier–Motzkin elimination procedure becomes infeasible when K is large. To tackle this problem, we obtain a closed form of achievable rate region with a special observation of disjoint unions of sets that constitute the power set of { 1 , ⋯ , K } . The proposed achievable rate region allows arbitrary input probability mass functions and improves over previously known achievable (closed form) rate regions for K-receiver ( K ≥ 3 ) BCs. [ABSTRACT FROM AUTHOR]

Smart agriculture has a broad prospect with the fast development of information technologies, such as Internet of Things, big data, edge computing and artificial intelligence. As more intelligent devices are deployed for agricultural scenarios, such as quality monitoring and information aggregation, the communication channels among these devices will be crowded and the performance can be greatly affected. Cognitive Radio Networks (CRNs) are promising in promoting better spectrum utilization, where unlicensed users can opportunistically use the vacant spectrum assigned to licensed users. On the basis of CRNs, many agricultural scenarios can be empowered with efficient communication capabilities. However, the broadcasting problem, which handles the information dissemination, has not been thoroughly studied in CRNs. Existing works are either centralized solutions performing broadcast on single/multiple channels, or distributed algorithms without performance guarantee for general networks. In this paper, we propose efficient distributed algorithms with short broadcast delay and high success ratio. The difficulties lie in the non-uniform channel availability, which entails broadcasting on multiple channels even for single-hop neighbors, and the distributed behaviors, where the users are only aware of the local information. Our contributions are threefold. First, we propose an efficient distributed rendezvous algorithm which spurs the neighbors to find the common channels in a short time. Second, we handle the single-hop broadcast by presenting two distributed algorithms and they guarantee a successful broadcast in O (Δ 2 log log N) and Δ time slots respectively, where N is the number of channels and Δ is the maximum number of neighbors. Finally, we extend these algorithms to multi-hop broadcast and the broadcast delay is only up to D times the delay of single-hop, where D is the network diameter. We also conduct extensive simulations and the results corroborate our theoretical analyses. [ABSTRACT FROM AUTHOR]

Telegram, an Industry 4.0 style communication service, is one of the world's most widespread communication platforms. The availability of channels and bots has opened as a broadcast channel for any media outlet. We asked the following questions: Do media outlets from Spain use Telegram channels? Which media outlets? Are they verified? What is their volume of subscribers? Can this information be used to rank media outlets? We identified many media channels and data were collected from each one. We present the results in a ranking. Forty-two media based in Spain have Telegram channels, 26 of which are ranked in the directory. Less than half of these channels are verified by the platform, and only three are linked to their website. This lack of verification could lead to the proliferation of fake channels. The article ends with a series of recommendations for channel managers to make it easier for the end user to identify and verify each media outlet. [ABSTRACT FROM AUTHOR]

The present study investigates language manipulation strategies and ideological features in online news headlines in France24 and RT broadcasting channels in French and English, respectively. The researchers investigate how news about the Syrian crisis is viewed from two different points of view, namely French and Russian. Headlines in the two languages are analysed according to the principles of Critical Discourse Analysis (CDA). Results show that both France24 and RT news headlines report news about the Syrian crisis using different choices of vocabulary, leading to different, ideologically driven interpretations. In other words, France24 news headlines select specific terminology to depict France and its allies as "peacemakers" in Syria. Conversely, Russia-along with its allies-are described in France24 headlines as 'instigators of chaos". However, in RT news headlines, the vocabulary selection describes Russia as a "conflict resolver" in Syria, whereas rival countries of Russia are viewed as "rogue interveners". [ABSTRACT FROM AUTHOR]

The original coded caching scenario assumes a content library that is of interest to all receiving users. In a realistic scenario though, the users may have diverging interests which may intersect to various degrees. What happens for example if each file is of potential interest to, say, 40% of the users and each user has potential interest in 40% of the library? In this work, we investigate the so- called symmetrically selfish coded caching scenario, where each user only makes requests from a subset of the library that defines its own file demand set (FDS), each user caches selfishly only contents from its own FDS, and where the different FDSs symmetrically overlap to some extent. In the context of various traditional prefetching scenarios (prior to the emergence of coded caching), selfish approaches were known to be potentially very effective. On the other hand — with the exception of some notable works — little is known about selfish coded caching. We here present a new information-theoretic converse that proves, in a general setting of symmetric FDS structures, that selfish coded caching, despite enjoying a much larger local caching gain and a much smaller set of possible demands, introduces an unbounded load increase compared to the unselfish case. In particular, in the $K$ -user broadcast channel where each user stores a fraction $\gamma $ of the library, where each file (class) is of interest to $\alpha $ users, and where any one specific file is of interest to a fraction $\delta $ of users, the optimal coding gain of symmetrically selfish caching is at least $(K - \alpha)\gamma + 1$ times smaller than in the unselfish scenario. This allows us to draw the powerful conclusion that the optimal selfish coding gain is upper bounded by $1/(1 - \delta)$ , and thus does not scale with $K$. These derived limits are shown to be exact for different types of demands. In the end, this work provides, in a unified manner, the strong conclusion that selfish caching can cause unbounded performance deterioration in coded caching systems. [ABSTRACT FROM AUTHOR]

Minimum energy required to achieve a distortion-noise profile, i.e., a function indicating the maximum allowed distortion value for each channel noise level, is studied for transmission of Gaussian sources over Gaussian channels. A general coding scheme is proposed to upper bound the minimum energy needed for any distortion-noise profile. Conversely, utilizing a family of lower bounds originally derived for broadcast channels with power constraints, the minimum required energy is lower bounded for any profile. As examples, linear, exponential, square-law, and staircase profiles are studied. It is shown that for the linear profile, as well as for any concave profile, uncoded transmission is optimal. As a negative result, it is shown that exponential profiles are not achievable with finite energy. For square-law and staircase profiles, upper bounds and lower bounds are derived and the gaps between them are studied. [ABSTRACT FROM AUTHOR]

RFID (radio frequency identification) is an Internet of Things (IoT) enabling technology. All physical devices can be connected to the Internet of Things thanks to RFID. When RFID is extensively utilized and fast increasing, security and privacy concerns are unavoidable. Interception, manipulation, and replay of the wireless broadcast channel between the tag and the reader are all possible security threats. Unverified tags or readers provide untrustworthy messages. IoT requires a safe and consistent RFID authentication system. PUFs are also physical one-way functions made up of the unique nanoscopic structure of physical things and their reactivity to random occurrences. PUF includes an unclonable feature that takes advantage of physical characteristics to boost security and resistance to physical attacks. We analyze the security of the RSEAP2 authentication protocol that has been recently proposed by Safkhani et al., a hash-based protocol, and elliptic curve cryptosystem-based protocol. Our security analysis clearly shows important security pitfalls in RSEAP2 such as mutual authentication, session key agreement, and denial-of-service attack. In our proposed work, we improved their scheme and enhanced their version using physically unclonable function (PUF), which are used by the proposed protocol in tags. This research proposes a cloud-based RFID authentication technique that is both efficient and trustworthy. To decrease the RFID tag's overhead, the suggested authentication approach not only resists the aforementioned typical assaults and preserves the tag's privacy, but also incorporates the cloud server into the RFID system. According to simulation results, our approach is efficient. Moreover, according to our security study, our protocol can withstand a variety of attacks, including tracking, replay, and desynchronization assaults. Our scheme withstands all the 18 security features and further consumes the computation cost as 14.7088 ms which is comparable with the other schemes. Similarly, our scheme consumes the communication cost as 672 bits during the sending mode and 512 bits during the receiving mode. Overall, the performance of our proposed method is equivalent to that of related schemes and provides additional security features than existing protocols. Mutual authentication, session key generation, and ephemeral session security are all achieved. Using the real-or-random concept, we formalize the security of the proposed protocol. [ABSTRACT FROM AUTHOR]

The spherical-cap approximation of vector quantization (SCVQ) is an analytical model used for the mathematical analysis of multiple-input multiple-output (MIMO) systems with limited feedback. SCVQ closely emulates the distribution of the quantization error induced by the finite-rate quantization of a channel using a simple and analytically tractable approach. However, the conventional SCVQ model is not applicable when antenna-combining schemes such as quantization-based combining (QBC) are considered. Because QBC is an effective antenna-combining method that minimizes channel quantization errors, it can be adopted for various practical MIMO broadcast systems. Nevertheless, evaluating the performance of QBC-based MIMO systems with an explicit codebook can be extremely difficult, depending on the system complexity. To resolve this, this study generalizes the conventional SCVQ to be compatible with the QBC. The proposed generalized version of the SCVQ effectively emulates the quantization error obtained using QBC, while enabling a simple simulation independent of the number of feedback bits and mathematically tractable analysis. We validate the effectiveness of the proposed model by presenting a wireless communication application based on a dense cellular network. [ABSTRACT FROM AUTHOR]

Aligned-Images Sum-set Inequalities are used in this work to study the Generalized Degrees of Freedom (GDoF) of the symmetric layered multi-hop interference channel under the robust assumption that the channel state information at the transmitters (CSIT) is limited to finite precision. First, the sum-GDoF value is characterized for the $2\times 2\times 2$ setting that is comprised of 2 sources, 2 relays, and 2 destinations. It is shown that the sum-GDoF does not improve even if perfect CSIT is allowed in the first hop, as long as the CSIT in the second hop is limited to finite precision. The sum GDoF characterization is then generalized to the $2\times 2\times \cdots \times 2$ setting that is comprised of $L$ hops. Remarkably, for large $L$ , the sum-GDoF value approaches that of the one-hop broadcast channel that is obtained by full cooperation among the two transmitters of the last hop, with finite precision CSIT. Previous studies of multi-hop interference networks either identified sophisticated GDoF optimal schemes under perfect CSIT, such as aligned interference neutralization and network diagonalization, that are powerful in theory but too fragile to be practical, or studied robust achievable schemes like classical amplify/decode/compress-and-forward without claims of information-theoretic optimality. In contrast, under finite precision CSIT, we show that the benefits of fragile schemes are lost, while a combination of classical random coding schemes that are simpler and much more robust, namely a rate-splitting between decode-and-forward and amplify-and-forward, is shown to be GDoF optimal. As such, this work represents another step towards bridging the gap between theory (optimality) and practice (robustness) with the aid of Aligned-Images Sum-set Inequalities. [ABSTRACT FROM AUTHOR]

We consider a transmitter and $K$ receivers, each of which shares a key variable with the transmitter. Through a noiseless broadcast channel, the transmitter wishes to send a common message $W$ securely to $N$ out of the $K$ receivers while the remaining $K-N$ receivers learn no information about $W$. We are interested in the maximum message rate, i.e., the maximum number of bits of $W$ that can be securely groupcast to the legitimate receivers per key block and the minimum broadcast bandwidth, i.e., the minimum number of bits of the broadcast information required to securely groupcast the message bits. We focus on the setting of combinatorial keys, where every subset of the $K$ receivers share an independent key of arbitrary size. Under this combinatorial key setting, the maximum message rate is characterized for the following scenarios - 1) $N=1$ or $N=K-1$ , i.e., secure unicast to 1 receiver with $K-1$ eavesdroppers or secure groupcast to $K-1$ receivers with 1 eavesdropper, 2) $N=2, K=4$ , i.e., secure groupcast to 2 out of 4 receivers, and 3) the symmetric setting where the key size for any subset of the same cardinality is equal for any $N,K$. Further, for the latter two cases, the minimum broadcast bandwidth for the maximum message rate is characterized. [ABSTRACT FROM AUTHOR]

Fifth generation mobile communication systems (5G) have to accommodate both Ultra-Reliable Low-Latency Communication (URLLC) and enhanced Mobile Broadband (eMBB) services. While eMBB applications support high data rates, URLLC services aim at guaranteeing low-latencies and high-reliabilities. eMBB and URLLC services are scheduled on the same frequency band, where the different latency requirements of the communications render their coexistence challenging. In this survey, we review, from an information theoretic perspective, coding schemes that simultaneously accommodate URLLC and eMBB transmissions and show that they outperform traditional scheduling approaches. Various communication scenarios are considered, including point-to-point channels, broadcast channels, interference networks, cellular models, and cloud radio access networks (C-RANs). The main focus is on the set of rate pairs that can simultaneously be achieved for URLLC and eMBB messages, which captures well the tension between the two types of communications. We also discuss finite-blocklength results where the measure of interest is the set of error probability pairs that can simultaneously be achieved in the two communication regimes. [ABSTRACT FROM AUTHOR]

We introduce a new analysis technique to derive a single-letter upper bound on the mismatch capacity of a stationary, single-user, memoryless channel with a decoding metric $q$. Our bound is obtained by considering a multicast transmission over a two-user broadcast channel with decoding metrics $q$ and $\rho $ at the receivers, referred to as $(q,\rho)$ -surely degraded. This channel has the property that the intersection event of correct $q$ -decoding of receiver 1 and erroneous $\rho $ -decoding of receiver 2 has zero probability for any fixed-composition codebook of a certain composition $P$. Our bound holds in the strong converse sense of an exponential decay of the probability of correct decoding at rates above the bound. Further, we refine the proof and present a bound that is tighter than that of any choice of $\rho $. Several examples that demonstrate the strict improvement of our bound compared to previous results are analyzed. Finally, we detect equivalence classes of isomorphic channel-metric pairs $(W,q)$ that share the same mismatch capacity. We prove that if the class contains a matched pair, then our bound is tight and the mismatch capacity of the entire class is fully characterized and is equal to the LM rate, which is achievable by random coding, and may be strictly lower that the matched capacity. [ABSTRACT FROM AUTHOR]

Achievable data rates in wireless systems rely heavily on the available channel state information (CSI) throughout the network. However, feedback links, which provide this information, are scarce, unreliable, and subject to security threats. In this work, we study the impact of having intermittent feedback links on the capacity region of the canonical two-user erasure broadcast channels. In our model, at any time instant, each receiver broadcasts its CSI, and at any other node, this information either becomes available with unit delay or gets erased. For this setting, we develop a new set of outer bounds to capture the intermittent nature of the feedback links. These outer bounds depend on the probability that the CSI from both receivers are erased at the transmitter. In particular, if at any time, the CSI from at least one of the two receivers is available at the other two nodes, then the outer-bounds match the capacity with global delayed CSI. We also provide capacity-achieving transmission strategies under certain scenarios, and we establish a connection between this problem and Blind Index Coding with feedback. [ABSTRACT FROM AUTHOR]

This work introduces channel-supermodular entropies, a subset of quasi-concave entropies. Channel-supermodularity is a property shared by some of the most commonly used entropies in the literature, including Arimoto–Rényi conditional entropies (which include Shannon and min-entropy as special cases), k-tries entropies, and guessing entropy. Based on channel-supermodularity, new preorders for channels that strictly include degradedness and inclusion (or Shannon ordering) are defined, and these preorders are shown to provide a sufficient condition for the more-capable and capacity ordering, not only for Shannon entropy but also regarding analogous concepts for other entropy measures. The theory developed is then applied in the context of query anonymization. We introduce a greedy algorithm based on channel-supermodularity for query anonymization and prove its optimality, in terms of information leakage, for all symmetric channel-supermodular entropies. [ABSTRACT FROM AUTHOR]

In this work, we consider the zero-delay transmission of bivariate Gaussian sources over a Gaussian broadcast channel with one-bit analog-to-digital converter (ADC) front ends. An outer bound on the conditional distortion region is derived. Focusing on the minimization of the average distortion, two types of methods are proposed to design nonparametric mappings. The first one is based on the joint optimization between the encoder and decoder with the use of an iterative algorithm. In the second method, we derive the necessary conditions to develop the optimal encoder numerically. Using these necessary conditions, an algorithm based on gradient descent search is designed. Subsequently, the characteristics of the optimized encoding mapping structure are discussed, and inspired by which, several parametric mappings are proposed. Numerical results show that the proposed parametric mappings outperform the uncoded scheme and previous parametric mappings for broadcast channels with infinite resolution ADC front ends. The nonparametric mappings succeed in outperforming the parametric mappings. The causes for the differences between the performances of two nonparametric mappings are analyzed. The average distortions of the parametric and nonparametric mappings proposed here are close to the bound for the cases with one-bit ADC front ends in low channel signal-to-noise ratio regions. [ABSTRACT FROM AUTHOR]

In this article, the sum secure degrees-of-freedom (SDoF) of the multiple-input multiple-output (MIMO) X channel with confidential messages (XCCM) and arbitrary antenna configurations is studied, where there is no channel state information (CSI) at two transmitters and only delayed CSI at a multiple-antenna, full-duplex, and decode-and-forward relay. We aim at establishing the sum-SDoF lower and upper bounds. For the sum-SDoF lower bound, we design three relay-aided transmission schemes, namely, the relay-aided jamming scheme, the relay-aided jamming and one-receiver interference alignment scheme, and the relay-aided jamming and two-receiver interference alignment scheme, each corresponding to one case of antenna configurations. Moreover, the security and decoding of each scheme are analyzed. The sum-SDoF upper bound is proposed by means of the existing SDoF region of two-user MIMO broadcast channel with confidential messages (BCCM) and delayed channel state information at the transmitter (CSIT). As a result, the sum-SDoF lower and upper bounds are derived, and the sum-SDoF is characterized when the relay has sufficiently large antennas. Furthermore, even assuming no CSI at two transmitters, our results show that a multiple-antenna full-duplex relay with delayed CSI can elevate the sum-SDoF of the MIMO XCCM. This is corroborated by the fact that the derived sum-SDoF lower bound can be greater than the sum-SDoF of the MIMO XCCM with output feedback and delayed CSIT. [ABSTRACT FROM AUTHOR]