Documente Academic
Documente Profesional
Documente Cultură
ABSTRACT INTRODUCTION
We are sending data from source node to destination The project propose techniques for the network nodes
using wireless sensor networks (WSNs), In wireless to estimate and characterize the impact of Hacking
sensor networks, it is a typical threat to source privacy and source node failure. we consider the problem of
that an attacker performs back tracing strategy to Problem free data transfer in network node routing in
locate source nodes by analyzing transmission paths. which the source node performs traffic allocation
So there is lot of chances to lose data and information based on empirical jamming statistics and dynamic
theft by network hackers. Network hackers performs routing at individual network nodes to prevent data
eves dropping, g, sniffers attack, Denial of service loss. Different from traditional wired network WNS
attack. These types of attacks are achieved by as usually deployed in unnamed area .if it is have
negative commands generated by intermediate server density complex data encryption ryption algorithm has
maintained by hackers. With the popularity of the already has been used . The attacker usually uses
Internet of Things (IoTs) in recent years, source expensive wireless receives to determine the position
privacy protection hass attracted a lot of attentions. of signals transmitting node and the move to the node
However, they fail to get the tradeoff between multi
multi- to monitor continuously, repeating the procedure the
path transmission and transmission cost. In this attacker can perform back tracking strategy to find the
project, we propose a Constrained Random Routing position of the source node, we found on improving
(CRR) mechanism and Greedy techniques, which can the efficiency of source privacy protection . from this
constantly change routing next-hop hop instead of a paper constrained random routing (CRR) based on the
relative fixed route so that attackers cannot analyze transmitting offset angles and constrained probability
routing and trace back to source nodes. At first we is proposed
ed to protect the privacy of source node CRR
designed the randomized architecture for each sensor fully consider energy consumption in multipath
nodes. Thenn calculate the coordinates and weights of transmission and also using methodology of Network
node, Finally, the selected weights help to decide utility maximization , Greedy random walk (GROW)
which node will become the next hop. In this way, mainly used for proposed traffic allocation method
attackers would be confused by the constantly also distributed
ted algorithm are mainly required
changing paths. The simulation results prove that our application area of distributed system and it also
proposal can achieve high routing efficie
efficiency in multi- distributed information process . In this paper they are
path transmission. proposed to incorporate the jamming impact in the
allocation problem the effect of jamming on
Keywords: wireless network sensor (WNS)
(WNS), Internet of transmission are each h link , they are stop the
Things (IOT) , Constrained Random Routing ((CRR) backtracking and change their sequence the import of
mechanism, Greedy techniques,, Netwo
Network Utility jamming dynamic and mobility on network
Maximinization (NUM), Distributed algorithm, throughput , the multiple path source routing
Traffic allocation algorithm
Architecture Diagram
@ IJTSRD | Available Online @ www.ijtsrd.com | Volume – 2 | Issue – 3 | Mar-Apr 2018 Page: 808
International Journal of Trend in Scientific Research and Development (IJTSRD) ISSN: 2456-6470
Block Diagram:
Source routing, also called path addressing, allows a the network determine the path based on the packet's
sender of a packet to partially or completely specify destination. Source routing allows easier
the route the packet takes through the network.[1] In troubleshooting, improved traceroute, and enables a
contrast, in non-source routing protocols, routers in node to discover all the possible routes to a host. It
@ IJTSRD | Available Online @ www.ijtsrd.com | Volume – 2 | Issue – 3 | Mar-Apr 2018 Page: 809
International Journal of Trend in Scientific Research and Development (IJTSRD) ISSN: 2456-6470
does not allow a source to directly manage network network flow optimization problem using an objective
performance by forcing packets to travel over one function based on portfolio selection theory from
path to prevent congestion on another. finance. We showed that this centralized optimization
problem can be solved using a distributed algorithm
POINT THE EFFECT OF JAMMER based on decomposition in network utility
MOBILITYON NETWORK maximization (NUM). We presented simulation
Providing a set of parameters to be estimated by results to illustrate the impact of jamming dynamics
network nodes and methods for the sources to and mobility on network throughput and to
aggregate this information and characterize the demonstrate the efficacy of our traffic allocation
available paths on the basis of expected throughput. algorithm. We have thus shown that multiple path
source routing algorithms can optimize the throughput
ESTIMATING LOCAL PACKET SUCCESS performance by effectively incorporating the
RATES empirical jamming impact into the allocation of traffic
The up- date period T and update relay period Ts to the set of paths.
between subsequent updates of the parameter
estimates have significant influence on the quality of
the estimate. If the update period Ts is too large, the REFERENCES
relayed estimates will be outdated.
1. P. Hui, C. Hong, Z. XiaoYing, F. YongJian, L.
CuiPing, and L. DeYing, ‘‘Location privacy
ESTIMATING END-TO-END PACKET preservation in wireless sensor networks,’’
SUCCESS RATES J. Softw., vol. 26, no. 3, pp. 617–639, 2015.
The source needs to estimate the effective end-to-end
packet success rate to determine the optimal traffic 2. H. GuangJie, J. Jinfang, M. Guizani, and J. J.
allocation. Assuming the total time required to Rodrigues, ‘‘Green routing protocols for wireless
transport packets from each source to the multimedia sensor networks,’’ IEEE Wireless
corresponding destination is negligible compared to Commun. Mag., vol. 23, no. 6, pp. 140–146, Dec.
the update relay period. 2016.
3. G. Han, L. Liu, S. Chan, R. Yu, and Y. Yang,
TRAFFIC ALLOCATION CONSTRAINTS ‘‘HySense: A hybrid mobile crowd sensing frame
We must consider the source data rate constraints, the work for sensing opportunities compensation
link capacity constraints, and the reduction of traffic under dynamic coverage constraint,’’ IEEE
flow due to jamming at intermediate nodes Commun. Mag., vol. 55, no. 3, pp. 93–99, Mar.
2017.
OPTIMAL TRAFFIC ALLOCATION USING
PORTFOLIO SELECTION THEORY 4. H. GuangJie, Y. Xuan, L. Li, Z. WenBo, and M.
To determine the optimal allocation of traffic to the Guizani, ‘‘A disaster management-oriented path
paths in Portfolio Selection, each source s chooses a planning for mobile anchor node-based
utility function that evaluates the total data rate, or localization in wireless sensor networks,’’ IEEE
throughput, successfully delivered to the destination Trans. Emerg. Topics Comput., to be published.
node 5. K. Shin, K. Kim, and S. Kim, ‘‘ADSR: Angle-
based multi-hop routing strategy for mobile
CONCLUSIONS wireless sensor networks,’’ in Proc. IEEE Asia–
Pacific Services Computer. Conf., Dec. 2011, pp.
We studied the problem of traffic allocation in
373–376.
multiple-path routing algorithms in the presence of
jammers whose effect can only be characterized 6. P. Spachos, D. Toumpakaris, and D. Hatzinakos,
statistically. We have presented methods for each ‘‘Angle-based dynamic routing scheme for source
network node to probabilistically characterize the location privacy in wireless sensor networks,’’ in
local impact of a dynamic jamming attack and for Proc. Veh. Technol. Conf., May 2015, pp. 1–5.
data sources to incorporate this information into the 7. Z. ZeMao, L. Yang, Z. Fan, Z. JianQin, and Z.
routing algorithm. We formulated multiple-path Pin, ‘‘Research on source location privacy routing
traffic allocation in multi-source networks as a lossy based on angle and probability in wireless sensor
@ IJTSRD | Available Online @ www.ijtsrd.com | Volume – 2 | Issue – 3 | Mar-Apr 2018 Page: 810
International Journal of Trend in Scientific Research and Development (IJTSRD) ISSN: 2456-6470
networks,’’ J. Shandong Univ., vol. 48, no. 9, pp.
1–9, 2013.
8. W. Choi, S. K. Das, and K. Basu, ‘‘Angle-based
dynamic path construction for route load
balancing in wireless sensor networks,’’ in Proc.
IEEE Wireless Commun. Netw. Conf., vol. 4. Mar.
2004, pp. 2474–2479.
9. Z. YaNan, Y. Xong, and X. Wu, ‘‘Enhanced
source-location privacy preservation protocol
using random angle,’’ Computer Engineering and
Applications. 2016.
@ IJTSRD | Available Online @ www.ijtsrd.com | Volume – 2 | Issue – 3 | Mar-Apr 2018 Page: 811