Subscribe
Issue No.11 - Nov. (2013 vol.12)
pp: 2167-2177
Chengzhi Li , Broadcom Corporation, Matawan
Huaiyu Dai , North Carolina State University, Raleigh
ABSTRACT
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.
INDEX TERMS
Protocols, Complexity theory, Noise measurement, Spread spectrum communication, Noise, Vectors, Histograms,clustering, Distributed computing, noisy multihop network
CITATION
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, doi:10.1109/TMC.2012.185
REFERENCES
 [1] N.A. Lynch, Distributed Algorithms. Morgan Kaufmann, 1997. [2] H. Attiya and J. Welch, Distributed Computing: Fundamentals, Simulations, and Advanced Topics, second ed. Wiley-Interscience, 2004. [3] A. Orlitsky and A. El-Gamal, "Communication Complexity," Complexity in Information Theory, Y.S. Abu-Mostafa, ed., pp. 16-61, Springer, 1988. [4] L. Lovasz, "Communication Complexity: A Survey," Paths, Flows, and VLSI Layout, B.H. Korte, ed., Springer-Verlag, 1990. [5] E. Kushilevitz and N. Nisan, Communication Complexity. Cambridge Univ., 1997. [6] A. Giridhar and P.R. Kumar, "Computing and Communcating Functions over Sensor Network," IEEE J. Selected Areas Comm., vol. 23, no. 4, pp. 755-764, Apr. 2005. [7] A.E. Gamal, "Open Problem," Proc. Workshop Specific Problems in Comm. and Computation, 1984. [8] R. Gallager, "Finding Parity in a Simple Broadcast Network," IEEE Trans. Information Theory, vol. 34, no. 2, pp. 176-80, Mar. 1988. [9] I. Newman, "Computing in Fault Tolerance Broadcast Networks," Proc. IEEE Ann. Conf. Computational Complexity, 2004. [10] N. Khude, A. Kumar, and A. Karnik, "Time and Energy Complexity of Distributed Computation of a Class of Functions in Wireless Sensor Networks," IEEE Trans. Mobile Computing, vol. 7, no. 5, pp. 617-632, May 2008. [11] L. Ying, R. Srikant, and G.E. Dullerud, "Distributed Symmetric Function Computation in Noisy Wireless Sensor Network," IEEE Trans. Information Theory, vol. 53, no. 12, pp. 4826-4833, Dec. 2007. [12] S. Rajagopalan and L. Schulman, "A Coding Theorem for Distributed Computation," Proc. 26th Ann. ACM Symp. Theory of Computing, 1994. [13] Y. Kanoria and D. Manjunath, "On Distributed Computation in Noisy Random Planar Networks," Proc. IEEE Int'l Symp. Information Theory, June 2007. [14] N. Goyal, G. Kindler, and M. Saks, "Lower Bounds for the Noisy Broadcast Problem," Proc. IEEE Symp. Foundations of Computer Science, 2005. [15] A. Yao, "On the Complexity of Communication under Noise," Proc. Fifth Israel Symp. Theory of Computing and Systems (ISTCS), 1997. [16] E. Kushilevitz and Y. Mansour, "Computation in Noisy Radio Networks," Proc. ACM-SIAM Symp. Discrete Algorithms, 1998. [17] U. Feige and J. Kilian, "Finding OR in a Noisy Broadcast Network," Information Processing Letters, vol. 73, nos. 1/2, pp. 69-75, 2000. [18] C. Li, H. Dai, and H. Li, "Finding the $K$ Largest Metrics in a Noisy Broadcast Network," Proc. Allerton Conf. Comm., Control and Computing, 2008. [19] P. Gupta and P.R. Kumar, "The Capacity of Wireless Networks," IEEE Trans. Information Theory, vol. 46, no. 2, pp. 388-404, Mar. 2000. [20] F. Xue and P.R. Kumar, Scaling Laws for Ad Hoc Wireless Networks: An Information Theoretic Approach, Now, 2006. [21] P. Gupta and P. Kumar, "Critical Power for Asymptotic Connectivity in Wireless Networks," Stochastic Analysis, Control, Optimization and Applications, W.H. Fleming, W. McEneaney, G. Yin, and Q. Zhang, eds., Birkhäuser, 1998. [22] F. Xue and P. Kumar, "The Number of Neighbors Needed for Connectivity of Wireless Networks," Wireless Network, vol. 10, no. 2, pp. 169-181, Mar. 2004. [23] D. Mosk-Aoyama and D. Shah, "Computing Separable Functions via Gossip," Proc. ACM Symp. Principles of Distributed Computing, Sept. 2007. [24] S. Subramanian, P. Gupta, and S. Shakkottai, "Scaling Bounds for Function Computation over Large Networks," Proc. IEEE Int'l Symp. Information Theory, June 2007. [25] W. Hoeffding, "Probability Inequalities for Sums of Bounded Random Variables," J. Am. Statistical Assoc., vol. 58, pp. 13-30, 1963. [26] J.H. van Lint, Introduction to Coding Theory, third ed. Springer-Verlag, 1999. [27] M.R. Garey and D.S. Johnson, A Guide to the Theory of NP-Completeness. W.H. Freeman and Company, 1979. [28] W. Li and H. Dai, "Cluster-Based Distributed Consensus," IEEE Trans. Wireless Comm., vol. 8, no. 1, pp. 28-31, Jan. 2009. [29] C. Li and H. Dai, "Towards Efficient Designs for In-Network Computing with Noisy Wireless Channels," Proc. IEEE INFOCOM, 2010. [30] A. Ozgur, O. Leveque, and D. Tse, "Hierarchical Cooperation Achieves Optimal Capacity Scaling in Ad Hoc Networks," IEEE Trans. Information Theory, vol. 53, no. 10, pp. 3549-3572, Oct. 2007. [31] J. Ghaderi, L. Xie, and X. Shen, "Hierarchical Cooperation in Ad Hoc Networks: Optimal Clustering and Achievable Throughput," IEEE Trans. Information Theory, vol. 55, no. 8, pp. 3425-3436, Aug. 2009. [32] L.-L. Xie and R.R. Kumar, "A Network Information Theory for Wireless Communication: Scaling Laws and Optimal Operation," IEEE Trans. Information Theory, vol. 50, no. 5, pp. 748-767, May 2004.