As a guest user you are not logged in or recognized by your IP address. You have
access to the Front Matter, Abstracts, Author Index, Subject Index and the full
text of Open Access publications.
A hierarchical routing algorithm for wireless sensor networks (WSNs) is discussed. We select cluster heads according to related distances and residual energy. Both effects of the number of nodes dissipated and the energy consumption act on propagation distances. In addition, the related density effects on the propagation distance. We Define comprehensive influence factor and propagation influence factor, adjust the initial probability of nodes participating in cluster heads’ election, make propagation distances of nodes gradually increase within a certain range. Simulation results show that both cluster heads and failure nodes are evenly distributed in the whole sensor network. The residual energy of nodes are balanced inter the living nodes, which extends the survival time of the network. The routing algorithm we have designed has the characteristics of better balanced energy consumption.
This website uses cookies
We use cookies to provide you with the best possible experience. They also allow us to analyze user behavior in order to constantly improve the website for you. Info about the privacy policy of IOS Press.
This website uses cookies
We use cookies to provide you with the best possible experience. They also allow us to analyze user behavior in order to constantly improve the website for you. Info about the privacy policy of IOS Press.