End-to-end security mechanisms for the optimized link state routing protocol for wireless ad hoc networks
| dc.contributor.advisor | Hutchison, Andrew | |
| dc.contributor.author | Asherson, Stephen Warren | |
| dc.date.accessioned | 2024-06-19T09:01:17Z | |
| dc.date.available | 2024-06-19T09:01:17Z | |
| dc.date.issued | 2008 | |
| dc.date.updated | 2024-06-19T08:36:34Z | |
| dc.description.abstract | Routing protocols designed for wireless ad hoc networks are, in general, highly vulnerable to various forms of security attacks. A routing protocol is vital to the functioning of a wireless ad hoc network, and hence, security needs to be present to negate any potential malicious influences. However, providing efficient security mechanisms for such routing protocols is still viewed as being a considerable challenge. In this dissertation, the focus lies on the Optimized Link State Routing (OLSR) protocol, a proactive protocol which relies heavily on broadcast transmissions. This study investigates the use and feasibility of several end-to-end security mechanisms for the OLSR protocol, with specific interest in the overhead and performance penalties incurred by such security mechanisms. In general, the main focus of the security mechanisms fall on authentication, integrity, and replay protection for the OLSR message. More specifically, we investigate the use of a one-time signature scheme known as Hash to Obtain Random Subset (HORS), as well as an extended version of HORS, as a broadcast digital signature for OLSR messages. For the experimental purposes of this study, an existing OLSR implementation was used as a basis for implementing a security-aware version of OLSR, incorporating our chosen security mechanisms. The experiments were performed on a 9 node indoor wireless mesh testbed, and consisted of testing both the standard OLSR protocol, as well as our security-aware version of the protocol. For each of the protocol versions tested, various performance aspects were recorded, allowing comparisons amongst the different versions to take place. The results obtained from the experiments indicate that the chosen security mechanisms add a significant amount of overhead, particularly in the department of traffic overhead. Whilst our extended version of the HORS signature scheme performed better than that of the standard HORS scheme, it was found that the performance of both schemes degraded rapidly as the hop-count, between any two given communicating entities, tended to increase. This performance degradation exists primarily due to the key management problems of the HORS one-time signature scheme, particularly regarding the process of public key distribution in a wireless network environment which lacks reliable broadcast transmissions and is subject to packet loss. The results from the experiments provide insight into the use of various security mechanisms, and also demonstrate the engineering challenges associated with securing a routing protocol based on IEEE 802.11 broadcast transmissions. | |
| dc.identifier.apacitation | Asherson, S. W. (2008). <i>End-to-end security mechanisms for the optimized link state routing protocol for wireless ad hoc networks</i>. (). ,Faculty of Science ,Department of Computer Science. Retrieved from http://hdl.handle.net/11427/39962 | en_ZA |
| dc.identifier.chicagocitation | Asherson, Stephen Warren. <i>"End-to-end security mechanisms for the optimized link state routing protocol for wireless ad hoc networks."</i> ., ,Faculty of Science ,Department of Computer Science, 2008. http://hdl.handle.net/11427/39962 | en_ZA |
| dc.identifier.citation | Asherson, S.W. 2008. End-to-end security mechanisms for the optimized link state routing protocol for wireless ad hoc networks. . ,Faculty of Science ,Department of Computer Science. http://hdl.handle.net/11427/39962 | en_ZA |
| dc.identifier.ris | TY - Thesis / Dissertation AU - Asherson, Stephen Warren AB - Routing protocols designed for wireless ad hoc networks are, in general, highly vulnerable to various forms of security attacks. A routing protocol is vital to the functioning of a wireless ad hoc network, and hence, security needs to be present to negate any potential malicious influences. However, providing efficient security mechanisms for such routing protocols is still viewed as being a considerable challenge. In this dissertation, the focus lies on the Optimized Link State Routing (OLSR) protocol, a proactive protocol which relies heavily on broadcast transmissions. This study investigates the use and feasibility of several end-to-end security mechanisms for the OLSR protocol, with specific interest in the overhead and performance penalties incurred by such security mechanisms. In general, the main focus of the security mechanisms fall on authentication, integrity, and replay protection for the OLSR message. More specifically, we investigate the use of a one-time signature scheme known as Hash to Obtain Random Subset (HORS), as well as an extended version of HORS, as a broadcast digital signature for OLSR messages. For the experimental purposes of this study, an existing OLSR implementation was used as a basis for implementing a security-aware version of OLSR, incorporating our chosen security mechanisms. The experiments were performed on a 9 node indoor wireless mesh testbed, and consisted of testing both the standard OLSR protocol, as well as our security-aware version of the protocol. For each of the protocol versions tested, various performance aspects were recorded, allowing comparisons amongst the different versions to take place. The results obtained from the experiments indicate that the chosen security mechanisms add a significant amount of overhead, particularly in the department of traffic overhead. Whilst our extended version of the HORS signature scheme performed better than that of the standard HORS scheme, it was found that the performance of both schemes degraded rapidly as the hop-count, between any two given communicating entities, tended to increase. This performance degradation exists primarily due to the key management problems of the HORS one-time signature scheme, particularly regarding the process of public key distribution in a wireless network environment which lacks reliable broadcast transmissions and is subject to packet loss. The results from the experiments provide insight into the use of various security mechanisms, and also demonstrate the engineering challenges associated with securing a routing protocol based on IEEE 802.11 broadcast transmissions. DA - 2008 DB - OpenUCT DP - University of Cape Town KW - Computer Science LK - https://open.uct.ac.za PY - 2008 T1 - End-to-end security mechanisms for the optimized link state routing protocol for wireless ad hoc networks TI - End-to-end security mechanisms for the optimized link state routing protocol for wireless ad hoc networks UR - http://hdl.handle.net/11427/39962 ER - | en_ZA |
| dc.identifier.uri | http://hdl.handle.net/11427/39962 | |
| dc.identifier.vancouvercitation | Asherson SW. End-to-end security mechanisms for the optimized link state routing protocol for wireless ad hoc networks. []. ,Faculty of Science ,Department of Computer Science, 2008 [cited yyyy month dd]. Available from: http://hdl.handle.net/11427/39962 | en_ZA |
| dc.language.rfc3066 | eng | |
| dc.publisher.department | Department of Computer Science | |
| dc.publisher.faculty | Faculty of Science | |
| dc.subject | Computer Science | |
| dc.title | End-to-end security mechanisms for the optimized link state routing protocol for wireless ad hoc networks | |
| dc.type | Thesis / Dissertation | |
| dc.type.qualificationlevel | Masters | |
| dc.type.qualificationlevel | MSc |