Publication 2013 Issue No. 11 - Nov. Abstract - Efficient In-Network Computing with Noisy Wireless Channels
Efficient In-Network Computing with Noisy Wireless Channels
Nov. 2013 (vol. 12 no. 11)
pp. 2167-2177
 ASCII Text x Chengzhi Li, Huaiyu Dai, "Efficient In-Network Computing with Noisy Wireless Channels," IEEE Transactions on Mobile Computing, vol. 12, no. 11, pp. 2167-2177, Nov., 2013.
 BibTex x @article{ 10.1109/TMC.2012.185,author = {Chengzhi Li and Huaiyu Dai},title = {Efficient In-Network Computing with Noisy Wireless Channels},journal ={IEEE Transactions on Mobile Computing},volume = {12},number = {11},issn = {1536-1233},year = {2013},pages = {2167-2177},doi = {http://doi.ieeecomputersociety.org/10.1109/TMC.2012.185},publisher = {IEEE Computer Society},address = {Los Alamitos, CA, USA},}
 RefWorks Procite/RefMan/Endnote x TY - JOURJO - IEEE Transactions on Mobile ComputingTI - Efficient In-Network Computing with Noisy Wireless ChannelsIS - 11SN - 1536-1233SP2167EP2177EPD - 2167-2177A1 - Chengzhi Li, A1 - Huaiyu Dai, PY - 2013KW - ProtocolsKW - Complexity theoryKW - Noise measurementKW - Spread spectrum communicationKW - NoiseKW - VectorsKW - HistogramsKW - clusteringKW - Distributed computingKW - noisy multihop networkVL - 12JA - IEEE Transactions on Mobile ComputingER -
In this paper, we study distributed function computation in a noisy multihop wireless network. We adopt the adversarial noise model, for which independent binary symmetric channels are assumed for any point-to-point transmissions, with (not necessarily identical) crossover probabilities bounded above by some constant $(\epsilon)$. Each node takes an $(m)$-bit integer per instance, and the computation is activated after each node collects $(N)$ readings. The goal is to compute a global function with a certain fault tolerance in this distributed setting; we mainly deal with divisible functions, which essentially cover the main body of interest for wireless applications. We focus on protocol designs that are efficient in terms of communication complexity. We first devise a general protocol for evaluating any divisible functions, addressing both one-shot $((N = O(1)))$ and block computation, and both constant and large $(m)$ scenarios. We also analyze the bottleneck of this general protocol in different scenarios, which provides insights into designing more efficient protocols for specific functions. In particular, we endeavor to improve the design for two exemplary cases: the identity function, and size-restricted type-threshold functions, both focusing on the constant $(m)$ and $(N)$ scenario. We explicitly consider clustering, rather than hypothetical tessellation, in our protocol design.