.png){kind=icon}
.png){kind=icon}
Return
Function Computation over Heterogeneous Wireless Sensor Networks
.png){kind=icon}
PRE
AI
DOI：10.1109/TPDS.2013.266.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
problem of function computation in large scale heterogeneous wireless sensor networks (WSNs) is studied. Suppose n sensors are placed in a disk network area with radius n(alpha), where alpha is a positive constant. The sensors are located heterogeneously around the sink node, i.e., the density of sensors decreases as the distance from the sink node increases. At one instant, each sensor is assigned an input bit. The target of the sink is to compute a function f of the input bits, where f is either a symmetric or the identity function. Energy-efficient algorithms based on inhomogeneous tessellation of the network are designed and the corresponding optimal energy consumption scaling laws are derived. We show that the proposed algorithms are indeed optimal (except for some polylogarithmic terms) by deriving matching lower bounds on the energy consumption required to compute f. At last, based on the results obtained in this paper as well as those obtained by previous works, some discussions and comparisons are presented. We observe that 1) the heterogeneity extent has a great impact on the computation of both symmetric function and identity function, and 2) the energy usage of computing symmetric function can be significantly smaller than that of computing identity function under certain parameter condition, i.e., performing in-network computation helps save energy.
Keywords:
Heterogeneity
in-network computation
symmetric function
identity function
wireless sensor networks (WSNs)
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6
Papers:
5.2K
Citations:
1.1W
