Abstract

AbstractBesides main quality of service features the guaranteed lifetime is one of the key characteristic of many applications for efficient operations, therefore guaranteeing the lifetime of the entire wireless sensor networks is mainly considered in the scheme. In this paper, a novel scheme to guarantee the lifetime of wireless sensor networks in terms of distributed and randomized clustering with scary energy is proposed. We then extend this algorithm to checks the status of every cluster head and conclude that how much energy is spent during performing different operations. The cluster head will also aware of the time for which it will perform duty as a local base for its member nodes. Simulation results validate the effect of the proposed clustering algorithm to guarantee scary lifetime of wireless sensor networks.KeywordsWireless sensor networkLifetimeClustering algorithmLEACH protocol

Full Text
Published version (Free)

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 call