Load Based Key Generation for MANETs: A Comparative Study with DSR and AODV
- PDF / 898,001 Bytes
- 10 Pages / 439.37 x 666.142 pts Page_size
- 63 Downloads / 143 Views
Load Based Key Generation for MANETs: A Comparative Study with DSR and AODV K. R. Shibu1 · R. Suji Pramila1
© Springer Science+Business Media, LLC, part of Springer Nature 2020
Abstract Automatic key establishment schemes are the root of secure communication in Mobile adhoc networks(MANETs). These schemes are not universal, their performance depends on many factors like routing protocols, type of attackers aimed at, the parameter used for key generation, etc. Among the routing protocols used in MANETs the most popular ones are reactive routing protocols DSR and AODV. In this paper, an efficient secret key establishment technique using traffic matrix is simulated in the two reactive routing protocol scenarios: DSR (Dynamic Source Routing) and AODV (Ad hoc On-demand Distance Vector routing). The simulation results are compared and analyzed in terms of the key generation complexity, packet loss ratio and active attacker detection. Finally the paper concludes the fact that traffic load based key generation scheme is preferable for reactive routing protocol based systems. Keywords DSR · AODV · Traffic matrix · Secret key
1 Introduction MANETs are a group of dynamic mobile nodes without specific infrastructure and base stations. The wireless nodes in the network are free to act as a source or destination at any time. This inherent nature of MANETs makes them popular in many important communication applications including military applications. The lack of centralized authority makes these networks more prone to security issues. So there is a growing need in data security management in MANETs. To address these security issues various secret key generation techniques are deployed. However, the applicability of the common key generation schemes to the network depends on many factors [1] including routing strategies, nature of network, etc. Also, many of the existing key generation schemes find it difficult to identify a suitable randomness source [2] for key generation. The kind of network that utilizes on-demand reactive routing protocols is maintaining a route table at the node level. The routing information thus stored helps them in finding * K. R. Shibu [email protected] 1
Department of Computer Science and Engineering, Noorul Islam Centre for Higher Education, Kumaracoil, Tamil Nadu, India
13
Vol.:(0123456789)
K. R. Shibu, R. Suji Pramila
routes each time the nodes want to communicate in the future. The details stored in the nodes are highly dynamic and unpredictable; this ensures a truly random set of data for randomness extraction [3]. Data traffic in the network can also be recorded and utilized as another randomness source. Mostly the traffic volume is maintained in the matrix form at each node. The traffic matrix based secret key generation scheme exploits the fact that several system metadata can be deployed to extract secret keys in MANETs. The scheme is extracting the randomness source from the system metadata: the traffic load and the routing table. This type of key generation is applic
Data Loading...
