Table of Contents Author Guidelines Submit a Manuscript
Mathematical Problems in Engineering
Volume 2015, Article ID 390457, 9 pages
http://dx.doi.org/10.1155/2015/390457
Research Article

Minimum-Energy Wireless Real-Time Multicast by Joint Network Coding and Scheduling Optimization

1College of Computer and Information Engineering, Hohai University, Nanjing 210098, China
2Shanghai Microsystem and Information Technology Research Institute, Chinese Academy of Sciences, Shanghai 200050, China

Received 21 January 2015; Revised 31 March 2015; Accepted 31 March 2015

Academic Editor: Joaquim Joao Judice

Copyright © 2015 Guoping Tan et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. R. Ahlswede, N. Cai, S. R. Li, and R. W. Yeung, “Network information flow,” IEEE Transactions on Information Theory, vol. 46, no. 4, pp. 1204–1216, 2000. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  2. T. Ho, M. Medard, R. Koetter et al., “A random linear network coding approach to multicast,” IEEE Transactions on Information Theory, vol. 52, no. 10, pp. 4413–4430, 2006. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  3. D. S. Lun, N. Ratnakar, M. Medard et al., “Minimum-cost multicast over coded packet networks,” IEEE Transactions on Information Theory, vol. 52, no. 6, pp. 2608–2623, 2006. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  4. Y. Wu, P. A. Chou, and S.-Y. Kung, “Minimum-energy multicast in mobile ad hoc networks using network coding,” IEEE Transactions on Communications, vol. 53, no. 11, pp. 1906–1918, 2005. View at Publisher · View at Google Scholar · View at Scopus
  5. S. H. Lee and S. Vishwanath, “Distributed rate allocation for network-coded multicast networks,” IEEE Communications Letters, vol. 17, no. 11, pp. 2204–2207, 2013. View at Publisher · View at Google Scholar · View at Scopus
  6. Y. Wu and S.-Y. Kung, “Distributed utility maximization for network coding based multicasting: a shortest path approach,” IEEE Journal on Selected Areas in Communications, vol. 24, no. 8, pp. 1475–1488, 2006. View at Publisher · View at Google Scholar · View at Scopus
  7. J. J. Jaramillo, R. Srikant, and L. Ying, “Scheduling for optimal rate allocation in ad hoc networks with heterogeneous delay constraints,” IEEE Journal on Selected Areas in Communications, vol. 29, no. 5, pp. 979–987, 2011. View at Publisher · View at Google Scholar · View at Scopus
  8. J. J. Jaramillo and R. Srikant, “Optimal scheduling for fair resource allocation in Ad hoc networks with elastic and inelastic traffic,” IEEE/ACM Transactions on Networking, vol. 19, no. 4, pp. 1125–1136, 2011. View at Publisher · View at Google Scholar · View at Scopus
  9. K. Rajawat and G. B. Giannakis, “Joint scheduling and network coding for multicast in delay-constrained wireless networks,” IEEE Transactions on Signal Processing, vol. 59, no. 12, pp. 6186–6196, 2011. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  10. D. Traskov, M. Heindlmaier, M. Medard, and R. Koetter, “Scheduling for network-coded multicast,” IEEE/ACM Transactions on Networking, vol. 20, no. 5, pp. 1479–1488, 2012. View at Publisher · View at Google Scholar · View at Scopus
  11. G. P. Fettweis, “The tactile internet: applications and challenges,” IEEE Vehicular Technology Magazine, vol. 9, no. 1, pp. 64–70, 2014. View at Publisher · View at Google Scholar · View at Scopus
  12. M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, W. H. Freeman, New York, NY, USA, 1979. View at MathSciNet
  13. T. Larsson, M. Patriksson, and A.-B. Stroemberg, “Ergodic, primal convergence in dual subgradient schemes for convex programming,” Mathematical Programming, vol. 86, no. 2, pp. 283–312, 1999. View at Publisher · View at Google Scholar · View at MathSciNet
  14. D. Bertsekas and R. Gallager, Data Networks, Prentice-Hall, Upper Saddle River, NJ, USA, 2nd edition, 1992.
  15. L. Tassiulas and A. Ephremides, “Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks,” IEEE Transactions on Automatic Control, vol. 37, no. 12, pp. 1936–1948, 1992. View at Publisher · View at Google Scholar · View at MathSciNet
  16. S. Sakai, M. Togasaki, and K. Yamazaki, “A note on greedy algorithms for the maximum weighted independent set problem,” Discrete Applied Mathematics, vol. 126, no. 2-3, pp. 313–322, 2003. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  17. S. Basagni, “Finding a maximal weighted independent set in wireless networks,” Telecommunication Systems, vol. 18, no. 1–3, pp. 155–168, 2001. View at Publisher · View at Google Scholar · View at Scopus
  18. M. Grant and S. Boyd, “CVX: Matlab software for disciplined convex programming,” September 2013, http://cvxr.com/cvx.
  19. M. Heindlmaier, D. S. Lun, D. Traskov, and M. Medard, “Wireless inter-session network coding—an approach using virtual multicasts,” in Proceedings of the IEEE International Conference on Communications (ICC '11), pp. 1–5, Kyoto, Japan, June 2011. View at Publisher · View at Google Scholar · View at Scopus
  20. M. Esmaeilzadeh and N. Aboutorab, “Inter-session network coding for transmitting multiple layered streams over single-hop wireless networks,” in Proceedings of the IEEE Information Theory Workshop (ITW '14), pp. 401–405, Hobart, Australia, November 2014. View at Publisher · View at Google Scholar