메뉴 건너뛰기




Volumn 8, Issue 6, 2002, Pages 607-617

Minimum-energy broadcasting in static Ad Hoc wireless networks

Author keywords

Ad hoc wireless networks; Energy conservation

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; ENERGY CONSERVATION; ENERGY UTILIZATION; GEOMETRY; OPTIMIZATION; POLYNOMIALS; TELECOMMUNICATION NETWORKS; TREES (MATHEMATICS); WIRELESS TELECOMMUNICATION SYSTEMS;

EID: 0036847411     PISSN: 10220038     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1020381720601     Document Type: Article
Times cited : (178)

References (11)
  • 1
    • 0000301097 scopus 로고
    • A greedy heuristic for the set-covering problem
    • V. Chátal, A greedy heuristic for the set-covering problem, Mathematics of Operations Research 4(3) (1979) 233-235.
    • (1979) Mathematics of Operations Research , vol.4 , Issue.3 , pp. 233-235
    • Chátal, V.1
  • 6
    • 19644369843 scopus 로고    scopus 로고
    • Approximation algorithms for connected dominating sets
    • S. Guha and S. Khuller. Approximation algorithms for connected dominating sets, Algorithmica 20 (1998) 347-387.
    • (1998) Algorithmica , vol.20 , pp. 347-387
    • Guha, S.1    Khuller, S.2
  • 11
    • 0033894011 scopus 로고    scopus 로고
    • On the construction of energy-efficient broadcast and multicast trees in wireless networks
    • J.E. Wieselthier, G.D. Nguyen and A. Ephremides, On the construction of energy-efficient broadcast and multicast trees in wireless networks, in: IEEE Infocom'2000 (2000).
    • (2000) IEEE Infocom'2000
    • Wieselthier, J.E.1    Nguyen, G.D.2    Ephremides, A.3


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