Title :
Analytical models for single-hop and multi-hop ad hoc networks
Author :
Alizadeh-Shabdiz, Farshid ; Subramaniam, Suresh
Author_Institution :
Dept. of Electr. & Comput. Eng., George Washington Univ., DC, USA
Abstract :
The inherent complexity of analysis of a multi-hop ad hoc network together with the fact that the behavior of a node is dependent not only on its neighbors´ behavior, but also on the behavior of other unseen nodes makes multi-hop network analysis extremely difficult. However, our approach in this paper to analyze multi-hop networks offers an accurate approximation with moderate complexity. Our approach is based on characterizing the behavior of a node by its state and the state of the channel it sees. This approach is used to carry out an analysis of single-hop and multi-hop ad hoc networks in which different nodes may have different traffic loads. In order to validate the model, it is applied to IEEE 802.11-based networks, and it is shown through extensive simulations that the model is very accurate.
Keywords :
Markov processes; access protocols; ad hoc networks; computational complexity; telecommunication channels; telecommunication traffic; wireless LAN; Markov chain; analytical model; computational complexity; multihop ad hoc network; network traffic; single-hop ad hoc network; Ad hoc networks; Analytical models; Computer networks; Distributed computing; Media Access Protocol; Performance analysis; Spread spectrum communication; Telecommunication traffic; Throughput; Traffic control;
Conference_Titel :
Broadband Networks, 2004. BroadNets 2004. Proceedings. First International Conference on
Print_ISBN :
0-7695-2221-1
DOI :
10.1109/BROADNETS.2004.15
