Impact Factor:6.549
 Scopus Suggested Journal: Tracking ID for this title suggestion is: 55EC484EE39417F0

International Journal
of Computer Engineering in Research Trends (IJCERT)

Scholarly, Peer-Reviewed, Platinum Open Access and Multidisciplinary

Welcome to IJCERT

International Journal of Computer Engineering in Research Trends. Scholarly, Peer-Reviewed, Platinum Open Access and Multidisciplinary

ISSN(Online):2349-7084                 Submit Paper    Check Paper Status    Conference Proposal

Back to Current Issues

Exigent Life from Wireless ad-hoc Signal Networks

M.Tech Research Scholar, Priyadarshini Institute of Technology and Science for Women
Assistant Professor, Priyadarshini Institute of Technology and Science for Women

An ad hoc sensor wireless network has been drawing interest among the researches in the direction sensing and pervasive computing. The security work in this area is priority and primarily focusing on denial of communication at the routing or medium access control levels. In this paper the attacks which are mainly focusing on routing protocol layer that kind of attacker is known as resource depletion attacks. These “Vampire” attacks are not impacting any specific kind of protocols. Finding of vampire attacks in the network is not a easy one. It’s very difficult to detect, devastating .A simple vampire presenting in the network can increasing network wide energy usage. We discuss some methods and alternative routing protocols solution will be avoiding some sort of problems which causing by vampire attacks.

J.JAYASANTHI,K.SUMALATHA."Exigent Life from Wireless ad-hoc Signal Networks". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.1, Issue 06,pp.397-404, DECEMBER - 2014, URL :,

Keywords : Sensor Networks; Wireless Networks; Ad hoc Networks; Routing Protocols.

[1] The network simulator — ns-2.
[2] Imad Aad, Jean-Pierre Hubaux, and Edward W.
Knightly, Denial of service resilience in ad hoc networks, MobiCom, 2004.
[3] Gergely Acs, Levente Buttyan, and Istvan Vajda,
Provably secure on-demand source routing in mobile ad hoc networks, IEEE Transactions on Mobile
Computing 05 (2006), no. 11.
[4] Tuomas Aura, Dos-resistant authentication with
client puzzles, International workshop on security
protocols, 2001.
[5] John Bellardo and Stefan Savage, 802.11 denial-ofservice attacks: real vulnerabilities and practical solutions, USENIX security, 2003.
[6] Daniel Bernstein and Peter Schwabe, New AES
software speed records, INDOCRYPT, 2008.
[7] Daniel J. Bernstein, Syn cookies, 1996.
[8] I.F. Blake, G. Seroussi, and N.P. Smart, Elliptic
curves in cryptography, Vol. 265, Cambridge University Press, 1999.
[9] Joppe W. Bos, Dag Arne Osvik, and Deian Stefan,
Fast implementations of AES on various platforms,
[10]Haowen Chan and Adrian Perrig, Security and privacy in sensor net-works, Computer 36 (2003), no.
[11]Jae-Hwan Chang and Leandros Tassiulas, Maximum lifetime routing in wireless sensor networks,
IEEE/ACM Transactions on Networking 12 (2004),
no. 4.
[12]Thomas H. Clausen and Philippe Jacquet, Optimized link state routing protocol (OLSR), 2003.
[13]Jing Deng, Richard Han, and Shivakant Mishra, Defending against path-based DoS attacks in wireless
sensor networks, ACM workshop on security of ad
hoc and sensor networks, 2005.
[14] , INSENS: Intrusion-tolerant routing for wireless sensor net-works, Computer Communications
29 (2006), no. 2.
[15]Sheetalkumar Doshi, Shweta Bhandare, and Timothy X. Brown, An on-demand minimum energy
routing protocol for a wireless ad hoc network,
ACM SIGMOBILE Mobile Computing and Communications Review 6 (2002), no. 3.
[16]John R. Douceur, The Sybil attack, International
workshop on peer-to-peer systems, 2002.
[17]Hans Eberle, Arvinderpal Wander, Nils Gura,
Sheueling Chang-Shantz, and Vipul Gupta, Architectural extensions for elliptic curve cryptography
over GF(2m) on 8-bit microprocessors, ASAP, 2005.
[18]T. English, M. Keller, Ka Lok Man, E. Popovici, M.
Schellekens, and W. Marnane, A low-power pairingbased cryptographic accelerator for embedded security applications, SOCC, 2009.
[19]Laura M. Feeney, An energy consumption model for
performance anal-ysis of routing protocols for mobile ad hoc networks, Mobile Networks and Applications 6 (2001), no. 3.
[20]Martin Feldhofer, Sandra Dominikus, and Johannes Wolkerstorfer,
Strong authentication for RFID systems using the
AES algorithm, CHES, 2004.
[21]Rodrigo Fonseca, Sylvia Ratnasamy, Jerry Zhao,
Cheng T. Ee, David Culler, Scott Shenker, and Ion Stoica, Beacon vector routing: Scalable point-to-point
routing in wireless sensornets, NSDI, 2005.
[22]Steven Galbraith, Keith Harrison, and David Soldera, Implementing the tate pairing, Algorithmic
number theory, 2002.
[23]Sharon Goldberg, David Xiao, Eran Tromer, Boaz
Barak, and Jennifer Rexford, Path-quality monitoring in the presence of adversaries, SIG-METRICS,
[24]Andrea J. Goldsmith and Stephen B. Wicker, Design
challenges for energy-constrained ad hoc wireless
networks, IEEE Wireless Communications 9 (2002),
no. 4.
[25]R. Govindan and A. Reddy, An analysis of internet
inter-domain topology and route stability, INFOCOM, 1997.
[26]Mina Guirguis, Azer Bestavros, Ibrahim Matta, and
Yuting Zhang,
Reduction of quality (RoQ) attacks on Internet endsystems, INFOCOM, 2005. 
[27]J.L. Hill and D.E. Culler, Mica: a wireless platform
for deeply embedded networks, IEEE Micro 22
(2002), no. 6.
[28]Yih-Chun Hu, David B. Johnson, and Adrian Perrig,
SEAD: secure efficient distance vector routing for
mobile wireless ad hoc networks, IEEE workshop on
mobile computing systems and applications, 2002.
[29]Yih-Chun Hu, Adrian Perrig, and David B. Johnson,
Ariadne: A secure on-demand routing protocol for
ad hoc networks, MobiCom, 2002.


Download :

Refbacks : Currently there are no Refbacks

Support Us

We have kept IJCERT is a free peer-reviewed scientific journal to endorse conservation. We have not put up a paywall to readers, and we do not charge for publishing. But running a monthly journal costs is a lot. While we do have some associates, we still need support to keep the journal flourishing. If our readers help fund it, our future will be more secure.

Quick Links


Science Central

Score: 13.30

Submit your paper to