Abstract
A key advantage of viewing communications in wireless networks as multiple access rather than a plurality of point-to-point transmissions, is its robustness towards multiple access interference. Concurrent packet transmissions are allowed to coexist thus deviating from the traditional view of enforcing collision-footprints around the transmitter-receiver pairs. What are the performance gains of employing channel access strategy based on a multiple access channel in a multihop wireless network? We consider a wireless multihop network, where nodes have a joint decoding capability to resolve up to K multiple concurrent packet transmissions from other nodes in their range. The basic assumptions are that the packet transmissions are asynchronous, i.e., nodes are completely uncoordinated, and that the packet transmission at each node is based on a probabilistic model. In this paper, we show that a simple random access strategy for communication over such channels offers significant gains in throughput while reducing latency in congested wireless networks. More precisely, we characterize the throughput performance gains through an exact analysis for the case of K=2 and also offer tight approximations for arbitrary K. Furthermore, we study the asymptotic throughput behavior and prove asymptotic optimality of random channel access over multiple access channel.
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call