Analyzing Control Traffic Overhead versus Mobility and Data Traffic Activity in Mobile Ad-Hoc Network Protocols

Laurent Viennot 1 Philippe Jacquet 2 Thomas Heide Clausen 3
1 GANG - Networks, Graphs and Algorithms
IRIF (UMR_8243) - Institut de Recherche en Informatique Fondamentale, Inria de Paris
2 HIPERCOM - High performance communication
Inria Paris-Rocquencourt, UP11 - Université Paris-Sud - Paris 11, Inria Saclay - Ile de France, X - École polytechnique, CNRS - Centre National de la Recherche Scientifique : UMR
Abstract : This paper proposes a general, parameterized model for analyzing protocol control overhead in mobile ad-hoc networks. A probabilistic model for the network topology and the data traffic is proposed in order to estimate overhead due to control packets of routing protocols. Our analytical model is validated by comparisons with simulations , both taken from literature and made specifically for this paper. For example, our model predicts linearity of control overhead with regard to mobility as observed in existing simulations results. We identify the model parameters for protocols like AODV, DSR and OLSR. Our model then allows accurate predictions of which protocol will yield the lowest overhead depending on the node mobility and traffic activity pattern. I. INTRODUCTION Mobile ad-hoc networking (MANET) has experienced a growing interest since the apparition of affordable radio interfaces , allowing wireless connectivity of mobile nodes. A key-point in connecting a group of mobile nodes is the design of a routing protocol that allows out-of-range nodes to communicate through the relaying of their traffic by intermediate nodes. This is the subject of the IETF MANET working group [5], [14] where several protocols are being proposed. The different routing protocols can be divided into two dis-joint classes, according to the way routes are created: Reactive protocols find routes on demand when needed by a source. They usually rely on flooding when no topol-ogy information is available. I.e. the source floods a packet and the path followed by this packet to reach the destination is then used. Proactive protocols proactively discover the topology with every node emitting regular hello packets and an optimized mechanism is used to broadcast local topology information. These two approaches have different characteristics with regard to control traffic overhead. Reactive protocols generate overhead only when a new route is needed, while proactive protocols continuously generate control traffic. Link failure,
Document type :
Journal articles
Complete list of metadatas

Cited literature [22 references]  Display  Hide  Download

https://hal-polytechnique.archives-ouvertes.fr/hal-02263376
Contributor : Thomas Heide Clausen <>
Submitted on : Sunday, August 4, 2019 - 5:22:53 PM
Last modification on : Friday, December 13, 2019 - 11:18:02 AM

File

2004-ACM-WINET-Analyzing-Contr...
Files produced by the author(s)

Identifiers

Collections

Citation

Laurent Viennot, Philippe Jacquet, Thomas Heide Clausen. Analyzing Control Traffic Overhead versus Mobility and Data Traffic Activity in Mobile Ad-Hoc Network Protocols. Wireless Networks, Springer Verlag, 2004, 10 (4), pp.447-455. ⟨10.1023/B:WINE.0000028548.44719.fe⟩. ⟨hal-02263376⟩

Share

Metrics

Record views

94

Files downloads

61