Table of Contents Author Guidelines Submit a Manuscript
Journal of Sensors
Volume 2014 (2014), Article ID 724219, 8 pages
Research Article

Cluster Head Selection in a Homogeneous Wireless Sensor Network Ensuring Full Connectivity with Minimum Isolated Nodes

Department of Electronics and Communication Engineering, Jaypee University of Information Technology, Waknaghat, Solan, Himachal Pradesh 173215, India

Received 2 December 2013; Accepted 28 June 2014; Published 12 August 2014

Academic Editor: Yanbiao Liao

Copyright © 2014 Tapan Kumar Jain et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.


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.