skip to main content
OSTI.GOV title logo U.S. Department of Energy
Office of Scientific and Technical Information

Title: TCPL: A Defense against wormhole attacks in wireless sensor networks

Abstract

Do In this paper presents recent advances in technology have made low-cost, low-power wireless sensors with efficient energy consumption. A network of such nodes can coordinate among themselves for distributed sensing and processing of certain data. For which, we propose an architecture to provide a stateless solution in sensor networks for efficient routing in wireless sensor networks. This type of architecture is known as Tree Cast. We propose a unique method of address allocation, building up multiple disjoint trees which are geographically inter-twined and rooted at the data sink. Using these trees, routing messages to and from the sink node without maintaining any routing state in the sensor nodes is possible. In this paper, we introduce the wormhole attack, a severe attack in ad hoc networks that is particularly challenging to defend against. The wormhole attack is possible even if the attacker has not compromised any hosts and even if all communication provides authenticity and confidentiality. In the wormhole attack, an attacker records packets (or bits) at one location in the network, tunnels them to another location, and retransmits them there into the network. The wormhole attack can form a serious threat in wireless networks, especially against many sensor networkmore » routing protocols and location-based wireless security systems. For example, most existing ad hoc network routing protocols, without some mechanism to defend against the wormhole attack, would be unable to find routes longer than one or two hops, severely disrupting communication. We present a new, general mechanism, called packet leashes, for detecting and thus defending against wormhole attacks, and we present a specific protocol, called TIK, that implements leashes.« less

Authors:
 [1];  [2];  [3]
  1. PG Student, Dept of Computer Science and Engineering, KBNCE, Gulbarga, Karnataka (India)
  2. Asst. Professor, Dept of Computer Science and Engineering, KBNCE, Gulbarga, Karnataka (India)
  3. Professor, Dept of E and CE, Dayanand College of Engineering, Banglore, Karnataka (India)
Publication Date:
OSTI Identifier:
21428707
Resource Type:
Journal Article
Journal Name:
AIP Conference Proceedings
Additional Journal Information:
Journal Volume: 1298; Journal Issue: 1; Conference: ICMOS 20110: International conference on modeling, optimization and computing, West Bengal (India), 28-30 Oct 2010; Other Information: DOI: 10.1063/1.3516386; (c) 2010 American Institute of Physics; Journal ID: ISSN 0094-243X
Country of Publication:
United States
Language:
English
Subject:
99 GENERAL AND MISCELLANEOUS//MATHEMATICS, COMPUTING, AND INFORMATION SCIENCE; DATA ACQUISITION; DATA PROCESSING; DATA TRANSMISSION; ENERGY CONSUMPTION; MATHEMATICAL SOLUTIONS; NEURAL NETWORKS; ROUTING; SECURITY; SENSORS; COMMUNICATIONS; PROCESSING

Citation Formats

Kumar, K E. Naresh, Waheed, Mohd Abdul, and Basappa, K Kari. TCPL: A Defense against wormhole attacks in wireless sensor networks. United States: N. p., 2010. Web. doi:10.1063/1.3516386.
Kumar, K E. Naresh, Waheed, Mohd Abdul, & Basappa, K Kari. TCPL: A Defense against wormhole attacks in wireless sensor networks. United States. https://doi.org/10.1063/1.3516386
Kumar, K E. Naresh, Waheed, Mohd Abdul, and Basappa, K Kari. Tue . "TCPL: A Defense against wormhole attacks in wireless sensor networks". United States. https://doi.org/10.1063/1.3516386.
@article{osti_21428707,
title = {TCPL: A Defense against wormhole attacks in wireless sensor networks},
author = {Kumar, K E. Naresh and Waheed, Mohd Abdul and Basappa, K Kari},
abstractNote = {Do In this paper presents recent advances in technology have made low-cost, low-power wireless sensors with efficient energy consumption. A network of such nodes can coordinate among themselves for distributed sensing and processing of certain data. For which, we propose an architecture to provide a stateless solution in sensor networks for efficient routing in wireless sensor networks. This type of architecture is known as Tree Cast. We propose a unique method of address allocation, building up multiple disjoint trees which are geographically inter-twined and rooted at the data sink. Using these trees, routing messages to and from the sink node without maintaining any routing state in the sensor nodes is possible. In this paper, we introduce the wormhole attack, a severe attack in ad hoc networks that is particularly challenging to defend against. The wormhole attack is possible even if the attacker has not compromised any hosts and even if all communication provides authenticity and confidentiality. In the wormhole attack, an attacker records packets (or bits) at one location in the network, tunnels them to another location, and retransmits them there into the network. The wormhole attack can form a serious threat in wireless networks, especially against many sensor network routing protocols and location-based wireless security systems. For example, most existing ad hoc network routing protocols, without some mechanism to defend against the wormhole attack, would be unable to find routes longer than one or two hops, severely disrupting communication. We present a new, general mechanism, called packet leashes, for detecting and thus defending against wormhole attacks, and we present a specific protocol, called TIK, that implements leashes.},
doi = {10.1063/1.3516386},
url = {https://www.osti.gov/biblio/21428707}, journal = {AIP Conference Proceedings},
issn = {0094-243X},
number = 1,
volume = 1298,
place = {United States},
year = {2010},
month = {10}
}