Nodes in infrastructureless wireless networks usually have only limited energy and pose new security challenges. since traditional cryptographic operations have a high energy cost. In this thesis, new security solutions are presented to avoid using costly cryptographic operations. Two secure problems are investigated: the first is secure routing: the other is secure data aggregation. For the first problem, a randomized algorithm is proposed to defend against malicious attackers wishing to disrupt routing in wireless ad-hoc networks. For the second problem, a solution is proposed to leverage the broadcast nature of wireless medium and use a special aggregation topology, namely a clique tree, for data integrity in wireless sensor networks. With analysis and performance evaluation, both solutions are demonstrably lightweight with acceptable security features.
| Identifer | oai:union.ndltd.org:uvic.ca/oai:dspace.library.uvic.ca:1828/2050 |
| Date | 08 January 2010 |
| Creators | Dreef, Dennis Sebastian |
| Contributors | Wu, Kui |
| Source Sets | University of Victoria |
| Language | English, English |
| Detected Language | English |
| Type | Thesis |
| Rights | Available to the World Wide Web |
Page generated in 0.0014 seconds