Wireless Communications

We present Greedy Perimeter Stateless Routing (GPSR), a novel routing protocol for wireless datagram networks that uses the positions of routers and a packet's destination to make packet forwarding decisions. GPSR makes greedy forwarding decisions using only information about a router's immediate neighbors in the network topology. When a packet reaches a region where greedy forwarding is impossible, the algorithm recovers by routing around the perimeter of the region. By keeping state only about the local topology, GPSR scales better in per-router state than shortest-path and ad-hoc routing protocols as the number of network destinations increases. Under mobility's frequent topology changes, GPSR can use local topology information to find correct new routes quickly. We describe the GPSR protocol, and use extensive simulation of mobile wireless networks to compare its performance with that of Dynamic Source Routing. Our simulations demonstrate GPSR's scalability on densely deployed wireless networks.

/pdf/gpsr-greedy-perimeter-stateless-routing-for-wireless-59gz21qf8y.pdf

GPSR: greedy perimeter stateless routing for wireless networks

We propose B-MAC, a carrier sense media access protocol for wireless sensor networks that provides a flexible interface to obtain ultra low power operation, effective collision avoidance, and high channel utilization. To achieve low power operation, B-MAC employs an adaptive preamble sampling scheme to reduce duty cycle and minimize idle listening. B-MAC supports on-the-fly reconfiguration and provides bidirectional interfaces for system services to optimize performance, whether it be for throughput, latency, or power conservation. We build an analytical model of a class of sensor network applications. We use the model to show the effect of changing B-MAC's parameters and predict the behavior of sensor network applications. By comparing B-MAC to conventional 802.11-inspired protocols, specifically SMAC, we develop an experimental characterization of B-MAC over a wide range of network conditions. We show that B-MAC's flexibility results in better packet delivery rates, throughput, latency, and energy consumption than S-MAC. By deploying a real world monitoring application with multihop networking, we validate our protocol design and model. Our results illustrate the need for flexible protocols to effectively realize energy efficient sensor network applications.

/pdf/versatile-low-power-media-access-for-wireless-sensor-4pgt6gm9z8.pdf

Versatile low power media access for wireless sensor networks

The state of the art in data compression is arithmetic coding, not the better-known Huffman method. Arithmetic coding gives greater compression, is faster for adaptive models, and clearly separates the model from the channel encoding.

/pdf/arithmetic-coding-for-data-compression-3eqc4smaaa.pdf

Arithmetic coding for data compression

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

In September 1968 the University of Hawaii began work on a research program to investigate the use of radio communications for computer-computer and console-computer links. In this report we describe a remote-access computer system---THE ALOHA SYSTEM---under development as part of that research program and discuss some advantages of radio communications over conventional wire communications for interactive users of a large computer system. Although THE ALOHA SYSTEM research program is composed of a large number of research projects, in this report we shall be concerned primarily with a novel form of random-access radio communications developed for use within THE ALOHA SYSTEM.

/pdf/the-aloha-system-another-alternative-for-computer-1m12kbuwqr.pdf

THE ALOHA SYSTEM: another alternative for computer communications

Information theory and coding

Packet broadcasting is a form of data communications architecture which can combine the features of packet switching with those of broadcast channels for data communication networks. Much of the basic theory of packet broadcasting has been presented as a byproduct in a sequence of papers with a distinctly practical emphasis. In this paper we provide a unified presentation of packet broadcasting theory. In Section II we introduce the theory of packet broadcasting data networks. In Section III we provide some theoretical results dealing with the performance of a packet broadcasting network when the users of the network have a variety of data rates. In Section IV we deal with packet broadcasting networks distributed in space, and in Section V we derive some properties of power-limited packet broadcasting channels, showing that the throughput of such channels can approach that of equivalent point-to-point channels.

https://www3.cs.stonybrook.edu/~jgao/CSE370-spring07/aloha-1977.pdf

The Throughput of Packet Broadcasting Channels

The ALOHA System-Another Alternative for Computer Communications

The first computer-communication networks put into operation were designed around the communications provided by the existing worldwide telephone network. Lucky has given a convincing rationale for that decision.

N. Abramson

Papers

THE ALOHA SYSTEM: another alternative for computer communications

Information theory and coding

The Throughput of Packet Broadcasting Channels

The ALOHA System-Another Alternative for Computer Communications

Packet switching with satellites