A priority-based weighted clustering algorithm for mobile ad hoc network Online publication date: Tue, 09-Apr-2019
by Sunil Pathak; Sonal Jain
International Journal of Communication Networks and Distributed Systems (IJCNDS), Vol. 22, No. 3, 2019
Abstract: One major problem in clustering is the setback involved in cluster formation, cluster maintenance and in the selection of a suitable cluster head. In this paper we have proposed a priority-based weighted clustering algorithm for MANETs which works on three approaches to reduce cluster head changes and clustering overhead. The first phase helps to dynamically determine the cluster head based on their initial priority of neighbour nodes within cluster. The second and third phase helps in cluster maintenance and selecting the new cluster head automatically without any delay when remaining battery power of old cluster head reaches up to the minimum threshold value or in the absence of cluster head. From the simulation result, it is clear that the proposed algorithm reduces the frequent cluster head changes, communication overheads and also improves the efficiency of transmission in the network. Priority of each mobile node is calculated based on node degree and battery power.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Communication Networks and Distributed Systems (IJCNDS):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook