Non-asymptotic multicast throughput capacity in multi-hop wireless networks

Previous works on multicast capacity mainly focus on deriving asymptotic order results in large-scale wireless networks, which can explore the general scaling laws of throughput capacity but cannot predict the exact achievable throughput. In this paper, we investigate the non-asymptotic capacity of multihop wireless networks for multicast applications wherein for each source node, k nodes are randomly selected as receivers. Since multicast routing has a dynamic nature, it is challenging for the exact performance analysis. To tackle the problem, we propose an explicit analytical model which describes multicast transmissions, considers networks of arbitrary size, takes data burst into account, and also covers the notion of time scales for transient analysis. By developing a practical multicast scheme, stochastic network calculus is employed for the exact analysis. With the analytical model, we derive lower and upper bounds on multicast capacity, which are non-asymptotic functions of the above variables, and also recover the scaling laws from an asymptotic point of view. Simulations further verify the accuracy of the analytical bounds.

[1]  Florin Ciucu,et al.  On the scaling of non-asymptotic capacity in multi-access networks with bursty traffic , 2011, 2011 IEEE International Symposium on Information Theory Proceedings.

[2]  R. Weber,et al.  Buffer overflow asymptotics for a buffer handling many traffic sources , 1996, Journal of Applied Probability.

[3]  Panganamala Ramana Kumar,et al.  RHEINISCH-WESTFÄLISCHE TECHNISCHE HOCHSCHULE AACHEN , 2001 .

[4]  Yan Gao,et al.  Determining the end-to-end throughput capacity in multi-hop networks: methodology and applications , 2006, SIGMETRICS '06/Performance '06.

[5]  Qian Zhang,et al.  A power controlled interference aware routing protocol for dense multi-hop wireless networks , 2008, Wirel. Networks.

[6]  Walid Saad,et al.  Network Formation Games Among Relay Stations in Next Generation Wireless Networks , 2011, IEEE Transactions on Communications.

[7]  Xinbing Wang,et al.  Optimal Multicast Capacity and DelayTradeoffs in MANETs , 2014, IEEE Trans. Mob. Comput..

[8]  R. Srikant,et al.  The multicast capacity of large multihop wireless networks , 2010, TNET.

[9]  Xiang-Yang Li.  Multicast capacity of wireless ad hoc networks , 2009, TNET.

[10]  Moshe Sidi,et al.  Performance and stability of communication networks via robust exponential bounds , 1993, TNET.

[11]  Yuming Jiang.  A basic stochastic network calculus , 2006, SIGCOMM 2006.

[12]  Florin Ciucu,et al.  Delay Bounds in Communication Networks With Heavy-Tailed and Self-Similar Traffic , 2009, IEEE Transactions on Information Theory.

[13]  Florin Ciucu,et al.  Scaling properties of statistical end-to-end bounds in the network calculus , 2006, IEEE Transactions on Information Theory.