Trellis-Based virtual regular addressing structures in self-organized networks

Authors:
Julien Ridoux;Anne Fladenmuller;Yannis Viniotis;Kavé Salamatian
Affiliations:
LIP6 – UPMC, Paris, France;LIP6 – UPMC, Paris, France;ECE Department, NCSU, Raleigh, NC;LIP6 – UPMC, Paris, France
Venue:
NETWORKING'05 Proceedings of the 4th IFIP-TC6 international conference on Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communication Systems
Year:
2005

Citing 5
Cited 3

A scalable location service for geographic ad hoc routing

MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Chord: A scalable peer-to-peer lookup service for internet applications

Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Addressing Network Survivability Issues by Finding the K-best Paths through a Trellis Graph

INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
An underlay strategy for indirect routing

Wireless Networks - Special issue: Pervasive computing and communications
A survey on position-based routing in mobile ad hoc networks

IEEE Network: The Magazine of Global Internetworking

Easily-managed and topology-independent location service for self-organizing networks

Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing
Performance of Taroko: a cluster-based addressing and routing scheme for self-organized networks

Proceedings of the 2006 international conference on Wireless communications and mobile computing
Twins: A Dual Addressing Space Representation for Self-Organizing Networks

IEEE Transactions on Parallel and Distributed Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.