Decentralized Wireless Networks With Asynchronous Users and Burst Transmissions

This paper studies a decentralized wireless network of asynchronous transmitter-receiver pairs with burst transmissions. Each receiver learns about the number of active users, channel coefficients, and mutual delays based on locally available measurements. The estimates for the mutual delays are not perfect, however, they are reliable enough to guarantee successful decoding. Two signalling schemes are addressed, namely, randomized masking (RM) and reduced cycle transmission (RCT). Under RM, the n symbols of a codeword are generated according to a Bernoulli-Gaussian distribution with activity factor 0 <; θ ≤ 1. This is in contrast to RCT where each codeword consists of ⌈θn⌉ Gaussian symbols followed by n-⌈θn⌉ zeros. Assuming the transmitters are unaware of the number of users, channel coefficients, and mutual delays, the probability of outage under RM is considerably lower compared with RCT if the signal-to-noise ratio (SNR) is sufficiently large. A generalized RCT scheme is also examined where the n - ⌈θn⌉ zero symbols are not necessarily located at the end of a codeword. In the asymptote of large SNR, the outage probability becomes vanishingly small under RM, however, it is bounded away from zero for generalized RCT regardless of the value of SNR.

[1]  Robert J. McEliece,et al.  Asynchronous multiple-access channel capacity , 1981, IEEE Trans. Inf. Theory.

[2]  James L. Massey,et al.  The collision channel without feedback , 1985, IEEE Trans. Inf. Theory.

[3]  Abhay Parekh,et al.  Spectrum sharing for unlicensed bands , 2005, IEEE Journal on Selected Areas in Communications.

[4]  Abbas El Gamal,et al.  Network Information Theory , 2021, 2021 IEEE 3rd International Conference on Advanced Trends in Information Theory (ATIT).

[5]  Kenneth W. Shum,et al.  Shift-Invariant Protocol Sequences for the Collision Channel Without Feedback , 2009, IEEE Transactions on Information Theory.

[6]  Pierre A. Humblet,et al.  The capacity region of the totally asynchronous multiple-access channel , 1985, IEEE Trans. Inf. Theory.

[7]  Josep Vidal,et al.  On the totally asynchronous interference channel with single-user receivers , 2009, 2009 IEEE International Symposium on Information Theory.

[8]  Gerhard Kramer,et al.  A New Outer Bound and the Noisy-Interference Sum–Rate Capacity for Gaussian Interference Channels , 2007, IEEE Transactions on Information Theory.

[9]  H. Vincent Poor,et al.  Multi-level rate-splitting for synchronous and asynchronous interference channels , 2011, 2011 IEEE International Symposium on Information Theory Proceedings.

[10]  Bixio Rimoldi Generalized time sharing: A low-complexity capacity-achieving multiple-access technique , 2001, IEEE Trans. Inf. Theory.

[11]  Kamyar Moshksar,et al.  Randomized Resource Allocation in Decentralized Wireless Networks , 2011, IEEE Transactions on Information Theory.

[12]  Dudley,et al.  Real Analysis and Probability: Measurability: Borel Isomorphism and Analytic Sets , 2002 .

[13]  Norman Abramson,et al.  The Throughput of Packet Broadcasting Channels , 1977, IEEE Trans. Commun..

[14]  Sandra Lowe,et al.  Probability A Graduate Course , 2016 .

[15]  Venugopal V. Veeravalli,et al.  Gaussian Interference Networks: Sum Capacity in the Low-Interference Regime and New Outer Bounds on the Capacity Region , 2008, IEEE Transactions on Information Theory.

[16]  R. M. Dudley,et al.  Real Analysis and Probability , 1989 .

[17]  “ GPS-free synchronization of Digital Terrestrial TV and Mobile TV distribution networks , .

[18]  Gregory W. Wornell,et al.  Optimal Sequential Frame Synchronization , 2007, IEEE Transactions on Information Theory.

[19]  Thomas M. Cover,et al.  Network Information Theory , 2001 .

[20]  A. Khandani,et al.  Randomized on-off signaling for asynchronous interference channels , 2010, 2010 Conference Record of the Forty Fourth Asilomar Conference on Signals, Systems and Computers.

[21]  Hua Wang,et al.  Gaussian Interference Channel Capacity to Within One Bit , 2007, IEEE Transactions on Information Theory.

[22]  Sergio Verdú,et al.  A general formula for channel capacity , 1994, IEEE Trans. Inf. Theory.

[23]  Amir K. Khandani,et al.  Capacity bounds for the Gaussian Interference Channel , 2008, 2008 IEEE International Symposium on Information Theory.

[24]  Bruce Hajek,et al.  Decentralized dynamic control of a multiaccess broadcast channel , 1982 .

[25]  Gábor Lugosi,et al.  Concentration Inequalities - A Nonasymptotic Theory of Independence , 2013, Concentration Inequalities.

[26]  Stuart C. Schwartz,et al.  Stability properties of slotted Aloha with multipacket reception capability , 1988 .

[27]  Kamyar Moshksar,et al.  Resource management in interference channels with asynchronous users , 2009, 2009 IEEE International Symposium on Information Theory.

[28]  Thomas M. Cover,et al.  Elements of Information Theory , 2005 .

[29]  W. S. Wong New Protocol Sequences for Random-Access Channels Without Feedback , 2007, IEEE Transactions on Information Theory.

[30]  Stuart C. Schwartz,et al.  Optimal decentralized control in the random access multipacket channel , 1989 .