Spine routing in ad hoc networks
Authors:
- 1 June 1998
- journal article
- Published by Springer Nature in Cluster Computing
- Vol. 1 (2) , 237-248
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Approximation algorithms for connected dominating sets1996
- Multicluster, mobile, multimedia radio networkWireless Networks, 1995
- Fast distributed construction of k-dominating sets and applications1995
- Optimal distributed algorithm for minimum spanning trees revisited1995
- Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computersACM SIGCOMM Computer Communication Review, 1994
- On the hardness of approximating minimization problemsJournal of the ACM, 1994
- Optimal distributed algorithms for minimum weight spanning tree, counting, leader election, and related problems1987
- The DARPA packet radio network protocolsProceedings of the IEEE, 1987
- A Distributed Algorithm for Minimum-Weight Spanning TreesACM Transactions on Programming Languages and Systems, 1983