메뉴 건너뛰기




Volumn , Issue , 2009, Pages 106-111

A heuristic for minimum connected dominating set with local repair for wireless sensor networks

Author keywords

[No Author keywords available]

Indexed keywords

BATTERY POWER; CDS; CONNECTED DOMINATING SETS; DOMINATING SETS; EFFICIENT DESIGNS; MINIMUM CONNECTED DOMINATING SET; NEIGHBOURHOOD; POWER CONSTRAINTS; REPAIR ALGORITHMS; SECOND PHASE; SIGNIFICANT IMPACTS; SIMULATION RESULT; STEINER TREES; THIRD PHASE; THREE PHASIS; TOPOLOGICAL CHANGES; UNIT DISK GRAPHS;

EID: 67650680197     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICN.2009.63     Document Type: Conference Paper
Times cited : (15)

References (14)
  • 1
    • 67650697704 scopus 로고    scopus 로고
    • S. Butenko, X. Cheng, D.-Z. Du, & P.M. Pardolos On the Construction of virtual backbone for adhoc Wireless network. In S.Butenko, R. Murphey and P. M. pardolas, editors, Cooperative Control: Models, Applications and Algorithms, pages 43-54 Kluwer Academic Publishers, 2002.
    • S. Butenko, X. Cheng, D.-Z. Du, & P.M. Pardolos On the Construction of virtual backbone for adhoc Wireless network. In S.Butenko, R. Murphey and P. M. pardolas, editors, Cooperative Control: Models, Applications and Algorithms, pages 43-54 Kluwer Academic Publishers, 2002.
  • 5
    • 0030689578 scopus 로고    scopus 로고
    • Routing in ad-hoc networks using minimum connected dominating sets
    • B. Das and V. Bharghavan Routing in ad-hoc networks using minimum connected dominating sets. In International Conference on Communications, pages 376-380, 1997.
    • (1997) International Conference on Communications , pp. 376-380
    • Das, B.1    Bharghavan, V.2
  • 7
    • 20344399438 scopus 로고    scopus 로고
    • Efficient Construction of Connected Dominating Set in Wireless Ad-Hoc Network
    • Bo Han, HaoHuan Fu, Lidong Lin, and Weijia Efficient Construction of Connected Dominating Set in Wireless Ad-Hoc Network,IEEE 2004.
    • (2004) IEEE
    • Han, B.1    Fu, H.2    Lin, L.3    Weijia4
  • 8
    • 67650683428 scopus 로고    scopus 로고
    • Sergiy Butenko, Xiuzhen Cheng, Carlos A. S. Oliveira, P.M. Pardalos A New Heuristic for the Minimum Connected Dominating Set Problem on Ad-Hoc Wireless Networks, 2004. In S. Butenko, R. Murphey, and P. Pardalos, editors, Recent Developments in Cooperative Control and Optimization, pages 6173. Kluwer Academic Publishers, 2004.
    • Sergiy Butenko, Xiuzhen Cheng, Carlos A. S. Oliveira, P.M. Pardalos A New Heuristic for the Minimum Connected Dominating Set Problem on Ad-Hoc Wireless Networks, 2004. In S. Butenko, R. Murphey, and P. Pardalos, editors, Recent Developments in Cooperative Control and Optimization, pages 6173. Kluwer Academic Publishers, 2004.
  • 10
    • 67650652939 scopus 로고    scopus 로고
    • M. Karpinsky and A. Zelikovsky New Approximation algorithms for steiner tree problem, Technical Report, Electronic Colloquium on Computational Complexity (ECCC):TR95-030,1995
    • M. Karpinsky and A. Zelikovsky New Approximation algorithms for steiner tree problem, Technical Report, Electronic Colloquium on Computational Complexity (ECCC):TR95-030,1995
  • 11
    • 19644369843 scopus 로고    scopus 로고
    • Approximation Algorithms for Connected Dominating Sets
    • Apr
    • S. Guha and S. Khuller, Approximation Algorithms for Connected Dominating Sets, Algorithmica, vol. 20, no. 4, pp. 374-387, Apr. 1998.
    • (1998) Algorithmica , vol.20 , Issue.4 , pp. 374-387
    • Guha, S.1    Khuller, S.2
  • 12
    • 33644928040 scopus 로고    scopus 로고
    • Connected Dominating Sets in Disk Graphs with bidirectional links
    • March
    • T. Thai and Ding-Zhu Du, Connected Dominating Sets in Disk Graphs with bidirectional links, IEEE Communication Letters, Vol-10, No. 3 March 2006.
    • (2006) IEEE Communication Letters , vol.10 , Issue.3
    • Thai, T.1    Du, D.-Z.2


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