This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Efficient Distributed Low-Cost Backbone Formation for Wireless Networks
July 2006 (vol. 17 no. 7)
pp. 681-693
Yu Wang, IEEE

Abstract—Backbone has been used extensively in various aspects (e.g., routing, route maintenance, broadcast, scheduling) for wireless ad hoc or sensor networks recently. Previous methods are mostly designed to minimize the size of the backbone. However, in many applications, it is desirable to construct a backbone with small cost when each wireless node has a cost of being in the backbone. In this paper, we first show that previous methods specifically designed to minimize the backbone size may produce a backbone with large cost. Then, an efficient distributed method to construct a weighted backbone with low cost is proposed. We prove that the total cost of the constructed backbone is within a small constant factor of the optimum for homogeneous networks when either the nodes' costs are smooth (i.e., the maximum ratio of costs of adjacent nodes is bounded) or the network maximum node degree is bounded. We also show that, with a small modification, the backbone is efficient for unicast: The total cost (or hop) of the least cost (or hop) path connecting any two nodes using backbone is no more than three (or four) times the least cost (or hop) path in the original communication graph. Our theoretical results are corroborated by our simulation studies. Finally, we discuss several possible ad hoc network applications of our proposed backbone formation algorithms.

[1] J. Wu and H. Li, “A Dominating-Set-Based Routing Scheme in Ad Hoc Wireless Networks,” Telecomm. Systems J., vol. 3, pp. 63-84, 2001.
[2] J. Wu and H. Li, “On Calculating Connected Dominating Set for Efficient Routing in Ad Hoc Wireless Networks,” Proc. Third Int'l Workshop Discrete Algorithms and Methods for Mobile Computing and Comm., 1999.
[3] B. Das and V. Bharghavan, “Routing in Ad-Hoc Networks Using Minimum Connected Dominating Sets,” Proc. IEEE Int'l Conf. Comm., 1997.
[4] K.M. Alzoubi, P.-J. Wan, and O. Frieder, “New Distributed Algorithm for Connected Dominating Set in Wireless Ad Hoc Networks,” Proc. IEEE Hawaii Int'l Conf. System Sciences, 2002.
[5] D.J. Baker and A. Ephremides, “The Architectural Organization of a Mobile Radio Network via a Distributed Algorithm,” IEEE Trans. Comm., vol. 29, no. 11, pp. 1694-1701, Nov. 1981.
[6] D.J. Baker, A. Ephremides, and J.A. Flynn, “The Design and Simulation of a Mobile Radio Network with Distributed Control,” IEEE J. Selected Areas in Comm., vol. 2, pp. 226-237, 1984.
[7] F. Dai and J. Wu, “An Extended Localized Algorithm for Connected Dominating Set Formation in Ad Hoc Wireless Networks,” IEEE Trans. Parallel and Distributed Systems, vol. 15, no. 10, pp. 908-920, Oct. 2004.
[8] B. Chen, K. Jamieson, H. Balakrishnan, and R. Morris, “Span: An Energy-Efficient Coordination Algorithm for Topology Maintenance in Ad Hoc Wireless Networks,” Wireless Network, vol. 8, no. 5, pp. 481-494, 2002.
[9] S. Basagni, “Finding a Maximal Weighted Independent Set in Wireless Networks,” Telecomm. Systems, vol. 18, nos. 1-3, pp. 155-168, Sept. 2001.
[10] M. Chatterjee, S.K. Das, and D. Turgut, “WCA: A Weighted Clustering Algorithm for Mobile Ad Hoc Networks,” J. Cluster Computing, vol. 5, no. 2, pp. 193-204, 2002.
[11] C. Bettstetter and R. Krausser, “Scenario-Based Stability Analysis of the Distributed Mobility-Adaptive Clustering (DMAC) Algorithm,” Proc. Second ACM Int'l Symp. Mobile Ad Hoc Networking and Computing, 2001.
[12] W.R. Heinzelman, A. Chandrakasan, and H. Balakrishnan, “Energy-Efficient Communication Protocol for Wireless Microsensor Networks,” Proc. 33rd Hawaii Int'l Conf. System Sciences, 2000.
[13] U.C. Kozat, G. Kondylis, B. Ryu, and M. Marina, “Virtual Dynamic Backbone for Mobile Ad Hoc Networks,” Proc. IEEE Int'l Conf. Comm., 2001.
[14] G. Smaragdakis, I. Matta, and A. Bestavros, “SEP: A Stable Election Protocol for Clustered Heterogeneous Wireless Sensor Networks,” Proc. Second Int'l Workshop Sensor and Actor Network Protocols and Applications, 2004.
[15] G. Chen, F. Nocetti, J. Gonzalez, and I. Stojmenovic, “Connectivity-Based k-Hop Clustering in Wireless Networks,” Proc. 35th Ann. Hawaii Int'l Conf. System Sciences, 2002.
[16] M. Min, F. Wang, D.-Z. Du, and P.M. Pardalos, “A Reliable Virtual Backbone Scheme in Mobile Ad-Hoc Networks,” Proc. First IEEE Int'l Conf. Mobile Ad-Hoc and Sensor Systems, 2004.
[17] H. Liu and R. Gupta, “Selective Backbone Construction for Topology Control,” Proc. First IEEE Int'l Conf. Mobile Ad-Hoc and Sensor Systems, 2004.
[18] L. Bao and J.J. Garcia-Luna-Aceves, “Topology Management in Ad Hoc Networks,” Proc. Fourth ACM Int'l Symp. Mobile Ad Hoc Networking and Computing, 2003.
[19] 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.
[20] X.-Y. Li and P.-J. Wan, “Theoretically Good Distributed CDMA/OVSF Code Assignment for Wireless Ad Hoc Networks,” Proc. 11th Int'l Computing and Combinatorics Conf. (COCOON), 2005.
[21] M. Gerla and J.T.-C. Tsai, “Multicluster, Mobile, Multimedia Radio Network,” Wireless Networks, vol. 1, no. 3, pp. 255-265, 1995.
[22] C.R. Lin and M. Gerla, “Adaptive Clustering for Mobile Wireless Networks,” IEEE J. Selected Areas in Comm., vol. 15, no. 7, pp. 1265-1275, Sept. 1997.
[23] K.M. Alzoubi, P.-J. Wan, and O. Frieder, “Message-Optimal Connected Dominating Sets in Mobile Ad Hoc Networks,” Proc. Third ACM Int'l Symp. Mobile Ad Hoc Networking and Computing, 2002.
[24] M.V. Marathe, H. Breu, H.B. HuntIII, S.S. Ravi, and D.J. Rosenkrantz, “Simple Heuristics for Unit Disk Graphs,” Networks, vol. 25, pp. 59-68, 1995.
[25] F. Kuhn and R. Wattenhofer, “Constant-Time Distributed Dominating Set Approximation,” Proc. 22nd ACM Symp. Principles of Distributed Computing, 2003.
[26] F. Kuhn, T. Moscibroda, and R. Wattenhofer, “What Cannot Be Computed Locally!” Proc. 23rd ACM Symp. Principles of Distributed Computing, 2004.
[27] S. Basagni, I. Chlamtac, and A. Farago, “A Generalized Clustering Algorithm for Peer-to-Peer Networks,” Proc. Workshop Algorithmic Aspects of Comm., 1997.
[28] X.-Y. Li and Y. Wang, “Simple Heuristics and PTASs for Intersection Graphs in Wireless Ad Hoc Networks,” Proc. ACM Sixth Int'l Workshop Discrete Algorithms and Methods for Mobile Computing and Comm. (DIALM), 2002.
[29] S. Guha and S. Khuller, “Approximation Algorithms for Connected Dominating Sets,” Algorithmica, vol. 20, no. 4, pp. 374-387, 1998.
[30] S. Guha and S. Khuller, “Improved Methods for Approximating Node Weighted Steiner Trees and Connected Dominating Sets,” Information and Computation, vol. 150, no. 1, pp. 57-74, 1999.
[31] H.B. Hunt, M.V. Marathe, V. Radhakrishnan, S.S. Ravi, D.J. Rosenkrantz, and R.E. Stearns, “NC-Approximation Schemes for NP- and PSPACE-Hard Problems for Geometric Graphs,” J. Algorithms, vol. 26, no. 2, pp. 238-274, 1998.
[32] V. Chvátal, “A Greedy Heuristic for the Set-Covering Problem,” Math. Operations Research, vol. 4, no. 3, pp. 233-235, 1979.
[33] G. Călinescu, “Computing 2-Hop Neighborhoods in Ad Hoc Wireless Networks,” Proc. Int'l Conf. Ad-Hoc Networks and Wireless (AdHoc-Now), 2003.
[34] X.-Y. Li, Y. Wang, and W.-Z. Song, “Applications of $k$ -Local MST for Topology Control and Broadcasting in Wireless Ad Hoc Networks,” IEEE Trans. Parallel and Distributed Processing, vol. 15, no. 12, pp. 1057-1069, Dec. 2004.
[35] Z. Liu, T. Joy, and R. Thompson, “A Dynamic Trust Model for Mobile Ad Hoc Networks,” Proc. 10th IEEE Int'l Workshop Future Trends in Distributed Computing Systems, 2004.
[36] R. Zheng, G. He, I. Gupta, and L. Sha, “Time Indexing in Sensor Networks,” Proc. First IEEE Int'l Conf. Mobile Ad-Hoc and Sensor Systems, 2004.
[37] O. Kachirski and R. Guha, “Intrusion Detection Using Mobile Agents in Wireless Ad Hoc Networks,” Proc. IEEE Workshop Knowledge Media Networking, 2002.

Index Terms:
Connected dominating set, clustering, distributed algorithm, wireless ad hoc networks.
Citation:
Yu Wang, Weizhao Wang, Xiang-Yang Li, "Efficient Distributed Low-Cost Backbone Formation for Wireless Networks," IEEE Transactions on Parallel and Distributed Systems, vol. 17, no. 7, pp. 681-693, July 2006, doi:10.1109/TPDS.2006.86
Usage of this product signifies your acceptance of the Terms of Use.