Trellis-Based Virtual Regular Addressing Structures in Self-organized Networks

Self–Organized Networks are multi-hop networks that do not rely on any infrastructure. Moreover, their topology is supposed to be flat since all nodes are equally in charge of address allocation and routing functions. Their time–changing topology breaks the association between Identification and Location that is present in the IP address. Moreover, mobility can not be handled easily when the addressing space is based on a tree description. In this paper we propose the use of Virtual Regular Structures to provide desired properties for Self0–Organized Networks. Our approach opens new ways to build addressing spaces and enables an implementation based on trellis graphs. We propose a construction heuristic and evaluate its performance via simulations. We also analyze the robustness of the proposed approach with regards to mobility.

[1]  Miguel Castro,et al.  Should we build Gnutella on a structured overlay? , 2004, Comput. Commun. Rev..

[2]  David R. Karger,et al.  A scalable location service for geographic ad hoc routing , 2000, MobiCom '00.

[3]  Charles E. Perkins,et al.  Internet connectivity for mobile ad hoc networks , 2002, Wirel. Commun. Mob. Comput..

[4]  Martin Mauve,et al.  A survey on position-based routing in mobile ad hoc networks , 2001, IEEE Netw..

[5]  Lip,et al.  Beyond the Tree Structure : a new way to configure nodes in SONs , 2004 .

[6]  P. Sweeney,et al.  Error control coding—fundamentals and applications, by Shu Lin and Daniel J. Costello Jr., Prentice‐Hall International, Hemel Hempstead, Herts., U.K., 1982. No. of pages: 720. Price: £43.20 , 1984 .

[7]  Ravi Prakash,et al.  MANETconf: configuration of hosts in a mobile ad hoc network , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[8]  Lionel M. Ni,et al.  Prophet address allocation for large scale MANETs , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[9]  J. Broch,et al.  Dynamic source routing in ad hoc wireless networks , 1998 .

[10]  Shu Lin,et al.  Error control coding : fundamentals and applications , 1983 .

[11]  Ryuji Wakikawa,et al.  Global connectivity for IPv6 Mobile Ad Hoc Networks , 2006 .

[12]  Tomasz Imielinski,et al.  Mobile Computing , 1996 .

[13]  Serge Fdida,et al.  An Underlay Strategy for Indirect Routing , 2004, Wirel. Networks.

[14]  David A. Maltz,et al.  Dynamic Source Routing in Ad Hoc Wireless Networks , 1994, Mobidata.

[15]  Robert Morris,et al.  Chord: A scalable peer-to-peer lookup service for internet applications , 2001, SIGCOMM 2001.

[16]  Andreas Pitsillides,et al.  Addressing network survivability issues by finding the K-best paths through a trellis graph , 1997, Proceedings of INFOCOM '97.

[17]  Charles E. Perkins,et al.  Ad hoc On-Demand Distance Vector (AODV) Routing , 2001, RFC.