ScienceDirect® Home Skip Main Navigation Links
You have guest access to ScienceDirect. Find out more.
 
Home
Browse
My Settings
Alerts
Help
 Quick Search
 Search tips (Opens new window)
    Clear all fields    
Computer Communications
Volume 28, Issue 10, 16 June 2005, Pages 1179-1192
Performance issues of Wireless LANs, PANs and ad hoc networks
 
Font Size: Decrease Font Size  Increase Font Size
 Abstract - selected
Article
Purchase PDF (537 K)

 
 
 
Related Articles in ScienceDirect
View More Related Articles
 
View Record in Scopus
 
doi:10.1016/j.comcom.2004.07.024    How to Cite or Link Using DOI (Opens New Window)
Copyright © 2004 Elsevier B.V. All rights reserved.

Performance of wireless networks with hidden nodes: a queuing-theoretic analysis

Saikat RayCorresponding Author Contact Information, E-mail The Corresponding Author, David StarobinskiE-mail The Corresponding Author and Jeffrey B. CarruthersE-mail The Corresponding Author

Department of Electrical and Computer Engineering, Boston University, Boston, MA 02215, USA

Received 21 July 2004; 
accepted 21 July 2004. 
Available online 11 September 2004.

Purchase the full-text article



References and further reading may be available for this article. To view references and further reading you must purchase this article.

Abstract

Hidden nodes are a fundamental problem that can potentially affect any wireless network where nodes cannot hear each other. Although the hidden node problem is well known, so far only few papers have quantified its effects in a comprehensive manner. This paper represents a first step towards getting a quantitative insight into the impact of hidden nodes on the performance of wireless networks. We first carry out an exact queuing-theoretic analysis for a 4-node segment and derive analytical expressions for the probability of packet collision, the mean packet delay, and the maximum throughput, based on a model that closely follows the IEEE 802.11 standard. We then extend the analysis and provide an approximation for a general linear topology that is asymptotically exact at low load. Finally, we perform detailed simulations to validate our analytical results and show their applicability to predict the performance of IEEE 802.11 networks with hidden nodes. The simulation and analysis closely match. Moreover, they reveal that the impact of hidden nodes propagates through the network causing some nodes to saturate at load as low as 15% of the capacity.

Keywords: IEEE 802.11; Hidden nodes; Collision probability; Delay analysis; Maximum throughput analysis

Article Outline

1. Introduction
2. Background
2.1. Outline of the IEEE 802.11 basic access method
2.2. Related work
3. Model and simple analysis
3.1. The elementary topology
3.2. Statistical model
3.3. A simple ‘random-look’ analysis
4. Analysis and main results
4.1. Probability of packet collision in the elementary topology
4.2. Maximum throughput in the elementary topology
4.3. Mean packet delay in the elementary topology
4.4. Extension to general linear network
5. Proof of key expressions
5.1. Calculation of E[N|qC(0)=0]
5.2. Calculation of E[N|qC(0)>0]
5.3. Derivation of Pr{qC(0)>0}
6. Simulation results
6.1. Validation of the analysis
6.2. Simulation of IEEE 802.11 network
6.2.1. Elementary topology
6.2.2. Linear topology
7. Conclusion
Acknowledgements
References














Computer Communications
Volume 28, Issue 10, 16 June 2005, Pages 1179-1192
Performance issues of Wireless LANs, PANs and ad hoc networks
 
Home
Browse
My Settings
Alerts
Help
Elsevier.com (Opens new window)
About ScienceDirect  |  Contact Us  |  Information for Advertisers  |  Terms & Conditions  |  Privacy Policy
Copyright © 2008 Elsevier B.V. All rights reserved. ScienceDirect® is a registered trademark of Elsevier B.V.