Jitter Considerations in On-demand Route Discovery for Mobile Ad Hoc Networks
Fri, 04/26/2013 - 17:14 by Juan Antonio Cordero
Abstract
Jittering (a small, random variation in timing of control message emission) is widely used in protocols for wireless communication, in order to avoid simultaneous packet transmissions over the same channel by adjacent nodes in the network. Used for both regularly scheduled packets, for event-triggered packets, and for scheduled resets in the network, jittering is a particularly important mechanism when a network event may cause multiple adjacent nodes to react concurrently. Introduced in the proactive MANET routing protocol OLSR, the "LLN On-demand Ad hoc Distance-vector Routing Protocol - Next Generation" (LOADng), a derivative of AODV, is specified so as to also use jitter for when flooding Route Request (RREQ) messages during route discovery. This use of jitter in RREQ flooding is, however, not without drawbacks, which are identified and addressed in this paper within the framework of a more general study of jitter mechanisms used for route discovery in reactive routing protocols. The paper studies the behaviour of route discovery when using "naive" jitter (simply, delaying RREQ retransmission by a small uniformly distributed random delay), in order to identify and analyse the problems hereof, mostly related to route sub-optimality and excessive control traffic overhead. A Window Jitter mechanism is then proposed to address these issues -- with the performance hereof, when compared to "naive" jitter being evaluated by way of modeling, theoretical analysis and experiments. The \articleformat~shows that the use of Window Jitter improves indeed the efficiency of route discovery in AODV and overcome the drawbacks identified for "naive" jitter.
- Authors
- Jiazi Yi, Juan Antonio Cordero and Thomas Clausen
- Source
Proceedings of the 16th International Conference on Network-Based Information Systems (NBiS'2013) , September 2013.
- Cite it
- BibTex
- Copyright
- See here
IEEE Copyright Notice: This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.
ACM Copyright Notice: Copyright 1999 by the Association for Computing Machinery, Inc. Permission to make digital or hard copies of part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page or intial screen of the document. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, to republish, to post on servers, or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from Publications Dept., ACM Inc., fax +1 (212) 869-0481, or permissions@acm.org.
Springer-Verlag LNCS Copyright Notice: The copyright of these contributions has been transferred to Springer-Verlag Berlin Heidelberg New York. The copyright transfer covers the exclusive right to reproduce and distribute the contribution, including reprints, translations, photographic reproductions, microform, electronic form (offline, online), or any other reproductions of similar nature. Online available from Springer-Verlag LNCS series.