Networking together hundreds or thousands of cheap microsensor nodes allows users to accurately monitor a remote environment by intelligently combining the data from the individual nodes. These networks require robust wireless communication protocols that are energy efficient and provide low latency. We develop and analyze low-energy adaptive clustering hierarchy (LEACH), a protocol architecture for microsensor networks that combines the ideas of energy-efficient cluster-based routing and media access together with application-specific data aggregation to achieve good performance in terms of system lifetime, latency, and application-perceived quality. LEACH includes a new, distributed cluster formation technique that enables self-organization of large numbers of nodes, algorithms for adapting clusters and rotating cluster head positions to evenly distribute the energy load among all the nodes, and techniques to enable distributed signal processing to save communication resources. Our results show that LEACH can improve system lifetime by an order of magnitude compared with general-purpose multihop approaches.

/pdf/an-application-specific-protocol-architecture-for-wireless-1s7y9fiv40.pdf

An application-specific protocol architecture for wireless microsensor networks

Statistics for Spatial Data.

Advances in processor, memory and radio technology will enable small and cheap nodes capable of sensing, communication and computation. Networks of such nodes can coordinate to perform distributed sensing of environmental phenomena. In this paper, we explore the directed diffusion paradigm for such coordination. Directed diffusion is datacentric in that all communication is for named data. All nodes in a directed diffusion-based network are application-aware. This enables diffusion to achieve energy savings by selecting empirically good paths and by caching and processing data in-network. We explore and evaluate the use of directed diffusion for a simple remote-surveillance sensor network.

/pdf/directed-diffusion-a-scalable-and-robust-communication-4tsx5vxsas.pdf

Directed diffusion: a scalable and robust communication paradigm for sensor networks

Mobile ad hoc routing protocols allow nodes with wireless adaptors to communicate with one another without any pre-existing network infrastructure. Existing ad hoc routing protocols, while robust to rapidly changing network topology, assume the presence of a connected path from source to destination. Given power limitations, the advent of short-range wireless networks, and the wide physical conditions over which ad hoc networks must be deployed, in some scenarios it is likely that this assumption is invalid. In this work, we develop techniques to deliver messages in the case where there is never a connected path from source to destination or when a network partition exists at the time a message is originated. To this end, we introduce Epidemic Routing, where random pair-wise exchanges of messages among mobile hosts ensure eventual message delivery. The goals of Epidemic Routing are to: i) maximize message delivery rate, ii) minimize message latency, and iii) minimize the total resources consumed in message delivery. Through an implementation in the Monarch simulator, we show that Epidemic Routing achieves eventual delivery of 100% of messages with reasonable aggregate resource consumption in a number of interesting scenarios.

/pdf/epidemic-routing-for-partially-connected-ad-hoc-networks-s5rslcaiip.pdf

Epidemic routing for partially-connected ad hoc networks

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

Wireless mesh networks: a survey

We experimentally evaluate the performance of a wireless ad hoc network from the point of view of both the routing and transport layers. The experiments are done on a testbed with desktop PCs and laptops using wireless radio LAN interfaces. For these experiments an on-demand routing protocol called AODV (ad hoc on-demand distance vector) has been implemented as a part of the operating system protocol stack. We describe our design choices and the experimental setup. The performance evaluation reveals that the performance is poor beyond two hops at moderate to high loads.

/pdf/experimental-evaluation-of-a-wireless-ad-hoc-network-xh1itkcaql.pdf

Experimental evaluation of a wireless ad hoc network

We address deafness and directional hidden terminal problem that occur when MAC protocols are designed for directional antenna based wireless multi-hop networks. Deafness occurs when the transmitter fails to communicate to its intended receiver, because the receiver's antenna is oriented in a different direction. The directional hidden terminal problem occurs when the transmitter fails to hear a prior RTS/CTS exchange between another pair of nodes and cause collision by initiating a transmission to the receiver of the ongoing communication. Though directional antennas offer better spatial reuse, these problems can have a serious impact on network performance. In this paper, we study various scenarios in which these problems can occur and design a MAC protocol that solves them comprehensively using only a single channel and single radio interface. Current solutions in literature either do not address these issues comprehensively or use more than one radio/channel to solve them. We evaluate our protocol using detailed simulation studies. Simulation results indicate that our protocol can effectively address deafness and directional hidden terminal problem and increase network performance.

