Multicluster, mobile, multimedia radio network
Wireless Networks
The broadcast storm problem in a mobile ad hoc network
MobiCom '99 Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking
Multicast tree construction and flooding in wireless ad hoc networks
Proceedings of the 3rd ACM international workshop on Modeling, analysis and simulation of wireless and mobile systems
WCA: A Weighted Clustering Algorithm for Mobile Ad Hoc Networks
Cluster Computing
On Reducing Broadcast Redundancy in Ad Hoc Wireless Networks
IEEE Transactions on Mobile Computing
A fast algorithm for the maximum clique problem
Discrete Applied Mathematics - Sixth Twente Workshop on Graphs and Combinatorial Optimization
Distributed Clustering for Ad Hoc Networks
ISPAN '99 Proceedings of the 1999 International Symposium on Parallel Architectures, Algorithms and Networks
A Distributed Weighted Clustering Algorithm for Mobile Ad Hoc Networks
AICT-ICIW '06 Proceedings of the Advanced Int'l Conference on Telecommunications and Int'l Conference on Internet and Web Applications and Services
A Review of Current Multicast Routing Protocol of Mobile Ad Hoc Network
ICCMS '10 Proceedings of the 2010 Second International Conference on Computer Modeling and Simulation - Volume 03
Efficient broadcasting in self-organizing multi-hop wireless networks
ADHOC-NOW'05 Proceedings of the 4th international conference on Ad-Hoc, Mobile, and Wireless Networks
| Hi-index | 0.00 |
This paper presents a new cluster-based route discovery method for On Demand Multicast Routing Protocol ODMRP intended for efficient and reliable multicasting over cluster-based topologies of Mobile Ad hoc NETworks MANETs. The proposed method uses a combination of a number of cluster-related ideas available in the literature and a novel technique of using secondary cluster-heads proposed in this paper. Secondary cluster-heads offer load balancing which is aimed at providing reliable multicast services. The proposed method was tested by a computer simulation conducted in GloMoSim and the results show that the method is capable of accomplishing its goals by requiring only about 50% of the network resources needed by the blind flooding method of ODMRP.