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, the effects of energy harvesting (EH) on an automatic repeat request based cooperative communication network comprised of a source, a relay, and two destination nodes, are investigated in Rayleigh fading channels. The energy of the decode-and-forward relay is provided by EH throughout the radio frequency signal from the source. In the proposed transmission protocol, the source transmits a data packet to the relay and two destination nodes by direct links. If the transmission is successful at both destination nodes, these nodes reply by an acknowledgement (ACK) signal to the source and the relay. Otherwise, there are two alternatives: If the relay has received this data packet successfully and replied by an ACK signal, then it cooperates and transmits the data packet for a second time to two destination nodes. If the relay has failed and replied by a non-acknowledgement signal, the source in this case retransmits this packet to the destination nodes by direct links. First, a broadcast channel is considered where the source transmits the same data packet to the relay and destination nodes. Second, the non-orthogonal multiple access technique is applied to the same network where different packets are sent to each destination node by means of superposition coding. In both cases, the system throughputs are obtained from the derived closed-form expressions for the outage probabilities based on the Markov chain model. All theoretical results are supported by computer simulation results. [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]

Information-theoretic analysis of the communication systems performances is of practical and theoretical importance. In this paper, (i) Specifically, we generalize the Cover–Chiang work on point to point channel with two-sided state information to two-receiver less noisy broadcast channel (2R-LN-BC) with different side information non-causally known at the encoder as well as the decoders, and obtain the capacity region including the previous works as its special cases. Then, (ii) the obtained result is expanded to the continuous alphabet Gaussian version. In this Gaussian version, the side information available at the receivers are supposed to be correlated on the channel noises and the impact of these receivers cognition of the noises on the capacity region is analyzed. [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]

With the explosive proliferation of connected devices and mobile users in the Internet-of-things, multiple access techniques are urged to be developed for the next generation wireless communications. Recently, rate-splitting multiple access (RSMA) has been a promising communication technology that holds advantages of strong robustness, low complexity, and high spectral efficiency, which can be integrated with the indoor visible light communication (VLC) broadcast system to compensate for the shortcomings of limited modulation bandwidth of LEDs. However, the research on the RSMA-based VLC systems is still in its infancy and there exist various problems to be explored. To benefit from the RSMA technique, this paper investigates the energy efficiency optimizations for both single-cell and multi-cell RSMA-based VLC broadcast systems. Specifically, these two systems are modeled, where the VLC broadcast channel follows Lambertian radiation model, and the splitting design and successive interference cancellation of RSMA are employed to mitigate the multi-user interference. Especially for multi-cell networks, the zero-forcing approach is adopted to eliminate the inter-cell interference. To maximize the energy efficiency, the precoding and power allocation problems are formulated for single-cell and multi-cell networks while accommodating multiple constraints including dynamic operation ranges of LEDs, QoS requirements, and interference elimination. For solving these non-convex fractional problems, two pieces of successive convex approximation (SCA)-based algorithms are proposed, in which the variable transformation and linear approximation are adopted. Simulation results indicate that the proposed schemes can achieve superior energy efficiency with fast convergence for various network loads and user deployments. [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.)

Summary: In this paper, we consider the transmission over multiple access relay channel (MARC) in which the relay operates in half‐duplex mode. The main contribution of this paper is establishing the capacity of the multiple access half‐duplex relay channel (MAHRC). Toward achieving this goal, we first derive a new achievable rate region. While deriving the achievable rate region, well‐known encoding and decoding schemes, which are used for transmission and reception over the degraded broadcast channel and the multiple access channel, are used. In this transmission scheme, the transmission from the two sources via the half‐duplex relay, to the destination, is split into two phases. Afterwards, an outer bound to the transmission over the discrete memoryless MAHRC is developed. Consequently, we show that the achievable rate region matches the outer bound and therefore the capacity region is formed. Further, the capacity region is extended to the case of Gaussian channel. Additionally, many numerical examples are shown to validate our theoretical derivations. In particular, these numerical examples show that the achievable rate region, and then the capacity, that we derive is larger than the well‐known results in the literature. [ABSTRACT FROM AUTHOR]

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]

How do state-controlled broadcasters reach foreign publics to engage in public diplomacy in the era of social media? Previous research suggests that features unique to social media, such as the ability to engage in two-way communication with audiences, provide statecontrolled broadcasters new opportunities for online public diplomacy. In this paper, we examine what strategies were used by four Chinese state-controlled media outlets on Twitter to reach foreign publics as the Chinese Communist Party worked to expand its public diplomacy and international media outreach efforts. We find that all outlets increased the volume and diversity of content while none engaged in interactive, two-way communication with audiences, and none appeared to artificially inflate their follower count. One outlet, China Global Television Network, made outsized gains in followership, and it differs from the other Chinese outlets in that it was rebranded, it disseminated a relatively lower share of government-mandated narratives pertaining to China, and the tone of its reporting was more negative. These results show that during a period when Chinese statecontrolled broadcasters gained followers on Twitter, outlets made limited use of features unique to social media and instead primarily used social media as a broadcast channel. [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]