Addressing deafness and hidden terminal problem in directional antenna based wireless multi-hop networks

It is widely believed that Time Warp is prone to two potential problems: an excessive amount of wasted, rolled back computation resulting from “rollback thrashing” behaviors, and inefficient use of memory, leading to poor performance of virtual memory and/or multiprocessor cache systems. An adaptive mechanism is proposed based on the Cancelback memory management protocol that dynamically controls the amount of memory used in the simulation in order to maximize performance. The proposed mechanism is adaptive in the sense that it monitors the execution of the Time Warp program, automatically adjusts the amount of memory used to reduce Time Warp overheads (fossil collection, Cancelback, the amount of rolled back computation, etc.) to a manageable level. The mechanism is based on a model that characterizes the behavior of Time Warp programs in terms of the flow of memory buffers among different buffer pools. We demonstrate that an implementation of the adaptive mechanism on a Kendall Square Research KSR-1 multiprocessor is effective in automatically maximizing performance while minimizing memory utilization of Time Warp programs, even for dynamically changing simulation models.

An Adaptive Memory Management Protocol for Time Warp Simulation.

We present the vision of BARNET (Backscattering Activity Recognition NEtwork of Tags), a network of passive RF tags that use RF backscatter for tag-to-tag communication. BARNET not only provides identification of tagged objects but also can serve as a 'device-free' activity recognition system. BARNET's key innovation is the concept of backscatter channel state information (BCSI) which can be measured via systematic multiphase probing of the backscatter tag-to-tag channel using innovative processing on the passive tags. So far such measurements were only possible using active radio receivers that consume much higher power. Changes in BCSI provide signatures for different activities in the environment that can be learned using suitable machine learning tools. We develop the BARNET tag architecture which shows that an ASIC implementation can run on harvested RF power. We develop a printed circuit board (PCB) prototype using discrete components to evaluate activity recognition performance. We show that the prototype can recognize human daily activities with an average error around 6%. Overall, BARNET uses passive tags to achieve the same level of performance as systems that use powered, active radios.

https://dl.acm.org/doi/pdf/10.1145/3210240.3210336

BARNET: Towards Activity Recognition Using Passive Backscattering Tag-to-Tag Network

It is widely believed that the Time Warp protocol for parallel discrete event simulation is prone to two potential problems: an excessive amount of wasted, rolled back computation resulting from “rollback thrashing” behaviors, and inefficient use of memory, leading to poor performance of virtual memory and/or multiprocessor cache systems. An adaptive mechanism is proposed based on the Cancelback memory management protocol for shared-memory multiprocessors that dynamically controls the amount of memory used in the simulation in order to maximize performance. The proposed mechanism is adaptive in the sense that it monitors the execution of the Time Warp program, and using simple models, automatically adjusts the amount of memory used to reduce Time Warp overheads (fossil collection, Cancelback, the amount of rolled back computation, etc.) to a manageable level. We describe an implementation of this mechanism on a shared memory, Kendall Square Research KSR-1, multiprocessor and demonstrate its effectiveness in automatically maximizing performance while minimizing memory utilzation, for several synthetic and benchmark discrete event simulation applications. We also demonstrate the adaptive ability of the mechanism by showing that it “tracks” the time-varying nature of a communication network simulation.

Samir R. Das

Papers

Experimental evaluation of a wireless ad hoc network

Addressing deafness and hidden terminal problem in directional antenna based wireless multi-hop networks

An Adaptive Memory Management Protocol for Time Warp Simulation.

BARNET: Towards Activity Recognition Using Passive Backscattering Tag-to-Tag Network

Adaptive memory management and optimism control in time warp