11-09-2017, 12:23 PM
Commonly unattended and hostile deployments of WSNs and their sensing devices with limited resources have led to a growing demand for secure, energy-efficient protocols. Routing and aggregation of data receive the most attention as they are among the daily routines of the network. With the awareness of such a demand, we find that so far there has been no work establishing a secure routing protocol as the basis for a secure data aggregation protocol. We argue that the secure routing role would become useless if the data aggregation scheme built into it is not secure. On the other hand, the secure data aggregation protocol needs a secure underlying routing protocol as the basis to be optimal. As an attempt for solution, we designed a power conscious protocol based on LEACH and ESPDA that combines secure routing protocol and secure data aggregation protocol. Next, we evaluate its safety effectiveness and its aspects of energy efficiency, knowing that there is always an exchange between both.
Due to routing attacks, secure routing in a mobile ad hoc network is one of the most challenging areas of research in computing. Any exploit that does not follow the rules of the routing protocol belongs to the routing attack. In a mobile adhoc network, attacks are classified into two broad categories called routing attacks and data forwarding attacks. Routing attacks are attacks that mislead or disrupt the normal operation of the network by announcing false routing updates and data forwarding attacks include actions such as modifying or dropping the data packet that does not interrupt routing protocols. In this work we propose a symmetric key AODV-based approach that uses hash function and hash code authentication message to ensure the path of discovery and response path of communication process between nodes in a network. The proposed method provides rapid verification of messages and maintains the principle of authentication and integrity security. We use a symmetric key-based AODV-based approach rather than an asymmetric key-based cryptographic approach because asymmetric key-based message block focus is encrypted and computing the digital signature of each block, this will take a long time for the computation, transmission and requires more storage. We simulate and compare the proposed safe AODV protocol with the original AODV protocol in the OMNeT ++ network simulator. The simulation result shows that the proposed method minimizes the time delay and network routing load involved in the calculation and verification of security fields during the path discovery process and works better than the original AODV protocol in presence of malicious nodes.
Due to routing attacks, secure routing in a mobile ad hoc network is one of the most challenging areas of research in computing. Any exploit that does not follow the rules of the routing protocol belongs to the routing attack. In a mobile adhoc network, attacks are classified into two broad categories called routing attacks and data forwarding attacks. Routing attacks are attacks that mislead or disrupt the normal operation of the network by announcing false routing updates and data forwarding attacks include actions such as modifying or dropping the data packet that does not interrupt routing protocols. In this work we propose a symmetric key AODV-based approach that uses hash function and hash code authentication message to ensure the path of discovery and response path of communication process between nodes in a network. The proposed method provides rapid verification of messages and maintains the principle of authentication and integrity security. We use a symmetric key-based AODV-based approach rather than an asymmetric key-based cryptographic approach because asymmetric key-based message block focus is encrypted and computing the digital signature of each block, this will take a long time for the computation, transmission and requires more storage. We simulate and compare the proposed safe AODV protocol with the original AODV protocol in the OMNeT ++ network simulator. The simulation result shows that the proposed method minimizes the time delay and network routing load involved in the calculation and verification of security fields during the path discovery process and works better than the original AODV protocol in presence of malicious nodes.