메뉴 건너뛰기




Volumn , Issue , 2009, Pages 1881-1889

The multicast capacity region of large wireless networks

Author keywords

[No Author keywords available]

Indexed keywords

BOTTOM LAYERS; CHANNEL CHARACTERISTICS; COOPERATIVE COMMUNICATION; DESTINATION NODES; EXPLICIT INFORMATION; GAUSSIAN FADING CHANNELS; MULTI-HOPPING; MULTICAST CAPACITY; SOURCE NODES; TRAFFIC DEMANDS; TWO LAYERS;

EID: 70349682338     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/INFCOM.2009.5062109     Document Type: Conference Paper
Times cited : (8)

References (22)
  • 1
    • 85056059061 scopus 로고    scopus 로고
    • Multicast operation of the ad hoc on-demand distance vector routing protocol
    • Procs, Seattle, WA, August
    • E. M. Royer and C. E. Perkins, "Multicast operation of the ad hoc on-demand distance vector routing protocol," Procs. ACM MobiCom, Seattle, WA, August 1999.
    • (1999) ACM MobiCom
    • Royer, E.M.1    Perkins, C.E.2
  • 4
    • 0033894011 scopus 로고    scopus 로고
    • On the Construction of Energy-Efficient Broadcast and Multicast Trees in Wireless Networks
    • Procs, Tel-Aviv, Israel, March
    • J. E. Wieselthier, G. D. Nguyen, and A. Ephremides, "On the Construction of Energy-Efficient Broadcast and Multicast Trees in Wireless Networks," Procs. IEEE INFOCOM, Tel-Aviv, Israel, March 2000.
    • (2000) IEEE INFOCOM
    • Wieselthier, J.E.1    Nguyen, G.D.2    Ephremides, A.3
  • 5
    • 33747142749 scopus 로고    scopus 로고
    • The capacity of wireless networks
    • March
    • P. Gupta and P. R. Kumar, "The capacity of wireless networks," IEEE Trans. Inform. Theory, 46(2):388-404, March 2000.
    • (2000) IEEE Trans. Inform. Theory , vol.46 , Issue.2 , pp. 388-404
    • Gupta, P.1    Kumar, P.R.2
  • 6
    • 35148893949 scopus 로고    scopus 로고
    • Hierarchical cooperation achieves optimal capacity scaling in ad hoc networks
    • October
    • A. Özgür, O. Lévêque, and D. N. C. Tse, "Hierarchical cooperation achieves optimal capacity scaling in ad hoc networks," IEEE Trans. Inform. Theory, 53(10):3549-3572, October 2007.
    • (2007) IEEE Trans. Inform. Theory , vol.53 , Issue.10 , pp. 3549-3572
    • Özgür, A.1    Lévêque, O.2    Tse, D.N.C.3
  • 7
    • 84888054847 scopus 로고    scopus 로고
    • On capacity scaling in arbitrary wireless networks
    • November 2007. Available online at
    • U. Niesen, P. Gupta, and D. Shah, "On capacity scaling in arbitrary wireless networks," submitted to IEEE Trans. Inform. Theory, November 2007. Available online at http://arxiv.org/abs/0711.2745.
    • submitted to IEEE Trans. Inform. Theory
    • Niesen, U.1    Gupta, P.2    Shah, D.3
  • 8
    • 33746625258 scopus 로고    scopus 로고
    • Scaling laws for ad-hoc wireless networks: An information theoretic approach
    • F. Xue and P. R. Kumar. Scaling laws for ad-hoc wireless networks: An information theoretic approach. Foundation and Trends in Networking, 1(2), 2006.
    • (2006) Foundation and Trends in Networking , vol.1 , Issue.2
    • Xue, F.1    Kumar, P.R.2
  • 9
    • 41949090957 scopus 로고    scopus 로고
    • Product multicommodity flow in wireless networks
    • April
    • R. Madan, D. Shah, and O. Lévêque, "Product multicommodity flow in wireless networks," IEEE Trans. Inform. Theory, 54(4): 1460-1476, April 2008.
    • (2008) IEEE Trans. Inform. Theory , vol.54 , Issue.4 , pp. 1460-1476
    • Madan, R.1    Shah, D.2    Lévêque, O.3
  • 10
    • 0000652415 scopus 로고
    • The geometry of graphs and some of its algorithmic applications
    • June
    • N. Linial, E. London, and Y. Rabinovich, "The geometry of graphs and some of its algorithmic applications," Combinatorica, 15(2):215-245, June 1995.
    • (1995) Combinatorica , vol.15 , Issue.2 , pp. 215-245
    • Linial, N.1    London, E.2    Rabinovich, Y.3
  • 11
    • 51349125353 scopus 로고    scopus 로고
    • Optimal geographic routing for wireless networks with near-arbitrary holes and traffic
    • Procs, Pheonix, AZ, Apr. 13-18
    • S. Subramanian, S. Shakkottai, and P. Gupta, "Optimal geographic routing for wireless networks with near-arbitrary holes and traffic," Procs. IEEE INFOCOM, Pheonix, AZ, Apr. 13-18, 2008.
    • (2008) IEEE INFOCOM
    • Subramanian, S.1    Shakkottai, S.2    Gupta, P.3
  • 12
    • 85009365766 scopus 로고    scopus 로고
    • The capacity region of large wireless networks
    • July 2008. Available online at
    • U. Niesen, P. Gupta, and D. Shah, "The capacity region of large wireless networks," submitted to IEEE Trans. Inform. Theory, July 2008. Available online at http://arxiv.org/abs/0809.1344.
    • submitted to IEEE Trans. Inform. Theory
    • Niesen, U.1    Gupta, P.2    Shah, D.3
  • 13
    • 37749007309 scopus 로고    scopus 로고
    • Multicast capacity for large scale wireless ad hoc networks, Procs
    • X.-Y. Li, S.-J. Tang, and O. Frieder, "Multicast capacity for large scale wireless ad hoc networks," Procs. ACM MobiCom, pages 263-277, 2007.
    • (2007) ACM MobiCom , pp. 263-277
    • Li, X.-Y.1    Tang, S.-J.2    Frieder, O.3
  • 14
    • 37849044341 scopus 로고    scopus 로고
    • The multicast capacity of large multihop wireless networks
    • Procs
    • S. Shakkottai, X. Liu, and R. Srikant, "The multicast capacity of large multihop wireless networks," Procs. ACM MobiHoc, 2007.
    • (2007) ACM MobiHoc
    • Shakkottai, S.1    Liu, X.2    Srikant, R.3
  • 16
    • 20544465186 scopus 로고    scopus 로고
    • Wireless Multicast: Theory and Approaches
    • June
    • P. Chaporkar and S. Sarkar, "Wireless Multicast: Theory and Approaches," IEEE Trans. Inform. Theory, vol. 51, no. 6, pp. 1954-1972, June 2005.
    • (2005) IEEE Trans. Inform. Theory , vol.51 , Issue.6 , pp. 1954-1972
    • Chaporkar, P.1    Sarkar, S.2
  • 18
    • 4444358046 scopus 로고    scopus 로고
    • Geometry of information propagation in massively dense ad hoc networks
    • Procs, Roppongi Hills, Japan, May
    • P. Jacquet, "Geometry of information propagation in massively dense ad hoc networks," Procs. ACM MobiHoc, Roppongi Hills, Japan, May 2004.
    • (2004) ACM MobiHoc
    • Jacquet, P.1
  • 21
    • 0242334165 scopus 로고    scopus 로고
    • An algebraic approach to network coding
    • R. Koetter and M. Medard, "An algebraic approach to network coding," IEEE/ACM Trans. Networking, 11(5):782-795, 2003.
    • (2003) IEEE/ACM Trans. Networking , vol.11 , Issue.5 , pp. 782-795
    • Koetter, R.1    Medard, M.2
  • 22
    • 70349689825 scopus 로고    scopus 로고
    • Separation for network coding
    • Preprint
    • R. Koetter, "Separation for network coding," Preprint, 2007.
    • (2007)
    • Koetter, R.1


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