Sciweavers

Share
IWCMC
2006
ACM

Performance of Taroko: a cluster-based addressing and routing scheme for self-organized networks

9 years 2 months ago
Performance of Taroko: a cluster-based addressing and routing scheme for self-organized networks
Self-Organized Networks (SONs) are a general description of autonomous networks without infrastructure, of which Ad Hoc, Sensor and Mesh networks are special cases. We had previously proposed a novel clustering architecture for SONs, named Taroko, that utilizes a fixed description of cluster routing tables to cope with SON’s characteristics. Taroko uses trellis graphs to provide addressing/locating and routing capabilities for the SON, while providing a builtin multi-path routing scheme and redundancy in the addressing space. This paper focuses on comparing Taroko to AODV and OLSR in terms of both control and data plane metrics. The simulation results show that Taroko performs well, especially in the presence of large numbers of sources. Categories and Subject Descriptors C.2.2 [Computer-Communication Networks]: Network Protocols General Terms Algorithms, Performance Keywords Self-Organized Networks, regular structure, trellis graphs
Julien Ridoux, Meriem Kassar, Mathias Boc, Anne Fl
Added 14 Jun 2010
Updated 14 Jun 2010
Type Conference
Year 2006
Where IWCMC
Authors Julien Ridoux, Meriem Kassar, Mathias Boc, Anne Fladenmuller, Yannis Viniotis
Comments (0)
books