Abstract
The capacities of wireless networks are increasingly challenged by the traffic stresses generated by data-intensive applications. Multicast is a bandwidth-efficient solution to simultaneously disseminate data to multiple receivers. In this paper, we present NCOM, a network coding based overlay multicast design, that integrates network coding (NC), opportunistic routing (OR), and cross-layer link scheduling to achieve high efficiency and reliability in multi-hop wireless multicast. In NCOM, the source and receivers are connected by an overlay Steiner tree optimized for the minimum OR distance between nodes. With NC, coded packets are opportunistically transmitted along overlay links. The transmissions of adjacent nodes in the overlay multicast are coordinated by a novel multicast acknowledgement scheme and cross-layer MAC scheduling. We implement NCOM in OPNET by customizing the IEEE 802.11b modules. Through OPNET simulations, we demonstrate that NCOM can achieve a higher throughput and lower source transmission redundancy than the existing NC and OR based wireless multicast designs. NCOM can be easily deployed for efficient and reliable multicast in multi-hop wireless networks.





Similar content being viewed by others
References
Ahlswede, R., Cai, N., Li, S.-Y. R., & Yeung, R. W. (2000). Network information flow. IEEE Transactions on Information Theory, 46, 1204–1216.
Gkantsidis, C., Miller, J., & Rodriguez, P. (2006). Anatomy of a P2P content distribution system with network coding. In IPTPS’06.
Chachulski, S., Jennings, M., Katti, S. & Katabi, D. (2007). Trading structure for randomness in wireless opportunistic routing. In Proceedings of the ACM Sigcomm.
Koutsonikolas, D., Hu, Y. C., & Wang, C.-C. (2009). Pacifier: High-throughput, reliable multicast without “crying babies in wireless mesh networks”. In IEEE Infocom 2009, Rio de Janeiro, Brazil, April 19–25, 2009.
Li, L., Ramjee, R., Buddhikot, M. & Miller, S. (2007). Network coding-based broadcast in mobile ad hoc networks. In Proceedings of IEEE INFOCOM, pp. 1739–1747.
Biswas, S., & Morris, R. (Nov 2003). Opportunistic routing in multi-hop wireless networks. In Proceedings of the second workshop on hot topics in networks (HotNets-II), Cambridge, MA, Nov. 2003.
Xiao, L., Johansson, M., & Boyd, S. (2004). Simultaneous routing and resource allocation via dual decomposition. IEEE Transactions on Communications, 52(7), 1136–1144.
Lin, X. & Shroff, N. B. (2004). Joint rate control and scheduling in multihop wireless networks. In 43rd IEEE conference on decision and control.
Eryilmaz, A., & Srikant, R. (2006). Joint congestion control, routing, and mac for stability and fairness in wireless networks. IEEE Journal on Selected Areas in Communications, 24(8), 1514–1524.
Chen, L., Low, S. H., Chiang, M. & Doyle, J. C. (2006). Optimal cross-layer congestion control, routing and scheduling design in ad hoc wireless networks. In Proceedings of IEEE INFOCOM.
Akyol, U., Andrews, M., Gupta, P., Hobby, J. D., Saniee, I., & Stolyar, A. L. (2008). Joint scheduling and congestion control in mobile ad-hoc networks. In Proceedings of IEEE INFOCOM.
Tao Cui Ho, T. L. C. (2007). Distributed minimum cost multicasting with lossless source coding and network coding. In 46th IEEE conference on decision and control, pp. 506–511.
Cui, T., Chen, L., & Ho, T. (2010). On distributed scheduling in wireless networks exploiting broadcast and network coding. IEEE Transactions on Communications, 58(4), 1223–1234.
Liu, Y. (2009). Optimal Cross-layer scheduling for multicast in multi-channel wireless networks. Technical report, Polytechnic Institute of NYU, December 2009. http://eeweb.poly.edu/faculty/yongliu/docs/multicast_tech.pdf
Couto, D. S. J. D., De, D. S. J., Daniel, C., Morris, R., Aguayo, D. & Bicket, J. (2003). A high-throughput path metric for multi-hop wireless routing. In Proceedings of ACM MOBICOM.
Dubois-Ferrire, H., Grossglauser, M. & Vetterli, M. (2007). Least-cost opportunistic routing. In 2007 Allerton conference on communication, control, and computing, Monticello IL, September 2007.
Shah, R. C., Wietholter, S., Wolisz, A. & Rabaey, J. M. (2005). When does opportunistic routing make sense? In IEEE PerSens, Mar. 2005.
Zeng, K., Lou, W., & Zhai, H. (2008). On end-to-end throughput of opportunistic routing in multirate and multihop wireless networks. In IEEE infocom 2008, Phoenix, AZ, April 15–17, 2008.
Le, T. & Liu, Y. (2009). On the capacity of hybrid wireless networks with opportunistic routing. In WASA’09, Boston, USA, August 2009.
Lin, Y., Li, B. & Liang, B. (October 2008). Codeor: Opportunistic routing in wireless mesh networks with segmented network coding. In Proceedings of the 16th IEEE international conference on network protocols (ICNP), Orlando, Florida, USA, October 2008.
Lin, Y., Liang, B., & Li, B. (2010). Slideor: Online opportunistic network coding in wireless mesh networks. INFOCOM’10: Proceedings of the 29th conference on information communications (pp. 171–175). Piscataway, NJ, USA: IEEE Press.
Koutsonikolas, D., Wang, C.-C. & Hu, Y. (March 2010). Ccack: Efficient network coding based opportunistic routing through cumulative coded acknowledgments. In Proceedings of the 29th IEEE conference on computer communications (INFOCOM), San Diego, CA, USA, March 2010.
Reis, C., Mahajan, R., Wetherall, D. & Zahorjan, J. (2006). Measurement-based models of delivery and interference in static wireless networks. In SIGCOMM computer and communications review.
Jannotti, J., Gifford, D. K., Johnson, K. L., Kaashoek, M. F. & O’Toole Jr., J. W. (2000). Overcast: Reliable multicasting with an overlay network. In Proceedings of operating systems design and implementation, pp. 197–212.
Chu, Y., Rao, S. & Zhang, H. (2000). A case for end system multicast. In Proceedings of ACM SIGMETRICS.
Laufer, R., Dubois-Ferrire, H. & Kleinrock, L. (2009). Multirate anypath routing in wireless mesh networks. In IEEE infocom 2009, Rio de Janeiro, Brazil, April 2009.
Dreyfus, S. E. & Wagner, R. A. (1972). The steiner problem in graphs. In Networks, pp. 195–207.
Chazelle, B. (2000). A minimum spanning tree algorithm with inverse-ackermann type complexity. Journal of the ACM (JACM), 47(6), 1028–1047.
Su, C. & Tassiulas, L. (1997). Mobile user’ s memory management to minimize deadline misses of users requests in a data broadcasting system. In Proceedings of 15th international teletraffic congress, June 1997, pp. 223–232.
Acknowledgments
We would like to thank Professor Y. Charlie Hu and Dimitrios Koutsonikolas at School of Electrical and Computer Engineering, Purdue University for discussing with us on Pacifier and CCACK. We got a great help from the Pacifier simulation code from them. We also would like to thank Yuting Zheng, Chang Liu, Sha Hua and Xiwang Yang from Department of Electrical and Computer Engineering, Polytechnic Institute of New York University for their help and discussion on Network Coding and Opportunistic Routing implementation in OPNET.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Le, T., Chen, X. & Liu, Y. NCOM: network coding based overlay multicast in wireless networks. Wireless Netw 21, 187–199 (2015). https://doi.org/10.1007/s11276-014-0748-4
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11276-014-0748-4