메뉴 건너뛰기




Volumn , Issue , 2012, Pages 155-164

Oblivious low-congestion multicast routing in wireless networks

Author keywords

congestion; geographic routing; multicast; stretch

Indexed keywords

CONGESTION; CONSTANT FACTORS; CONTENT-BASED; GEOGRAPHIC ROUTING; GEOGRAPHICAL ROUTING; INTERMEDIATE NODE; MINIMUM SPANNING TREES; MULTICAST COMMUNICATION; MULTICAST REQUEST; MULTICAST ROUTING; MULTICASTS; OPTIMAL LEVEL; PUBLISH/SUBSCRIBE; ROUTING SCHEME; STRETCH;

EID: 84863544285     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2248371.2248395     Document Type: Conference Paper
Times cited : (10)

References (32)
  • 3
    • 0030413554 scopus 로고    scopus 로고
    • Polynomial time approximation scheme for Euclidean TSP and other geometric problems
    • S. Arora. Polynomial time approximation scheme for Euclidean TSP and other geometric problems. In Proc. 37th Symp. on Found. of Comp. Sc. (FOCS), pages 2-11, 1996.
    • (1996) Proc. 37th Symp. on Found. of Comp. Sc. (FOCS) , pp. 2-11
    • Arora, S.1
  • 4
    • 13244289973 scopus 로고    scopus 로고
    • Robust position-based routing in wireless ad hoc networks with irregular transmission ranges
    • DOI 10.1002/wcm.108
    • L. Barrière, P. Fraigniaud, L. Narayanan, and J. Opatrny. Robust position-based routing in wireless ad hoc networks with irregular transmission ranges. Wireless Communication and Mobile Computing, 3:141-153, 2003. (Pubitemid 40183734)
    • (2003) Wireless Communications and Mobile Computing , vol.3 , Issue.2 , pp. 141-153
    • Barriere, L.1    Fraigniaud, P.2    Narayanan, L.3    Opatrny, J.4
  • 5
    • 0038560837 scopus 로고    scopus 로고
    • On-line routing in all-optical networks
    • PII S0304397599000250
    • Y. Bartal and S. Leonardi. On-line routing in all-optical networks. Theor. Comp. Sc., 221(1-2):19-39, 1999. (Pubitemid 129608959)
    • (1999) Theoretical Computer Science , vol.221 , Issue.1-2 , pp. 19-39
    • Bartal, Y.1    Leonardi, S.2
  • 11
    • 85008020169 scopus 로고    scopus 로고
    • Trade-offs between stretch factor and load-balancing ratio in routing on growth-restricted graphs
    • J. Gao and L. Zhang. Trade-offs between stretch factor and load-balancing ratio in routing on growth-restricted graphs. IEEE Trans. on Parallel and Distributed Systems, 20(2):171-179, 2009.
    • (2009) IEEE Trans. on Parallel and Distributed Systems , vol.20 , Issue.2 , pp. 171-179
    • Gao, J.1    Zhang, L.2
  • 12
    • 0000629443 scopus 로고    scopus 로고
    • Dynamic source routing in ad hoc wireless networks
    • chapter 5
    • D. B. Johnson and D. A. Maltz. Dynamic source routing in ad hoc wireless networks. In Mobile Computing, volume 353, chapter 5. 1996.
    • (1996) Mobile Computing , vol.353
    • Johnson, D.B.1    Maltz, D.A.2
  • 14
    • 33751074448 scopus 로고    scopus 로고
    • Improved bounds for the unsplittable flow problem
    • DOI 10.1016/j.jalgor.2004.07.006, PII S0196677404001397
    • P. Kolman and C. Scheideler. Improved bounds for the unsplittable flow problem. J. of Algorithms, 61(1):20-44, 2006. (Pubitemid 44767713)
    • (2006) Journal of Algorithms , vol.61 , Issue.1 , pp. 20-44
    • Kolman, P.1    Scheideler, C.2
  • 16
    • 46749156674 scopus 로고    scopus 로고
    • Ad-hoc networks beyond unit disk graphs
    • F. Kuhn, R. Wattenhofer, and A. Zollinger. Ad-hoc networks beyond unit disk graphs. Wireless Networks, 14(5):715-729, 2008.
    • (2008) Wireless Networks , vol.14 , Issue.5 , pp. 715-729
    • Kuhn, F.1    Wattenhofer, R.2    Zollinger, A.3
  • 17
    • 40749131715 scopus 로고    scopus 로고
    • An algorithmic approach to geographic routing in ad hoc and sensor networks
    • F. Kuhn, R. Wattenhofer, and A. Zollinger. An algorithmic approach to geographic routing in ad hoc and sensor networks. IEEE/ACM Transactions on Networking, 16:51-62, 2008.
    • (2008) IEEE/ACM Transactions on Networking , vol.16 , pp. 51-62
    • Kuhn, F.1    Wattenhofer, R.2    Zollinger, A.3
  • 21
    • 11144307932 scopus 로고    scopus 로고
    • A survey of geocast routing protocols
    • C. Maihofer. A survey of geocast routing protocols. Communications Surveys & Tutorials, 6(2):32-42, 2004.
    • (2004) Communications Surveys & Tutorials , vol.6 , Issue.2 , pp. 32-42
    • Maihofer, C.1
  • 24
    • 57049141635 scopus 로고    scopus 로고
    • Optimal hierarchical decompositions for congestion minimization in networks
    • H. Räcke. Optimal hierarchical decompositions for congestion minimization in networks. In Proc. 40th Symp. on Theory of Computing (STOC), pages 255-263, 2008.
    • (2008) Proc. 40th Symp. on Theory of Computing (STOC) , pp. 255-263
    • Räcke, H.1
  • 26
    • 0032621035 scopus 로고    scopus 로고
    • A review of current routing protocols for ad-hoc mobile wireless networks
    • April
    • E. Royer and C. Toh. A review of current routing protocols for ad-hoc mobile wireless networks. In IEEE Personal Communications, volume 6, April 1999.
    • (1999) IEEE Personal Communications , vol.6
    • Royer, E.1    Toh, C.2
  • 28
    • 0021386815 scopus 로고
    • OPTIMAL TRANSMISSION RANGES FOR RANDOMLY DISTRIBUTED PACKET RADIO TERMINALS
    • H. Takagi and L. Kleinrock. Optimal transmission ranges for randomly distributed packet radio terminals. IEEE Transactions on Communications, 32(3):246-257, 1984. (Pubitemid 14544854)
    • (1984) IEEE Transactions on Communications , vol.COM-32 , Issue.3 , pp. 246-257
    • Takagi, H.1    Kleinrock, L.2
  • 30
    • 0042878478 scopus 로고    scopus 로고
    • Multicast over Wireless Networks
    • DOI 10.1145/585597.585598
    • U. Varshney. Multicast over wireless networks. Communications of the ACM, 45(12):31-37, 2002. (Pubitemid 135700547)
    • (2002) Communications of the ACM , vol.45 , Issue.12 , pp. 31-37
    • Varshney, U.1


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