http://www.csun.edu/~andrzej/COMP529-S05/papers/Mesh%20Networks%20Survey.pdf

Wireless mesh networks: a survey

We consider routing security in wireless sensor networks. Many sensor network routing protocols have been proposed, but none of them have been designed with security as a goal. We propose security goals for routing in sensor networks, show how attacks against ad-hoc and peer-to-peer networks can be adapted into powerful attacks against sensor networks, introduce two classes of novel attacks against sensor networks sinkholes and HELLO floods, and analyze the security of all the major sensor network routing protocols. We describe crippling attacks against all of them and suggest countermeasures and design considerations. This is the first such analysis of secure routing in sensor networks.

/pdf/secure-routing-in-wireless-sensor-networks-attacks-and-4630unozk9.pdf

Secure routing in wireless sensor networks: attacks and countermeasures

The objective of this paper is to give a comprehensive introduction to applied cryptography with an engineer or computer scientist in mind. The emphasis is on the knowledge needed to create practical systems which supports integrity, confidentiality, or authenticity. Topics covered includes an introduction to the concepts in cryptography, attacks against cryptographic systems, key use and handling, random bit generation, encryption modes, and message authentication codes. Recommendations on algorithms and further reading is given in the end of the paper. This paper should make the reader able to build, understand and evaluate system descriptions and designs based on the cryptographic components described in the paper.

[서평]「Applied Cryptography」

An ad hoc network is a group of wireless mobile computers (or nodes), in which individual nodes cooperate by forwarding packets for each other to allow nodes to communicate beyond direct wireless transmission range. Prior research in ad hoc networking has generally studied the routing problem in a non-adversarial setting, assuming a trusted environment. In this paper, we present attacks against routing in ad hoc networks, and we present the design and performance evaluation of a new secure on-demand ad hoc network routing protocol, called Ariadne. Ariadne prevents attackers or compromised nodes from tampering with uncompromised routes consisting of uncompromised nodes, and also prevents a large number of types of Denial-of-Service attacks. In addition, Ariadne is efficient, using only highly efficient symmetric cryptographic primitives.

/pdf/ariadne-a-secure-on-demand-routing-protocol-for-ad-hoc-57ex02ywre.pdf

Ariadne: a secure on-demand routing protocol for ad hoc networks

Mobile ad hoc networks (MANETs) represent complex distributed systems that comprise wireless mobile nodes that can freely and dynamically self-organize into arbitrary and temporary, ‘‘ad-hoc’’ network topologies, allowing people and devices to seamlessly internetwork in areas with no pre-existing communication infrastructure, e.g., disaster recovery environments. Ad hoc networking concept is not a new one, having been around in various forms for over 20 years. Traditionally, tactical networks have been the only communication networking application that followed the ad hoc paradigm. Recently, the introduction of new technologies such as the Bluetooth, IEEE 802.11 and Hyperlan are helping enable eventual commercial MANET deployments outside the military domain. These recent evolutions have been generating a renewed and growing interest in the research and development of MANET. This paper attempts to provide a comprehensive overview of this dynamic field. It first explains the important role that mobile ad hoc networks play in the evolution of future wireless technologies. Then, it reviews the latest research activities in these areas, including a summary of MANETs characteristics, capabilities, applications, and design constraints. The paper concludes by presenting a set of challenges and problems requiring further research in the future. � 2003 Elsevier B.V. All rights reserved.

/pdf/mobile-ad-hoc-networking-imperatives-and-challenges-56mord86q0.pdf

Mobile ad hoc networking: imperatives and challenges

Most recent ad hoc network research has focused on providing routing services without considering security. We detail security threats against ad hoc routing protocols, specifically examining AODV and DSR. In light of these threats, we identify three different environments with distinct security requirements. We propose a solution to one, the managed-open scenario where no network infrastructure is pre-deployed, but a small amount of prior security coordination is expected. Our protocol, authenticated routing for ad hoc networks (ARAN), is based on certificates and successfully defeats all identified attacks.

/pdf/a-secure-routing-protocol-for-ad-hoc-networks-2ifoapah6c.pdf

A secure routing protocol for ad hoc networks

