Secured distributed routing technique using extended DART and table elimination (ET-DART) technique in wireless sensor networks environment

Abstract

Distributed wireless sensor networks (WSNs) particularly deployed in urban applications like traffic surveillance are the main source of big data, and they produce a massive quantity of data. Multipath routing favors reliable data delivery in the case of sensitive data. However, the disadvantage is that many routes might increase the number of control packets. In this paper, we present an extended dynamic address routing technique (DART) with table elimination (ET) technique named ET-DART to reduce the complexity by handling a high degree of connectedness. The new idea of “connectedness” is used to distribute data from one node as it collected from another node. This method is used for defending capture attacks, and it modifies the security in every node without modifying the packet received ratios. A set of simulations takes place to verify the superiority of the presented ET-DART in terms of different performance metrics. Under the presence of 400 nodes, the presented ET-DART method successfully decrypts 154 packets with a maximum throughput of 82.15%. The experimental outcome verified the enhanced results of the presented method over the compared ones under several aspects.