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

Authors:
Julien Ridoux;Meriem Kassar;Mathias Boc;Anne Fladenmuller;Yannis Viniotis
Affiliations:
The University of Melbourne, Victoria, Australia;Lip6-UPMC, Paris, France;Lip6-UPMC, Paris, France;Lip6-UPMC, Paris, France;NCSU, Raleigh, NC
Venue:
Proceedings of the 2006 international conference on Wireless communications and mobile computing
Year:
2006

Citing 6
Cited 0

Location-aided routing (LAR) in mobile ad hoc networks

MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
A scalable location service for geographic ad hoc routing

MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
GPSR: greedy perimeter stateless routing for wireless networks

MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
A Scalable Location Management Scheme in Mobile Ad-Hoc Networks

LCN '01 Proceedings of the 26th Annual IEEE Conference on Local Computer Networks
An underlay strategy for indirect routing

Wireless Networks - Special issue: Pervasive computing and communications
Trellis-Based virtual regular addressing structures in self-organized networks

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

Quantified Score

Hi-index	0.00

Visualization

Abstract

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 built-in 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.