An Overlay Maintenance Protocol for Overlay Routing on Top of Ad Hoc Networks

  • Sandrine Calomme
  • Guy Leduc
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4982)


The protocol described in this paper builds and maintains an overlay topology on top of an ad hoc network. The overlay is intended to be used by a routing application. As flooding is a key component of many route discovery mechanisms in MANETs, we evaluate the delivery percentage, bandwidth consumption and time duration of flooding a message on the overlay. We also consider the overlay path stretch as an indicator for the data transfer transmission time.

The protocol does not require any information from the underlay routing protocol, nor cooperation from the nodes that do not belong to the overlay. Each overlay node maintains a set of nearest overlay nodes and exchanges its neighbourhood information with them in order to select useful overlay links. Resilience is afforded by setting a minimum number of overlay neighbours.

The performance observed over OLSR are good, for all overlay densities and mobility level studied.


Node Versus Optimise Link State Route Pruning Rule Broadcast Packet Overlay Node 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


  1. 1.
    Bavier, A., Feamster, N., Huang, M., Peterson, L., Rexford, J.: In vini veritas: realistic and controlled network experimentation. In: Proc. of ACM SIGCOMM (2006)Google Scholar
  2. 2.
    Li, Z., Mohapatra, P.: Qron: Qos-aware routing in overlay networks. IEEE Journal on Selected Areas in Communications 22(1) (2004)Google Scholar
  3. 3.
    Subramanian, L., Stoica, I., Balakrishnan, H., Katz, R.H.: Overqos: offering internet qos using overlays. SIGCOMM Comput. Commun. Rev. 33(1) (2003)Google Scholar
  4. 4.
    Touch, J.: Dynamic internet overlay deployment and management using the x-bone. Computer Networks 36(2-3) (2001)Google Scholar
  5. 5.
    Klein, M., Konig-Ries, B., Obreiter, P.: A lightweight overlay for service discovery in mobile ad hoc networks. In: Proc. of 3rd Workshop on Applications and Services in Wireless Networks (ASWN 2003) (July 2003)Google Scholar
  6. 6.
    Xie, J., Talpade, R.R., McAuley, A., Liu, M.: Amroute: Ad hoc multicast routing protocol. Mobile Networks and Applications 7(6) (2002)Google Scholar
  7. 7.
    Conti, M., Gregori, E., Turi, G.: A cross-layer optimization of gnutella for mobile ad hoc networks. In: Proc. of ACM MobiHoc 2005, Urbana-Champaign, IL (2005)Google Scholar
  8. 8.
    Delmastro, F.: From pastry to crossroad: Cross-layer ring overlay for ad hoc networks. In: Proc. of 2nd IEEE International Workshop on Mobile Peer-to-Peer Computing (MP2P 2005) (March 2005)Google Scholar
  9. 9.
    Pucha, H., Das, S.M., Hu, Y.C.: How to implement dhts in mobile ad hoc networks? In: Proc. of MobiCom 2004, Philadelphia, PA (2004)Google Scholar
  10. 10.
    Cramer, C., Fuhrmann, T.: Proximity neighbor selection for a dht in wireless multi-hop networks. In: Proc. of 5th IEEE International Conference on Peer-to-Peer Computing (P2P 2005) (August 2005)Google Scholar
  11. 11.
    Zahn, T., Schiller, J.H.: Madpastry: A dht substrate for practicably sized manets. In: Proc. of 5th Workshop on Applications and Services in Wireless Networks (ASWN 2005) (June 2005)Google Scholar
  12. 12.
    Pucha, H., Das, S.M., Hu, Y.C.: Ekta: An efficient dht substrate for distributed applications in mobile ad hoc networks. In: Proc. of 6th IEEE Workshop on Mobile Computing Systems and Applications (WMCSA 2004) (December 2004)Google Scholar
  13. 13.
    Kummer, R., Kropf, P., Felber, P.: Distributed lookup in structured peer-to-peer ad-hoc networks. In: Proc. of International Conference on Distributed Objects and Applications (DOA 2006) (October 2006)Google Scholar
  14. 14.
    Calomme, S., Leduc, G.: Efficient and resilient overlay topologies over ad hoc networks. In: Hutchison, D., Katz, R.H. (eds.) IWSOS 2007. LNCS, vol. 4725, Springer, Heidelberg (2007)CrossRefGoogle Scholar
  15. 15.
    Clausen, T., Jacquet, P.: Optimized link state routing protocol (olsr).Google Scholar
  16. 16.
    Perkins, C., Royer, E.M.: Ad hoc on-demand distance vector routing. In: Proc. of IEEE Workshop on Mobile Computing Systems and Applications(WMCSA 1999) (1999)Google Scholar
  17. 17.
    Clausen, T., Jacquet, P., Viennot, L.: Comparative study of routing protocols for mobile ad-hoc networks. In: Proc. of 1st Annual Mediterranean Ad Hoc Networking Workshop (Medhocnet 2002) (2002)Google Scholar

Copyright information

© IFIP International Federation for Information Processing 2008

Authors and Affiliations

  • Sandrine Calomme
    • 1
  • Guy Leduc
    • 1
  1. 1.Research Unit in Networking Electrical Engineering and Computer Science DepartmentUniversity of LiègeBelgium

Personalised recommendations