Securing data retrieval based on Tree Indexed self organized Key in Mobile Ad-hoc Network
S.K.B Sangeetha, S. Sathappan · 2016
In mobile Ad-hoc network, the design of secured data delivery is quite challenging owing to the fact that nodes gets compromised due to the self organizing nature of the network. During data storage and processing, security becomes the primary concern. Confidentiality of data is the primary requirements of secure data retrieval. MANETs are to provide preventing traffic analysis and attacks from outside observers. In this research work, a novel optimization mechanism for providing secured data delivery called, Self Organized B+ Tree Indexed Key (SOBTIK) in Mobile Ad hoc Network is proposed. In particular, based on the instance of mobile node deployment, B+ Tree structure is generated where each node contains only keys, providing confidentiality of the outsourced data. Given the data to be transmitted, a new algorithm for efficient transmission to the neighbouring mobile node is presented. In addition, a self organizing key is generated in which the source node transmits the secured data to the destination mobile node. Finally, indexing is done on the generated self organized key to improve access time of intermediate mobile nodes for transmission. Simulation results based on real traces with multiple time instances for varied mobile node density and speed demonstrate the effectiveness of our mechanism.