Cluster Head Selection in a Homogeneous Wireless Sensor Network Ensuring Full Connectivity with Minimum Isolated Nodes
TL;DR: The research work proposes a cluster head selection algorithm for a wireless sensor network that ensures a completely connected network with minimum number of isolated nodes and the superiority of the proposed design is verified by simulation results done in MATLAB.
read more
Abstract: The research work proposes a cluster head selection algorithm for a wireless sensor network. A node can be a cluster head if it is connected to at least one unique neighbor node where the unique neighbor is the one that is not connected to any other node. If there is no connected unique node then the CH is selected on the basis of residual energy and the number of neighbor nodes. With the increase in number of clusters, the processing energy of the network increases; hence, this algorithm proposes minimum number of clusters which further leads to increased network lifetime. The major novel contribution of the proposed work is an algorithm that ensures a completely connected network with minimum number of isolated nodes. An isolated node will remain only if it is not within the transmission range of any other node. With the maximum connectivity, the coverage of the network is automatically maximized. The superiority of the proposed design is verified by simulation results done in MATLAB, where it clearly depicts that the total numbers of rounds before the network dies out are maximum compared to other existing protocols.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
An automated lightweight encryption scheme for secure and energy-efficient communication in wireless sensor networks
Osama Ahmed Khashan,Rami Ahmad,Nour Mahmoud Khafajah +2 more
- 15 Apr 2021
TL;DR: In this article, the authors proposed FlexCrypt, an automated lightweight cryptographic scheme for WSNs, where a new dynamic clustering technique that supports mobility among the sensor nodes is developed.
90
Energy dependent cluster formation in heterogeneous wireless sensor network
TL;DR: An approach for efficient cluster head selection namely Energy Dependent Cluster Formation in Heterogeneous Wireless Sensor Network (EDCF) to enhance the lifespan of network is proposed.
73
Balanced Cluster Head Selection Based on Modified k-Means in a Distributed Wireless Sensor Network
TL;DR: The results show that Mk-means (modified k-me means) algorithm was found to outperform the existing clustering algorithms owing to its unique multiple cluster head methodology.
55
Lifetime Optimization of a Multiple Sink Wireless Sensor Network through Energy Balancing
TL;DR: The wireless sensor network consists of small limited energy sensors which are connected to one or more sinks and the network lifetime optimization is achieved by restructuring the network by modifying the neighbor nodes of a sink.
Performance Analysis of Novel Energy Aware Routing in Wireless Sensor Network
Sanjeev Kumar,Surender Kumar Soni,Randheer,Rahul Priyadarshi +3 more
- 03 Nov 2018
TL;DR: By using GEAR (Geographical and Energy Aware Routing) Protocol, it is emphasis that commination among the nodes should be energy efficient by an intelligent neighbor selection to forward the packet to the sink.
22
References
An application-specific protocol architecture for wireless microsensor networks
TL;DR: This work develops and analyzes low-energy adaptive clustering hierarchy (LEACH), a protocol architecture for microsensor networks that combines the ideas of energy-efficient cluster-based routing and media access together with application-specific data aggregation to achieve good performance in terms of system lifetime, latency, and application-perceived quality.
HEED: a hybrid, energy-efficient, distributed clustering approach for ad hoc sensor networks
O. Younis,Sonia Fahmy +1 more
TL;DR: It is proved that, with appropriate bounds on node density and intracluster and intercluster transmission ranges, HEED can asymptotically almost surely guarantee connectivity of clustered networks.
WCA: A Weighted Clustering Algorithm for Mobile Ad Hoc Networks
TL;DR: An on-demand distributed clustering algorithm for multi-hop packet radio networks that takes into consideration the ideal degree, transmission power, mobility, and battery power of mobile nodes, and is aimed to reduce the computation and communication costs.
Dynamic clustering for acoustic target tracking in wireless sensor networks
TL;DR: Through both probabilistic analysis and ns-2 simulation, the proposed dynamic clustering algorithm effectively eliminates contention among sensors and renders more accurate estimates of target locations as a result of better quality data collected and less collision incurred.
508
ACE: An Emergent Algorithm for Highly Uniform Cluster Formation
Haowen Chan,Adrian Perrig +1 more
- 19 Jan 2004
TL;DR: The efficient subdivision of a sensor network into uniform, mostly non-overlapping clusters of physically close nodes is an important building block in the design of efficient upper layer network functions such as routing, broadcast, data aggregation, and query processing.