A Polynomial-Time Approximation Scheme for the Minimum-Connected Dominating Set in Ad Hoc Wireless Networks

Networks

Volumn 42, Issue 4, 2003, Pages 202-208

  Cheng, Xiuzhen ^a   Huang, Xiao ^b   Li, Deying ^c   Wu, Weili ^d   Du, Ding Zhu ^e  

^a George Washington University   (United States)

^b 3M COMPANY   (United States)

^c CITY UNIVERSITY OF HONG KONG   (Hong Kong)

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

^e University of Minnesota   (United States)

Author keywords

Connected dominating set; Partition; Polynomial time approximation scheme; Unit disk graph

Indexed keywords

CONNECTED DOMINATING SET; DYNAMIC TOPOLOGY; PARTITION; POLYNOMIAL-TIME APPROXIMATION SCHEME; RESOURCE LIMITATION; UNIT DISK GRAPH;

BANDWIDTH; DATA ACQUISITION; ENVIRONMENTAL IMPACT; NETWORK PROTOCOLS; OPTIMIZATION; PROBLEM SOLVING; TELECOMMUNICATION LINKS; URBAN PLANNING;

WIRELESS TELECOMMUNICATION SYSTEMS;

EID: 2142846003     PISSN: 00283045     EISSN: None     Source Type: Journal    
DOI: 10.1002/net.10097     Document Type: Article

References (16)

1. K.M. Alzoubi, P.-J. Wan, and O. Frieder, New distributed algorithm for connected dominating set in wireless ad hoc networks, Proc HICSS, Hawaii, 2002, pp. 3881-3887.
2. A.D. Amis and R. Prakash, Load-balancing clusters in wireless ad hoc networks, Proc 3rd IEEE Symp on Application-Specific Systems and Software Engineering Technology, 2000, pp. 25-32.
3. X. Cheng and D.-Z. Du, Virtual backbone-based routing in ad hoc wireless networks, Technical report 02-002, Department of Computer Science and Engineering, University of Minnesota.
4. B.N. Clark, C.J. Colbourn, and D.S. Johnson, Unit disk graphs, Discr Math 86 (1990), 165-177.
5. T. Clausen, P. Jacquet, A. Laouiti, P. Minet, P. Muhlethaler, and L. Viennot, Optimized link state routing protocol, IETF Internet Draft, draft-ietf-manet-olsr-05.txt, October 2001.
6. B. Das and V. Bharghavan, Routing in ad hoc networks using minimum connected dominating sets, ICC '97, Montreal, Canada, June 1997, pp. 376-380.
7. S. Guha and S. Khuller, Approximation algorithms for connected dominating sets, Algorithmica 20 (1998), 374-387.
8. P. Johansson, T. Larsson, N. Hedman, B. Mielczarek, and M. Degermark, Scenario-based performance analysis of routing protocols for mobile ad hoc networks, Proc IEEE MOBICOM, Seattle, August 1999, pp. 195-206.
9. D.B. Johnson and D.A. Maltz, "Dynamic source routing in ad hoc wireless networks," Mobile computing, Tomasz Imielinski and Hank Korth (Editors), Kluwer, Boston, 1996, pp. 153-181.
10. C. Lund and M. Yannakakis, On the hardness of approximating minimization problems, J ACM 41 (1994), 960-981.
11. M.V. Marathe, H. Breu, H.B. Hunt III, S.S. Ravi, and D.J. Rosenkrantz, Simple heuristics for unit-disk graphs, Networks 25 (1995), 59-68.
12. S.-Y. Ni, Y.-C. Tseng, Y.-S. Chen, and J.-P. Sheu, The broadcast storm problem in a mobile ad hoc network, Proc MOBICOM, Seattle, 1999, pp. 151-162.
13. C.E. Perkins and E.M. Royer, Ad hoc on-demand distance vector routing, Proc 2nd IEEE Workshop on Mobile Computing Systems and Applications, New Orleans, LA, February 1999, pp. 90-100.
14. P. Sinha, R. Sivakumar, and V. Bharghavan, Enhancing ad hoc routing with dynamic virtual infrastructures, INFOCOM 3 (2001), 1763-1772.
15. R. Sivakumar, P. Sinha, and V. Bharghavan, CEDAR: A core-extraction distributed ad hoc routing algorithm, IEEE J Sel Areas Commun 17 (1999), 1454-1465.
16. J. Wu and H. Li, On calculating connected dominating set for efficient routing in ad hoc wireless networks, Proc 3rd Int Workshop on Discrete Algorithms and Methods for MOBILE Computing and Communications, Seattle, WA, 1999, pp. 7-14.