Analysis of the hidden node problem in HIPERLAN

Author

Vukovic, Ivan

Author_Institution

Performance Anal. Dept., Motorola Inc., Arlington Heights, IL, USA

Volume

2

fYear

1999

fDate

1999

Firstpage

1234

Abstract

We present analysis of the HIPERLAN channel access control (CAC) protocol in an ad hoc wireless network assuming partially connected topologies. We derive expressions for the probability of success and capacity as a function of the number of hidden node pairs. More complex hidden node scenarios are analyzed using simulations. Significant degradation in performance was observed especially for the nodes in the overlapping regions. In particular, we show that an independent HIPERLAN operating in the overlapping region can be blocked for a long period of time assuming heavy load in the surrounding networks

Keywords

access protocols; digital simulation; network topology; probability; wireless LAN; HIPERLAN; an ad hoc wireless network; capacity; channel access control protocol; hidden node pairs; hidden node problem; overlapping region nodes; partially connected topologies; performance degradation; simulations; success probability; Access control; Access protocols; Analytical models; Capacity planning; Peer to peer computing; Performance analysis; Throughput; Topology; Traffic control; Wireless application protocol;

fLanguage

English

Publisher

ieee

Conference_Titel

Communications, 1999. ICC '99. 1999 IEEE International Conference on

Conference_Location

Vancouver, BC

Print_ISBN

0-7803-5284-X

Type

conf

DOI

10.1109/ICC.1999.765513

Filename

765513