End-to-end security mechanisms for the optimized link state routing protocol for wireless ad hoc networks
type: CreativeWork
description: 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 bo…
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 bo…
author: Asherson, Stephen Warren
keywords: Computer Science
date published: 2008
date modified: 2026-07-22T22:22:49Z
provider: University of Cape Town
publisher: Networked Digital Library of Theses and Dissertations
type: WebPage
source organization: Department of Computer Science

PropertyValue
property ID: Handle
value: http://hdl.handle.net/11427/39962