Please use this identifier to cite or link to this item:
Title: Toward efficient distributed algorithms for in-network binary operator tree placement in wireless sensor networks
Authors: Lu, Zongqing
Wen, Yonggang
Fan, Rui
Tan, Su-Lim
Biswas, Jit
Keywords: DRNTU::Engineering::Computer science and engineering
Issue Date: 2013
Source: Lu, 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.
Series/Report no.: IEEE journal on selected areas in communications
Abstract: In-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.
ISSN: 0733-8716
DOI: 10.1109/JSAC.2013.130411
Fulltext Permission: none
Fulltext Availability: No Fulltext
Appears in Collections:SCSE Journal Articles

Citations 20

Updated on Mar 20, 2023

Web of ScienceTM
Citations 20

Updated on Mar 18, 2023

Page view(s) 10

Updated on Mar 20, 2023

Google ScholarTM




Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.