메뉴 건너뛰기




Volumn 45, Issue 3, 2009, Pages 451-458

A PTAS for minimum connected dominating set in 3-dimensional Wireless sensor networks

Author keywords

Connected dominating set; PTAS; Unit ball graph; Wireless sensor network

Indexed keywords

3-DIMENSIONAL; A-PLANE; CONNECTED DOMINATING SET; MINIMUM CONNECTED DOMINATING SET; NEW CONSTRUCTION; POLYNOMIAL TIME APPROXIMATION SCHEMES; PTAS; RUNNING TIME; THREE DIMENSIONAL SPACE; UNIT BALL GRAPH; UNIT DISK GRAPHS;

EID: 70349673596     PISSN: 09255001     EISSN: 15732916     Source Type: Journal    
DOI: 10.1007/s10898-008-9384-9     Document Type: Article
Times cited : (38)

References (19)
  • 2
    • 0030689578 scopus 로고    scopus 로고
    • Routing in ad hoc networks using minimum connected dominating sets
    • Montreal, Canada
    • Bharghavan, V., Das, B.: Routing in ad hoc networks using minimum connected dominating sets. International Conference on Communication, Montreal, Canada (1997)
    • (1997) International Conference on Communication
    • Bharghavan, V.1    Das, B.2
  • 3
    • 26444499503 scopus 로고    scopus 로고
    • Applications of connectd dominating sets in wireless netwoks
    • Du D.-Z. Pardalos P. (eds.) Kluwer Academic Publisher
    • Blum, J., Ding, M., Cheng, X.: Applications of Connectd Dominating Sets in Wireless Netwoks. In: Du D.-Z. Pardalos P. (eds.) Handbook of combinatorial Optimization, pp. 329-369. Kluwer Academic Publisher (2004)
    • (2004) Handbook of Combinatorial Optimization , pp. 329-369
    • Blum, J.1    Ding, M.2    Cheng, X.3
  • 6
    • 2142846003 scopus 로고    scopus 로고
    • A Polynomial-Time Approximation Scheme for the Minimum-Connected Dominating Set in Ad Hoc Wireless Networks
    • DOI 10.1002/net.10097
    • X. Cheng X. Huang D. Li W. Wu D. Du 2003 A polynomial-time approximation scheme for minimum connected dominating set in ad hoc wireless networks Networks 42 202 208 10.1002/net.10097 (Pubitemid 38552247)
    • (2003) Networks , vol.42 , Issue.4 , pp. 202-208
    • Cheng, X.1    Huang, X.2    Li, D.3    Wu, W.4    Du, D.-Z.5
  • 8
    • 19644369843 scopus 로고    scopus 로고
    • Approximation algorithms for connected dominating sets
    • 10.1007/PL00009201
    • S. Guha S. Khuller 1998 Approximation algorithms for connected dominating sets Algorithmica 20 374 387 10.1007/PL00009201
    • (1998) Algorithmica , vol.20 , pp. 374-387
    • Guha, S.1    Khuller, S.2
  • 9
    • 0021897852 scopus 로고
    • Approximation schemes for covering and packing problems in image processing and VLSI
    • 10.1145/2455.214106
    • D.S. Hochbaum W. Maass 1985 Approximation schemes for covering and packing problems in image processing and VLSI J. ACM. 32 130 136 10.1145/2455.214106
    • (1985) J. ACM. , vol.32 , pp. 130-136
    • Hochbaum, D.S.1    Maass, W.2
  • 10
    • 32644433433 scopus 로고    scopus 로고
    • Improving construction for connected dominating set with steiner tree in wireless sensor networks
    • DOI 10.1007/s10898-005-8466-1
    • M. Min H. Du X. Jia C.X. Huang S.C. Huang W. Wu 2006 Improving construction for connected dominating set with Steiner tree in wireless sensor networks J. Glob. Optim. 35 111 119 10.1007/s10898-005-8466-1 (Pubitemid 43787036)
    • (2006) Journal of Global Optimization , vol.35 , Issue.1 , pp. 111-119
    • Min, M.1    Du, H.2    Jia, X.3    Huang, C.X.4    Huang, S.C.-H.5    Wu, W.6
  • 12
    • 0031355355 scopus 로고    scopus 로고
    • Minimizing the number of optical amplifiers needed to support a multi-wavelength optical LAN/MAN
    • Ramamurthy, B., Iness, J., Mukherjee, B.: Minimizing the number of optical amplifiers needed to support a multi-wavelength optical LAN/MAN. In: Proceedings of IEEE INFOCOM'97, pp. 261-268 (1997)
    • (1997) Proceedings of IEEE INFOCOM'97 , pp. 261-268
    • Ramamurthy, B.1    Iness, J.2    Mukherjee, B.3
  • 13
    • 10044221102 scopus 로고    scopus 로고
    • A greedy approximation for minimum connected dominating set
    • 10.1016/j.tcs.2004.08.013
    • L. Ruan H. Du X. Jia W. Wu Y. Li K. Ko 2004 A greedy approximation for minimum connected dominating set Theor. Comput. Sci. 329 325 330 10.1016/j.tcs.2004.08.013
    • (2004) Theor. Comput. Sci. , vol.329 , pp. 325-330
    • Ruan, L.1    Du, H.2    Jia, X.3    Wu, W.4    Li, Y.5    Ko, K.6
  • 14
    • 84951014072 scopus 로고    scopus 로고
    • Power efficient topologies for wireless sensor networks
    • Salhieh, A., Weinmann, J., Kochha, M., Schwiebert, L.: Power efficient topologies for wireless sensor networks. In: ICPP'2001, pp. 156-163 (2001)
    • (2001) ICPP'2001 , pp. 156-163
    • Salhieh, A.1    Weinmann, J.2    Kochha, M.3    Schwiebert, L.4
  • 17
    • 0036346466 scopus 로고    scopus 로고
    • Distributed construction of connected dominating set in wireless ad hoc networks
    • Wan, P., Alzoubi, K.M., Frieder, O.: Distributed construction of connected dominating set in wireless ad hoc networks. In: Proceedings of Infocom' 2002 (2002)
    • (2002) Proceedings of Infocom' 2002
    • Wan, P.1    Alzoubi, K.M.2    Frieder, O.3


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.