메뉴 건너뛰기




Volumn 1770, Issue , 2000, Pages 651-660

The power range assignment problem in radio networks on the plane

Author keywords

Approximation algorithms; Lower bounds; Multi hop packet radio networks; Power consumption

Indexed keywords

COMBINATORIAL OPTIMIZATION; ELECTRIC POWER UTILIZATION; POLYNOMIAL APPROXIMATION; RADIO;

EID: 84944051168     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-46541-3_54     Document Type: Conference Paper
Times cited : (71)

References (8)
  • 1
    • 0021465991 scopus 로고
    • Some Complexity Results about Packet Radio Networks
    • IT-30
    • E. Arikan, “Some Complexity Results about Packet Radio Networks", IEEE Trans- actions on Information Theory, 456-461, IT-30, 1984.
    • (1984) IEEE Trans- Actions on Information Theory , pp. 456-461
    • Arikan, E.1
  • 8
    • 0024860918 scopus 로고
    • Distributed Scheduling of Broadcasts in RadioNetwork
    • R. Ramaswami and K. Parhi, “Distributed Scheduling of Broadcasts in RadioNetwork", INFOCOM'89, 497-504, 1989.
    • (1989) INFOCOM'89 , pp. 497-504
    • Ramaswami, R.1    Parhi, K.2


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