Abstract :
We are sending data from source node to destination using wireless sensor networks WSNs , In wireless sensor networks, it is a typical threat to source privacy that an attacker performs back tracing strategy to locate source nodes by analyzing transmission paths. So there is lot of chances to lose data and information theft by network hackers. Network hackers performs eves dropping, sniffers attack, Denial of service attack. These types of attacks are achieved by negative commands generated by intermediate server maintained by hackers. With the popularity of the Internet of Things IoTs in recent years, source privacy protection has attracted a lot of attentions. However, they fail to get the tradeoff between multi path transmission and transmission cost. In this project, we propose a Constrained Random Routing CRR mechanism and Greedy techniques, which can constantly change routing next hop instead of a relative fixed route so that attackers cannot analyze routing and trace back to source nodes. At first we designed the randomized architecture for each sensor nodes. Then calculate the coordinates and weights of node, Finally, the selected weights help to decide which node will become the next hop. In this way, attackers would be confused by the constantly changing paths. The simulation results prove that our proposal can achieve high routing efficiency in multi path transmission. A Prasanth | P Sankar Ganesh | S P Raja Gopalan "Data Prevention from Network Hacking" Published in International Journal of Trend in Scientific Research and Development (ijtsrd), ISSN: 2456-6470, Volume-2 | Issue-3 , April 2018, URL: https://www.ijtsrd.com/papers/ijtsrd11035.pdf Paper URL: http://www.ijtsrd.com/engineering/computer-engineering/11035/data-prevention-from-network-hacking/a-prasanth
Keyword :
wireless network sensor (WNS), Internet of Things (IOT) , Constrained Random Routing (CRR) mechanism, Greedy techniques, Network Utility Maximinization (NUM), Distributed algorithm, Traffic allocation algorithm