Initial work in ad hoc routing has considered only the problem of providing efficient mechanisms for finding paths in very dynamic networks, without considering security. Because of this, there are a number of attacks that can be used to manipulate the routing in an ad hoc network. In this paper, we describe these threats, specifically showing their effects on ad hoc on-demand distance vector and dynamic source routing. Our protocol, named authenticated routing for ad hoc networks (ARAN), uses public-key cryptographic mechanisms to defeat all identified attacks. We detail how ARAN can secure routing in environments where nodes are authorized to participate but untrusted to cooperate, as well as environments where participants do not need to be authorized to participate. Through both simulation and experimentation with our publicly available implementation, we characterize and evaluate ARAN and show that it is able to effectively and efficiently discover secure routes within an ad hoc network.

/pdf/authenticated-routing-for-ad-hoc-networks-250x85iy34.pdf

Authenticated routing for ad hoc networks

Admission control of flows is essential for providing quality of service in multihop wireless networks. In order to make an admission decision for a new flow, the expected bandwidth consumption of the flow must be correctly determined. Due to the shared nature of the wireless medium, nodes along a multihop path contend among themselves for access to the medium. This leads to intra-flow contention; contention between packets of the same flow being forwarded at different hops along a multihop path causing the actual bandwidth consumption of the flow to become a multiple of its single hop bandwidth requirement. Determining the amount of intra-flow contention is non-trivial since interfering nodes may not be able to communicate directly if they are outside each other's transmission range. In this paper, we propose two methods to determine the extent of intra-flow contention along multihop paths. The highlight of the proposed solutions is that carrier-sensing data is used to deduce information about carrier-sensing neighbors, and no high power transmissions are necessary. Analytical and simulation results show that our methods estimate intra-flow contention with low error, while significantly reducing overhead, energy consumption and latency as compared to previous approaches.

Determining intra-flow contention along multihop paths in wireless networks

Existing solutions for QoS-aware routing in mobile multihop networks attempt to discover a QoS-satisfactory route for the user at the user's current location. If a suitable route is not available at the current location, the user is denied access. This approach does not take advantage of the special characteristics of mobile multihop networks. That is, users in these networks are mobile and their connectivity is dependent on their location and the locations of other users. By changing their location, users can alter their connectivity characteristics and potentially obtain better service from the network. In this paper, we propose enhancing QoS-aware routing protocols to take advantage of this characteristic. With our solution, if a satisfactory route is not available at the user's current location, the protocol discovers a nearby location where a better route is available. The user can then choose to move to the suggested location to improve the received quality of service. We demonstrate our idea by appropriately extending a QoS-sensitive version of the AODV routing protocol, and presenting a simulation-based evaluation. Simulation results show the effectiveness and efficiency of our idea.

/pdf/leveraging-mobility-to-improve-quality-of-service-in-mobile-1hlijcf9cb.pdf

Leveraging mobility to improve quality of service in mobile networks

CSMA-based MAC protocols require wireless nodes to share the transmission medium with other nodes that are within carrier-sensing (CS) range. Hence, operations that depend on and can potentially affect the state of the shared medium, such as admission control, require coordination and information sharing among these nodes. The CS range of wireless nodes is traditionally much larger than the reception range. Nodes that are outside reception range but within CS range can sense packet transmissions; however, they are unable to decode the packet contents. Direct messaging between these nodes is therefore not feasible for information sharing. In this paper, we describe two perceptive approaches for communication with nodes within CS range. Our approaches exploit the ability of a node to detect a change in the strength of the carrier signal when a transmission is in progress. Information is encoded in, and inferred from, perceptible transmission characteristics, such as the duration of a transmission or the silence between adjacent transmissions. This paper evaluates the feasibility and effectiveness of our perceptive communication mechanisms on a hardware testbed. We implement a prototype of our solution on the Mica2 mote platform and test it in different network scenarios. Our results demonstrate that the durations of transmissions and silences can be correctly detected within a small margin of error in most situations, thus verifying the utility of our approach.

/pdf/the-utility-of-perceptive-communication-between-distant-1qxjb7hgdd.pdf

K. Sanzgiri

Papers

A secure routing protocol for ad hoc networks

Authenticated routing for ad hoc networks

Determining intra-flow contention along multihop paths in wireless networks

Leveraging mobility to improve quality of service in mobile networks

The utility of perceptive communication between distant wireless nodes