[KSCI] Korea Science Citation Index Service

The Throughput Order of Multicast Traffics with Physical-Layer Network Coding in Random Wireless Ad Hoc Networks

Chen, Chen (School of Electronics Engineering and Computer Science, Peking University)
Bai, Lin (School of Electronic and Information Engineering, Beihang University)
He, Jianhua (College of Engineering, Swansea University)
Xiang, Haige (School of Electronics Engineering and Computer Science, Peking University)
Choi, Jin-Ho (College of Engineering, Swansea University)

Publication Information

Journal of Communications and Networks / v.13, no.3, 2011 , pp. 214-220 More about this Journal

Abstract

This paper attempts to address the effectiveness of physical-layer network coding (PNC) on the throughput improvement for multi-hop multicast in random wireless ad hoc networks (WAHNs). We prove that the per session throughput order with PNC is tightly bounded as ${\Theta}((n\sqrt{m}R(n))^{-1})$ if $m=(R^{-2}(n))$ , where n is the total number of nodes, R(n) is the communication range, and m is the number of destinations for each multicast session. We also show that per-session throughput order with PNC is tight bounded as ${\Theta}(n^{-1})$ , when $m={\Omega}(R^{-2}(n))$ . The results of this paper imply that PNC cannot improve the throughput order of multicast in random WAHNs, which is different from the intuition that PNC may improve the throughput order as it allows simultaneous signal access and combination.

Keywords

Physical-layer network coding (PNC); throughput capacity; wireless ad hoc networks (WAHNs);

Citations & Related Records

Times Cited By Web Of Science : 0 (Related Records In Web of Science)
Times Cited By SCOPUS : 0

Reference

1	Z. Wang, S. Karande, H. Sadjadpour, and J. Garcia-Luna-Aceves, "On the capacity improvement of multicast traffic with network coding," in Proc. IEEE MILCOM, 2008, pp. 1-7.
2	S. H. Lim, Y.-H. Kim, A. E. Gamal, and S.-Y. Chung, "Noisy network coding," submitted to IEEE Trans. Inf. Theory, 2010.
3	M. Grossglauser and D. Tse, "Mobility increases the capacity of ad hoc wireless networks," IEEE/ACM Trans. Netw., vol. 10, no. 4, pp. 447-486, 2002.
4	P. Gupta and P. R. Kumar, "The capacity of wireless networks," IEEE Trans. Inf. Theory, vol. 46, no. 2, pp. 388-404, 2000. DOI ScienceOn
5	J. Garcia-Luna-Aceves, H. R. Sadjadpour, and Z. Wang, "Challenges: Towards truly scalable ad hoc networks;' in Proc. MOBICOM, 2007, pp. 207-214.
6	S. Avestimehr, S. Diggavi, and D. Tse, "Wireless network information flow: A deterministic approach," submitted to IEEE Trans. Inf. Theory, 2009.
7	S. Shakkottai, X. Liu, and R. Srikant, "The multicast capacity of wireless ad-hoc networks," in Proc. MobiHoc, 2007, pp. 247-255.
8	Z. Wang, H. Sadjadpour, and J. Garcia-Luna-Aceves, "A unifying perspective on the capacity of wireless ad hoc networks," in Proc. IEEE INFOCOM, 2008, pp. 211-215.
9	B. Tavli, "Broadcast capacity of wireless networks," IEEE Commun. Lett., vol. 10, no. 2, pp. 68-69, 2006. DOI ScienceOn
10	A. Keshavarz, V. Ribeiro, and R. Riedi, "Broadcast capacity in multihop wireless networks," in Proc. MOBICOM, 2006, pp. 239-250.
11	R. Ahlswede, N. Cai, S.-Y. R. Li, and R. W. Yeung, "Network information flow," IEEE Trans. Inf. Theory, vol. 46, no. 4, pp. 1204-1216, 2000. DOI ScienceOn
12	S. Katti, S. Gollakota, and D. Katabi, "Embracing wireless interference: Analog network coding," in Proc. SIGCOMM, 2007, pp. 397-408.
13	S. Karande, Z. Wang, and H. R. Sadjadpour, and J. J. Garcia-Luna-Aceves, "Multicast throughput order of network coding in wireless ad-hoc networks," in Proc. SECON, 2009, pp. 247-255.
14	S. Zhang, S.-C. Liew, and P. Lam, "Hot topic: Physical-layer network coding," in Proc. MOBICOM, 2006, pp. 358-365.
15	S. Karande, Z. Wang, H. Sadjadpour, and J. Garcia-Luna-Aceves, "Network coding does not change the multicast throughput order of wireless ad hoc networks," in Proc. IEEE ICC, 2009, pp. 689-693.
16	X.-Y. Li, S.-J. Tang, and O. Frieder, "Multicast capacity for large scale wireless ad hoc networks," in Proc. MOBICOM, 2007, pp. 207-214.
17	J. Liu, D. Goeckel, and D. Towsley, "Bounds on the gain of network coding and broadcasting in wireless networks," University of Massachusetts, Amherst, Tech. Rep., 2007.
18	M. Steele, "Growth rates of euclidean minimal spanning trees with power weighted edges," The Ann. Probability, vol. 16, no. 4, pp. 1767-1787, 1988. DOI ScienceOn
19	R. Motwawni and P. Raghavan, Randomized Algorithms, 1995.
20	S. Kulkarni and P. Viswanath, "Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms;" J. ACM, vol. 46, no. 6, pp. 787-832, 2004.
21	J. Liu, D. Goeckel, and D. Towsley, "Bounds on the gain of network coding and broadcasting in wireless networks," in Proc. IEEE INFOCOM, 2007, pp.724-732.