Maximising resource utilisation and load balancing in MANET multicasting with ODMRP over cluster-based topologies

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.

[1]  Yu-Chee Tseng,et al.  The Broadcast Storm Problem in a Mobile Ad Hoc Network , 1999, Wirel. Networks.

[2]  Melbourne Barton,et al.  Efficient flooding with passive clustering-an overhead-free selective forward mechanism for ad hoc/sensor networks , 2003 .

[3]  Jie Wu,et al.  Forward-node-set-based broadcast in clustered mobile ad hoc networks , 2003, Wirel. Commun. Mob. Comput..

[4]  Ben Lee,et al.  Issues in Scalable Clustered Network Architecture for Mobile Ad Hoc Networks , 2004, Mobile Computing Handbook.

[5]  Mario Gerla,et al.  On-Demand Multicast Routing Protocol (ODMRP) for Ad Hoc Networks , 2015 .

[6]  A. Ephremides,et al.  A design concept for reliable mobile radio networks with frequency hopping signaling , 1987, Proceedings of the IEEE.

[7]  Patric R. J. Östergård,et al.  A fast algorithm for the maximum clique problem , 2002, Discret. Appl. Math..

[8]  Sajal K. Das,et al.  WCA: A Weighted Clustering Algorithm for Mobile Ad Hoc Networks , 2002, Cluster Computing.

[9]  Jie Wu,et al.  On Reducing Broadcast Redundancy in Ad Hoc Wireless Networks , 2002, IEEE Trans. Mob. Comput..

[10]  Charalampos Konstantopoulos,et al.  Lowest-ID with adaptive ID reassignment: a novel mobile ad-hoc networks clustering algorithm , 2006, 2006 1st International Symposium on Wireless Pervasive Computing.

[11]  Sam Jabbehdari,et al.  A Novel Distributed Clustering Algorithm for Mobile Ad-hoc Networks , 2008 .

[12]  Sung-Ju Lee,et al.  On-Demand Multicast Routing Protocol (ODMRP) for Ad-Hoc Networks , 2002 .

[13]  Chong-kwon Kim,et al.  Multicast tree construction and flooding in wireless ad hoc networks , 2000, MSWIM '00.

[14]  Charalampos Konstantopoulos,et al.  Clustering of Mobile Ad Hoc Networks: An Adaptive Broadcast Period Approach , 2006, 2006 IEEE International Conference on Communications.

[15]  Janez Konc,et al.  An improved branch and bound algorithm for the maximum clique problem , 2007 .

[16]  Wonchang Choi,et al.  A Distributed Weighted Clustering Algorithm for Mobile Ad Hoc Networks , 2006, Advanced Int'l Conference on Telecommunications and Int'l Conference on Internet and Web Applications and Services (AICT-ICIW'06).

[17]  Stefano Basagni,et al.  Distributed clustering for ad hoc networks , 1999, Proceedings Fourth International Symposium on Parallel Architectures, Algorithms, and Networks (I-SPAN'99).

[18]  Trilok Chand Aseri,et al.  A Review of Current Multicast Routing Protocol of Mobile Ad Hoc Network , 2010, 2010 Second International Conference on Computer Modeling and Simulation.

[19]  Mario Gerla,et al.  Multicluster, mobile, multimedia radio network , 1995, Wirel. Networks.

[20]  S. Jain,et al.  Node stability based clustering algorithm for mobile ad hoc networks , 2008, 2008 Fourth International Conference on Wireless Communication and Sensor Networks.

[21]  Nathalie Mitton,et al.  Efficient Broadcasting in Self-organizing Multi-hop Wireless Networks , 2005, ADHOC-NOW.