Efficient Distributed Algorithms for Topology Control Problem with Shortest Path Constraints

Discrete Mathematics, Algorithms and Applications

Volumn 1, Issue 4, 2009, Pages 437-461

  Willson, James K ^a   Gao, Xiaofeng ^a   Qu, Zhonghua ^a   Zhu, Y I ^a   Li, Yingshu ^b   Wu, Weili ^a  

^a The University of Texas at Dallas   (United States)

^b GEORGIA STATE UNIVERSITY   (United States)

Author keywords

Connected dominating set; distributed algorithm; shortest path

Indexed keywords

EID: 79956216545     PISSN: 17938309     EISSN: 17938317     Source Type: Journal    
DOI: 10.1142/S1793830909000348     Document Type: Article

References (33)

1. K. M. Alzoubi, P. J. Wan and O. Frieder, New distributed algorithm for connected dominating set in wireless ad hoc networks, in Proc. 35th Hawaii Int. Conf. System Sciences, Big Island, Hawaii (2002).
2. K. M. Alzoubi, P. J. Wang and O. Frieder, Distributed heuristics for connected dominating sets in wireless ad hoc networks, J. Commun. Netw. 4 (2002) 22-29.
3. C. Ambühl, T. Erlebach, M. Mihal'ak and M. Nunkesser, Constant-factor approximation for minimum weight (connected) dominating sets in unit disk graphs, in Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques, in Proc. 9th Int. Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX 2006) and 10th Int. Workshop on Randomization and Computation (RANDOM 2006) (Springer, Berlin/Heidelberg, 2006), pp. 3-14.
4. B. S. Baker, Approximation algorithms for NP-complete problems on planar graphs, J. ACM 41 (1994) 153-180.
5. Extended abstract published in the proceedings of FOCS'83 (1983), pp. 265-273.
6. M. Burkhart, P. V. Rickenbach, R. Wattenhofer and A. Zollinger, Does topology control reduce interference Proc. 5th ACM Int. Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc'04) (2004), pp. 9-19.
7. M. Cadei, X. Cheng and D. Z. Du, Connected domination in ad hoc wireless networks, in Proc. 6th Int. Conf. Computer Science and Informatics (2002).
8. X. Cheng, X. Huang, D. Li, W. Wu and D. Z. Du, Polynomial-time approximation scheme for minimum connected dominating set in ad hoc wireless networks, Networks 42 (2003) 202-208.
9. B. N. Clark, C. J. Colbourn and D. S. Johnson, Unit disk graphs, Discrete Math. 86 (1990) 165-177.
10. U. Feige, A threshold of lnn for approximating set cover, Proc. 28th ACM Symposium on Theory of Computing, ACM (1996) 314-318.
11. X. F. Gao, Y. C. Huang, Z. Zhang and W. L. Wu, (6+)-approximation for minimum weight dominating set in unit disk graphs, The 14th Annual International Computing and Combinatorics Conference (COCOON 2008), Dalian, China, June 27-29 (2008).
12. B. Gao, Y. H. Yang and H. Y. Ma, An efficient approximation scheme for minimum connected dominating set in wireless ad hoc networks, IEEE Vehicular Technology Conference No. 60, Los Angeles CA (2004).
13. M. R. Garey and D. S. Johnson, Computer and Intractablity: A Guide to the Theory of NP-Completeness (Fressman, San Francisco, 1978).
14. B. Han and W. J. Jia, Design and analysis of connected dominating set formation for topology control in wireless ad hoc networks, Proc. 14th International Conference on Computer Communications and Networks (ICCCN 2005) (2005), pp. 7-12.
15. B. Han, H. H. Fu, L. D. Lin and W. J. Jia, Efficient construction of connected dominating set in wireless ad hoc networks, Proc. First IEEE International Conference on Mobile Ad Hoc and Sensor Systems, Florida (2004).
16. H. B. Hunt III, M. V. Marathe, V. Radhakrishnan, S. S. Ravi, D. J. Rosenkrantz and R. E. Stearns, NC-approximation schemes for NP- A nd PSPACE-hard problems for geometric graphs, J. Algorithms 26 (1998) 238-274.
17. B. H. Kim, J. K. Ahn, H. S. Kim, D. W. Roh, D. Y. Seo and S. H. Won, Packet transmission acknowledgement in wireless communication system, http://www.freepatentsonline.com/7372831.html.
18. D. Y. Kim, W. Wang, C. C. Ma, N. Sohaee and W. L. Wu, A new clustering scheme for underwater acoustic sensor networks, submitted to IEEE Transactions on Mobile Computing (IEEE TMC), 2008.
19. K. Jain, J. Padhye, V. N. Padmanabhan and L. L. Liu, Impact of interference on multi-hop wireless network performance, Wire. Netw. 11 (2005) 471-487.
20. O. Johansson, Simple distrbuted +1-coloring of graphs, Information Processing Letters 70 (1999) 229-232.
21. Y. S. Li, M. T. Thai, F. Wang, C. W. Yi, P. J. Wan and D. Z. Du, On greedy construction of connected dominating sets in wireless networks, Wire. Commun. Mobile Comput. 5 (2005) 927-932.
22. D. Lichtenstein, Planar formulae and their uses, SIAM J. Comput. 11 (1982) 329-343.
23. C. Lund and M. Yannakakis, On the hardness of approximating minimization problems, J. ACM 41 (1994) 960-981.
24. M. V. Marathe, H. Breu, H. B. Hunt III, S. S. Ravi and D. J. Rosenkrantz, Simple heuristics for unit disk graphs, Netw. 25 (1995) 59-68.
25. M. Min, H.W. Du, X. H. Jia, C. X. Huang, S. C. H. Huang and W. L. Wu, Improving construction for connected dominating set with steiner tree in wireless sensor networks, J. Global Optim. 35 (2006) 111-119.
26. How Does Wireless InternetWork, http://www.superpages.com/supertips/how-doeswireless-internet-work.html.
27. N. B. Salem and J. P. Hubaux, A fair scheduling for wireless mesh networks, The 1st IEEE Workshop on Wireless Mesh Networks, Held in conjunction with SECON'05, Santa Clara (2005).
28. M. T. Thai and D. Z. Du, Connected dominating sets in disk graphs with bidirectional links, IEEE Commun. Lett. 10 (2006) 138-140.
29. M. T. Thai, F. Wang, D. Liu, S. W. Zhu and D. Z. Du, Connected dominating sets in wireless networks with different transmission ranges, IEEE Trans. Mobile Comput. 6 (2007) 721-730.
30. P. J. Wan, K. M. Alzoubi and O. Frieder, Distributed construction of connected dominating set in wireless ad hoc networks, Proc. Third ACM Internet, Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications (1999), pp. 7-14.
31. Y. Wang and X. Y. Li, Localized construction of bounded degree and planar spanner for wireless ad hoc networks, Mobile Netw. Appl. 11 (2006) 161-175.
32. J. Wu and H. Li, On calculating connected dominating set for efficient routing in ad hoc wireless networks, Proc. 3rd ACM Int. Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications (1999), pp. 7-14.
33. Z. Zhang, X. F. Gao, W. L.Wu and D. Z. Du, PTAS for minimum connected dominating set in unit ball graph, The 3rd International Conference on Wireless Algorithms, Systems and Applications (WASA 2008) Oct. 26-28 (2008).