Secure and Opportunistic Routing in WSN using Associative Secure Optimized Routing Algorithm

Under wireless communication domain optimized routing for wireless networks is the trending scenario for research. Various older schemes faces performance issues such as consistency, alongside ensuring routing security which significantly causes performance degradation. Although the current mechanisms designed for routing are low-cost and precise positioning is also not essential but security still requires emphasis to be given during design. In this paper a secure and optimized routing technique is proposed for WSN mentioned as Associative Secure Optimized Routing (ASOR) Algorithm. Optimized data progression is the prime focus of ASOR alongside ensuring security to it. ASOR operates in two phases, in first phase it identifies and club the associative nodes based on the defined indulgent constant(IC) based on explicit trust, strength of link and link_quality parameters. Explicit trust and strength of link are directly measurable however to measure quality, survival time of link and the incurred delay are taken into consideration. Secondly the selection of optimized nodes using proposed ASOR is carried out through defined aptness function(AF) which is dependent on explicit_trust(ET), strength_of_link(SOL), node_quality(NQ) and distance. Proposed associative secure optimized routing scheme’s performance is evaluated based on metrics for adhoc sensor network of 100 dynamic nodes in the presence of worm_hole and black_hole attacks. Comparatively higher throughput and detection_rate whereas lower distance and delay are indicated by ASOR, which are relatively better than opposing methods. ASOR shows significantly high detection_rate and throughput as 55.7 and 44.1 respectively and comparatively less delay and distance as 13 and 168.2 which are significantly better than opposing methods. ASOR can be effectively used in WSN for real time application such as in agriculture, industries etc