Context-Aware Inter-Networking for Wireless Networks

  • Franck Legendre
  • Marcelo Dias de Amorim
  • Serge Fdida
Conference paper
Part of the IFIP International Federation for Information Processing book series (IFIPAICT, volume 162)


Key issues of wireless ad hoc networks are auto-configuration and flexibility. Due to mobility, wireless networks are subject to frequent splits and merges. In many situations, overlapping networks must combine to form a new single network requiring a partial or total reconfiguration. In this context, existing proposals assume that merging networks use similar routing schemes. Nevertheless, there is no guarantee that different networks implement the same routing protocols. In such a scenario, routing protocols must adapt to the changing nature of the network characteristics. The wide spectrum under which ad hoc wireless networks are used lead to the design of multiple routing protocols (e.g., proactive, reactive and adaptive). Merging of wireless networks using distinct routing protocol is thus unavoidable and leverages particular difficult problems. We propose in this paper a flexible solution that enables heterogeneous networks to efficiently cope with merging. We designed a routing translator daemon based on the neighborhood context enabling neighbor nodes using distinct protocols to interoperate. The neighborhood context is obtained from the Neighborhood Routing Protocol Discovery Protocol. Several scenarios under different assumptions show that AODV, DSR and OLSR can efficiently interoperate. We give insights on how routing must adapt and evolve in order to cope with merging.


Wireless Network Dynamic Source Route Neighborhood Context Route Request Software Definable Radio 
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. [Clausen and Jacquet, 2003]
    Clausen, T. and Jacquet, P. (2003). Optimized Link State Routing Protocol OLSR. RFC. RFC-3626.Google Scholar
  2. [D.B. Johnson and Hu, 2003]
    D.B. Johnson, D.A. Maltz and Hu, Y-C. (2003). The Dynamic Source Routing protocol for Mobile ad hoc networks (DSR). Internet-Draft. draft-ietf-manet-dsr-09.txt-Work-in-progress.Google Scholar
  3. [Haas, 1997]
    Haas, Z. (1997). A new routing protocol for the reconfigurable wireless networks. In Proc. of the IEEE International Conference on Universal Personal Communications.Google Scholar
  4. [JSAC, 1999]
    JSAC, IEEE (1999). Special issue on software radios. In Mobile Computing, volume 17-4. IEEE.Google Scholar
  5. [Lu and Bhargava, 2001]
    Lu, Y. and Bhargava, B. (2001). Achieving flexibility and scalability: A new architecture for wireless network. In Proc. of International Conference on Internet Computing (IC’2001), pages 1105–1111, Las Vegas.Google Scholar
  6. [Nesargi and Prakash, 2002]
    Nesargi, S. and Prakash, R. (2002). Manetconf: Configuration of hosts in a mobile ad hoc network. In Proc. of Infocom’02, New York.Google Scholar
  7. [Perkins et al., 2003]
    Perkins, C. E., Belding-Royer, E. M., and Das, S. (2003). Ad hoc On-Demand Distance Vector AODV Routing. IETF RFC 3661.Google Scholar
  8. [R. Ogier and Lewis, 2004]
    R. Ogier, F. Templin and Lewis, M. (2004). Topology Dissemination Based on Reverse-Path Forwarding (TBRPF). RFC. RFC-3684.Google Scholar

Copyright information

© International Federation for Information Processing 2005

Authors and Affiliations

  • Franck Legendre
    • 1
  • Marcelo Dias de Amorim
    • 1
  • Serge Fdida
    • 1
  1. 1.LIP6/CNRSUniversity of Paris VIParisFrance

Personalised recommendations