Hierarchical multicast routing scheme for mobile ad hoc network

Authors:
A. Shajin Nargunam;M. P. Sebastian
Affiliations:
Department of Computer Applications, N.I College of Engineering, Thuckalay, Tamil Nadu, India;Department of Computer Engineering, National Institute of Technology Calicut, Kerala, India
Venue:
HiPC'07 Proceedings of the 14th international conference on High performance computing
Year:
2007

Citing 12
Cited 1

Proportional differentiated services: delay differentiation and packet scheduling

IEEE/ACM Transactions on Networking (TON)
WCA: A Weighted Clustering Algorithm for Mobile Ad Hoc Networks

Cluster Computing
Model-based compression in wireless ad hoc networks

Proceedings of the 1st international conference on Embedded networked sensor systems
A Light-Weight Contention-Based Clustering Algorithm for Wireless Ad Hoc Networks

CIT '04 Proceedings of the The Fourth International Conference on Computer and Information Technology
Efficient Broadcasting with Guaranteed Coverage in Mobile Ad Hoc Networks

IEEE Transactions on Mobile Computing
Novel self-configurable positioning technique for multihop wireless networks

IEEE/ACM Transactions on Networking (TON)
ATP: A Reliable Transport Protocol for Ad Hoc Networks

IEEE Transactions on Mobile Computing
A Distributed Protocol for Dynamic Address Assignment in Mobile Ad Hoc Networks

IEEE Transactions on Mobile Computing
Cooperation in wireless ad hoc networks: a market-based approach

IEEE/ACM Transactions on Networking (TON)
The k-Neighbors Approach to Interference Bounded and Symmetric Topology Control in Ad Hoc Networks

IEEE Transactions on Mobile Computing
An advanced location information management scheme for supporting flexible service provisioning in reconfigurable mobile networks

IEEE Communications Magazine
MANNA: a management architecture for wireless sensor networks

IEEE Communications Magazine

Review: Review of multicast routing mechanisms in mobile ad hoc networks

Journal of Network and Computer Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

Ad hoc network is a dynamic multi-hop wireless network that is established by a group of mobile nodes on a shared wireless channel. The plain flooding algorithm provokes a high number of unnecessary packet rebroadcasts, causing contention, packet collisions and ultimately wasting precious limited bandwidth. Another barrier is that routing in ad hoc networks does not scale up as easily as in fixed network. Hierarchical techniques have long been known to afford scalability in networks. By introducing hierarchical routing scheme to ad hoc networks, we can effectively address this problem. Clustering provides a method to build and maintain hierarchical routing scheme in ad hoc networks. By summarizing topology detail via a hierarchical map of the network topology, network nodes are able to conserve memory and link resources. This paper proposes a fully distributed cluster based routing algorithm for mobile ad hoc networks. Non-overlapping clusters are formed using the dynamic cluster creation algorithm. Packets are routed according to the routing information available with each gateway node. The mobility issues are also handled locally in this routing architecture. The proposed cluster maintenance algorithm dynamically adapts to the changes and hence the efficiency is not degraded by node mobility. In addition, our analysis shows that building clustered hierarchies is affordable and that clustering algorithms can also be used to enhance network quality of service.