메뉴 건너뛰기




Volumn 1, Issue , 2003, Pages 416-421

A cluster-merge algorithm for solving the minimum power broadcast problem in large scale wireless networks

Author keywords

[No Author keywords available]

Indexed keywords

BROADCAST INCREMENTAL POWER (BIP); CLUSTER-MERGE (CM) ALGORITHM; POWER BROADCAST; POWER MATRIX;

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

References (7)
  • 1
    • 0033894011 scopus 로고    scopus 로고
    • On the construction of energy-efficient broadcast and multi-cast trees in wireless networks
    • J.E.Wieselthier, G.D. Nguyen and A. Ephremides, "On the construction of energy-efficient broadcast and multi-cast trees in wireless networks", IEEE INFOCOM 2000, pp. 585-594.
    • IEEE INFOCOM 2000 , pp. 585-594
    • Wieselthier, J.E.1    Nguyen, G.D.2    Ephremides, A.3
  • 6
    • 0042941430 scopus 로고    scopus 로고
    • Minimum power broadcast trees for wireless networks: Integer programming formulations
    • San Francisco, CA, Apr. 1-3
    • A. K. Das, R.J. Marks II, M.A. El-Sharkawi, P. Arabshahi and A. Gray, "Minimum Power Broadcast Trees for Wireless Networks: Integer Programming Formulations", Proc. of INFOCOM, San Francisco, CA, Apr. 1-3, 2003.
    • (2003) Proc. of INFOCOM
    • Das, A.K.1    Marks II, R.J.2    El-Sharkawi, M.A.3    Arabshahi, P.4    Gray, A.5
  • 7
    • 0842267707 scopus 로고    scopus 로고
    • r-Shrink: A heuristic for improving minimum power broadcast trees in wireless networks
    • submitted to
    • A. K. Das, R.J. Marks II, M.A. El-Sharkawi, P. Arabshahi and A. Gray, "r-Shrink: A heuristic for improving Minimum Power Broadcast Trees in Wireless Networks", submitted to GLOBECOM 2003.
    • GLOBECOM 2003
    • Das, A.K.1    Marks II, R.J.2    El-Sharkawi, M.A.3    Arabshahi, P.4    Gray, A.5


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