Department of Electrical Engineering
| M. Sc. Thesis Defense | 269 |

Routing Security in Wireless Ad Hoc Networks |
Mobile ad hoc networks are a special type of mobile wireless networks where a collection of mobile network devices from a temporary network without any aid of an established infrastructure. However, the fact that there is no central Infrastructure and that the devices can move randomly gives rise to various kinds of problems, such as routing and security. Many algorithms are proposed for security in routing process for wireless ad hoc networks. Too much of secure routing protocol in ad hoc networks focused in authentication, and they disregarded the data confidentiality after rout discovery. Hence, in this thesis, we propose secure routing algorithm, named High Secure Routing Protocol in wireless ad hoc networks with two methods (HSAODV1 and HSAODV2). These protocols have two phases: In the first one, at the first step the source, destination and intermediate nodes authenticate by use of digital signature and asymmetric algorithms, after in the next step, the protocol utilizes one way function for data confidentiality increased. In the second one, at the first step the source, destination and intermediate nodes authenticate by use of one way hash function, the next step of the HSAODV2 is same as HSAODV1 with little different. We base the design of HSAODV1 and HSAODV2 protocols in part on the AODV ad hoc network routing protocol. Our protocols are robust against multiple routing attacks such as blackhole attack. In order to assess the functionality of this algorithm, the security matrix and the normalized routing overhead are evaluated for proposed method in three steps. For simulating the algorithms NS-2 network simulation tool is used. In the first step of simulation, the packet delivery ratio, average end to end delay and normalized routing overhead are evaluated for proposed algorithms. In the second step of simulation, the blackhole attack is simulated in AODV, HSAODV1 and HSAODV2 protocols then the security matrix and the normalized routing overhead are compared for these protocols and AODV. In the last step of simulation for performance analyze, the proposal algorithms are compared with AODV and SAODV protocols . |
Student: Mahdi Taheri Supervisor: Dr. Majid naderi Adviser: Dr. H. Taheri, Prof. K. Mohammadi, Dr H. S. Shahosseini |
Defense Date: Monday 31 January Time: 2:30 PM Location: Class No. 204, Department of Electrical Engineering |