ACM SIGBED Review

Buschmann, Carsten; Pfisterer, Dennis; Fischer, Stefan; Fekete, Sándor P.; Kröller, Alexander

doi: 10.1145/1121782.1121784pmid: N/A

In this paper we present a modular and extensible visualization framework for wireless sensor networks. These networks have typically no means of visualizing their internal state, sensor readings or computational results. Visualization is therefore a key issue to develop and operate these networks. Data emitted by individual sensor nodes is collected by gateway software running on a machine in the sensor network. It is then passed on via TCP/IP to the visualization software on a potentially remote machine. Visualization plug-ins can register to different data types, and visualize the information using a flexible multi-layer mechanism that renders the information on a canvas. Developers can easily adapt existing or develop new custom tailored plug-ins for their specific visualization needs and applications.

Morcos, Hany; Matta, Ibrahim; Bestavros, Azer

doi: 10.1145/1121782.1121786pmid: N/A

Routing protocols in wireless sensor networks (WSN) face two main challenges: first, the challenging environments in which WSN's are deployed negatively affect the quality of the routing process. Therefore, routing protocols for WSN's should recognize and react to node failures and packet losses. Second, sensor nodes are battery-powered, which makes power a scarce resource. Routing protocols should optimize power consumption to prolong the lifetime of the WSN. In this paper, we present a new adaptive routing protocol for WSN's, we call it M 2 RC. M 2 RC has two phases: mesh establishment phase and data forwarding phase. In the first phase, M 2 RC establishes the routing state to enable multipath data forwarding. In the second phase, M 2 RC forwards data packets from the source to the sink. Targeting hop-by-hop reliability, an M 2 RC forwarding node waits for an acknowledgement (ACK) that its packets were correctly received at the next neighbor. Based on this feedback, an M 2 RC node applies multiplicative-increase/additive-decrease (MIAD) to control the number of neighbors targeted by its packet broadcast. We simulated M 2 RC in the ns-2 simulator 4 and compared it to GRAB 1, Max-power, and Min-power routing schemes. Our simulations show that M 2 RC achieves the highest throughput with at least 10-30% less consumed power per delivered report in scenarios where a certain numberof nodes unexpectedly fail.-

Gummadi, Ramakrishna; Li, Xin; Govindan, Ramesh; Shahabi, Cyrus; Hong, Wei

doi: 10.1145/1121782.1121785pmid: N/A

Recent sensor networks research has produced a class of data storage and query processing techniques called Data-Centric Storage that leverages locality-preserving distributed indexes to efficiently answer multi-dimensional range and range-aggregate queries. These distributed indexes offer a rich design space of a) logical decompositions of sensor relation schema into indexes, as well as b) physical mappings of these indexes onto sensors. In this paper, we discuss this space for energy-efficient data organizations (logical and physical mappings of tuples and attributes to sensor nodes) and examine the performance of purely local query optimization techniques for processing queries that span such decomposed relations.-