loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Applications of k-Local MST for Topology Control and Broadcasting in Wireless Ad Hoc Networks
December 2004 (vol. 15 no. 12)
pp. 1057-1069
ASCII Text
x 
 
Xiang-Yang Li, Yu Wang, Wen-Zhan Song, "Applications of k-Local MST for Topology Control and Broadcasting in Wireless Ad Hoc Networks," IEEE Transactions on Parallel and Distributed Systems, vol. 15, no. 12, pp. 1057-1069, December, 2004.
 
 
BibTex
x
 
@article{ 10.1109/TPDS.2004.77,
author = {Xiang-Yang Li and Yu Wang and Wen-Zhan Song},
title = {Applications of k-Local MST for Topology Control and Broadcasting in Wireless Ad Hoc Networks},
journal ={IEEE Transactions on Parallel and Distributed Systems},
volume = {15},
number = {12},
issn = {1045-9219},
year = {2004},
pages = {1057-1069},
doi = {http://doi.ieeecomputersociety.org/10.1109/TPDS.2004.77},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - JOUR
JO - IEEE Transactions on Parallel and Distributed Systems
TI - Applications of k-Local MST for Topology Control and Broadcasting in Wireless Ad Hoc Networks
IS - 12
SN - 1045-9219
SP1057
EP1069
EPD - 1057-1069
A1 - Xiang-Yang Li,
A1 - Yu Wang,
A1 - Wen-Zhan Song,
PY - 2004
KW - Localized algorithms
KW - broadcasting
KW - topology control
KW - minimum spanning tree
KW - wireless ad hoc networks.
VL - 15
JA - IEEE Transactions on Parallel and Distributed Systems
ER -
 
Yu Wang, IEEE

Abstract—In this paper, we propose a family of structures, namely, k{\hbox{-}}{\rm{localized}} minimum spanning tree ({\rm{LMST}}_k) for topology control and broadcasting in wireless ad hoc networks. We give an efficient localized method to construct {\rm{LMST}}_k using only O(n) messages under the local-broadcast communication model, i.e., the signal sent by each node will be received by all nodes within the node's transmission range. We also analytically prove that the node degree of the structure {\rm{LMST}}_k is at most 6, {\rm{LMST}}_k is connected and planar and, more importantly, the total edge length of the {\rm{LMST}}_k is within a constant factor of that of the minimum spanning tree when k \ge 2 (called low weighted hereafter). We then propose another low weighted structure, called Incident MST and RNG Graph (IMRG), that can be locally constructed using at most 13n messages under the local broadcast communication model. Test results are corroborated in the simulation study. We study the performance of our structures in terms of the total power consumption for broadcasting, the maximum node power needed to maintain the network connectivity. We theoretically prove that our structures are asymptotically the best possible for broadcasting among all locally constructed structures. Our simulations show that our new structures outperform previous locally constructed structures in terms of broadcasting and power assignment for connectivity.

[1] X.-Y. Li, G. Calinescu, P.-J. Wan, and Y. Wang, “Localized Delaunay Triangulation with Applications in Wireless Ad Hoc Networks,” IEEE Trans. Parallel and Distributed Processing, vol. 14, no. 10, pp. 1035-1047, Oct. 2003.[2] X.-Y. Li, P.-J. Wan, Y. Wang, and O. Frieder, “Sparse Power Efficient Topology for Wireless Networks,” Proc. IEEE Conf. Computer Comm. and Network, 2001.[3] R. Ramanathan and R. Rosales-Hain, “Topology Control of Multihop Wireless Networks Using Transmit Power Adjustment,” Proc. IEEE INFOCOM, 2000.[4] K. Alzoubi, X.-Y. Li, Y. Wang, P.-J. Wan, and O. Frieder, “Geometric Spanners for Wireless Ad Hoc Networks,” IEEE Trans. Parallel and Distributed Processing, vol. 14, no. 4, pp. 408-421, Apr. 2003.[5] Y. Wang, X.-Y. Li, and O. Frieder, “Distributed Spanner with Bounded Degree for Wireless Networks,” Int'l J. Foundations of Computer Science, vol. 14, no. 2, pp. 183-200, 2003.[6] P. Bose, P. Morin, I. Stojmenovic, and J. Urrutia, “Routing with Guaranteed Delivery in Ad Hoc Wireless Networks,” ACM/Kluwer Wireless Networks, vol. 7, no. 6, pp. 609-616, 2001, Proc. Third Int'l Workshop Discrete Algorithms and Methods for Mobile Computing and Communications, pp. 48-55, 1999.[7] Y. Wang and X.-Y. Li, “Localized Construction of Bounded Degree Planar Spanner for Wireless Networks,” Proc. ACM DialM-POMC Joint Workshop Foundations of Mobile Computing, 2003.[8] N. Li, J.C. Hou, and L. Sha, “Design and Analysis of a MST-Based Topology Control Algorithm,” Proc. IEEE INFOCOM, 2003.[9] A. Clementi, P. Penna, and R. Silvestri, “On the Power Assignment Problem in Radio Networks,” Proc. Electronic Colloquium on Computational Complexity, 2001.[10] J. Wieselthier, G. Nguyen, and A. Ephremides, “On the Construction of Energy-Efficient Broadcast and Multicast Trees in Wireless Networks,” Proc. IEEE INFOCOM, pp. 586-594, 2000.[11] P.-J. Wan, G. Calinescu, X.-Y. Li, and O. Frieder, “Minimum-Energy Broadcast Routing in Static Ad Hoc Wireless Networks,” ACM Wireless Networks, 2002.[12] M. Faloutsos and M. Molle, “Creating Optimal Distributed Algorithms for Minimum Spanning Trees,” Technical Report CSRI-327, 1995.[13] M. Seddigh, J. Solano Gonzalez, and I. Stojmenovic, “RNG and Internal Node Based Broadcasting Algorithms for Wireless One-to-One Networks,” ACM Mobile Computing and Comm. Rev., vol. 5, no. 7, pp. 37-44, 2002.[14] X.-Y. Li, “Approximate MST for UDG Locally,” Proc. Computing and Combinatorics Ann. Int'l Conf., 2003.[15] M. Bahramgiri, M. Taghi Hajiaghayi, and V.S. Mirrokni, “Fault-Tolerant and 3-Dimensional Distributed Topology Control Algorithms in Wireless Multi-Hop Networks,” Proc. 11th Ann. Int'l Conf. Computer Comm. and Networks (ICCCN), pp. 392-397, 2002.[16] M. Taghi Hajiaghayi, N. Immorlica, V.S. Mirrokni, “Power Optimization in Topology Control Algorithms for Wireless Multi-Hop Networks,” Proc. ACM MobiCom, 2003.[17] L. Hu, “Topology Control for Multihop Packet Radio Networks,” IEEE Trans. Comm., vol. 41, no. 10, 1993.[18] L. Li, J.Y. Halpern, P. Bahl, Y.-M. Wang, and R. Wattenhofer, “Analysis of a Cone-Based Distributed Topology Control Algorithms for Wireless Multi-Hop Networks,” Proc. ACM Symp. Principle of Distributed Computing (PODC), 2001.[19] L. Lloyd, R. Liu, M.V. Marathe, R. Ramanathan, and S.S. Ravi, “Algorithmic Aspects of Topology Control Problems for Ad Hoc Networks,” Proc. ACM MOBIHOC, 2002.[20] R. Wattenhofer, L. Li, P. Bahl, and Y.-M. Wang, “Distributed Topology Control for Wireless Multihop Ad-Hoc Networks,” Proc. IEEE INFOCOM, 2001.[21] R. Rajaraman, “Topology Control and Routing in Ad Hoc Networks: A Survey,” SIGACT News, vol. 33, pp. 60-73, 2002.[22] G.T. Toussaint, “The Relative Neighborhood Graph of a Finite Planar Set,” Pattern Recognition, vol. 12, no. 4, pp. 261-268, 1980.[23] K.R. Gabriel and R.R. Sokal, “A New Statistical Approach to Geographic Variation Analysis,” Systematic Zoology, vol. 18, pp. 259-278, 1969.[24] T. Lukovszki, “New Results on Geometric Spanners and Their Applications,” PhD thesis, Univ. of Paderborn, 1999.[25] X.-Y. Li, P.-J. Wan, Y. Wang, and O. Frieder, “Sparse Power Efficient Topology for Wireless Networks,” Proc. IEEE Hawaii Int'l Conf. System Sciences (HICSS), 2002.[26] M. Sanchez, P. Manzoni, and Z. Haas, “Determination of Critical Transmission Range in Ad-Hoc Networks,” Multiaccess, Mobility and Teletraffic for Wireless Comm. (MMT), 1999.[27] L. Kirousis, E. Kranakis, D. Krizanc, and A. Pelc, “Power Consumption in Packet Radio Networks,” Proc. Symp. Theoretical Aspects of Computer Science (STACS), 1997.[28] A. Clementi, P. Penna, and R. Silvestri, “The Power Range Assignment Problem in Radio Networks on the Plane,” Proc. 17th Symp. Theoretical Aspects of Computer Science (STACS '00), pp. 651-660, 2000.[29] A. Clementi, P. Penna, and R. Silvestri, “Hardness Results for the Power Range Assignment Problem in Packet Radio Networks,” Proc. Second Int'l Workshop Approximation Algorithms for Combinatorial Optimization Problems (RANDOM/APPROX '99), pp. 197-208, 1999.[30] G. Călinescu, I. Mandoiu, and A. Zelikovsky, “Symmetric Connectivity with Minimum Power Consumption in Radio Networks,” Proc. IFIP-TCS Int'l Conf. Theoretical Computer Science, 2002.[31] A. Clementi, P. Crescenzi, P. Penna, G. Rossi, and P. Vocca, “On the Complexity of Computing Minimum Energy Consumption Broadcast Subgraphs,” Proc. 18th Symp. Theoretical Aspects of Computer Science, pp. 121-131, 2001.[32] G. Călinescu, “Computing 2-Hop Neighborhoods in Ad Hoc Wireless Networks,” Proc. AdHocNow, 2003.[33] K. Alzoubi, P.-J. Wan, and O. Frieder, “Message-Optimal Connected-Dominating-Set Construction for Routing in Mobile Ad Hoc Networks,” Proc. Third ACM MobiHoc, 2002.[34] X.-Y. Li, Y. Wang, P.-J. Wang, and C.-W. Yi, “Fault Tolerant Deployment and Topology Constrol for Wireless Ad Hoc Networks,” Proc. ACM MobiHoc, 2003.[35] X.-Y. Li and Y. Wang, “Efficient Construction of Bounded Degree Planar Spanner,” Proc. Int'l Conf. Computing and Combinatorics (COCOON), 2003.

Index Terms:
Localized algorithms, broadcasting, topology control, minimum spanning tree, wireless ad hoc networks.
Citation:
Xiang-Yang Li, Yu Wang, Wen-Zhan Song, "Applications of k-Local MST for Topology Control and Broadcasting in Wireless Ad Hoc Networks," IEEE Transactions on Parallel and Distributed Systems, vol. 15, no. 12, pp. 1057-1069, Dec. 2004, doi:10.1109/TPDS.2004.77
Usage of this product signifies your acceptance of the Terms of Use.