Subscribe

Issue No.12 - Dec. (2013 vol.24)

pp: 2418-2428

Luoyi Fu , Shanghai Jiao Tong University, Shanghai

Xinbing Wang , Shanghai Jiao Tong University, Shanghai

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TPDS.2012.334

ABSTRACT

This paper addresses the issue of multicast scaling performance in multichannel multiradio (MC-MR) networks. Under the assumption of both limited bandwidth and node tunability, a total fixed bandwidth $(W)$ is equally split into $(c)$ channels with $(0<m\le c)$ interfaces equipped on each node for channel switching. The network contains totally $(n)$ nodes, each serving as a source with $(k)$ randomly and uniformly selected destinations. We try to give a comprehensive picture of multicast scalings by investigating both the static and mobile networks, with the metrics being capacity and delay. Previous literature has indicated that unicast capacity is solely determined by the ratio of channels to interfaces $(c/m)$ in MC-MR networks. However, in multicast our problem is made more complicated by the interplay among $(k)$, $(c/m)$ and node mobility (if considered in mobile scenario). We characterize their impact on multicast scaling and obtain three remarkable findings from our results. First, we find capacity loss exists in static networks even if the ratio $(c/m=O(\log n))$ (We use the following notation throughout our paper: $(f(n)=O(g(n))\Leftrightarrow \limsup _{n\rightarrow \infty }{f(n)\over g(n)} <\infty)$, $(f(n)=\Omega (g(n))\Leftrightarrow \liminf _{n\rightarrow \infty }{f(n)\over g(n)} <\infty)$, $(f(n)=\Theta (g(n))\Leftrightarrow f(n)=O(g(n)))$ and $(g(n)=O(f(n)))$, $(f(n)=\widetilde{\Theta }(\cdot ))$: The corresponding order $(\Theta (\cdot ))$ which contains a logarithmic order.) when $(k)$ is close to $(\Theta (n))$. This differs from unicast that is free of capacity loss as long as $(c/m=O(\log n))$. Second, mobility is manifested to improve multicast capacity in MC-MR networks, where two major capacity bottlenecks, i.e., connectivity and interference constraints, in static networks can be effectively broken. Third, a largely reduced delay is possible by simply seeking for multichannel reuse in 2-hop algorithm without redundancy. This even outperforms the delay scaling in single channel framework , where a delay smaller than $(\Theta (\sqrt{n\log k}))$ is not achievable even with more than $(\Theta (\sqrt{n\log k}))$ relay nodes involved in 2-hop mode. As a high-level summary of our results, our work discloses analytically where the performance improvement and degradation exhibit in MC-MR networks, meanwhile unifying the previous bounds on unicast (setting $(k=1)$) in .

INDEX TERMS

Multicast communication, Routing, Mobile communication, Upper bound, Mobile computing, Unicast, Wireless networks,scaling, Multicast, multichannel multiradio

CITATION

Luoyi Fu, Xinbing Wang, "Multicast Scaling Law in Multichannel Multiradio Wireless Networks",

*IEEE Transactions on Parallel & Distributed Systems*, vol.24, no. 12, pp. 2418-2428, Dec. 2013, doi:10.1109/TPDS.2012.334REFERENCES