dc.contributor.authorLu, Zongqing
dc.contributor.authorWen, Yonggang
dc.contributor.authorFan, Rui
dc.contributor.authorTan, Su-Lim
dc.contributor.authorBiswas, Jit
dc.date.accessioned2013-12-05T07:01:21Z
dc.date.available2013-12-05T07:01:21Z
dc.date.copyright2013en_US
dc.date.issued2013
dc.identifier.citationLu, Z., Wen, Y., Fan, R., Tan, S. L., & Biswas, J. (2013). Toward efficient distributed algorithms for in-network binary operator tree placement in wireless sensor networks. IEEE journal on selected areas in communications, 31(4), 743-755.en_US
dc.identifier.issn0733-8716en_US
dc.identifier.urihttp://hdl.handle.net/10220/18113
dc.description.abstractIn-network processing is touted as a key technology to eliminate data redundancy and minimize data transmission, which are crucial to saving energy in wireless sensor networks (WSNs). Specifically, operators participating in in-network processing are mapped to nodes in a sensor network. They receive data from downstream operators, process them and route the output to either the upstream operator or the sink node. The objective of operator tree placement is to minimize the total energy consumed in performing in-network processing. Two types of placement algorithms, centralized and distributed, have been proposed. A problem with the centralized algorithm is that it does not scale to large WSN's, because each sensor node is required to know the complete topology of the network. A problem with the distributed algorithm is their high message complexity. In this paper, we propose a heuristic algorithm to place a treestructured operator graph, and present a distributed implementation to optimize in-network processing cost and reduce the communication overhead. We prove a tight upper bound on the minimum in-network processing cost, and show that the heuristic algorithm has better performance than a canonical greedy algorithm. Simulation-based evaluations demonstrate the superior performance of our heuristic algorithm. We also give an improved distributed implementation of our algorithm that has a message overhead of O(M) per node, which is much less than the O(√NM log2 M) and O(√NM) complexities for two previously proposed algorithms, Sync and MCFA, respectively. Here, N is the number of network nodes and M is the size of the operator tree.en_US
dc.language.isoenen_US
dc.relation.ispartofseriesIEEE journal on selected areas in communicationsen_US
dc.subjectDRNTU::Engineering::Computer science and engineering
dc.titleToward efficient distributed algorithms for in-network binary operator tree placement in wireless sensor networksen_US
dc.typeJournal Article
dc.contributor.schoolSchool of Computer Engineeringen_US
dc.identifier.doihttp://dx.doi.org/10.1109/JSAC.2013.130411


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record