Energy-optimal distributed algorithms for minimum spanning trees
Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures
Minimum-energy broadcast in random-grid ad-hoc networks: approximation and distributed algorithms
Proceedings of the 11th international symposium on Modeling, analysis and simulation of wireless and mobile systems
MVSink: Incrementally Building In-Network Aggregation Trees
EWSN '09 Proceedings of the 6th European Conference on Wireless Sensor Networks
Energy-optimal distributed algorithms for minimum spanning trees
IEEE Journal on Selected Areas in Communications - Special issue on stochastic geometry and random graphs for the analysis and designof wireless networks
The relation between organized structure and maintaining cost in WSN
WiCOM'09 Proceedings of the 5th International Conference on Wireless communications, networking and mobile computing
A local distributed algorithm to approximate MST in unit disc graphs
FCT'09 Proceedings of the 17th international conference on Fundamentals of computation theory
Localized and integrated topology maintenance for wireless sensor networks
NTMS'09 Proceedings of the 3rd international conference on New technologies, mobility and security
SmartDetect: an efficient WSN implementation for intrusion detection
COMSNETS'10 Proceedings of the 2nd international conference on COMmunication systems and NETworks
INFOCOM'10 Proceedings of the 29th conference on Information communications
Journal of Parallel and Distributed Computing
MixNStream: multi-source video distribution with stream mixers
Proceedings of the 2010 ACM workshop on Advanced video streaming techniques for peer-to-peer networks and social networking
Topology control and channel assignment in lossy wireless sensor networks
Proceedings of the 23rd International Teletraffic Congress
A weight-value algorithm for finding connected dominating sets in a MANET
Journal of Network and Computer Applications
Bounding interference in wireless ad hoc networks with nodes in random position
SIROCCO'12 Proceedings of the 19th international conference on Structural Information and Communication Complexity
Establishing strong connectivity using optimal radius half-disk antennas
Computational Geometry: Theory and Applications
DISC'12 Proceedings of the 26th international conference on Distributed Computing
| Hi-index | 0.01 |
While there are distributed algorithms for the MST problem, these algorithms require relatively large number of messages and time; this makes these algorithms impractical for resource-constrained networks such as ad hoc wireless sensor networks. In such networks, a sensor has very limited power, and any algorithm needs to be simple, local, and energy efficient for being practical. Motivated by these considerations, we design and analyze a class of simple and local distributed algorithms called Nearest Neighbor Tree (NNT) algorithms for energy-efficient construction of MSTs in a wireless ad hoc setting. We assume that the nodes are uniformly distributed in a unit square and show provable bounds on the performance with respect to both the quality of the spanning tree produced and the energy needed to construct them. In particular, we show that NNT produces a close approximation to the MST, and they can be maintained dynamically with polylogarithmic number of rearrangements under node insertions/deletions. We also perform extensive simulations of our algorithms. We tested our algorithms on both uniformly random distributions of nodes, and on a realistic distributions of nodes in an urban setting. Simulations validate the theoretical results and show that the bounds are much better in practice.