A wireless adhoc sensor network consists of a
number of sensors spread across a geographical area. A
primary challenge in the design of Wireless adhoc sensor
networks is to enhance the network lifetime and usage of low
energy. Due to the resource constrained nature of sensor
nodes, innovative techniques are required to extend the
network lifetime in WSN`s. Nodes energy is considered as an
important resource for sensor node which are battery
powered based. The resource depletion attacks such as
vampire attacks at the routing protocol layer, permanently
disable the WSN`s by evacuating the battery power. This
paper proposes an energy efficient routing protocol which
finds the forwarding path between sensor nodes and sink to
avoid energy consumption attacks (vampire attacks) by using
heuristic function. An energy aware routing protocol is
proposed that uses heuristic function and A* search
algorithm to find an optimal route in case of battery
depletion attacks. In addition to this, the low energy nodes
are avoided for repetitive data transmissions that extends the
network lifetime. Maximum energy efficiency, optimal route
and the avoidance of data transmission by low energy nodes
is achieved in the proposed system.
Published In:IJCSN Journal Volume 5, Issue 4
Date of Publication : August 2016
Pages : 667-674
Figures :04
Tables : 03
E. Gayathri : Research Scholar, Department Of Computer Science and Technology,
Sri Krishnadevaraya University, Anantapuramu,
Andhra Pradesh, India
Dr N. Geethanjali : Professor, Department Of Computer Science and Technology,
Sri Krishnadevaraya University, Anantapuramu,
Andhra Pradesh, India
Wireless Adhoc Sensor Networks, Denial of
Service, Balancing Energy Consumption, Energy-Efficient
Routing, Throughput, Network Lifetime
In this paper, we defined Vampire attacks, resource
consumption attacks that use routing protocols to
permanently disable ad hoc wireless sensor networks by
evacuating nodes’ battery power. These attacks do not
depend on particular protocols or implementations, but
rather expose vulnerabilities in a number of popular
protocol classes. A number of protocols and challenges have been made to overcome the carousel attack but less
concentration is shown towards the stretch attack. We
measured their attack success on a randomly generated
topology of 50 nodes. In this paper, to overcome the
stretch attack an energy aware heuristic-based routing
protocol is proposed that uses heuristic function and A *
search to find an optimal and minimal route. In addition to
the heuristic function and A* search the longlife factor is
used as one of the route selection parameter in our
proposed algorithm. Hence, PLGPa protocol, the first
sensor network routing protocol proposed, always avoids
the low-energy nodes if there exists alternative paths in the
network. Our proposed routing scheme extends network
lifetime and degrades the chance of network partition in
the presence of malicious nodes. Simulation results show
that depending on the location of the adversary, network
energy expenditure during the forwarding phase are far
better than the existing. We have not offered totally a good
solution for Vampire attacks during the topology discovery
phase, but proposed some ideas about damage limitations
caused in the adhoc sensor networks.
[1] B. Karp and H.T. Kung, “GPSR: Greedy Perimeter
Stateless Routing for Wireless Networks,” Proc. ACM
MobiCom, 2000.
[2] F. Stajano and R. Anderson, “The Resurrecting
Duckling: Security Issues for Ad-Hoc Wireless
Networks,” Proc. Int’l Workshop Security Protocols,
1999.
[3] Eugene Y. Vasserman and Nicholas Hopper.
(FEBRUARY 2013). Vampire Attacks: Draining Life
from Wireless Ad Hoc Sensor Networks. IEEE. 12 (2),
p318-332.
[4] W. Heinzelman, A. Chandrakasan, and H.
Balakrishnan, “Energy- Efficient Communication
Protocols for Wireless Microsensor Networks,” Proc.
Hawaiian Int’l Conf. Systems Science, 2000.
[5] Boukerche, X. Cheng, and J. Linus, “Energy-Aware
Data- Centric Routing in Microsensor Networks,”
Proc. Sixth ACM Int’lWorkshop Modeling Analysis
and Simulation of Wireless and Mobile Systems
(MSWIM’ 03), pp. 42-49, 2003.
[6] O. Younis and S. Fahmy, “HEED: A Hybrid, Energy-
Efficient Distributed Clustering Approach for Ad Hoc
Sensor Networks,” IEEE Trans. Mobile Computing,
vol. 3, no. 4, pp. 366-379, Oct.-Dec.2004.
[7] X. Wu and G. Chen, and S.K. Das, “Avoiding Energy
Holes in Wireless Sensor Networks with Nonuniform
Node Distribution,” vol. 19, no. 5, pp. 710-720, 2008.
[8] J. Deng, R. Han, and S. Mishra, “INSENS: Intrusion-
Tolerant Routing for Wireless Sensor Networks,”
Computer Comm., vol. 29, no. 2, pp. 216-230, 2006.
[9] S. Doshi, S. Bhandare, and T.X. Brown, “An On-
Demand Minimum Energy Routing Protocol for a
Wireless Ad Hoc Network,” ACM SIGMOBILE
Mobile Computing and Comm. Rev., vol. 6, no. 3, pp.
50-66, 2002. [10] J.R. Douceur, “The Sybil Attack,” Proc. Int’l Workshop
Peer-to-Peer Systems, 2002.
[11] R.C. Shah and J.M. Rabaey, “Energy Aware Routing
for Low Energy Ad Hoc Sensor Networks,” Proc. IEEE
Wireless Comm. and Network Conf. (WCNC), 2002.
[12] K. M. Rana and M. A. Zaveri, “ASEER: A routing
method to extend life of two-tiered wireless sensor
network”, in Int. J. Adv. Smart Sensor Netw. Syst., vol.
11(2), pp. 1 –16, 2011.
[13] J. Park and S. Sahni, “An online heuristic for
maximum lifetime routing in WSNs”, in IEEE Trans.
Comput., vol. 55, pp. 1048–1056, 2006.
[14] Y.-C. Hu, D.B. Johnson, and A. Perrig, “Ariadne: A
Secure On- Demand Routing Protocol for Ad Hoc
Networks,” Proc. MobiCom, 2002.
[15] H. Zhang and H. Shen, ”Balancing energy consumption
to maximize network lifetime in data-gathering sensor
networks”, in IEEE Trans. Parallel Distrib. Syst., vol.
20, pp. 1526—1539, 2009.
[16] K. Akkaya and M. Younis, ”A survey of routing
protocols in wireless sensor networks”, vol. 3(3), pp.
325–349, 2005.
[17] F. Ren , J. Zhang , T. He , C. Lin and S. K. Das,
”EBRP: Energy-balanced routing protocol for data
gathering in wireless sensor networks”, in IEEE Trans.
Parallel Distrib. Syst., vol. 22, pp. 2108 –2125, 2011.
[18] K. M. Passino and P. J. Antsaklis, “A metric space
approach to the specification of the heuristic function
for the algorithm”, in IEEE Trans. on System, MAN and
Cybernetics, vol. 24(1), pp. 159–166, 1994.
[19] S. Singh, M. Woo, and C.S. Raghavendra, “Power-
Aware Routing in Mobile Ad Hoc Networks,” Proc.
ACM MobiCom, 1998.
[20] F. Ren , J. Zhang , T. He , C. Lin and S. K. Das,
”EBRP: Energy-balanced routing protocol for data
gathering in wireless sensor networks”, in IEEE Trans.
Parallel Distrib. Syst., vol. 22, pp. 2108 –2125, 2011.
[21] J.-H. Chang and L. Tassiulas, “Maximum Lifetime
Routing in Wireless Sensor Networks,” IEEE/ACM
Trans. Networking, vol. 12, no. 4, pp. 609-619, Aug.
2004.
[22] N.Kaleeswari and Dr.K.Baskaran ''Implementation of
energy balancing in wireless sensor networks'', IJCSI
International journal of computer science, vol 9, issue
3, no 2, May 2012.
[23] A.J. Goldsmith and S.B. Wicker, “Design Challenges
for Energy- Constrained Ad Hoc Wireless Networks,”
IEEE Wireless Comm., vol. 9, no. 4, pp. 8-27, Aug.
2002.