Subscribe
Issue No.01 - January (2009 vol.20)
pp: 124-139
Maleq Khan , Virginia Bioinformatics Institute, Virginia Tech, Blacksburg
Gopal Pandurangan , Purdue University, West Lafayette
V.S. Anil Kumar , Virginia Bioinformatics Institute, Virginia Tech, Blacksburg
ABSTRACT
While there are distributed algorithms for the MST problem, these algorithms require relatively large number of messages and time; this makes these algorithms impractical for resource-constrained networks such as ad hoc wireless sensor networks. In such networks, a sensor has very limited power, and any algorithm needs to be simple, local, and energy efficient for being practical. Motivated by these considerations, we design and analyze a class of simple and local distributed algorithms called Nearest Neighbor Tree (NNT) algorithms for energy-efficient construction of MSTs in a wireless ad hoc setting. We assume that the nodes are uniformly distributed in a unit square and show provable bounds on the performance with respect to both the quality of the spanning tree produced and the energy needed to construct them. In particular, we show that NNT produces a close approximation to the MST, and they can be maintained dynamically with polylogarithmic number of rearrangements under node insertions/deletions. We also perform extensive simulations of our algorithms. We tested our algorithms on both uniformly random distributions of nodes, and on a realistic distributions of nodes in an urban setting. Simulations validate the theoretical results and show that the bounds are much better in practice.
INDEX TERMS
Distributed Algorthms, Minimum Spanning Tree, Sensor networks, Approximation Algorithms, Probabilistic Analysis
CITATION
Maleq Khan, Gopal Pandurangan, V.S. Anil Kumar, "Distributed Algorithms for Constructing Approximate Minimum Spanning Trees in Wireless Sensor Networks", IEEE Transactions on Parallel & Distributed Systems, vol.20, no. 1, pp. 124-139, January 2009, doi:10.1109/TPDS.2008.57
REFERENCES
 [1] R. Gallager, P. Humblet, and P. Spira, “A Distributed Algorithm for Minimum-Weight Spanning Trees,” ACM Trans. Programming Languages and Systems, vol. 5, no. 1, pp. 66-77, Jan. 1983. [2] B. Krishnamachari, D. Estrin, and S. Wicker, “The Impact of Data Aggregation in Wireless Sensor Networks,” Proc. Second Int'l Workshop Distributed Event-Based Systems (DEBS '02), July 2002. [3] M. Elkin, “Unconditional Lower Bounds on the Time-Approximation Tradeoffs for the Distributed Minimum Spanning Tree Problem,” Proc. 36th ACM Symp. Theory of Computing (STOC '04), June 2004. [4] D. Peleg, Distributed Computing: A Locality-Sensitive Approach. SIAM, 2000. [5] X. Li, Y. Wang, P. Wan, W. Song, and O. Frieder, “Localized Low-Weight Graph and Its Applications in Wireless Ad Hoc Networks,” Proc. IEEE INFOCOM, 2004. [6] X. Li, “Algorithmic, Geometric and Graphs Issues in Wireless Networks,” J. Wireless Comm. and Mobile Computing, vol. 3, no. 2, pp. 119-140, 2003. [7] W. Heinzelman, A. Chandrakasan, and H. Balakrishnan, “An Application-Specific Protocol Architecture for Wireless Microsensor Networks,” IEEE Trans. Wireless Comm., vol. 1, no. 4, pp. 660-670, Oct. 2002. [8] N. Li, J. Hou, and L. Sha, “Design and Analysis of an MST-Based Topology Control Algorithm,” Proc. IEEE INFOCOM, 2003. [9] M. Cheng, M. Cardei, X. Cheng, L. Wang, Y. Xu, and D. Du, “Topology Control of Ad Hoc Wireless Networks for Energy Efficiency,” IEEE Trans. Computers, vol. 53, no. 12, pp. 1629-1635, Dec. 2004. [10] R. Wattenhofer, L. Li, P. Bahl, and Y. Wang, “Distributed Topology Control for Power Efficient Operation in Multihop Wireless Ad Hoc Networks,” Proc. IEEE INFOCOM '01, Apr. 2001. [11] L. Kirousis, E. Kranakis, D. Krizanc, and A. Pelc, “Power Consumption in Packet Radio Networks,” Theoretical Computer Science, vol. 243, nos. 1-2, pp. 289-305, July 2000. [12] X. Li, G. Calinescu, and P. Wan, “Distributed Construction of Planar Spanner and Routing for Ad Hoc Wireless Networks,” Proc. IEEE INFOCOM, 2002. [13] X. Li, P. Wan, Y. Wang, and O. Frieder, “Sparse Power Efficient Topology for Wireless Networks,” Proc. 35th Ann. Hawaii Int'l Conf. System Sciences (HICSS), 2002. [14] D. Rosenkrantz, R. Stearns, and P. Lewis, “An Analysis of Several Heuristics for the Traveling Salesman Problem,” SIAM J. Computing, vol. 6, no. 3, pp. 563-581, 1977. [15] M. Imase and B.M. Waxman, “Dynamic Steiner Tree Problem,” Siam J. Discrete Math., vol. 4, no. 3, pp. 369-384, 1991. [16] T. Cormen, C. Leiserson, and R. Rivest, Introduction to Algorithms. The MIT Press, 1990. [17] C. Ambuhl, “An Optimal Bound for the MST Algorithm to Compute Energy Efficient Broadcast Trees in Wireless Networks,” Proc. 32nd Int'l Colloquium on Automata, Languages and Programming (ICALP '05), pp. 1139-1150, Nov. 2005. [18] P. Wan, G. Calinescu, X. Li, and O. Frieder, “Minimum-Energy Broadcasting in Static Ad Hoc Wireless Networks,” Wireless Networks, vol. 8, no. 6, pp. 607-617, Nov. 2002. [19] A. Clementi, P. Crescenzi, P. Penna, G. Rossi, and P. Vocca, “On the Complexity of Computing Minimum Energy Consumption Broadcast Subgraph,” Proc. 18th Ann. Symp. Theoretical Aspects of Computer Science (STACS '01), pp. 121-131, June 2001. [20] C. Intanagonwiwat, D. Estrin, R. Govindan, and J. Heidemann, “Impact of Network Density on Data Aggregation in Wireless Sensor Networks,” Proc. 22nd Int'l Conf. Distributed Computing Systems (ICDCS '02), July 2002. [21] P. Gupta and P. Kumar, “Critical Power for Asymptotic Connectivity in Wireless Networks,” Stochastic Analysis, Control, Optimization and Applications: A Volume in Honor of W.H. Fleming, pp. 547-566, Mar. 1998. [22] Transportation Analysis Simulation System (TRANSIMS), http:/transims.tsasa.lanl.gov, 2008. [23] D. Kempe and J. Kleinberg, “Protocols and Impossibility Results for Gossip-Based Communication Mechanisms,” Proc. 43rd Ann.IEEE Symp. Foundations of Computer Science (FOCS '02), Nov. 2002. [24] J. Steele, “Asymptotics for Euclidean Minimal Spanning Trees on Random Points,” Probability Theory and Related Fields, vol. 92, pp.247-258, 1992. [25] F. Avram and D. Bertsimas, “The Minimum Spanning Tree Constant in Geometrical Probability and under the Independent Model: A Unified Approach,” The Annals of Applied Probability, vol. 2, no. 1, pp. 113-130, 1992. [26] O. Johansson, “Simple Distributed $(\Delta + 1)\hbox{-}{\rm coloring}$ of Graphs,” Information Processing Letters, vol. 70, no. 5, pp. 229-232, 1999. [27] R. Motwani and P. Raghavan, Randomized Algorithms. Cambridge Univ. Press, 1995. [28] R. Graham, D. Knuth, and O. Patashnik, Concrete Mathematics: A Foundation for Computer Science, second ed. Addison-Wesley Publishing, 1989. [29] A. Yao, “On Constructing Minimum Spanning Trees in $k \hbox{-}{\rm Dimensional}$ Spaces and Related Problems,” SIAM J. Computing, vol. 11, no. 4, pp. 721-736, 1982. [30] A. Panconesi and A. Srinivasan, “Randomized Distributed Edge Coloring via an Extension of the Chernoff-Hoeffding Bounds,” SIAM J. Computing, vol. 26, pp. 350-368, 1997.