Loading...
| Friend's email | |
| Your name | |
| Your email | |
| enter code | |
This page was sent successfuly
- Type of Document: M.Sc. Thesis
- Language: Farsi
- Document No: 39712 (05)
- University: Sharif University of Technology
- Department: Electrical Engineering
- Advisor(s): Aref, Mohammad Reza; Ashtiani, Farid
- Abstract:
- Network coding generalizes conventional routing algorithms. It considers data streams as mathematical entities which can be processed in the nodes of networks. In this work, after a concise introduction to network coding, we focus on security issues in network coding form an information theoretic point of view. First we introduce fundamental concepts of network coding such as linear network coding and random network coding. Then, we accentuate the advantages and disadvantages of network coding. To investigate security in network coding, we introduce perfect security and weak security as two different levels of security against wire tapper. Then we scrutinize the prerequisite for reaching these levels of security. Furthermore, we prove that there exists a scheme which could provide both level of security simultaneously. We find an upper bound for the field size in which our scheme could be implemented. In addition, we introduce byzantine attacks. Since network coding permits the internal nodes to process the data streams, it is highly vulnerable to error propagation. We explain how to design a code which is capable of conveying information in spite of byzantine nodes. Then, we define deterministic and Probabilistic states and for each of them, we explore achievable secure rate region. Finally, we delineate the theory of error correction in network coding which is a generalization of classic error correction, propitiously designed to cope with errors in network coding.
- Keywords:
- Network Coding ; Error Correction ; Perfect Security ; Weak Security ; Byzantine Attacks
Digital Object List
-
محتواي پايان نامه
- view
Bookmark