Open Access Open Access  Restricted Access Subscription Access
Open Access Open Access Open Access  Restricted Access Restricted Access Subscription Access

Security against Jamming in Opportunistic Localization for Underwater Sensor Networks


     

   Subscribe/Renew Journal


In Underwater Sensor Networks, localization and the security of the node is the important process. Due to the lack of reference anchor node in the distributed localization [1],[4],[5], the opportunistic localization[3]in which the sensor nodes localized by exploiting the available opportunities and to interact with reference nodes to get localized with the minimum localization delay. For the secure transmission of the data between the source and the receiver, the RSA algorithm is used here. If there is attack in the path, the source node chooses the alternative path. In the route discovery process, the routing update condition calculates the node weight of each path and sorts the path weight in descending order and chooses the path which has the largest weight for data communication. The shortest path among all the weighted is chosen using the greedy algorithm. The simulation result shows that the network performance is increased and the packet drop, packet delay is reduced compared to the network with jamming environment.


Keywords

Ns-AOMD; Greedy Algorithm; Path Weight; Packet Delay; Energy;
User
Subscription Login to verify subscription
Notifications
Font Size

Abstract Views: 197

PDF Views: 2




  • Security against Jamming in Opportunistic Localization for Underwater Sensor Networks

Abstract Views: 197  |  PDF Views: 2

Authors

Abstract


In Underwater Sensor Networks, localization and the security of the node is the important process. Due to the lack of reference anchor node in the distributed localization [1],[4],[5], the opportunistic localization[3]in which the sensor nodes localized by exploiting the available opportunities and to interact with reference nodes to get localized with the minimum localization delay. For the secure transmission of the data between the source and the receiver, the RSA algorithm is used here. If there is attack in the path, the source node chooses the alternative path. In the route discovery process, the routing update condition calculates the node weight of each path and sorts the path weight in descending order and chooses the path which has the largest weight for data communication. The shortest path among all the weighted is chosen using the greedy algorithm. The simulation result shows that the network performance is increased and the packet drop, packet delay is reduced compared to the network with jamming environment.


Keywords


Ns-AOMD; Greedy Algorithm; Path Weight; Packet Delay; Energy;