Towards Optimal Data Transmission by Network Coding
MetadataShow full item record
Communication protocols based on coded schemes and, in particular, network coding promise increased efficiency for future networks. The field is still young. Nevertheless, many important results have been already obtained. In this thesis, network coding is studied in three directions: In one direction, wireless network coding is studied. Wireless communication involves sharing of scarce resources, and special care is required to maximize the utilization of the medium. Network coding, in that sense, has the potential to improve the capacity. There are many issues involved in modeling a wireless network. Adapting all of these issues to network coding is a difficult task. We have considered a simplified model that takes into account the broadcast property and the transmission power. Based on this setting, we analyze some aspects of network coding in wireless networks. In this study, optimization algorithms were needed to compute special flow graphs for network coding. We propose special optimization algorithms for that purpose. We have studied the type of cycles that appear in wireless broadcast networks, and through simulation we observe the penalty of avoiding cycles in wireless network coding. In another direction, the delay is studied from the queueing theoretic point of view, for code based communication protocols. We have improved previous results and propose a better measurement for delay. Finally, we study secure network coding. For secure network coding, a new attack model is studied and the secrecy capacity is improved by a concatenated secret sharing scheme.
Has partsPaper I: Ravanbakhsh, M.; Barbero, Á. I.; Haugland, D.; Ytrehus, Ø., 2009, Power savings of cyclic network coding for multicast on wireless networks. Full text not available in BORA.
Paper II: Ravanbakhsh, M.; Barbero, Á. I.; Ytrehus, Ø., Improved Delay Estimates for a Queueing Model for Random Linear Coding for Unicast, pp. 1413-1417. In: IEEE International Symposium on Information Theory (ISIT) 2009. Copyright 2009 IEEE. Reproduced with permission. Published version. The published version is also available at: http://dx.doi.org/10.1109/ISIT.2009.5205892
Paper III: Ravanbakhsh, M.; Hassanzadeh, M. M.; Haugland, D., Wiretapping Based on Node Corruption over Secure Network Coding: Analysis and Optimization, pp. 154-162. In: Barbero, Á. (ed.), Coding Theory and Applications. Second International Castle Meeting (ICMCTA) 2008. Lecture Notes in Computer Science Vol. 5228. Copyright 2008 Springer-Verlag. Full text not available in BORA due to publisher restrictions. The published version is available at: http://dx.doi.org/10.1007/978-3-540-87448-5_16
Paper IV: Hassanzadeh, M. M.; Ravanbakhsh, M.; Ytrehus, Ø., Two Layer Secure Network Coding - (2-LSNC), pp. 7-12. In: International Symposium on Telecommunications (IST) 2008. Copyright 2008 IEEE. Reproduced with permission. Published version. The published version is also available at: http://dx.doi.org/10.1109/ISTEL.2008.4651263
Paper V: Ravanbakhsh, M.; Haugland, D., Heuristic Methods for Flow Graph Selection in Integral Network Coding, 8 p. Reports in Informatics no. 391. Bergen : University of Bergen, Department of Informatics, 2009. Reproduced with permission. Published version.