Minimum-hot-spot query trees for wireless sensor networks
Zeinalipour-Yazdi, Constantinos D.
SourceMobiDE 2010 - Proceedings of the 9th ACM International Workshop on Data Engineering for Wireless and Mobile Access, in Conjunction with ACM SIGMOD / PODS 2010
9th ACM International Workshop on Data Engineering for Wireless and Mobile Access, MobiDE'10, Held in Conjunction with SIGMOD 2010
Google Scholar check
MetadataShow full item record
We propose a distributed algorithm to construct a balanced communication tree that serves in gathering data from the network nodes to a sink. Our algorithm constructs a near-optimally balanced communication tree with minimum overhead. The balancing of the node degrees results in the minimization of packet collisions during query execution, that would otherwise require numerous retransmissions and reduce the lifetime of the network. We compare our simple distributed algorithm against previous work and a centralized solution and show that for most network layouts it outperforms competition and achieves tree balance very close to the centralized algorithm. It also has the smallest energy overhead possible to construct the tree, increasing the lifetime of the network even more. Copyright 2010 ACM.
Showing items related by title, author, creator and subject.
Lambrou, T. P.; Panayiotou, Christos G. (2009)
Laoudias, C.; Michaelides, M. P.; Panayiotou, Christos G. (2013)
Andreou, Panayiotis G.; Zeinalipour-Yazdi, Constantinos D.; Samaras, George S.; Chrysanthis, Panos K. (2014)Wireless sensor networks enable users to monitor the physical world at an extremely high fidelity. In order to collect the data generated by these tiny-scale devices, the data management community has proposed the utilization ...