"A Survey of Mobility Models for Ad Hoc Network Research," Wireless Comm. & Mobile Computing (WCMC) : Special issue on Mobile Ad Hoc Networking : Research

In the performance evaluation of a protocol for an ad hoc network, the protocol should be tested under realistic conditions including, but not limited to, a sensible transmission range, limited buffer space for the storage of messages, representative data traffic models, and realistic movements of the mobile users (i.e., a mobility model). This paper is a survey of mobility models that are used in the simulations of ad hoc networks. We describe several mobility models that represent mobile nodes whose movements are independent of each other (i.e., entity mobility models) and several mobility models that represent mobile nodes whose movements are dependent on each other (i.e., group mobility models). The goal of this paper is to present a number of mobility models in order to offer researchers more informed choices when they are deciding upon a mobility model to use in their performance evaluations. Lastly, we present simulation results that illustrate the importance of choosing a mobility model in the simulation of an ad hoc network protocol. Specifically, we illustrate how the performance results of an ad hoc network protocol drastically change as a result of changing the mobility model simulated.

/pdf/a-survey-of-mobility-models-for-ad-hoc-network-research-ygkxat400x.pdf

A survey of mobility models for ad hoc network research

We study the problem of searching on data that is encrypted using a public key system. Consider user Bob who sends email to user Alice encrypted under Alice’s public key. An email gateway wants to test whether the email contains the keyword “urgent” so that it could route the email accordingly. Alice, on the other hand does not wish to give the gateway the ability to decrypt all her messages. We define and construct a mechanism that enables Alice to provide a key to the gateway that enables the gateway to test whether the word “urgent” is a keyword in the email without learning anything else about the email. We refer to this mechanism as Public Key Encryption with keyword Search. As another example, consider a mail server that stores various messages publicly encrypted for Alice by others. Using our mechanism Alice can send the mail server a key that will enable the server to identify all messages containing some specific keyword, but learn nothing else. We define the concept of public key encryption with keyword search and give several constructions.

https://link.springer.com/content/pdf/10.1007%2F978-3-540-24676-3_30.pdf

Public Key Encryption with Keyword Search

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

As sensor networks edge closer towards wide-spread deployment, security issues become a central concern. So far, much research has focused on making sensor networks feasible and useful, and has not concentrated on security.We present a suite of security building blocks optimized for resource-constrained environments and wireless communication. SPINS has two secure building blocks: SNEP and mTESLA SNEP provides the following important baseline security primitives: Data confidentiality, two-party data authentication, and data freshness. A particularly hard problem is to provide efficient broadcast authentication, which is an important mechanism for sensor networks. mTESLA is a new protocol which provides authenticated broadcast for severely resource-constrained environments. We implemented the above protocols, and show that they are practical even on minimal hardware: the performance of the protocol suite easily matches the data rate of our network. Additionally, we demonstrate that the suite can be used for building higher level protocols.

http://www.csl.mtu.edu/cs5461/www/Reading/Perrig02.pdf

SPINS: security protocols for sensor networks

S p I- i t e Posit ion S t a t em en t : Use Distributed State for Failure Recovery

In peer-to-peer systems, attrition attacks include both traditional, network-level denial of service attacks as well as application-level attacks in which malign peers conspire to waste loyal peers' resources. We describe several defenses for LOCKSS, a peer-to-peer digital preservation system, that help ensure that application-level attacks even from powerful adversaries are less effective than simple network-level attacks, and that network-level attacks must be intense, wide-spread, and prolonged to impair the system.

Attrition Defenses for a Peer-to-Peer Digital Preservation System

An example system includes a tracker device inertial data determination portion to determine inertial data of a tracker device, a tracker device inertial data broadcast portion to broadcast a signal indicative of the inertial data of the tracker device, and a matching device coupling portion to, in response to receiving a signal from a user device indicative of motion matching of the user device with the tracker device, couple the user device with a virtual environment display portion associated with the tracker device.

Motion matching in virtual environments

We have proof that red grapes scoot around more than green grapes when microwaved.

Vitis Propulsion: Theory and Practice

An example system includes an identification engine to determine production data associated with a three-dimensionally printed object. The system also includes an alignment engine to determine a placement of the three-dimensionally printed object relative to a display device. The system includes a rendering engine to generate an image including a visual representation of the production data. The rendering engine is to position the visual representation of the production data so that representations of data points in the production data will overlay corresponding portions of the three-dimensionally printed object upon displaying by the display device.

Mary Baker

Papers

S p I- i t e Posit ion S t a t em en t : Use Distributed State for Failure Recovery

Attrition Defenses for a Peer-to-Peer Digital Preservation System

Motion matching in virtual environments

Vitis Propulsion: Theory and Practice

Generating images for objects