DocumentCode
2760984
Title
Throughput Analysis of a Path in an IEEE 802.11 Multihop Wireless Network
Author
Hira, Mukesh M. ; Tobagi, Fouad A. ; Medepalli, Kamesh
Author_Institution
Dept. of Electr. Eng., Stanford Univ., CA
fYear
2007
fDate
11-15 March 2007
Firstpage
441
Lastpage
446
Abstract
In this paper, we present a methodology to analytically compute the end-to-end throughput that can be achieved on a path between two nodes in an IEEE 802.11 multihop wireless network with homogenous data transmission rates. Knowledge of achievable end-to-end throughput is important for making routing decisions and performing admission control. Unlike a wired network where the throughput of a path after accounting for overheads is roughly equal to the lowest bandwidth along the path, the throughput of a wireless multihop path is much lower than the minimum data rate along the path because of sharing of the medium by nodes within carrier sensing range of each other. Our analysis of the achievable throughput takes into account this effect of sharing of the medium in the form of blocking and interference. We apply our analysis to several randomly generated paths, and compare the analytical results with those from simulations to validate the analysis.
Keywords
telecommunication congestion control; telecommunication network routing; wireless LAN; IEEE 802.11multihop wireless network; admission control; end-to-end throughput; homogenous data transmission rates; medium sharing; randomly generated paths; routing decisions; throughput analysis; Admission control; Bandwidth; Computer networks; Data communication; Interference; Routing; Spread spectrum communication; Throughput; Wireless networks; Wireless sensor networks;
fLanguage
English
Publisher
ieee
Conference_Titel
Wireless Communications and Networking Conference, 2007.WCNC 2007. IEEE
Conference_Location
Kowloon
ISSN
1525-3511
Print_ISBN
1-4244-0658-7
Electronic_ISBN
1525-3511
Type
conf
DOI
10.1109/WCNC.2007.86
Filename
4224331
Link To Document