Cluster based routing using a k-tree core backbone for mobile ad hoc networks

Authors:
Saurabh Srivastava;R. K. Ghosh
Affiliations:
Indian Institute of Technology, Kanpur;Indian Institute of Technology, Kanpur
Venue:
DIALM '02 Proceedings of the 6th international workshop on Discrete algorithms and methods for mobile computing and communications
Year:
2002

Citing 9
Cited 4

Optimal distributed algorithms for minimum weight spanning tree, counting, leader election, and related problems

STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Algorithms for a core and k-tree core of a tree

Journal of Algorithms
Optimal distributed algorithm for minimum spanning trees revisited

Proceedings of the fourteenth annual ACM symposium on Principles of distributed computing
Finding a k-Tree Core and a k-Tree Center of a Tree Network in Parallel

IEEE Transactions on Parallel and Distributed Systems
A Distributed Algorithm for Minimum-Weight Spanning Trees

ACM Transactions on Programming Languages and Systems (TOPLAS)
Efficient Parallel Algorithms for Optimally Locating a k-Leaf Tree in a Tree Network

ICPP '97 Proceedings of the international Conference on Parallel Processing
Ad Hoc Networking

Ad Hoc Networking
Load balanced routing protocols for ad hoc mobile wireless networks

IEEE Communications Magazine
Adaptive clustering for mobile wireless networks

IEEE Journal on Selected Areas in Communications

Fault-Tolerant Beacon Vector Routing for Mobile Ad Hoc Networks

IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 16 - Volume 17
Efficient route discovery in hybrid networks

Ad Hoc Networks
A route-aware MAC for wireless multihop networks with a convergecast traffic pattern

Computer Networks: The International Journal of Computer and Telecommunications Networking
Merging clustering algorithms in mobile ad hoc networks

ICDCIT'05 Proceedings of the Second international conference on Distributed Computing and Internet Technology

Quantified Score

Hi-index	0.00

Visualization

Abstract

The problem of routing in Mobile Ad hoc Networks is non-trivial because of the dynamic nature of the network topology. In addition to computing shortest paths, as in wire-line networks, any routing scheme must consider that the topology of the network can vary while the packet is being routed.Cluster based schemes have been proposed which segregate the network into manageable sets for maintaining routing information. In this paper we propose a novel method of constructing the clusters and a backbone based on the concept of a k-tree core. We also propose an hierarchical routing scheme using this cluster information and evaluate its performance through extensive simulations.