Abstract
In this paper first the problem of secure minimum-cost multicast with network coding is studied, while the maximum end-to-end parameters, such as security, delay, and rate are assumed to be bounded in one multicast session. We present a decentralized algorithm that computes minimum-cost QoS flow subgraphs in network coded multicast networks. In next stage we generalize this idea to interference-limited dynamic networks where capacities are functions of the signal-to-noise-interference ratio (SINR). Since dynamic link capacities can be controlled by varying transmission powers, minimum-cost multicast must be achived by jointly optimizing network coding subgraphs with power control schemes. Simulation results shows this approach provides an efficient way for solving the optimization problem. The optimization numerical results show that using power control algorithm, higher success ratio is obtained, in comparison with previous algorithms.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Chen, S., Nahrstedt, K.: 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, 64–79 (November/December 1998)
Wang, B., Hou, J.C.: Multicast Routing and Its QoS Extension: Problems, Algorithms, and Protocols. IEEE Network 14(1), 22–36 (2000)
Zhang, X., Li, B.: Optimized multipath network coding in lossy wireless networks. In: Proc. of ICDCS 2008 (2008)
Lun, D.S., Ratnakar, N., Medard, M., Koetter, R., Karger, D., Ho, T., Ahmed, E., Zhao, F.: Minimum-cost multicast over coded packet networks. IEEE Trans. Inform. Theory 52(6), 2608–2623 (2006)
Low, S.H., Lapsley, D.E.: Optimization flow control, I: basic algorithm and convergence. IEEE/ACM Transactions on Networking 7(6), 861–874 (1999), http://netlab.caltech.edu
Li, S.-Y.R., Yeung, R.W., Cai, N.: Linear network coding. IEEE Trans. Inform. Theory 49(2), 371–381 (2003)
Jaggi, S., Sanders, P., Chou, P.A., Effros, M., Egner, S., Jain, K., Tolhuizen, L.: Polynomial Time Algorithms for Multicast Network Code Construction. IEEE Transactions on Information Theory 51(6), 1973–1982 (2005)
Fragouli, C., Boudec, J.-Y.L., Widmer, J.: Network Coding: An instant primer. SIGCOMM Comput. Commun. Rev. 36, 63 (2006)
Chou, P.A., Wu, Y., Jain, K.: Practical network coding. In: Allerton Conference on Communication, Control, and Computing (2003)
Julian, D., Chiang, M., O’Neill, D., Boyd, S.: QoS and fairness constrained convex optimization of resource allocation for wireless cellular and ad hoc networks. In: Proc. IEEE INFOCOM, New York, USA, pp. 477–486 (June 2002)
Chen, S., Shavitt, Y.: A Scalable Distributed QoS Multicast Routing Protocol. In: Proc. IEEE International Conference on Communications (ICC), vol. 2, pp. 1161–1165 (2004)
Desaulniers, G., Desrosiers, J., Solomon, M.M. (eds.): Column generation. Springer, Berlin (2005)
Yeung, W., Yen, S., Li, R., Cai, N., Zhang, Z.: Network Coding Theory. Now Publishers Inc. (June 2006)
Li, Z., Li, B.: Network Coding in Undirected networks. In: Proc. 38th Annu. Conf. Information Sciences and Systems, Princeton, NJ (March 2004)
Salavati, A.H., Aref, M.R.: A New Framework for Solving Multi constraint Network QoS Provisioning Problems in Polynomial Time (2009)
Yang, H., Luo, H., Ye, F.: Security and Privacy in Sensor Networks. IEEE Wireless Communications 11, 38–47
Ho, T., Koetter, R., Mdard, M., Karger, D.R., Effros, M.: The Benefits of Coding Over Routing in a Randomized Setting. In: Proc. IEEE Int. Symp. Information Theory, Yokohama, Japan, p. 442 (June/July 2003)
Palomar, D., Chiang, M.: A Tutorial on Decomposition Method and Distributed Network Resource Allocation. IEEE J. Sel. Areas Commun. 24, 1439 (2006)
Bertsekas, D.P.: Nonlinear Programming, 2nd edn. Athena Scientific, Belmont (1999)
Salavati, A.H.: Quality of Service Network Coding. Msc thesis. Sharif university of technology (September 2008)
Boyd, S., Vandenberghe, L.: Convex Optimization. Cambridge Univ. Press, Cambridge (2004)
Xi, Y., Yeh, E.M.: Distributed algorithms for minimum cost multicast with network coding. In: Proceedings of the 43rd Allerton Annual Conference on Communication, Control, and Computing (September 2005)
Gallager, R.: A minimum delay routing algorithm using distributed computation. IEEE Transactions on Communications 25(1), 73–85 (1977)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Mohajer, A., Mazoochi, M., Niasar, F.A., Ghadikolayi, A.A., Nabipour, M. (2013). Network Coding-Based QoS and Security for Dynamic Interference-Limited Networks. In: Kwiecień, A., Gaj, P., Stera, P. (eds) Computer Networks. CN 2013. Communications in Computer and Information Science, vol 370. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-38865-1_29
Download citation
DOI: https://doi.org/10.1007/978-3-642-38865-1_29
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-38864-4
Online ISBN: 978-3-642-38865-1
eBook Packages: Computer ScienceComputer Science (R0)