In this paper, authors propose novel limited feedback scheduling algorithms for multiple-input multiple-output (MIMO) orthogonal frequency division multiplexing (OFDM) broadcast channels (BC). Users feed back the maximum signal-to-interference-plus-noise ratio (SINR) and the index of the corresponding transmit antenna to base station. Here, it is proposed that a given user transmits back the maximum SINRs corresponding to each transmit antenna. It is shown that by this process the overall throughput improves significantly with comparatively small increase in feedback overhead (FO). Further, FO increases linearly with number of sub-carriers used in MIMO–OFDM. Adjacent sub-carriers experience similar channel conditions. Hence, they are grouped into clusters to reduce FO. Moreover, we propose that feedback of each user should consist of sum of the logarithmic values of the maximum SINRs corresponding to each transmit antenna for all sub-carriers present in a given cluster. The logarithmic based algorithm below a specific cluster size attains system sum-rate comparable to scheduling algorithms without sub-carrier grouping but with a reduction in FO by a factor equal to cluster size. [ABSTRACT FROM AUTHOR]

Copyright of Rihan Journal for Science Publishing is the property of Association of Arab Universities 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.)

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]

This paper provides a comparative analysis of how the energy-sector stocks of 20 regional blocs (Americas, Australasia, BRIC, Southeast Asia, Scandinavia, Southern Europe, Far East, Europe, European Union, Emerging Europe, Asia, G7, G12, Economic and Monetary Union (EMU), CCARBNS, Latin America, North America, PIIGS, Asia-Pacific and NORCS) are connected from 5 July 1994 to 21 April 2020. It uses various techniques: Diebold and Yilmaz (2014)(DY 2014, hereafter) spillover indices and TVP-VAR, LASSO-VAR. Our main results are as follows: First, the DY approach results show that the biggest net contributor of volatility is the CCARBNS region, followed by the G12 and G7 regions, while the biggest receiver of volatility is the Southeast Asia region. Second, the TVP-VAR and LASSO-VAR results reveal that Scandinavia, Far East, and America's regions are net receivers of energy shocks, with net transmitters being CCARBNS, G7, G12 and Emerging European regions. Third, during the 2007–2008 financial crisis and recent COVID-19 outbreak, energy stock market spillovers have reached unprecedented high levels. Fourth, the world policy uncertainty greatly influenced the magnitude of volatility spillovers across regional energy stock markets. [ABSTRACT FROM AUTHOR]

In this work, we propose globally optimal power allocation strategies to maximize the users sum-rate (SR), and system energy efficiency (EE) in the downlink of single-cell multicarrier non-orthogonal multiple access (MC-NOMA) systems. Each NOMA cluster includes a set of users in which the well-known superposition coding (SC) combined with successive interference cancellation (SIC) technique is applied among them. By obtaining the closed-form expression of intra-cluster power allocation, we show that MC-NOMA can be equivalently transformed to a virtual orthogonal multiple access (OMA) system, where the effective channel gain of these virtual OMA users is obtained in closed-form. Then, the SR and EE maximization problems are solved by using very fast water-filling and Dinkelbach algorithms, respectively. The equivalent transformation of MC-NOMA to the virtual OMA system brings new theoretical insights, which are discussed throughout the paper. The extensions of our analyses to other scenarios, such as considering users rate fairness, admission control, long-term performance, and a number of future next-generation multiple access (NGMA) schemes enabling recent advanced technologies, e.g., reconfigurable intelligent surfaces are discussed. Extensive numerical results are provided to demonstrate the performance gaps among single-carrier NOMA (SC-NOMA), OMA-NOMA, and OMA. [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]

In-band full duplex (IBFD) communications are a potential solution to spectrum scarcity. IBFD communications offer greater spectral efficiency than traditional half-duplex communications by transmitting and receiving on the same frequency channel. However, IBFD operation requires overcoming the challenge of eliminating the self-interference coupled from the transmit antenna to the receive subsystem. Knowledge of the characteristics of the loopback propagation channel makes it easier to cancel out the self-interference. Nevertheless, complex field trials are required to adequately characterize loopback channels, which is still lacking in the recent literature. This paper proposes a measurement campaign in a real and ongoing broadcast transmission center to characterize the main characteristics of loopback channels. The work proposes a set of loopback channels based on field trials and an empirical analysis of the most relevant parameters of the channel model, such as the Doppler spectrum, the delay spread, and the K-factor. • A new methodology for measuring and characterizing broadcast loopback channels. • Characterizing the loopback channel in terms of the amplitude and the delay of the paths. • An analysis of the obtained delay spread and K-factor values. • Characterizing the Doppler spectrum of the loopback channel in broadcast transmitters. • Performance evaluation of the proposed channel models under an ATSC 3.0 compliant transceiver chain. [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]

Copyright of Turkish Journal of Primary Education (TUJPED) is the property of Turkish Journal of Primary Education (TUJPED) 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.)

While depolarization of the neuronal membrane is known to evoke the neurotransmitter release from synaptic vesicles, hyperpolarization is regarded as a resting state of chemical neurotransmission. Here, we report that hyperpolarizing neurons can actively signal neural information by employing undocked hemichannels. We show that UNC-7, a member of the innexin family in Caenorhabditis elegans, functions as a hemichannel in thermosensory neurons and transmits temperature information from the thermosensory neurons to their postsynaptic interneurons. By monitoring neural activities in freely behaving animals, we find that hyperpolarizing thermosensory neurons inhibit the activity of the interneurons and that UNC-7 hemichannels regulate this process. UNC-7 is required to control thermotaxis behavior and functions independently of synaptic vesicle exocytosis. Our findings suggest that innexin hemichannels mediate neurotransmission from hyperpolarizing neurons in a manner that is distinct from the synaptic transmission, expanding the way of neural circuitry operations. [ABSTRACT FROM AUTHOR]

Copyright of Global Media Journal: Turkish Edition is the property of Global Media Journal, Turkish Edition 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.)

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]