Unnecessary Competition in Multi-hop Wireless Networks

In multi-hop wireless networks, active nodes compete for the sharing channel with nodes in the same range. In this paper, we show that a large fraction of the competition can be seen as unnecessary. In addition, we present that with the aid of routing information, the unnecessary competition can be alleviated and consequently the network performance improved.

[1]  Leandros Tassiulas,et al.  End-to-end bandwidth guarantees through fair local spectrum share in wireless ad-hoc networks , 2003, 42nd IEEE International Conference on Decision and Control (IEEE Cat. No.03CH37475).

[2]  Baochun Li.  End-to-End Fair Bandwidth Allocation in Multi-Hop Wireless Ad Hoc Networks , 2005, 25th IEEE International Conference on Distributed Computing Systems (ICDCS'05).

[3]  Sunil Kumar,et al.  Medium Access Control protocols for ad hoc wireless networks: A survey , 2006, Ad Hoc Networks.

[4]  P. Kumar,et al.  Capacity of Ad Hoc Wireless Networks , 2002 .

[5]  Edward W. Knightly,et al.  Distributed multi-hop scheduling and medium access with delay and throughput constraints , 2001, MobiCom '01.

[6]  Satish K. Tripathi,et al.  Alleviating MAC Layer Self-Contention in Ad-hoc Networks , 2003 .

[7]  D. Atkin.  OR scheduling algorithms. , 2000, Anesthesiology.

[8]  Hongqiang Zhai,et al.  Distributed Flow Control and Medium Access in Multihop Ad Hoc Networks , 2006, IEEE Transactions on Mobile Computing.