A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is
Lecture Notes in Computer Science
We propose two algorithms to form spanning trees in sensor networks. The first algorithm forms hierarchical clusters of spanning trees with a given root, the sink. ... This hybrid architecture which provides co-existing spanning trees within clusters yields the necessary foundation for a two-level communication protocol in a sensor network as well as providing a structure ... The ENCAST (ENergy Critical node Aware Spanning Tree) algorithm  finds a shortest path tree (SPT) by breadth first traversal from the sink, and each node can reach the sink via the minimum number ...doi:10.1007/978-3-540-69384-0_57 fatcat:oemte7nahngxvboycyx4iqxjyu
It helps avoid exhausting the energy of any sensor node while leaving large amounts of energy at other nodes. ... In this thesis, we propose mechanisms to extend the lifetime of wireless sensor networks. ... Energy-Critical Node Aware Spanning Tree In this subsection, we present the algorithm, "ENergy Critical node Aware Spanning Tree" (ENCAST). ...doi:10.7939/r3sh39 fatcat:rotnnsyr7naa7ebzi7fnaa7yga