Vampire Attacks: Draining Life From Wireless Adhoc Sensor Networks

Pavani Potnuri, Bharath Kumar Gowru, Venkateswara Rao Nadakuditi


Ad hoc less power wireless networks are one of the current topics in the field of security and pervasive computing. Most of the research work done before for improving the security of the networks in this area is mainly limited to the denial of message at the routing level or MAC levels. This project work investigates the attacks done with an aim of resource reduction at the routing protocol layer. These attacks can lead to the quick draining of the nodes battery power there by permanently disable the networks. These resource depletion attacks are called as “Vampire” attacks, which are not particular to any  protocol, instead they depends on the general features of the routing protocols classes. In some of the bad cases, a particular vampire can increases network-wide bandwidth usage in the order of O (N). Present techniques to overcome these attacks were discussed, including one new protocol has been demonstrated which has successfully reduced the affects of the vampires while forwarding the packet as per the simulation results in the testing environment modeled in this work. A public key algorithm named Elliptic Curve Cryptography (ECC) algorithm is also used for more security provision.


sensor networks, security, protocol and Elliptic Curve Cryptography.


I. Aad, J.-P. Hubaux, and E.W. Knightly, “Denial of Service Resilience in Ad Hoc Networks,” Proc. ACM MobiCom, 2004.

G. Acs, L. Buttyan, and I. Vajda, “Provably Secure On-Demand Source Routing in Mobile Ad Hoc Networks,” IEEE Trans. Mobile Computing, vol. 5, no. 11, pp. 1533-1546, Nov. 2006.

T. Aura, “Dos-Resistant Authentication with Client Puzzles,” Proc. Int’l Workshop Security Protocols, 2001.

J. Bellardo and S. Savage, “802.11 Denial-of-Service Attacks: Real Vulnerabilities and Practical Solutions,” Proc. 12th Conf. USENIX Security, 2003.

D. Bernstein and P. Schwabe, “New AES Software Speed Records,” Proc. Ninth Int’l Conf. Cryptology in India: Progress in Cryptology (INDOCRYPT), 2008.

D.J. Bernstein, “Syn Cookies,”, 1996.

I.F. Blaked, G. Seroussi, and N.P. Smart, Elliptic Curves in Cryptography, vol. 265. Cambridge Univ. , 1999.

J.W. Bos, D.A. Osvik, and D. Stefan, “Fast Implementations of AES on Various Platforms,” Cryptology ePrint Archive, Report 2009/ 501,, 2009.

H. Chan and A. Perrig, “Security and Privacy in Sensor Networks,” Computer, vol. 36, no. 10, pp. 103-105, Oct. 2003.

H. Chan and A. Perrig, “Security and Privacy in Sensor Networks,” Computer, vol. 36, no. 10, pp. 103-105, Oct. 2003.

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.

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.

Y.-C. Hu, D.B. Johnson, and A. Perrig, “Ariadne: A Secure On-Demand Routing Protocol for Ad Hoc Networks,” Proc. MobiCom, 2002.

M. Maleki, K. Dantu, and M. Pedram, “Power-Aware Source Routing Protocol for Mobile Ad Hoc Networks,” Proc. Int’l Symp. Low Power Electronics and Design (ISLPED), 2002.

Full Text: PDF [FULL TEXT]


  • There are currently no refbacks.

Copyright © 2013, All rights reserved.|

Creative Commons License
International Journal of Science Engineering and Advance Technology is licensed under a Creative Commons Attribution 3.0 Unported License.Based on a work at IJSEat , Permissions beyond the scope of this license may be available at