Coding Theory For Security And Reliability In Wireless Networks
| dc.contributor.author | Kacewicz, Anna | en_US |
| dc.date.accessioned | 2010-04-09T20:24:56Z | |
| dc.date.available | 2015-04-09T06:27:30Z | |
| dc.date.issued | 2010-04-09T20:24:56Z | |
| dc.description.abstract | Wireless networks hold many applications and are an integral part of our lives. Security and reliability are extremely important in wireless networks. These networks must be reliable so that data can be conveyed from transmitters to receivers. Data sent across wireless networks must be kept confidential from unintended users and it is necessary that false packets generated by illegitimate users are rejected by the receiver. Another important task is for the network to determine which network components can be trusted and to what degree. The work presented in this dissertation addresses the security and reliability issues in wireless networks through the use of coding theory. The network is composed of numerous nodes and we consider a classical point to point communication problem. We explore the network reliability issue and develop two algorithms (exponential and polynomial time) which determine minimum redundancy and optimal symbol allocation to assure that the probability of successful decoding is greater than or equal to a specified threshold. The performance of the algorithms is compared with each other, and MDS, LT, and Raptor codes are compared using the exponential algorithm. We also consider the security problem of keeping a message confidential from an illegitimate eavesdropper in a multiple path network. Carefully crafted Raptor codes are shown to asymptotically achieve perfect secrecy and zero-error probability, and a bit allocation method across the paths is developed. Lastly, we look into the problem of determining the integrity of nodes in the network. In particular, we show how the malicious nodes can be localized in the network through the use of ReedMuller codes. The Reed-Muller codes represent the paths that are necessary in the network. For the case where a path is not realizable according to the network connectivity matrix, we conceived an algorithm to treat the non-realizable paths as erasures and decode to localize malicious nodes. The performance of the algorithm is compared to several techniques. | en_US |
| dc.identifier.other | bibid: 6890967 | |
| dc.identifier.uri | https://hdl.handle.net/1813/14833 | |
| dc.language.iso | en_US | en_US |
| dc.title | Coding Theory For Security And Reliability In Wireless Networks | en_US |
| dc.type | dissertation or thesis | en_US |
Files
Original bundle
1 - 1 of 1