The clade vertebrata: spines and routing in ad hoc networks
- 27 November 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 599-605
- https://doi.org/10.1109/iscc.1998.702601
Abstract
This work proposes a self-organizing, dynamic infrastructure called a spine for efficient routing in ad hoc networks. We present a scalable framework for routing that encompasses a range of knowledge at each spine node, and identify the trade-offs involved for routing at different points in this range. Our routing algorithm requires only partial topology information at each spine node, consisting of the spine structure, dependants of each spine node, propagation of long-lived links, and snooped routing information from ongoing flows. Through worst-case theoretical bounds and simulation of typical scenarios, we show that the spine-based routing with only partial topology information provides good routes at low overhead.Keywords
This publication has 8 references indexed in Scilit:
- Routing in ad-hoc networks using minimum connected dominating setsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Spine routing in ad hoc networksCluster Computing, 1998
- Multicluster, mobile, multimedia radio networkWireless Networks, 1995
- A distributed routing algorithm for mobile wireless networksWireless Networks, 1995
- Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computersPublished by Association for Computing Machinery (ACM) ,1994
- A design concept for reliable mobile radio networks with frequency hopping signalingProceedings of the IEEE, 1987
- A Distributed Algorithm for Minimum-Weight Spanning TreesACM Transactions on Programming Languages and Systems, 1983
- Hierarchical routing for large networks Performance evaluation and optimizationComputer Networks (1976), 1977