A novel non-disjoint partitioning algorithm for inter-cluster communication in wireless sensor networks
by S. Karthik; A. Ashok Kumar
International Journal of Communication Networks and Distributed Systems (IJCNDS), Vol. 27, No. 2, 2021

Abstract: Clustering accomplishes energy efficiency, seamless communication, and quality of service (QoS) metrics in wireless sensor networks. The idea of assimilating an overlapping method with clustering presents a virtuous inter-cluster communication in a distributed hostile environment. Therefore, a novel unequal non-disjoint partitioning algorithm called ratings based energy-efficient clustering overlap (REEC overlap) is proposed using K harmonic means (KHM) and fuzzy C means (FCM). The clusters are overlapped by combining the harmonic average distance, and FCM membership function. The cluster heads are chosen and rotated by rating value in which intersecting nodes are eliminated. The route is discovered using the energy required threshold with the least distance of nodes wherein frequency division multiple access (FDMA) is espoused as a data transmission medium. Simulation results show that the proposed work performs better than existing protocols. Moreover, REEC overlap is compared with REEC non-overlap to illustrate the energy dissipation of cluster heads that was proposed in the previous work.

Online publication date: Mon, 02-Aug-2021

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
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:

    Username:        Password:         

Forgotten your 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