Optimization of critical data synchronization via link overlay RNG in mobile ad hoc networks

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 of 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.

[1]  Aravind Srinivasan,et al.  Fast distributed algorithms for (weakly) connected dominating sets and linear-size skeletons , 2003, J. Comput. Syst. Sci..

[2]  L. Devroye.  THE EXPECTED SIZE OF SOME GRAPHS IN COMPUTATIONAL GEOMETRY , 1988 .

[3]  Philippe Jacquet.  Control of mobile ad hoc networks , 2006, 2006 IEEE Information Theory Workshop - ITW '06 Punta del Este.

[4]  Philippe Jacquet.  Optimization of point to point database synchronization via link overlay RNG in mobile ad hoc networks , 2006 .

[5]  Fred Baker.  Problem Statement for OSPF Extensions for Mobile Ad Hoc Routing , 2003 .

[6]  Thomas R. Henderson,et al.  A wireless interface type for OSPF , 2003, IEEE Military Communications Conference, 2003. MILCOM 2003..

[7]  Philippe Jacquet,et al.  Multi-point Relaying Techniques with OSPF on Ad Hoc Networks , 2009, 2009 Fourth International Conference on Systems and Networks Communications.

[8]  John Moy,et al.  OSPF Version 2 , 1998, RFC.

[9]  P.A. Spagnolo,et al.  Comparison of Proposed Ospf Manet Extensions , 2006, MILCOM 2006 - 2006 IEEE Military Communications conference.

[10]  A. Udaya Shankar,et al.  An Empirical Characterization of Instantaneous Throughput in 802.11b WLANs , 2002 .

[11]  Philippe Jacquet,et al.  Link state routing in wireless ad-hoc networks , 2003, IEEE Military Communications Conference, 2003. MILCOM 2003..

[12]  Philippe Jacquet,et al.  OSPF Multipoint Relay (MPR) Extension for Ad Hoc Networks , 2009, RFC.

[13]  Marco Conti,et al.  IEEE 802.11 wireless LAN: capacity analysis and protocol enhancement , 1998, Proceedings. IEEE INFOCOM '98, the Conference on Computer Communications. Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies. Gateway to the 21st Century (Cat. No.98.

[14]  Richard G. Ogier,et al.  Mobile Ad Hoc Network (MANET) Extension of OSPF Using Connected Dominating Set (CDS) Flooding , 2009, RFC.

[15]  Abhay Roy,et al.  Extensions to OSPF to Support Mobile Ad Hoc Networking , 2010, RFC.

[16]  Anis Laouiti,et al.  Multipoint relaying for flooding broadcast messages in mobile wireless networks , 2002, Proceedings of the 35th Annual Hawaii International Conference on System Sciences.

[17]  Jie Wu,et al.  Efficient broadcasting with guaranteed coverage in mobile ad hoc networks , 2005, IEEE Transactions on Mobile Computing.

[18]  Peter E. Hart,et al.  Nearest neighbor pattern classification , 1967, IEEE Trans. Inf. Theory.

[19]  Dang-Quan Nguyen,et al.  Integrating VANETs in the Internet Core with OSPF : the MPR-OSPF Approach , 2007, 2007 7th International Conference on ITS Telecommunications.

[20]  George F. Riley,et al.  The Georgia Tech Network Simulator , 2003, MoMeTools '03.

[21]  François Ingelrest,et al.  RNG Relay Subset Flooding Protocols in Mobile Ad-Hoc Networks , 2003, Int. J. Found. Comput. Sci..

[22]  Godfried T. Toussaint,et al.  The relative neighbourhood graph of a finite planar set , 1980, Pattern Recognit..

[23]  Philippe Jacquet,et al.  Fish eye OLSR scaling properties , 2004, Journal of Communications and Networks.