TY - GEN
T1 - Achieving the Capacity Bounds of Multicast in Large-Scale Wireless Networks
AU - Lu, Kejie
AU - Liu, Wang
AU - Wang, Jianping
AU - Zhang, Tao
AU - Fu, Shengli
N1 - Full text of this publication does not contain sufficient affiliation information. With consent from the author(s) concerned, the Research Unit(s) information for this record is based on the existing academic department affiliation of the author(s).
PY - 2010
Y1 - 2010
N2 - In the past few years, the capacity of multicast traffic in large-scale random wireless networks has attracted considerable attention because of the fundamental importance of network capacity and the multicast applications. However, there are still significant gaps between the upper bounds and the constructive lower bounds. In this paper, we develop a novel percolation highway system with which the constructive lower bounds can arbitrarily approach the upper bounds. ©2010 IEEE.
AB - In the past few years, the capacity of multicast traffic in large-scale random wireless networks has attracted considerable attention because of the fundamental importance of network capacity and the multicast applications. However, there are still significant gaps between the upper bounds and the constructive lower bounds. In this paper, we develop a novel percolation highway system with which the constructive lower bounds can arbitrarily approach the upper bounds. ©2010 IEEE.
UR - https://www.scopus.com/pages/publications/77955693270
UR - https://www.scopus.com/record/pubmetrics.uri?eid=2-s2.0-77955693270&origin=recordpage
U2 - 10.1109/ISIT.2010.5513677
DO - 10.1109/ISIT.2010.5513677
M3 - RGC 32 - Refereed conference paper (with host publication)
SN - 9781424469604
SN - 9781424478903
SN - 9781424478927
SP - 2328
EP - 2332
BT - 2010 IEEE International Symposium on Information Theory - Proceedings
PB - IEEE
T2 - 2010 IEEE International Symposium on Information Theory (ISIT 2010)
Y2 - 13 June 2010 through 18 June 2010
ER -