Download now Free registration required
Sensor networks are commonly used for security and surveillance applications. As sensor nodes have limited battery power, computing, and storage resources, the energy efficient security techniques are needed. The authors provide a new heuristic approach to search for balanced and small weight routing spanning trees in a network. The approach is a modification of Kruskal's Minimum Spanning Tree (MST) search algorithm and is based on a distributed search by hierarchical clusters. It provides spanning trees with a lower maximum degree, a bigger diameter and can be used for balanced energy consumption routing in Wireless Sensor Networks (WSNs).
- Format: PDF
- Size: 196.6 KB