Journal of Communications and Networks

The Korean Institute of Commucations and Information Sciences (한국통신학회)
권호 표지

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)
  • Received : 2010.02.20
  • Accepted : 2010.12.05
  • Published : 2011.06.30
Download PDF
⟨ Previous Next ⟩

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

References

  1. P. Gupta and P. R. Kumar, "The capacity of wireless networks," IEEE Trans. Inf. Theory, vol. 46, no. 2, pp. 388-404, 2000. https://doi.org/10.1109/18.825799
  2. 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.
  3. J. Garcia-Luna-Aceves, H. R. Sadjadpour, and Z. Wang, "Challenges: Towards truly scalable ad hoc networks;' in Proc. MOBICOM, 2007, pp. 207-214.
  4. 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.
  5. 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.
  6. 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.
  7. S. Zhang, S.-C. Liew, and P. Lam, "Hot topic: Physical-layer network coding," in Proc. MOBICOM, 2006, pp. 358-365.
  8. S. Katti, S. Gollakota, and D. Katabi, "Embracing wireless interference: Analog network coding," in Proc. SIGCOMM, 2007, pp. 397-408.
  9. B. Tavli, "Broadcast capacity of wireless networks," IEEE Commun. Lett., vol. 10, no. 2, pp. 68-69, 2006. https://doi.org/10.1109/LCOMM.2006.02013.
  10. A. Keshavarz, V. Ribeiro, and R. Riedi, "Broadcast capacity in multihop wireless networks," in Proc. MOBICOM, 2006, pp. 239-250.
  11. S. Shakkottai, X. Liu, and R. Srikant, "The multicast capacity of wireless ad-hoc networks," in Proc. MobiHoc, 2007, pp. 247-255.
  12. 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.
  13. 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. https://doi.org/10.1109/18.850663
  14. 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.
  15. 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.
  16. S. Avestimehr, S. Diggavi, and D. Tse, "Wireless network information flow: A deterministic approach," submitted to IEEE Trans. Inf. Theory, 2009.
  17. S. H. Lim, Y.-H. Kim, A. E. Gamal, and S.-Y. Chung, "Noisy network coding," submitted to IEEE Trans. Inf. Theory, 2010.
  18. 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.
  19. R. Motwawni and P. Raghavan, Randomized Algorithms, 1995.
  20. M. Steele, "Growth rates of euclidean minimal spanning trees with power weighted edges," The Ann. Probability, vol. 16, no. 4, pp. 1767-1787, 1988. https://doi.org/10.1214/aop/1176991596
  21. 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.