Corpus ID: 17133096

Wormhole Detection in Wireless Ad Hoc Networks

@inproceedings{Hu2002WormholeDI,
  title={Wormhole Detection in Wireless Ad Hoc Networks},
  author={Yih-Chun Hu and Adrian Perrig and David B. Johnson},
  year={2002}
}
A new and distinct variety of Valencia navel orange tree which is characterized by seedless fruit with a navel structure and has a very late maturity. 
Network security attacks Ad hoc wireless Networks
TLDR
The different types of attacks in Adhoc wireless network in its different layers are discussed and they are very severe as it may damage the complete data or information. Expand
Recovery Mechanism on Sensor Networks
TLDR
The research outcomes include re-clustering algorithms, reprogramming techniques and authentications protocols developed and tested on both hardware and simulation platforms. Expand
Cooperative strategies for pairwise secure communication channels in sensor networks
OF THESIS Submitted in Partial Fulfillment of the Requirements for the Degree of Master of Science Electrical Engineering The University of New Mexico Albuquerque, New Mexico
Attack Analysis and Detection for Ad Hoc Routing Protocols
TLDR
This paper introduces the concept of basic events, and defines a taxonomy of anomalous basic events by analyzing the basic security goals of an attack. Expand
Wormhole Attack Avoidance Technique in Mobile Adhoc Networks
TLDR
This technique for wormhole avoidance addresses the malicious nodes and avoids the routes having wormhole nodes without affecting the overall performance of the network. Expand
Real-time and passive wormhole detection for wireless sensor networks
TLDR
Pworm is presented, a passive wormhole detection and localization system based upon the key observation that a large amount of network traffic will be attracted by the wormholes and silently observes the variations in network topology to infer the wormhole existence. Expand
Pworm: Passive and Real-Time Wormhole Detection Scheme for WSNs
TLDR
Pworm is a passive wormhole detection and localization system based upon the key observation that a large amount of network traffic will be attracted by the wormholes, and is well suited for false alarms, scalability, and time delay in terms of activation as well as detection latencies. Expand
The wandering nodes: key management for low-power mobile ad hoc networks
  • S. Seys, B. Preneel
  • Computer Science
  • 25th IEEE International Conference on Distributed Computing Systems Workshops
  • 2005
TLDR
This paper describes a key management scheme that is designed to work in low-power mobile ad hoc networks, built around the concept of a neighborhood in which nodes dynamically establish link keys based on keying material they already possess. Expand
Peer identification in wireless and sensor networks using signal properties
  • T. Suen, A. Yasinsac
  • Computer Science
  • IEEE International Conference on Mobile Adhoc and Sensor Systems Conference, 2005.
  • 2005
TLDR
Methods to determine a transmitting peer node's location using signal properties and trusted-peer collaboration are investigated, and how this location information can establish peer identity confidence is considered. Expand
Mobility and security issues in wireless ad-hoc sensor networks
  • N. Boudriga, M. Obaidat
  • Computer Science
  • GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.
  • 2005
TLDR
This paper proposes an efficient scheme for the management of data, sensor mobility, and sensing security, and focuses on two fundamental issues: supporting high mobility of sensors and guaranteeing continuity of sensing, while providing for the correlation of collected data. Expand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 77 REFERENCES
The quest for security in mobile ad hoc networks
TLDR
An overview of security problems for mobile ad hoc networks is provided, distinguishing the threats on basic mechanisms and on security mechanisms and the solution to protect the security mechanisms is described. Expand
Securing ad hoc networks
TLDR
This article takes advantage of the inherent redundancy in ad hoc networks-multiple routes between nodes-to defend routing against denial-of-service attacks and uses replication and new cryptographic schemes to build a highly secure and highly available key management service, which terms the core of this security framework. Expand
Multipoint Relaying: An Efficient Technique for Flooding in Mobile Wireless Networks
TLDR
The principle and the functioning of multipoint relays are discussed, and a heuristic to select these MPRs in a mobile wireless environment is proposed, and it is proved that the computation of a multipoint relay set with minimal size is NP-complete. Expand
Securing the Nimrod routing architecture
  • Karen E. Sirois, S. Kent
  • Computer Science
  • Proceedings of SNDSS '97: Internet Society 1997 Symposium on Network and Distributed System Security
  • 1997
TLDR
The focus of this work is countering attacks that would degrade or deny service to network subscribers, using several newly developed sequence integrity mechanisms, plus a protocol for shared secret establishment. Expand
DSR: the dynamic source routing protocol for multihop wireless ad hoc networks
TLDR
The Dynamic Source Routing protocol (DSR) is a simple and efficient routing protocol designed specifically for use in multi-hop wireless ad hoc networks of mobile nodes, and a summary of some of the simulation and testbed implementation results for the protocol is provided. Expand
Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers
TLDR
The modifications address some of the previous objections to the use of Bellman-Ford, related to the poor looping properties of such algorithms in the face of broken links and the resulting time dependent nature of the interconnection topology describing the links between the Mobile hosts. Expand
Ad-hoc on-demand distance vector routing
  • C. Perkins, E. Belding-Royer
  • Computer Science
  • Proceedings WMCSA'99. Second IEEE Workshop on Mobile Computing Systems and Applications
  • 1999
TLDR
An ad-hoc network is the cooperative engagement of a collection of mobile nodes without the required intervention of any centralized access point or existing infrastructure and the proposed routing algorithm is quite suitable for a dynamic self starting network, as required by users wishing to utilize ad- hoc networks. Expand
A reliable, efficient topology broadcast protocol for dynamic networks
  • B. Bellur, R. Ogier
  • Computer Science
  • IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320)
  • 1999
TLDR
TBRPF uses the topology information received along the broadcast trees to compute the minimum-hop paths that form the trees themselves, and is the first topology broadcast protocol based on RPF with this property. Expand
SPINS: Security Protocols for Sensor Networks
TLDR
A suite of security protocols optimized for sensor networks: SPINS, which includes SNEP and μTESLA and shows that they are practical even on minimal hardware: the performance of the protocol suite easily matches the data rate of the network. Expand
Security for Sensor Networks
TLDR
This chapter identifies the vulnerabilities associated with the operational paradigms currently employed by Wireless Sensor Networks and a framework for implementing security in WSNs, which identifies the security measures necessary to mitigate the identified vulnerabilities. Expand
...
1
2
3
4
5
...