Efficient and Resilient Overlay Topologies over Ad Hoc Networks

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

Abstract

We discuss what kind of overlay topology should be pro-actively built before an overlay routing protocol enters a route search process on top of it.

The basic overlay structures we study are the K-Nearest Neighbours overlay topologies, connecting every overlay node to its K nearest peers.

We introduce a family of optimizations, based on a pruning rule. As flooding is a key component of many route discovery mechanisms in MANETs, our performance study focusses on the delivery percentage, bandwidth consumption and time duration of flooding on the overlay. We also consider the overlay path stretch and the overlay nodes degree as respective indicators for the data transfer transmission time and overlay resilience.

We finally recommend to optimize the K-Nearest Neighbours overlay topologies with the most selective pruning rule and, if necessary, to set a minimal bound on the overlay node degree for improving resilience.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Clark, D.: The design philosophy of the DARPA Internet protocols. Computer Communication Review 18(4), 106–114 (1988)CrossRefGoogle Scholar
  2. 2.
    Klemm, A., Lindemann, C., Waldhorst, O.: A special-purpose peer-to-peer file sharing system for mobile ad hoc networks. In: Proc. of IEEE Semiannual Vehicular Technology Conference (VTC2003-Fall), IEEE Computer Society Press, Los Alamitos (2003)Google Scholar
  3. 3.
    Duran, A., Shen, C.C.: Mobile ad hoc p2p file sharing. In: WCNC 2004. Proc. of IEEE Wireless Communications and Networking Conference, IEEE Computer Society Press, Los Alamitos (2004)Google Scholar
  4. 4.
    Conti, M., Gregori, E., Turi, G.: A cross-layer optimization of gnutella for mobile ad hoc networks. In: Proc. of ACM MobiHoc 2005, pp. 343–354. ACM Press, New York (2005)CrossRefGoogle Scholar
  5. 5.
    Santi, P.: Topology control in wireless ad hoc and sensor networks. ACM Comp. Surveys 37(2), 164–194 (2005)CrossRefGoogle Scholar
  6. 6.
    Blough, D., Leoncini, M., Resta, G., Santi, P.: The k-neigh protocol for symmetric topology control in ad hoc networks. In: Proc. of ACM MobiHoc 2003, pp. 141–152. ACM Press, New York (2003)CrossRefGoogle Scholar
  7. 7.
    Wattenhofer, R., Zollinger, A.: XTC: A practical topology control algorithm for ad-hoc networks. In: Proc. of 4th International Workshop on Algorithms for Wireless, Mobile, Ad Hoc and Sensor Networks (WMAN) (2004)Google Scholar
  8. 8.
    Calomme, S., Leduc, G.: The critical neighbourhood range for asymptotic overlay connectivity in ad hoc networks. Ad Hoc & Sensor Wireless Networks journal 2(2) (2006)Google Scholar
  9. 9.
    Perkins, C., Royer, E.M.: Ad hoc on-demand distance vector routing. In: WMCSA 1999. Proc. IEEE Workshop on Mobile Computing Systems and Applications, IEEE Computer Society Press, Los Alamitos (1999)Google Scholar
  10. 10.
    Narayanaswamy, S., Kawadia, V., Sreenivas, R., Kumar, P.R.: Power control in ad-hoc networks: Theory, architecture, algorithm and implementation of the compow protocol. In: Proc. of European Wireless 2002. Next Generation Wireless Networks: Technologies, Protocols, Services and Applications, Florence, Italy, pp. 156–162 (February 2002)Google Scholar
  11. 11.
    Marina, M.K., Das, S.R.: Routing performance in the presence of unidirectional links in multihop wireless networks. In: MobiHoc 2002. Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing, pp. 12–23. ACM Press, New York (2002)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2007

Authors and Affiliations

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

Personalised recommendations