DocumentCode
3253794
Title
Queue-based contention control for congested multihop wireless networks
Author
Hwang, Jaeseon ; Lim, Hyuk
Author_Institution
Dept. of Inf. & Commun., Gwangju Inst. of Sci. & Technol., Gwangju
fYear
2008
fDate
14-17 Oct. 2008
Firstpage
540
Lastpage
541
Abstract
In multihop wireless networks, packets from a source node are relayed by intermediate nodes (relay nodes) toward their destination node along a multihop wireless path. However, if a relay node simultaneously receives a large number of packets and fails to forward them at the same rate as they are received, the end-to-end throughput performance of the network degrades due to packet losses at the bottleneck relay node. In this paper, we propose an adaptive contention control algorithm that adjusts the channel access probability depending on the level of congestion at each relay node in order to improve the end-to-end throughput performance in multihop wireless networks. In this algorithm, a bottleneck relay node is granted permission to increase its channel access probability by reducing its contention window size, thus enabling it to forward packets more aggressively. Through a series of simulations, we show that the end-to-end throughput is improved by about 60% in a chain topology.
Keywords
packet radio networks; telecommunication congestion control; adaptive contention control algorithm; channel access probability; multihop wireless networks; packet losses; Adaptive control; Degradation; Network topology; Performance loss; Permission; Programmable control; Relays; Spread spectrum communication; Throughput; Wireless networks;
fLanguage
English
Publisher
ieee
Conference_Titel
Local Computer Networks, 2008. LCN 2008. 33rd IEEE Conference on
Conference_Location
Montreal, Que
Print_ISBN
978-1-4244-2412-2
Electronic_ISBN
978-1-4244-2413-9
Type
conf
DOI
10.1109/LCN.2008.4664228
Filename
4664228
Link To Document