Optimization of Critical Data Synchronization via Link Overlay RNG in Mobile Ad Hoc Networks
Tue, 09/04/2012 - 11:59 by Juan Antonio Cordero
Abstract
In practice, ad hoc networks are still too unreliable for standard mobile and vehicular communications. It is thus important to complement current protocols in this context, with schemes guaranteeing the exchange of critical data when needed. A promising approach in this realm is to use an overlay subgraph, over which critical messages are exchanged and acknowledged in a peer to peer fashion. Overlay nodes’ local databases remain thus synchronized over time, at least concerning critical data. This paper elaborates on the problem of performance, related to the discovery and maintenance of such overlay networks in a mobile ad hoc context. We analyze SLOT, an overlay selected based on a Relative Neighbour Graph (RNG) scheme. We then apply SLOT to a standard IP protocol: OSPF, a popular routing protocol which has recently been extended, with RFC 5449 and RFC 5614, to work also on mobile ad hoc networks, and which makes use of a similar overlay synchronization subgraph. This paper compares the performance these existing OSPF mechanisms with that of SLOT-OSPF, a novel OSPF extension for mobile ad hoc networks using SLOT. Simulations show that SLOT-OSPF produces drastically less control traffic than RFC 5449 or RFC 5614, allowing SLOT-OSPF to function correctly while the other existing approaches stall, when the number of routers in the domain is large.
- Authors
- Emmanuel Baccelli, Juan Antonio Cordero and Philippe Jacquet
- Source
In 7th IEEE International Conference Mobile Ad-hoc and Sensor Systems (MASS) , 2010.
- 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.