메뉴 건너뛰기




Volumn , Issue , 2004, Pages 275-286

FLSS: A fault-tolerant topology control algorithm for wireless networks

Author keywords

Energy management; Fault tolerance; K vertex connectivity; Topology control; Wireless networks

Indexed keywords

K-VERTEX CONNECTIVITY; NODE FAILURES; TOPOLOGY CONTROL; WIRELESS NETWORKS;

EID: 11244250585     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (195)

References (21)
  • 2
    • 0013362396 scopus 로고    scopus 로고
    • Output-sensitive reporting of disjoint paths
    • G. D. Battista, R. Tamassia, and L. Vismara. Output-sensitive reporting of disjoint paths. Algorithmica, 23(4):302-340, 1999.
    • (1999) Algorithmica , vol.23 , Issue.4 , pp. 302-340
    • Battista, G.D.1    Tamassia, R.2    Vismara, L.3
  • 3
  • 5
    • 0000682065 scopus 로고
    • Network flow and testing graph connectivity
    • S. Even and R. E. Tarjan. Network flow and testing graph connectivity. SIAM Journal on Computing, 4:507-518, 1975.
    • (1975) SIAM Journal on Computing , vol.4 , pp. 507-518
    • Even, S.1    Tarjan, R.E.2
  • 8
    • 0042433239 scopus 로고    scopus 로고
    • Power control and clustering in ad hoc networks
    • San Francisco, CA, USA, Apr.
    • V. Kawadia and P. Kumar. Power control and clustering in ad hoc networks. In Proc. IEEE INFOCOM 2003, volume 1, pages 459-469, San Francisco, CA, USA, Apr. 2003.
    • (2003) Proc. IEEE INFOCOM 2003 , vol.1 , pp. 459-469
    • Kawadia, V.1    Kumar, P.2
  • 9
    • 0002631049 scopus 로고    scopus 로고
    • Approximation algorithms for finding highly connected subgraphs
    • D. S. Hochbaum, editor, PWS Publishing Company, Boston, MA
    • S. Khuller. Approximation algorithms for finding highly connected subgraphs. In D. S. Hochbaum, editor, Approximation algorithms for NP-hard problems. PWS Publishing Company, Boston, MA, 1996.
    • (1996) Approximation Algorithms for NP-hard Problems
    • Khuller, S.1
  • 10
    • 70350674995 scopus 로고
    • On the shortest spanning subtree of a graph and the traveling salesman problem
    • J. B. Kruskal. On the shortest spanning subtree of a graph and the traveling salesman problem. Proceedings of the American Mathematical Society, 7:48-50, 1956.
    • (1956) Proceedings of the American Mathematical Society , vol.7 , pp. 48-50
    • Kruskal, J.B.1
  • 12
    • 8344232302 scopus 로고    scopus 로고
    • Topology control in heterogeneous wireless networks: Problems and solutions
    • Hong Kong, China, Mar. the version in the conference proceedings has a technical error, and an updated version of the paper appears as a technical report at Department of Computer Science, University of Illinois at Urbana Champaign, Technical Report No. UIUCDCS-R-2004-2412, Mar 2004.
    • N. Li and J. C. Hou. Topology control in heterogeneous wireless networks: problems and solutions. In Proc. IEEE INFOCOM 2004, Hong Kong, China, Mar. 2004 (the version in the conference proceedings has a technical error, and an updated version of the paper appears as a technical report at Department of Computer Science, University of Illinois at Urbana Champaign, Technical Report No. UIUCDCS-R-2004-2412, Mar 2004).
    • (2004) Proc. IEEE INFOCOM 2004
    • Li, N.1    Hou, J.C.2
  • 13
    • 0041973675 scopus 로고    scopus 로고
    • Design and analysis of an MST-based topology control algorithm
    • San Francisco, CA, USA, Apr.
    • N. Li, J. C. Hou, and L. Sha. Design and analysis of an MST-based topology control algorithm. In Proc. IEEE INFOCOM 2003, volume 3, pages 1702-1712, San Francisco, CA, USA, Apr. 2003.
    • (2003) Proc. IEEE INFOCOM 2003 , vol.3 , pp. 1702-1712
    • Li, N.1    Hou, J.C.2    Sha, L.3
  • 14
    • 0036346602 scopus 로고    scopus 로고
    • Distributed construction of planar spanner and routing for ad hoc networks
    • New York, NY, USA, June
    • X.-Y. Li, G. Calinescu, and P.-J. Wan. Distributed construction of planar spanner and routing for ad hoc networks. In Proc. IEEE INFOCOM 2002, volume 3, pages 1268-1277, New York, NY, USA, June 2002.
    • (2002) Proc. IEEE INFOCOM 2002 , vol.3 , pp. 1268-1277
    • Li, X.-Y.1    Calinescu, G.2    Wan, P.-J.3
  • 18
    • 0033471867 scopus 로고    scopus 로고
    • On k-connecitivity for a geometric random graph
    • M. D. Penrose. On k-connecitivity for a geometric random graph. Random Structures and Algorithms, 15(2): 145-164, 1999.
    • (1999) Random Structures and Algorithms , vol.15 , Issue.2 , pp. 145-164
    • Penrose, M.D.1
  • 19
    • 0033893765 scopus 로고    scopus 로고
    • Topology control of multihop wireless networks using transmit power adjustment
    • Tel Aviv, Israel, Mar.
    • R. Ramanathan and R. Rosales-Hain. Topology control of multihop wireless networks using transmit power adjustment. In Proc. IEEE INFOCOM 2000, volume 2, pages 404-413, Tel Aviv, Israel, Mar. 2000.
    • (2000) Proc. IEEE INFOCOM 2000 , vol.2 , pp. 404-413
    • Ramanathan, R.1    Rosales-Hain, R.2
  • 20
    • 0032667848 scopus 로고    scopus 로고
    • Minimum energy mobile wireless networks
    • Aug.
    • V. Rodoplu and T. H. Meng. Minimum energy mobile wireless networks. IEEE J. Select. Areas Commun., 17(8):1333-1344, Aug. 1999.
    • (1999) IEEE J. Select. Areas Commun. , vol.17 , Issue.8 , pp. 1333-1344
    • Rodoplu, V.1    Meng, T.H.2


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