Yu Wang
WeiZhao Wang
ABSTRACT
Backbone has been used extensively in various aspects (e.g., routing, route maintenance, broadcast, scheduling) for wireless networks. Previous methods are mostly designed to minimize the backbone size. 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 a large cost. We then propose an efficient distributed method to construct a weighted sparse backbone with low cost. 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 or the network maximum node degree is bounded. We also show that with a small modification the constructed 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 3 (or 4) times of the least cost (or hop) path in the original communication graph. As a side product, we give an efficient overlay based multicast structure whose total cost is no more than 10 times of the minimum when the network is modeled by UDG. Our theoretical results are corroborated by our simulation studies.
- Alzoubi, K., Li, X.-Y., Wang, Y., Wan, P.-J., and Frieder, O. Geometric spanners for wireless ad hoc networks. IEEE Trans. on Paral. and Distr. Processing 14, 4 (2003), 408--421. Google Scholar
Digital Library
- Alzoubi, K. M., Wan, P.-J., and Frieder, O. Message-optimal connected dominating sets in mobile ad hoc networks In Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing (2002), ACM Press, pp. 157--164. Google ScholarDigital Library
- Alzoubi, K. M., Wan, P.-J., and Frieder, O. New distributed algorithm for connected dominating set in wireless ad hoc networks. In HICSS, Hawaii (2002). Google ScholarDigital Library
- Baker, D., Ephremides, A., and Flynn, J. A. The Design and Simulation of a Mobile Radio Network with Distributed Control. IEEE Journal on Selected Areas in Comm. (1984), 226--237.Google ScholarDigital Library
- Baker, D. J., and Ephremides, A. The Architectural Organization of a Mobile Radio Network via a Distributed Algorithm. IEEE Transactions on Communications COM-29, 11 (November 1981), 1694--1701.Google ScholarCross Ref
- Bao, L., and Garcia-Luna-Aceves, J. J. Topology management in ad hoc networks. In Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing (2003), ACM Press, pp. 129--140. Google ScholarDigital Library
- Basagni, S. Distributed clustering for ad hoc networks. In Proceedings of the IEEE Intern. Symp. on Parallel Architectures, Algorithms, and Networks (1999), pp. 310--315. Google ScholarDigital Library
- Basagni, S. Finding a maximal weighted independent set in wireless networks. Telecommunication Systems, Special Issue on Mobile Computing and Wireless Networks 18, 1/3 (September 2001), 155--168.Google Scholar
- Basagni, S., Mastrogiovanni, M., and Petrioli, C. A performance comparison of protocols for clustering and backbone formation in large scale ad hoc networks. In 1st IEEE International Conference on Mobile Ad-hoc and Sensor Systems (MASS) (2004).Google ScholarCross Ref
- Bettstetter, C., and Krausser, R. Scenario-based stability anlysis of the distributed mobility-adaptive clustering (dmac) algorithm. In Proceedings of the 2nd ACM international symposium on Mobile ad hoc networking & computing (2001), ACM Press, pp. 232--241. Google ScholarDigital Library
- Cǎlinescu, G. Computing 2-hop neighborhoods in ad hoc wireless networks. In AdHoc-Now 03 (2003).Google Scholar
- Chatterjee, M., Das, S., and Turgut, D. WCA: A weighted clustering algorithm for mobile ad hoc networks. Journal of Cluster Computing 5, 2 (2002), 193--204. Google ScholarDigital Library
- Chen, G., Nocetti, F., Gonzalez, J., and Stojmenovic, I. Connectivity-based k-Hop clustering in wireless networks. In Proceedings of the 35th HICSS-Volume 7 (2002), IEEE Computer Society, p. 188.3. Google ScholarDigital Library
- Chvátal, V. A greedy heuristic for the set-covering problem. Mathematics of Operations Research 4, 3 (1979), 233--235.Google ScholarDigital Library
- Das, B., and Bharghavan, V. Routing in ad-hoc networks using minimum connected dominating sets. In 1997 IEEE Intern. Conference on on Communications (ICC'97) (1997), vol. 1, pp. 376--380.Google ScholarCross Ref
- Das, B., Sivakumar, R., and Bharghavan, V. Routing in ad hoc networks using a spine. In IEEE Sixth International Conference on Computer Communications and Networks (ICCCN97) (1997). Google ScholarDigital Library
- Gao, J., Guibas, L. J., Hershburger, J., Zhang, L., and Zhu, A. Discrete mobile centers. In Proceedings of the 17th ACM Symposium on Computational Geometry (SoCG 01) (2001), pp. 188--196. Google ScholarDigital Library
- Gerla, M., and Tsai, J. T.-C. Multicluster, mobile, multimedia radio network. Wireless Networks 1, 3 (1995), 255--265. Google ScholarDigital Library
- Guha, S., and Khuller, S. Approximation algorithms for connected dominating sets. Algorithmica 20, 4 (1998), 374--387. Google ScholarDigital Library
- Guha, S., and Khuller, S. Improved methods for approximating node weighted steiner trees and connected dominating sets. Information and Computation 150, 1 (1999), 57--74. Google ScholarDigital Library
- Heinzelman, W. R., Chandrakasan, A., and Balakrishnan, H. Energy-efficient communication protocol for wireless microsensor networks. In Proceedings of the 33rd HICSS-Volume 8 (2000), IEEE Computer Society, p. 8020. Google ScholarDigital Library
- Hunt, H. B., Marathe, M. V., Radhakrishnan, V., Ravi, S. S., Rosenkrantz, D. J., and Stearns, R. E. NC-Approximation Schemes for NP- and PSPACE -Hard Problems for Geometric Graphs. Journal of Algorithms 26, 2, (1998), 238--274. Google ScholarDigital Library
- Kachirski, O., and Guha, R. Intrusion detection using mobile agents in wireless ad hoc networks. In Proceedings of IEEE Workshop on Knowledge Media Networking/ (2002). Google ScholarDigital Library
- Kozat, U. C., Kondylis, G., Ryu, B., and Marina, M. Virtual dynamic backbone for mobile ad hoc networks. In Proceedings of IEEE ICC 2001 (2001).Google ScholarCross Ref
- Kuhn, F., Moscibroda, T., and Wattenhofer, R. What cannot be computed locally. In Proceedings of the 23rd annual symposium on Principles of distributed computing (2004), ACM Press, pp. 300--309. Google ScholarDigital Library
- Kuhn, F., Moscibroda, T., and Wattenhofer, R. Initializing newly deployed ad hoc and sensor networks. In Proceedings of the 10th annual international conference on Mobile computing and networking (MobiCom) (2004), ACM Press, pp. 260--274. Google ScholarDigital Library
- Kuhn, F., and Wattenhofer, R. Constant-time distributed dominating set approximation. In Proceedings of the 22nd annual symposium on Principles of distributed computing (2003), ACM Press, pp. 25--32. Google ScholarDigital Library
- Li, X.-Y., and Wang, Y. Simple heuristics and PTASs for intersection graphs in wireless ad hoc networks. In ACM 6th International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications (DIALM2002) (2002). Google ScholarDigital Library
- Li, X.-Y., Wang, Y., Wan, P.-J., Song, W.-Z., and Frieder, O. Localized low weight graph and its applications in wireless ad hoc networks. In IEEE INFOCOM 2004 (2004).Google Scholar
- Liang, B., and Haas, Z. J. Virtual backbone generation and maintenance in ad hoc network mobility management. In Proc. of 19th IEEE INFOCOM (2000), vol. 3, pp. 1293--1302.Google ScholarCross Ref
- Lin, C. R., and Gerla, M. Adaptive clustering for mobile wireless networks. IEEE Journal of Selected Areas in Communications 15, 7 (1997), 1265--1275. Google ScholarDigital Library
- Liu, H., and Gupta, R. Selective backbone construction for topology control. In 1st IEEE International Conference on Mobile Ad-hoc and Sensor Systems (MASS) (2004).Google Scholar
- Liu, Z., Joy, T., and Thompson, R. A dynamic trust model for mobile ad hoc networks. In Proceedings of the 10th IEEE International Workshop on Future Trends in Distributed Computing Systems (2004). Google ScholarDigital Library
- Min, M., Wang, F., Du, D.-Z., and Pardalos, P. M. A reliable virtual backbone scheme in mobile ad-hoc networks. In 1st IEEE International Conference on Mobile Ad-hoc and Sensor Systems (MASS) (2004).Google Scholar
- Sivakumar, R., Das, B., and Bharghavan, V. The clade vertebrata: spines and routing in ad hoc networks. In IEEE Symposium on Computers and Communications (1998). Google ScholarDigital Library
- Smaragdakis, G., Matta, I., and Bestavros, A. SEP: A stable election protocol for clustered heterogeneous wireless sensor networks. In Second International Workshop on Sensor and Actor Network Protocols and Applications (2004).Google Scholar
- Stojmenovic, I., Seddigh, M., and Zunic, J. Dominating sets and neighbor elimination based broadcasting algorithms in wireless networks. IEEE Transactions on Parallel and Distributed Systems 13, 1 (2002), 14--25. Google ScholarDigital Library
- Turgut, D., Das, S., Elmasri, R., and Turgut, B. Optimizing clustering algorithm in mobile ad hoc networks using genetic algorithmic approach. In IEEE GLOBECOM 2002 (2002).Google ScholarCross Ref
- Wan, P.-J., Alzoubi, K. M., and Frieder, O. Distributed construction of connected dominating set in wireless ad hoc networks. In INFOCOM (2002).Google Scholar
- Wan, P.-J., Li, X.-Y., and Song, W.-Z. Theoretically good distributed OVSF-CDMA code assignment in wireless ad hoc networks, 2004. Submitted for publication.Google Scholar
- Wu, J., and Li, H. A dominating-set-based routing scheme in ad hoc wireless networks. Telecommunication Systems Journal 3 (2001), 63--84.Google Scholar
- Zheng, R., He, G., Gupta, I., and Sha, L. Time idexing in sensor networks. In 1st IEEE International Conference on Mobile Ad-hoc and Sensor Systems (MASS) (2004).Google Scholar
Index Terms
- Distributed low-cost backbone formation for wireless ad hoc networks
Recommendations
Efficient Distributed Low-Cost Backbone Formation for Wireless Networks
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 ...
Geometric Spanners for Wireless Ad Hoc Networks
We propose a new geometric spanner for static wireless ad hoc networks, which can be constructed efficiently in a localized manner. It integrates the connected dominating set and the local Delaunay graph to form a backbone of the wireless network. ...
Zone-based virtual backbone formation in wireless ad hoc networks
Efficient protocol for clustering and backbone formation is one of the most important issues in wireless ad hoc networks. Connected dominating set (CDS) formation is a promising approach for constructing virtual backbone. However, finding the minimum ...
Comments