TY - GEN
T1 - Scaling laws on multicast capacity of large scale wireless networks
AU - Wang, Cheng
AU - Li, Xiang Yang
AU - Jiang, Changjun
AU - Tang, Shaojie
AU - Liu, Yunhao
AU - Zhao, Jizhong
PY - 2009
Y1 - 2009
N2 - In this paper, we focus on the networking-theoretic multicast capacity for both random extended networks (REN) and random dense networks (RDN) under Gaussian Channel model, when all nodes are individually power-constrained. During the transmission, the power decays along path with the attenuation exponent α > 2. In REN and RDN, n nodes are randomly distributed in the square region with side-length √n and 1, respectively. We randomly choose n B nodes as the sources of multicast sessions, and for each source v, we pick uniformly at random n d nodes as the destination nodes. Based on percolation theory, we propose multicast schemes and analyze the achievable throughput by considering all possible values of n s and n d · As a special case of our results, we show that for n s = Θ(n), the per-session multicast capacity of RDN is Θ Equation Persented when n d = O Equation Persented and is Θ(1/n) when n d = Ω Equation Persented the per-session multicast capacity of REN is Θ Equation Persented when n d = O Equation Persented and is Θ Equation Persented when n d = Ω Equation Persented.
AB - In this paper, we focus on the networking-theoretic multicast capacity for both random extended networks (REN) and random dense networks (RDN) under Gaussian Channel model, when all nodes are individually power-constrained. During the transmission, the power decays along path with the attenuation exponent α > 2. In REN and RDN, n nodes are randomly distributed in the square region with side-length √n and 1, respectively. We randomly choose n B nodes as the sources of multicast sessions, and for each source v, we pick uniformly at random n d nodes as the destination nodes. Based on percolation theory, we propose multicast schemes and analyze the achievable throughput by considering all possible values of n s and n d · As a special case of our results, we show that for n s = Θ(n), the per-session multicast capacity of RDN is Θ Equation Persented when n d = O Equation Persented and is Θ(1/n) when n d = Ω Equation Persented the per-session multicast capacity of REN is Θ Equation Persented when n d = O Equation Persented and is Θ Equation Persented when n d = Ω Equation Persented.
KW - Achievable throughput
KW - Multicast capacity
KW - Percolation
KW - Random networks
KW - Wireless ad hoc networks
UR - https://www.scopus.com/pages/publications/70349686657
U2 - 10.1109/INFCOM.2009.5062107
DO - 10.1109/INFCOM.2009.5062107
M3 - Conference contribution
AN - SCOPUS:70349686657
SN - 9781424435135
T3 - Proceedings - IEEE INFOCOM
SP - 1863
EP - 1871
BT - IEEE INFOCOM 2009 - The 28th Conference on Computer Communications
T2 - 28th Conference on Computer Communications, IEEE INFOCOM 2009
Y2 - 19 April 2009 through 25 April 2009
ER -