메뉴 건너뛰기
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volumn 3998 LNCS, Issue , 2006, Pages 115-126
Gathering algorithms on paths under interference constraints
Author keywords

Gathering; Interference; Multi hop radio network; Path
Indexed keywords

CONSTRAINT THEORY; INFORMATION ANALYSIS; INFORMATION RETRIEVAL; INTEGER PROGRAMMING; MATHEMATICAL MODELS; PROBLEM SOLVING;
EID: 33746100661     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11758471_14     Document Type: Conference Paper
Times cited : (9)
References (9)
  • 1
    • 33746071996 scopus 로고    scopus 로고
    • Hardness and approximation of gathering in static radio networks
    • Pisa,Italy, March
    • J-C. Bermond, J. Galtier, R. Klasing, N. Morales, and S. Pérennes. Hardness and approximation of gathering in static radio networks. In FAWN06, Pisa,Italy, March 2006.
    • (2006) FAWN06
    • Bermond, J.-C.1    Galtier, J.2    Klasing, R.3    Morales, N.4    Pérennes, S.5
  • 2
    • 33746060966 scopus 로고    scopus 로고
    • Efficient gathering in radio ids with interference
    • Presqu'le de Giens, May
    • J.-C. Bermond and J. Peters. Efficient gathering in radio ids with interference. In AlgoTel'05, pages 103-106, Presqu'le de Giens, May 2005.
    • (2005) AlgoTel'05 , pp. 103-106
    • Bermond, J.-C.1    Peters, J.2
  • 3
    • 33746040923 scopus 로고    scopus 로고
    • Aces haut dbit en zone rurale: Une solution "ad hoc"
    • P. Bertin, J-F. Bresse, and B. Le Sage. Aces haut dbit en zone rurale: une solution "ad hoc". Prance Telecom R&D, 22:16-18, 2005.
    • (2005) Prance Telecom R&D , vol.22 , pp. 16-18
    • Bertin, P.1    Bresse, J.-F.2    Le Sage, B.3
  • 4
    • 84869193784 scopus 로고    scopus 로고
    • Gossiping with bounded size messages in ad-hoc radio networks
    • Proceedings of ICALP'02. Springer-Verlag
    • M. Christersson, L. Gasieniec, and A. Lingas. Gossiping with bounded size messages in ad-hoc radio networks. In Proceedings of ICALP'02, volume 2380 of LNCS, pages 377-389. Springer-Verlag, 2002.
    • (2002) LNCS , vol.2380 , pp. 377-389
    • Christersson, M.1    Gasieniec, L.2    Lingas, A.3
  • 5
    • 0036591068 scopus 로고    scopus 로고
    • Fast broadcasting and gossiping in radio networks
    • M. Chrobak, L. Gasieniec, and W. Rytter. Fast broadcasting and gossiping in radio networks. Journal of Algorithms, 43(2):177-189, 2002.
    • (2002) Journal of Algorithms , vol.43 , Issue.2 , pp. 177-189
    • Chrobak, M.1    Gasieniec, L.2    Rytter, W.3
  • 6
    • 33746093582 scopus 로고    scopus 로고
    • Logarithmic inapproximability of the radio broadcast problem
    • M. L. Elkin and G. Kortsarz. Logarithmic inapproximability of the radio broadcast problem. Journal of Algorithms, 52(1):8-25, 2004.
    • (2004) Journal of Algorithms , vol.52 , Issue.1 , pp. 8-25
    • Elkin, M.L.1    Kortsarz, G.2
  • 7
    • 0037222272 scopus 로고    scopus 로고
    • Centralized broadcast in multihop radio networks
    • I. Gaber and Y. Mansour. Centralized broadcast in multihop radio networks. Journal of Algorithms, 46(1):1-20, 2003.
    • (2003) Journal of Algorithms , vol.46 , Issue.1 , pp. 1-20
    • Gaber, I.1    Mansour, Y.2
  • 9
    • 33746088506 scopus 로고    scopus 로고
    • On the complexity of bandwidth allocation in radio networks with steady traffic demands
    • INRIA Research Report RR-5432 and I3S Research Report I3S/RR-2 004-40-FR
    • R. Klasing, N. Morales, and S. Pérennes. On the complexity of bandwidth allocation in radio networks with steady traffic demands. Technical report, INRIA Research Report RR-5432 and I3S Research Report I3S/RR-2 004-40-FR, 2004.
    • (2004) Technical Report
    • Klasing, R.1    Morales, N.2    Pérennes, S.3

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