메뉴 건너뛰기




Volumn , Issue , 2009, Pages 91-98

Blackbone2, an efficient deterministic algorithm for creating 2-connected m-dominating set-based backbones in ad hoc networks

Author keywords

k connected m dominating set; Localized algorithm; Wireless sensor networks

Indexed keywords

A-DENSITY; AVERAGE NUMBERS; CDS; COMPUTATION TIME; DECENTRALIZED ALGORITHMS; DENSITY RANGE; DETERMINISTIC ALGORITHMS; DETERMINISTIC APPROACH; DOMINATING SETS; K-CONNECTED; LOCALIZED ALGORITHM;

EID: 74249096406     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1641776.1641791     Document Type: Conference Paper
Times cited : (7)

References (18)
  • 3
    • 17244373061 scopus 로고    scopus 로고
    • An extended localized algorithm for connected dominating set formation in ad hoc wireless networks
    • F. Dai and J. Wu. An extended localized algorithm for connected dominating set formation in ad hoc wireless networks. IEEE Trans. Parallel and Distributed Systems, 15(10):908-920, 10 2004.
    • IEEE Trans. Parallel and Distributed Systems , vol.15 , Issue.10
    • Dai, F.1    Wu, J.2
  • 8
    • 74249123031 scopus 로고    scopus 로고
    • Localized construction of connected dominatinf set in wireless networks
    • Y. Li, S. Zhu, M. T. Thai, and D.-Z. Du. Localized construction of connected dominatinf set in wireless networks. IEEE INFOCOM, 2002.
    • (2002) IEEE INFOCOM
    • Li, Y.1    Zhu, S.2    Thai, M.T.3    Du, D.-Z.4
  • 10
    • 38149074877 scopus 로고    scopus 로고
    • Algorithms for minimum m-connected k-dominating set problem
    • COCOA 2007
    • W. Shang, F. Yao, P. Wan, and X. Hu. Algorithms for minimum m-connected k-dominating set problem. COCOA 2007, LNCS 4616, pages 182-190, 2007.
    • (2007) LNCS , vol.4616 , pp. 182-190
    • Shang, W.1    Yao, F.2    Wan, P.3    Hu, X.4
  • 11
    • 34548693199 scopus 로고    scopus 로고
    • On approximation algorithms of k-connected m-dominating set in disk graphs
    • Computer Science
    • M. T. Thai, N. Zhang, R. Tiwari, and X. Xu. On approximation algorithms of k-connected m-dominating set in disk graphs. Accepted by Theoretical Computer Science, 2007.
    • (2007) Accepted by Theoretical
    • Thai, M.T.1    Zhang, N.2    Tiwari, R.3    Xu, X.4
  • 12
    • 74249105704 scopus 로고    scopus 로고
    • P.-J. Wan, K. M. Alzoubi, and O. Frieder. Distributed construction of connected dominating set in wireless ad hoc networks. NFS International Workshop on Theoretical Aspects of Wireless Ad hoc, Sensor and Peer-to-Peer Networks, 6 2004.
    • P.-J. Wan, K. M. Alzoubi, and O. Frieder. Distributed construction of connected dominating set in wireless ad hoc networks. NFS International Workshop on Theoretical Aspects of Wireless Ad hoc, Sensor and Peer-to-Peer Networks, 6 2004.
  • 15
    • 4143137446 scopus 로고    scopus 로고
    • An enhanced approach to determine a small forward node set based on multi-point relay
    • J. Wu. An enhanced approach to determine a small forward node set based on multi-point relay. Proc. 58th IEEE Semiann. Vehicular Technology Conf, 4:2774-2777, 10 2003.
    • (2003) Proc. 58th IEEE Semiann. Vehicular Technology Conf , vol.4 , Issue.2774-2777 , pp. 10
    • Wu, J.1
  • 17
    • 57349157704 scopus 로고    scopus 로고
    • Y. Wu and Y. Li. Construction algorithms for k-connected m-dominating sets in wireless sensor networks. Mobihoc'08, pages 83-90, 5 2008.
    • Y. Wu and Y. Li. Construction algorithms for k-connected m-dominating sets in wireless sensor networks. Mobihoc'08, pages 83-90, 5 2008.
  • 18
    • 47949083311 scopus 로고    scopus 로고
    • Constructing k-connected m-dominating sets in wireless sensor networks
    • Y. Wu, F. Wang, M. T. Thai, and Y. Li. Constructing k-connected m-dominating sets in wireless sensor networks. Military Communication Conference, 10 2007.
    • (2007) Military Communication Conference , vol.10
    • Wu, Y.1    Wang, F.2    Thai, M.T.3    Li, Y.4


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