Novel Approach to Sub-graph Selection over Coded Wireless Networks with QoS Constraints

References

• S. Chen, and K. Nahrstedt, “An overview of quality-of-service routing for the next generation high-speed networks: Problems and solutions,” IEEE Network, Special Issue on Transmission and Distribution of Digital Video, Vol. 12, pp. 64–79, Nov./Dec. 1998.
   Google Scholar
• B. Zhang, and H. T. Mouftah, “QoS routing for wireless ad hoc networks: Problems, algorithms, and protocols,” IEEE Commun. Magazine, Vol. 43, pp. 110–7, Oct. 2005.
   Web of Science ®Google Scholar
• R. Ahlswede, N. Cai, S. Y. R. Li, and R. W. Yeung, “Network information flow,” IEEE Trans. Inform. Theory, Vol. 46, pp. 1204–16, Jul. 2000.
   Web of Science ®Google Scholar
• D. S. Lun, N. Ratnakar, M. Medard, R. Koetter, D. Karger, T. Ho, E. Ahmed, and F. Zhao, “Minimum-cost multicast over coded packet networks,” IEEE Trans. Inform. Theory, Vol. 52, no. 6, pp. 2608–23, Jun. 2006.
   Web of Science ®Google Scholar
• S. Y. R. Li, R. W. Yeung, and N. Cai, “Linear network coding,” IEEE Trans. Inform. Theory, Vol. 49, no. 2, pp. 371–81, Feb. 2003.
   Web of Science ®Google Scholar
• S. Jaggi, P. Sanders, P. A. Chou, M. Effros, S. Egner, K. Jain, and L. Tolhuizen, “Polynomial time algorithms for multicast,” IEEE Trans. Inform. Theory, Vol. 51, no. 6, pp. 1973–82, Jun. 2005.
   Google Scholar
• P. A. Chou, Y. Wu, and K. Jain, “Practical network coding,” presented at the Allerton Conference on Communication, Control, and Computing, Monticello, IL, Oct. 2003. Invited paper.
   Google Scholar
• Z. Li, and B. Li, “Network coding in undirected networks,” presented at the Proceeding of the 38th Annual Conference on Information Sciences and Systems, Princeton, NJ, pp. 17–19, Mar. 2004.
   Google Scholar
• W. Yeung, S. Yen, R. Li, N. Cai, and Z. Zhang, “Network coding theory,” Found. Trends Commun. Inf. Theory, Vol. 2, no. 4, pp. 241–329, Jun. 2006.
   Google Scholar
• D. S. Lun, M. Medard, and M. Effros, “On coding for reliable communication over packet networks,” presented at the Proceedings of the 42nd Annual Allerton Conference on Communication, Control, and Computing, Monticello, IL, Oct. 2004. Invited paper.
   Google Scholar
• N. Cai, and R. W. Yeung, “Secure network coding,” in Proceedings of the IEEE International Symposium on Information Theory (ISIT), Lausanne, Switzerland, Jun. 2002, p. 323.
   Google Scholar
• C. Fragouli, J.-Y. L. Boudec, and J. Widmer, “Network coding: An instant primer,” SIGCOMM Comput. Commun. Rev., Vol. 36, p. 63, 2006.
   Web of Science ®Google Scholar
• Y. Wu, and S.-Y. Kung, “Distributed utility maximization for network coding based multicasting: A shortest path approach”, IEEE J. Sel. Areas Commun., Vol. 24, no. 8, pp. 1475–88, Aug. 2006.
   Web of Science ®Google Scholar
• Y. Xi, and E. M. Yeh, “Distributed algorithms for minimum cost multicast with network coding,” IEEE NetCod Workshop, pp. 1–9, Apr. 2006.
   Google Scholar
• Y. Xi, and E. M. Yeh, “Distributed algorithms for minimum cost multicast with network coding in wireless networks,” presented at the Proceedings of the 4th International Symposium on Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks (WiOpt ‘06),” Boston, MA, pp. 12–19, Apr. 2006.
   Google Scholar
• G. Desaulniers, J. Desrosiers, and M. M. Solomon, Ed., Column Generation. Berlin: Springer, 2005.
   Google Scholar
• K. Holmberg, and D. Yuan, “A multicommodity network-flow problem with side constraints on paths solved by column generation,” Informs J. Comput., Vol. 15, no. 1, pp. 42–57, 2003.
   Web of Science ®Google Scholar
• R. K. Ahuja, T. L. Magnanti, and J. B. Orlin, Network Flows: Theory, Algorithms, and Applications. Upper Saddle River, NJ: Prentice-Hall, 1993.
   Google Scholar
• M. R. Garey, and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness. New York: W. H. Freeman and Company, 1979.
   Google Scholar
• Y. P. Aneja, and K. K. Nair, “The constrained shortest path problem,” Naval Res. Logistic Q., Vol. 52, pp. 549–55, 1978.
   Google Scholar
• J. M. Jaffe, “Algorithms for finding paths with multiple constraints,” Networks, Vol. 14, pp. 95–116, 1984.
   Web of Science ®Google Scholar
• M. Desrochers, and F. Soumis, “A generalized permanent labelling algorithm for the shortest path problem with time windows,” INFOR, Vol. 26, pp. 191–212, 1988.
   Web of Science ®Google Scholar
• M. Parsa, Q. Zhu, and J. J. G.-L. Aceves, “An iterative algorithm for delay-constrained minimum cost multicast,” IEEE/ACM Trans. Networking, Vol. 6, pp. 213–9, 2001.
   Google Scholar
• R. Sriram, G. Manimaran, and C. Murthy, “Algorithms for delay-constrained low-cost multicast tree construction,” Comput. Commun., Vol. 21, pp. 1693–706, 1998.
   Web of Science ®Google Scholar
• H. Youssef, A. A. Mulhem, S. Sait, and M. Tahir, “QoS-driven multicast tree generation using tabu search,” Comput. Commun., Vol. 25, pp. 1140–9, 2002.
   Web of Science ®Google Scholar