메뉴 건너뛰기




Volumn , Issue , 2003, Pages 300-312

Power Optimization in Fault-Tolerant Topology Control Algorithms for Wireless Multi-hop Networks

Author keywords

Ad hoc network; Approximation algorithm; Graph model; Graph property; Power conservation; Topology control

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTER NETWORKS; ELECTRIC POWER UTILIZATION; FAULT TOLERANT COMPUTER SYSTEMS; GRAPH THEORY; OPTIMIZATION;

EID: 1542358972     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/938985.939016     Document Type: Conference Paper
Times cited : (134)

References (28)
  • 12
    • 0000558850 scopus 로고
    • Augmenting graphs to meet edge-connectivity requirements
    • András Frank. Augmenting graphs to meet edge-connectivity requirements. SIAM J. Discrete Math., 5(1):25-53, 1992.
    • (1992) SIAM J. Discrete Math. , vol.5 , Issue.1 , pp. 25-53
    • Frank, A.1
  • 13
    • 0001186361 scopus 로고
    • An application of submodular flows
    • András Frank and Eva Tardos. An application of submodular flows. Linear Algebra Appl., 114/115:329-348, 1989.
    • (1989) Linear Algebra Appl. , vol.114-115 , pp. 329-348
    • Frank, A.1    Tardos, E.2
  • 15
    • 0029289832 scopus 로고
    • A general approximation technique for constrained forest problems
    • M.X. Goemans and D.P. Williamson. A general approximation technique for constrained forest problems. SIAM Journal on Computing, 24:296-317, 1995.
    • (1995) SIAM Journal on Computing , vol.24 , pp. 296-317
    • Goemans, M.X.1    Williamson, D.P.2
  • 16
    • 0005363324 scopus 로고    scopus 로고
    • A factor 2 approximation for the generalized steiner network problem
    • K. Jain. A factor 2 approximation for the generalized steiner network problem. Combinatorica, 21(1):39-60, 2001.
    • (2001) Combinatorica , vol.21 , Issue.1 , pp. 39-60
    • Jain, K.1
  • 17
    • 0030367201 scopus 로고    scopus 로고
    • Improved approximation algorithms for uniform connectivity problems
    • Samir Khuller and Balaji Raghavachari. Improved approximation algorithms for uniform connectivity problems. J. Algorithms, 21(2):434-450, 1996.
    • (1996) J. Algorithms , vol.21 , Issue.2 , pp. 434-450
    • Khuller, S.1    Raghavachari, B.2
  • 18
    • 0001857122 scopus 로고    scopus 로고
    • Power consumption in packet radio networks
    • Lefteris M. Kirousis, Evangelos Kranakis, Danny Krizanc, and Andrzej Pelc. Power consumption in packet radio networks. Theoret. Comput. Sci., 243(1-2):289-305, 2000.
    • (2000) Theoret. Comput. Sci. , vol.243 , Issue.1-2 , pp. 289-305
    • Kirousis, L.M.1    Kranakis, E.2    Krizanc, D.3    Pelc, A.4
  • 23
    • 0030407583 scopus 로고    scopus 로고
    • Optimal transmission ranges for mobile communication in linear multihop packet radio networks
    • R. Mathar and J Mattfeldt. Optimal transmission ranges for mobile communication in linear multihop packet radio networks. Wireless Networks, 2:329-342, 1996.
    • (1996) Wireless Networks , vol.2 , pp. 329-342
    • Mathar, R.1    Mattfeldt, J.2
  • 26
    • 0000576654 scopus 로고
    • Ecken vom grad n in minimalen n-fach zusammenhangenden Graphen
    • Mader W. Ecken vom grad n in minimalen n-fach zusammenhangenden Graphen. Arch. Math. (Basel), 23:219-224, 1972.
    • (1972) Arch. Math. (Basel) , vol.23 , pp. 219-224
    • Mader, W.1


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