Impact of traffic localization on communication rates in ad-hoc networks

Abstract

The effect of traffic distribution on communication rates and receiver complexity in ad-hoc networks is addressed, considering a network with constant density of users and a certain traffic model. Information theoretic upper bounds on communication rates are derived under an assumption that transmitting nodes as well as receiving nodes cooperate. It is shown that for the case of large signal attenuation the bounds hold even when the cooperation among users is limited to a certain region of the network domain. Furthermore, achievability bounds on communication rates are derived. The bounds rely on two proposed local cooperation strategies. A comparison shows that the upper bounds are tight and closely follow the achievability results. Finally, the impact of traffic localization on the receiver complexity is addressed.

Analysis of a Random Channel Access Scheme with Multi-Packet Reception

“…Let τ n be the time of n-th packet occurrence in the Poisson process 3 . A collision occurs if the number of overlapping packets in the time window [τ n , τ n + L − 1] is greater than K. For K = 2, this is illustrated in Fig 2. The arrival of more than 2 packets in the window of the n-th packet leads to a collision of the packet.…”

“…Joint-decoding and layering of CDMA signals provides a number of advantages such as resistance to nearfar effect, and robustness to multiple access interference. Several novel joint detection methods are capacity achieving in many scenarios [2], [3]. With joint decoding it is possible to resolve multiple concurrent overlapping packet transmissions in wireless network environments.…”