메뉴 건너뛰기




Volumn 36, Issue 5, 2008, Pages 605-608

An approximation algorithm for the wireless gathering problem

Author keywords

Approximation algorithms; Data gathering; Wireless networks

Indexed keywords

NUCLEAR PROPULSION; POLYNOMIAL APPROXIMATION; WIRELESS SENSOR NETWORKS;

EID: 50249086308     PISSN: 01676377     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.orl.2008.06.001     Document Type: Article
Times cited : (18)

References (10)
  • 2
    • 0027642528 scopus 로고
    • Multiple communication in multihop radio networks
    • Bar-Yehuda R., Israeli A., and Itai A. Multiple communication in multihop radio networks. SIAM Journal on Computing 22 4 (1993) 875-887
    • (1993) SIAM Journal on Computing , vol.22 , Issue.4 , pp. 875-887
    • Bar-Yehuda, R.1    Israeli, A.2    Itai, A.3
  • 4
    • 33746100661 scopus 로고    scopus 로고
    • J.-C. Bermond, R.C. Corrêa, M.-L. Yu, Gathering algorithms on paths under interference constraints, in: Proc. 6th Italian Conf. on Algorithms and Complexity, 2006, pp. 115-126
    • J.-C. Bermond, R.C. Corrêa, M.-L. Yu, Gathering algorithms on paths under interference constraints, in: Proc. 6th Italian Conf. on Algorithms and Complexity, 2006, pp. 115-126
  • 7
    • 1842538820 scopus 로고    scopus 로고
    • V.S. Anil Kumar, M.V. Marathe, S. Parthasarathy, A. Srinivasan, End-to-end packet-scheduling in wireless ad-hoc networks, in: J.I. Munro (Ed.), Proc. 15th Symp. on Discrete Algorithms, 2004, pp. 1021-1030
    • V.S. Anil Kumar, M.V. Marathe, S. Parthasarathy, A. Srinivasan, End-to-end packet-scheduling in wireless ad-hoc networks, in: J.I. Munro (Ed.), Proc. 15th Symp. on Discrete Algorithms, 2004, pp. 1021-1030


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