메뉴 건너뛰기




Volumn 9, Issue 8, 2010, Pages 1108-1118

A better approximation algorithm for computing connected dominating sets in unit ball graphs

Author keywords

Connected dominating sets; Unit ball graphs; Virtual backbones; Wireless networks

Indexed keywords

CDS; CENTRALIZED ALGORITHMS; CONNECTED DOMINATING SET; DISTRIBUTED ALGORITHM; DISTRIBUTED ENVIRONMENTS; MINIMUM CONNECTED DOMINATING SET; PERFORMANCE RATIO; QUALITY FACTORS; TIME COMPLEXITY; UNIT BALL GRAPH; UNIT DISK GRAPHS; UPPER BOUND; VIRTUAL BACKBONE; VIRTUAL BACKBONES;

EID: 77953748234     PISSN: 15361233     EISSN: None     Source Type: Journal    
DOI: 10.1109/TMC.2010.55     Document Type: Article
Times cited : (42)

References (20)
  • 2
    • 0023092944 scopus 로고
    • A design concept for reliable mobile radio networks with frequency hopping signaling
    • Jan.
    • A. Ephremides, J. Wieselthier, and D. Baker, "A Design Concept for Reliable Mobile Radio Networks with Frequency Hopping Signaling," Proc. IEEE, vol.75, no.1, pp. 56-73, Jan. 1987.
    • (1987) Proc. IEEE , vol.75 , Issue.1 , pp. 56-73
    • Ephremides, A.1    Wieselthier, J.2    Baker, D.3
  • 3
    • 19644369843 scopus 로고    scopus 로고
    • Approximation algorithms for connected dominating sets
    • Apr.
    • S. Guha and S. Khuller, "Approximation Algorithms for Connected Dominating Sets," Algorithmica, vol.20, pp. 374-387, Apr. 1998.
    • (1998) Algorithmica , vol.20 , pp. 374-387
    • Guha, S.1    Khuller, S.2
  • 4
    • 0036346466 scopus 로고    scopus 로고
    • Distributed construction of connected dominating set in wireless ad hoc networks
    • June
    • P.-J. Wan, K.M. Alzoubi, and O. Frieder, "Distributed Construction of Connected Dominating Set in Wireless Ad Hoc Networks," Proc. IEEE INFOCOM, June 2002.
    • (2002) Proc. IEEE INFOCOM
    • Wan, P.-J.1    Alzoubi, K.M.2    Frieder, O.3
  • 6
    • 10044221102 scopus 로고    scopus 로고
    • A greedy approximation for minimum connected dominating sets
    • Dec.
    • L. Ruan, H. Du, X. Jia, W. Wu, Y. Li, and K.I. Ko, "A Greedy Approximation for Minimum Connected Dominating Sets," J. Theoretical Computer Science, vol.329, pp. 325-330, Dec. 2004.
    • (2004) J. Theoretical Computer Science , vol.329 , pp. 325-330
    • Ruan, L.1    Du, H.2    Jia, X.3    Wu, W.4    Li, Y.5    Ko, K.I.6
  • 8
    • 32644448886 scopus 로고    scopus 로고
    • Minimum connected dominating sets and maximal independent sets in unit disk graphs
    • W. Wu, H. Du, X. Jia, Y. Li, and S. Huang, "Minimum Connected Dominating Sets and Maximal Independent Sets in Unit Disk Graphs," Theoretical Computer Science, vol.352, pp. 1-7, 2006.
    • (2006) Theoretical Computer Science , vol.352 , pp. 1-7
    • Wu, W.1    Du, H.2    Jia, X.3    Li, Y.4    Huang, S.5
  • 10
    • 33750323316 scopus 로고    scopus 로고
    • A simple improved distributed algorithm for minimum CDS in unit disk graphs
    • Aug.
    • S. Funke, A. Kesselman, U. Meyer, and M. Segal, "A Simple Improved Distributed Algorithm for Minimum CDS in Unit Disk Graphs," ACM Trans. Sensor Network, vol.2, no.3, pp. 444-453, Aug. 2006.
    • (2006) ACM Trans. Sensor Network , vol.2 , Issue.3 , pp. 444-453
    • Funke, S.1    Kesselman, A.2    Meyer, U.3    Segal, M.4
  • 13
    • 13944252629 scopus 로고    scopus 로고
    • Underwater acoustic sensor networks: Research challenges
    • DOI 10.1016/j.adhoc.2005.01.004, PII S1570870505000168
    • I.F. Akyildiz, D. Pompili, and T. Melodia, "Underwater Acoustic Sensor Networks: Research Challenges," J. Ad Hoc Network, vol.3, no.3, pp. 257-279, Mar. 2005. (Pubitemid 40266052)
    • (2005) Ad Hoc Networks , vol.3 , Issue.3 , pp. 257-279
    • Akyildiz, I.F.1    Pompili, D.2    Melodia, T.3
  • 18
    • 0040773831 scopus 로고
    • Bemerkungen der Redaktion
    • R. Hoppe, "Bemerkungen der Redaktion," Grunert Arch. Math. Phys., vol.56, pp. 307-312, 1874.
    • (1874) Grunert Arch. Math. Phys. , vol.56 , pp. 307-312
    • Hoppe, R.1
  • 19
    • 1642405350 scopus 로고    scopus 로고
    • Approximation algorithms for the mobile piercing set problem with applications to clustering in Ad-Hoc networks
    • H. Huang, A.W. Richa, and M. Segal, "Approximation Algorithms for the Mobile Piercing Set Problem with Applications to Clustering in Ad-Hoc Networks," ACM Springer Mobile Networks and Applications (MONET), vol.9, no.2, pp. 151-161, 2004.
    • (2004) ACM Springer Mobile Networks and Applications (MONET) , vol.9 , Issue.2 , pp. 151-161
    • Huang, H.1    Richa, A.W.2    Segal, M.3


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