International Journal of Computer Application
Issue 4, Volume 6 (Nov.- Dec. 2014)
Available online on http://www.rspublication.com/ijca/ijca_index.htm
ISSN: 2250-1797
A RESEARCH TO FIND DESTIONATION LOCATION IN WIRELESS SENSOR
NETWORKS USING GOR ROUTING
S.GOMATHI
PG SCHOLAR
DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING
MEENAKSHI RAMASAMY ENGINEERING COLLEGE
ABSTRACT
In a sensor network, an important problem is to provide privacy to the event detecting sensor
node and integrity to the data gathered by the node. In this paper, propose a tree based routing
scheme for preserving source location privacy using hide and seek strategy to create fake
routes along the path to the sink from the real source, where the end of each route is a fake
source node, which periodically emits fake events. It makes it more difficult for an adversary
to trace messages back to the source location. Meanwhile, the proposed scheme is able to
maximize the network lifetime. The main idea is that the lifetime of WSNs depends on the
nodes with high energy consumption or hotspot, the proposed scheme minimizes energy in
hotspot and creates routes in non hotspot regions with abundant energy. Hence, it achieves not
only source node privacy preservation, but also increase the network lifetime. And also
identify a novel attack against existing phantom routing.
Keywords:Wireless sensor networks, multi-constrained Qos, Geographic opportunistic
routing;
1.INTRODUCTION
Wireless sensor networks
Wireless sensor networks have enabled several novel classes of application, including
monitoring and tracking. In the case of monitoring applications, the deployment of sensor
networks will vary from mission critical applications, such as military, health and asset
monitoring. It consists of a large number of sensing devices called sensor nodes which are
interconnected through wireless links to perform distributed sensing tasks. WSNs have found
R S. Publication, rspublicationhouse@gmail.com
Page 32
International Journal of Computer Application
Issue 4, Volume 6 (Nov.- Dec. 2014)
Available online on http://www.rspublication.com/ijca/ijca_index.htm
ISSN: 2250-1797
many useful applications for automatic data collecting, such as habitat monitoring, military
surveillance, and target tracking, for monitoring the activities of enemy soldiers or valuable
assets such as endangered animals. In critical application security is an important aspect of
security is privacy. Privacy is often important in critical applications, as sensitive information
may need to be kept private.
Nature of the problem:
Providing reliable and timely communication in WSNs is a
challenging problem. This is because , the varying wireless channel conditions and sensor
node failures may cause network topology and connectivity changing over time[2].Under such
conditions, to forward a packet reliably at each hop, it may need multiple retransmissions,
resulting in undesirable long delay as well as waste of energy. Therefore, many existing
works [3]-[9] have been proposed to improve the routing reliability and latency in WSNs with
unreliable links.
Previous work: Several existing works, MMSPEED [5], MCMP [6], EQSR [7], and ECM
[8] propose to utilize multiple paths between the source and sink for multi-constrained Qos
provisioning in WSNs. Data transmission along multiple paths can achieve
certain desired
reliability, and the delay Qos requirement is met as long as any one packet copy arrives at
destination before the deadline.
Purpose: Opportunistic routing aims to improve wireless performance by exploiting spatial
diversity in dense wireless networks[14].A number of opportunistic routing protocol have
been proposed [15]-[18]in the literature. Geographic opportunistic routing, where location
information is available at each hop
EQUATIONS
Let D and R denote the end-to-end delay and reliability QoS constraints, respectively.
Due to the unreliable wireless link conditions, the complexity of obtaining the exact end-toend link state information is beyond the computation and energy tolerance of sensor nodes [6].
However, per hop information is convenient to acquire and maintain at a low overhead cost.
Therefore, we partition the end-to-end QoS requirements into the hop requirements to achieve
the soft QoS provisioning. To keep consistency, we follow the variable definitions
about[20].Assuming node I is sending a data packet to the sink node (denote as Dest), and j is
one of I’s neighbors which is closer to the than i. Define aij in Eq. 1 as the single hop packet
progress(SPP) to the Dest when a packet is forwarded by neighbor j. ci is defined as the
available next-hop forwarder set of node I, where all nodes in ci have positive SPPs.
R S. Publication, rspublicationhouse@gmail.com
Page 33
International Journal of Computer Application
Issue 4, Volume 6 (Nov.- Dec. 2014)
Available online on http://www.rspublication.com/ijca/ijca_index.htm
ISSN: 2250-1797
aij = Dist(i;Dest) − Dist(j;Dest); (1)
The single-hop medium delay is defined as Eq. 2, where the signal propagation delay is
ignored.
tk = TBackoff + TDATA + k · (TSIFS + TACK); (2)
we have the partitioned hop QoS requirements at node i.
di = D�eirhi(3)
ri =rhi R (4)
The remaining hop count rhi is estimated as Eq. 5.
rhi = ⌈Dist(i;Dest)addv(hi)⌉; (5)
2. RELATED WORK
2.1
Geographic Opportunistic Routing
Opportunistic routing aims to improve wireless performance by exploiting spatial
diversity in dense wireless networks [14]. A number of opportunistic routing protocols have
been proposed [15]-[18] in the literature. Geographic opportunistic routing (GOR) [19] is a
branch of the opportunistic routing, where location information is available at each node. In
opportunistic routing at the network layer a set of forwarding candidates are selected while at
the MAC layer only one node is chosen as the actual relay based on the reception results in an
a posteriori manner.
2.2
Qos provisioning in WSNs
Unique characteristics of WSNs, such as energy supply and computing power
limitations of sensor devices, unreliable wireless links, and data-centric communication
paradigm, pose challenges in the area of Qos provisioning in WSNs. Early studies on Qos
aware routing in WSNs mainly focus on one Qos requirement, either delay or reliability and
low computational cost.
2.3
EQGOR Design
Motivation
The pareto principle(also known as the 80-20 rule in the field of economics) states
that, for many events, roughly 80% of the effects comes from 20% of the causes [34]. We
observe that there also exists similar pareto principle in GOR. That is, must forwarding tasks
for each hop are taken by the first two or three candidates in the ordered forwarding candidate
set. This indicates that it obtain a close optimal solution in our design, by which the
algorithm’s time complexity can be effectively reduced.
R S. Publication, rspublicationhouse@gmail.com
Page 34
International Journal of Computer Application
Issue 4, Volume 6 (Nov.- Dec. 2014)
Available online on http://www.rspublication.com/ijca/ijca_index.htm
ISSN: 2250-1797
3. PROPOESD SCHEME
We proposed to exploit the geographic opportunistic routing (GOR) for multi-constrained
QoS provisioning in WSNs, which is more suitable than the multipath routing approach. We
found that existing GOR protocol cannot be directly applied to the QoS provisioning in
WSNs. Because the computation delay of a GOR protocol should be also considered in
WSNs. We studied the problem of efficient GOR for multi-constrained QoS provisioning
(EGQP) in WSNs. We formulated the EGQP problem as a multi-objective multi-constraint
optimization problem and analyzed the properties of EGQP’s multiple objectives. Based on
our analysis and observations, we then proposed an Efficient QoS-aware GOR (EQGOR)
algorithm for QoS provisioning in WSNs. EQGOR achieves a good balance between these
multiple objectives, and has a very low time complexity, which is specifically tailored for
WSNs considering the resource limitation of sensor devices.
1. We proposed to improve the routing latency and routing cost in WSNs with unreliable
links
2. We find that existing EGQR protocol has some multi-constrain problems WSNs.
Therefore, we investigate the problem of Extended GOP in WSNs.
3. Multipath routing
4. EGOP significantly improves both the end-to-end energy efficiency and latency, and it is
characterized by the low time complexity.
4. SYSTEM MODEL
We consider a multi-hop WSN in a two-dimensional planar region. We assume the network is
densely deployed, i.e., each node has plenty of neighbors. Nodes know the geographical
location information of their direct neighbors and where the destination is [26]. We assume
that the MAC layer provides the link quality estimation service, e.g., the packet reception ratio
(PRR) information on each link can be obtained by counting of the lost probe messages or
data packets [27]. Each node is aware of the PRR values to its one-hop neighbors.
R S. Publication, rspublicationhouse@gmail.com
Page 35
International Journal of Computer Application
Issue 4, Volume 6 (Nov.- Dec. 2014)
Available online on http://www.rspublication.com/ijca/ijca_index.htm
ISSN: 2250-1797
5. PROBLEM STATEMENT
Existing solutions can only be used to deal with adversaries who have only a local view of
network traffic. A highly motivated adversary can easily eavesdrop on the entire network and
defeat all these solutions. For example, the adversary may decide to deploy his own set of
sensor nodes to monitor the communication in the target network. However, all these existing
methods assume that the adversary is a local eavesdropper. If an adversary has the global
knowledge of the network traffic, it can easily defeat these schemes. For example, thesinglehop packet progress between nodes i and jk, respectively. In Eq. 8 and Eq. 9,
pij
k 1 pis the probability of
k
m=0 ijm
the kth forwarding candidate∏in
(Fi) takes
j
thethforwarding
task. tjk is the single-hop medium delay of forward
the k
er
in j(Fi).
We define espeedi( j (Fi)) as the expected single-hop pack-et speed for node i given the
ordered forwarding candidate set j (Fi), which is calculated by dividing the single-hop packet
progress to the single-hop media delay, as in Eq. 10.
n
p
(
aij ij
k
1
i
jp )
k k m=0 m
=1
espeedi(
=
j
(Fi))
n
k∑
k 1
∏
n
ij
∑
(tkpijk ∏m=0
pijm
)+t
n
∏
p
m=1 m
k=1
(10) The hop QoS requirements di and ri will be adaptively adjusted according to the actual
accumulated delay and packet progress over preceding links. Intuitively, we know that: 1)
Increasing the single-hop packet speed can relax both the hop QoS requirements, thus the endR S. Publication, rspublicationhouse@gmail.com
Page 36
International Journal of Computer Application
Issue 4, Volume 6 (Nov.- Dec. 2014)
Available online on http://www.rspublication.com/ijca/ijca_index.htm
ISSN: 2250-1797
to-end delay and reliability QoS requirements are more likely guaranteed as the packet is
progressed toward the destination; 2) Although increasing the number of forwarding
candidates would result in higher reliability, considering the energy constraint of sensor
devices, it is expected to involve less forwarding candidates to save energy cost in WSNs
(e.g., those neighbors that are not involved into local forwarding in GOR may turn off their
radios for energy saving). From the discussion above, we formulate EGQP problem as a multi
objective multi constraint optimization problem.
Problem formulation: Fi ⊆ Ci
max espeedi( j (Fi)) min |Fi|
Subject to
edi( j (Fi)) ≤ di eri( j (Fi)) ≥ ri
Dist(jm; jk) ≤ Range ∀jm ∈ Fi; ∀jk ∈ Fi;
where Range is the neighbor detection range between neigh-boring nodes. For opportunistic
routing, the nodes in for-warding candidate set should be able to overhear from each other.
Otherwise, the packet duplication problem would occur and there will be multiple data copies
being transmitted [28]. Therefore, we have the constraint Dist(jm; jk) ≤ Range. Note that if the
delay constraint is too restrictive to be achievable, we can only reduce the end-to-end delay in
a best effort approach
6. ARICHITECTURE DIAGRAM
R S. Publication, rspublicationhouse@gmail.com
Page 37
International Journal of Computer Application
Issue 4, Volume 6 (Nov.- Dec. 2014)
Available online on http://www.rspublication.com/ijca/ijca_index.htm
ISSN: 2250-1797
7. CONCLUSION
we proposed to exploit the geographic opportunistic routing (GOR) for multi-constrained QoS
provisioning in WSNs, which is more suitable than the multipath routing approach. We found
that existing GOR protocol cannot be directly applied to the QoS provisioning in WSNs.
Because the computation delay of a GOR protocol should be also considered in WSNs. We
studied the problem of efficient GOR for multi-constrained QoS provisioning (EGQP) in WSNs.
We formulated the EGQP problem as a multi-objective multi-constraint optimization problem
and analyzed the properties of EGQP’s multiple objectives. Based on our analysis and
observations, we then proposed an Efficient QoS-aware GOR (EQGOR) algorithm for QoS
provisioning in WSNs. EQGOR achieves a good balance between these multiple objectives, and
has a very low time complexity, which is specifically tailored for WSNs considering the resource
limitation of sensor devices. We conducted extensive evaluations to study the performance of the
proposed EQGOR. Evaluation results demonstrate its efficacy for QoS provisioning in WSNs.
8. REFERENCES
[1] J. Yick, B. Mukherjee, and D. Ghosal, “Wireless sensor network survey,”Comput. Netw.,
vol. 52, no. 12, pp. 2292–2330, Aug. 2008.
[2] J. Niu, L. Cheng, Y. Gu, L. Shu, and S. K. Das, “R3E: Reliable reactive routing
enhancement for wireless sensor networks,”IEEE Transaction on Industrial Informatics,
2013.
[3] I. Stojmenovic, A. Nayak, and J. Kuruvila, “Design guidelines for routing protocols in ad
hoc and sensor networks with a realistic physical layer,” IEEE Communications Magazine,
vol. 43, no. 3, pp. 101–106, 2005.
[4] J. Kuruvila, A. Nayak, and I. Stojmenovic, “Greedy localized routing for maximizing
probability of delivery in wireless ad hoc networks with a realistic physical layer,” Journal
of Parallel and Distributed Computing, vol. 66, no. 4, pp. 499–506, Apr. 2006.
[5] E. Felemban, S. Member, C. gun Lee, and E. Ekici, “MMSPEED: Multipath multispeed protocol for qos guarantee of reliability and timeliness in wireless sensor
networks,” IEEE Transactions on Mobile Computing, vol. 5, pp. 738–754, 2006.
R S. Publication, rspublicationhouse@gmail.com
Page 38
International Journal of Computer Application
Issue 4, Volume 6 (Nov.- Dec. 2014)
Available online on http://www.rspublication.com/ijca/ijca_index.htm
ISSN: 2250-1797
[6] X. Huang and Y. Fang, “Multiconstrained qos multipath routing in wireless sensor
networks,” Wireless Networks, vol. 14, no. 4, pp. 465– 478, 2008.
[7] B. Yahya and J. Ben-othman, “An energy efficient and qos aware multipath routing protocol
for wireless sensor networks,” in Proc. LCN ’09, 2009, pp. 93–100.
[8] A. B. Bagula and K. G. Mazandu, “Energy constrained multipath routing in wireless sensor
networks,” in Proc. UIC ’08, 2008, pp. 453–467.
[9] M. A. Razzaque, M. M. Alam, M. Or-Rashid, and C. S. Hong, “Multi- constrained qos
geographic routing for heterogeneous traffic in sensor networks,” in Proc. CCNC ’08, 2008
Jan., pp. 157–162.
[10] F. Xia, “Review qos challenges and opportunities in wireless sen- sor//actuator
networks,” Sensors, vol. 8, no. 2, pp. 1099–1110, 2008.
[11] F. Kuipers and P. VanMieghem, “Conditions that impact the complexity of qos
routing,” IEEE/ACM Transactions on Networking, vol. 13, no. 4, pp. 717–730, 2005.
[12] Z. Wang, E. Bulut, and B. K. Szymanski, “Energy efficient collision aware multipath
routing for wireless sensor networks,” in IEEE ICC, 2009, pp. 1–5.
[13] L. Cheng, J. Cao, C. Chen, J. Ma, and S. Das, “Exploiting geographic opportunistic routing
for soft qos provisioning in wireless sensor net- works,” in Proc. IEEE MASS’10, Nov.
2010, pp. 292–301.
[14] R. Shah, S. Wietholter, A. Wolisz, and J. Rabaey, “When does oppor- tunistic routing
make sense?” in Proc. IEEE PerCom Workshops ’05,
2005, pp. 350–356.
[15] S. Biswas and R. Morris, “Exor: opportunistic multi-hop routing for wireless
networks,” SIGCOMM Computer Communication Review, vol. 35, no. 4, pp. 133–
144, 2005.
[16] R. Bruno and M. Nurchis, “Survey on diversity-based routing in wireless mesh networks:
Challenges and solutions,” Comput. Commun., vol. 33, no. 3, pp. 269–282, Feb. 2010.
[17] E. Rozner, M. K. Han, L. Qiu, and Y. Zhang, “Model-drivenoptimization of opportunistic
routing,” SIGMETRICS Perform. Eval. Rev., vol. 39, no. 1, pp. 229–240, Jun. 2011.
[18] X. Mao, S. Tang, X. Xu, X.-Y. Li, and H. Ma, “Energy-efficientopportunistic routing in
wireless sensor networks,” IEEE Transactions on Parallel and Distributed Systems, vol. 22,
no. 11, pp. 1934–1942, Nov. 2011.
R S. Publication, rspublicationhouse@gmail.com
Page 39
International Journal of Computer Application
Issue 4, Volume 6 (Nov.- Dec. 2014)
Available online on http://www.rspublication.com/ijca/ijca_index.htm
ISSN: 2250-1797
[19] M. Zorzi and R. R. Rao, “Geographic random forwarding (geraf) for ad hoc and sensor
networks: Energy and latency performance,” IEEE Transactions on Mobile Computing, vol.
2, no. 4, pp. 349–365, 2003.
[20] K. Zeng, W. Lou, J. Yang, and D. R. Brown, III, “On throughput efficiency of geographic
opportunistic routing in multihop wireless networks,” Mobile Networks and Applications,
vol. 12, no. 5, pp. 347– 357, 2007.
[21] O. Landsiedel, E. Ghadimi, S. Duquennoy, and M. Johansson, “Low power, low delay:
opportunistic routing meets duty cycling,” in Proc. IPSN ’12, 2012, pp. 185–196.
[22] A. Basalamah, S. M. Kim, S. Guo, T. He, and Y. Tobe, “Link correlation aware
opportunistic routing,” in Proc. INFOCOM’ 12, 2012.
[23] K. Akkaya and M. Younis, “An energy-aware qos routing protocol for wireless sensor
networks,” in IEEE ICDCSW, 2003, pp. 710–715.
[24] T. He, J. A. Stankovic, C. Lu, and T. Abdelzaher, “Speed: A stateless protocol for realtime communication in sensor networks,” in IEEE ICDCS, 2003, pp. 46–55.
[25] C. Lu, B. Blum, T. Abdelzaher, J. Stankovic, and T. He, “Rap: areal-time communication
architecture for large-scale wireless sensor networks,” in IEEE RTAS, 2002, pp. 55–66.
R S. Publication, rspublicationhouse@gmail.com
Page 40