Capacity of Ultra Wide Band Wireless Ad Hoc Networks
Rohit Negi, Arjunan Rajeswaran
Abstract
Throughput capacity is a critical parameter for the design and evaluation of ad-hoc wireless networks. Consider n identical randomly located nodes, on a unit area, forming an ad-hoc wireless network. Assuming a fixed per node transmission capability of T bits per second at a fixed range, it has been shown that the uniform throughput capacity per node r(n) is Theta((T)/(sqrtn log n)), a decreasing function of node density n. However an alternate communication model may also be considered, with each node constrained to a maximum transmit power P0 and capable of utilizing W Hz of bandwidth. Under the limiting case W rightarrow infinity, such as in Ultra Wide Band (UWB) networks, the uniform throughput per node is O ((n log n)(alpha-1/2) (upper bound) and Omega((n(alpha-1)/2)/((log n)(alpha +1)/2)) (achievable lower bound). These bounds demonstrate that throughput increases with node density n, in contrast to previously published results. This is the result of the large bandwidth, and the assumed power and rate adaptation, which alleviate interference. Thus, the effect of physical layer properties on the capacity of ad hoc wireless networks is demonstrated. Further, the promise of UWB as a physical layer technology for ad-hoc networks is justified.
Create a lesson
Related papers
Distributed Consensus, Optimization, and Learning under Communication Constraints
Zheng Chen, Nicolò Michelusi, Themistoklis Charalambous et al.
Energy-Accumulate-Then-Act Backscatter Communications With Retransmission Under Imperfect Feedback Detection
Rui Xu, Yinghui Ye, Guangyue Lu et al.
The Exact Memory-Rate Tradeoff for Three-User Secure Coded Caching
Han Fang, Nan Liu, Wei Kang
Cross-Modal Semantic Successive Refinement for Generative Image Communication over Underwater Acoustic Channels
Xu Pei, Bin Wang, Guangxu Zhu et al.
Fano's Inequality and Channel Capacity in the Individual-Sequence Regime
Neri Merhav
Exact Transport-Information Correspondence for Distribution-Adaptive Discretization
Koretaka Yuge