Abstract
Wireless sensor networks (WSN) provide the availability of small and low-cost sensor nodes with capability of detecting, observing and monitoring the environment, along with data processing and communication. These sensor nodes have limited transmission range, processing and storage capabilities as well as their energy resources. Routing protocols for wireless sensor networks are responsible for maintaining the energy efficient paths in the network and have to ensure extended network lifetime. In this paper, we propose and analyze a new approach of cluster head selection by a homogeneous sensor node (having same initial energy) in wireless sensor network, which involves choosing the cluster head which lies closest to the midpoint of the base station and the sensor node. Our proposed routing algorithm is related with energy and distance factors of each nodes. This scheme is then compared with the traditional LEACH protocol which involves selecting the cluster head which is nearest to the particular node. We conclude that the proposed protocol effectively extends the network lifetime with less consumption of energy in the network.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Journal of Wireless & Mobile Networks
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
