Wireless sensor networks for habitat monitoring (0)

by A Mainwaring, D Culler, J Polastre, R Szewczyk, J Anderson
Venue:in Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications, ser. WSNA ’02
Add To MetaCart
Results 1 - 10 of 1,496

TAG: a Tiny AGgregation service for ad-hoc sensor networks

by Samuel Madden, Michael J. Franklin, Joseph M. Hellerstein, Wei Hong - IN OSDI , 2002
"... ..."
Abstract - Cited by 1389 (35 self) - Add to MetaCart
Abstract not found
(Show Context)

Versatile Low Power Media Access for Wireless Sensor Networks

by Joseph Polastre, Jason Hill, David Culler , 2004
"... 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 ..."
Abstract - Cited by 1099 (19 self) - Add to MetaCart
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.11inspired protocols, specifically S-MAC, 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.

The nesC language: A holistic approach to networked embedded systems

by David Gay, Matt Welsh, Philip Levis, Eric Brewer, Robert Von Behren, David Culler - In Proceedings of Programming Language Design and Implementation (PLDI , 2003
"... We present nesC, a programming language for networked embedded systems that represent a new design space for application developers. An example of a networked embedded system is a sensor network, which consists of (potentially) thousands of tiny, lowpower “motes, ” each of which execute concurrent, ..."
Abstract - Cited by 943 (48 self) - Add to MetaCart
We present nesC, a programming language for networked embedded systems that represent a new design space for application developers. An example of a networked embedded system is a sensor network, which consists of (potentially) thousands of tiny, lowpower “motes, ” each of which execute concurrent, reactive programs that must operate with severe memory and power constraints. nesC’s contribution is to support the special needs of this domain by exposing a programming model that incorporates event-driven execution, a flexible concurrency model, and component-oriented application design. Restrictions on the programming model allow the nesC compiler to perform whole-program analyses, including data-race detection (which improves reliability) and aggressive function inlining (which reduces resource consumption). nesC has been used to implement TinyOS, a small operating system for sensor networks, as well as several significant sensor applications. nesC and TinyOS have been adopted by a large number of sensor network research groups, and our experience and evaluation of the language shows that it is effective at supporting the complex, concurrent programming style demanded by this new class of deeply networked systems.
(Show Context)

TOSSIM: Accurate and Scalable Simulation of Entire TinyOS Applications

by Philip Levis, Nelson Lee, Matt Welsh, David Culler , 2003
"... Accurate and scalable simulation has historically been a key enabling factor for systems research. We present TOSSIM, a simulator for TinyOS wireless sensor networks. By exploiting the sensor network domain and TinyOS’s design, TOSSIM can capture network behavior at a high fidelity while scaling to ..."
Abstract - Cited by 784 (19 self) - Add to MetaCart
Accurate and scalable simulation has historically been a key enabling factor for systems research. We present TOSSIM, a simulator for TinyOS wireless sensor networks. By exploiting the sensor network domain and TinyOS’s design, TOSSIM can capture network behavior at a high fidelity while scaling to thousands of nodes. By using a probabilistic bit error model for the network, TOSSIM remains simple and efficient, but expressive enough to capture a wide range of network interactions. Using TOSSIM, we have discovered several bugs in TinyOS, ranging from network bitlevel MAC interactions to queue overflows in an ad-hoc routing protocol. Through these and other evaluations, we show that detailed, scalable sensor network simulation is possible.

Energy-Efficient Computing for Wildlife Tracking: Design Tradeoffs and Early Experiences with ZebraNet

by Philo Juang, Hidekazu Oki, Yong Wang, Margaret Martonosi, Li-shiuan Peh, Daniel Rubenstein , 2002
"... Over the past decade, mobile computing and wireless communication have become increasingly important drivers of many new computing applications. The eld of wireless sensor networks particularly focuses on applications involving autonomous use of compute, sensing, and wireless communication devices ..."
Abstract - Cited by 719 (8 self) - Add to MetaCart
Over the past decade, mobile computing and wireless communication have become increasingly important drivers of many new computing applications. The eld of wireless sensor networks particularly focuses on applications involving autonomous use of compute, sensing, and wireless communication devices for both scienti c and commercial purposes. This paper examines the research decisions and design tradeos that arise when applying wireless peer-to-peer networking techniques in a mobile sensor network designed to support wildlife tracking for biology research.
(Show Context)

Tinydb: An acquisitional query processing system for sensor networks

by Samuel R. Madden, Michael J. Franklin, Joseph M. Hellerstein, Wei Hong - ACM Trans. Database Syst , 2005
"... We discuss the design of an acquisitional query processor for data collection in sensor networks. Acquisitional issues are those that pertain to where, when, and how often data is physically acquired (sampled) and delivered to query processing operators. By focusing on the locations and costs of acq ..."
Abstract - Cited by 626 (8 self) - Add to MetaCart
We discuss the design of an acquisitional query processor for data collection in sensor networks. Acquisitional issues are those that pertain to where, when, and how often data is physically acquired (sampled) and delivered to query processing operators. By focusing on the locations and costs of acquiring data, we are able to significantly reduce power consumption over traditional passive systems that assume the a priori existence of data. We discuss simple extensions to SQL for controlling data acquisition, and show how acquisitional issues influence query optimization, dissemination, and execution. We evaluate these issues in the context of TinyDB, a distributed query processor for smart sensor devices, and show how acquisitional techniques can provide significant reductions in power consumption on our sensor devices. Categories and Subject Descriptors: H.2.3 [Database Management]: Languages—Query languages; H.2.4 [Database Management]: Systems—Distributed databases; query processing

The design of an acquisitional query processor for sensor networks

by Samuel Madden, Michael J. Franklin, Joseph M. Hellerstein, Wei Hong - In SIGMOD , 2003
"... We discuss the design of an acquisitional query processor for data collection in sensor networks. Acquisitional issues are those that pertain to where, when, and how often data is physically acquired (sampled) and delivered to query processing operators. By focusing on the locations and costs of acq ..."
Abstract - Cited by 523 (25 self) - Add to MetaCart
We discuss the design of an acquisitional query processor for data collection in sensor networks. Acquisitional issues are those that pertain to where, when, and how often data is physically acquired (sampled) and delivered to query processing operators. By focusing on the locations and costs of acquiring data, we are able to significantly reduce power consumption over traditional passive systems that assume the a priori existence of data. We discuss simple extensions to SQL for controlling data acquisition, and show how acquisitional issues influence query optimization, dissemination, and execution. We evaluate these issues in the context of TinyDB, a distributed query processor for smart sensor devices, and show how acquisitional techniques can provide significant reductions in power consumption on our sensor devices. 1.
(Show Context)

Tinysec: A link layer security architecture for wireless sensor networks

by Chris Karlof, Naveen Sastry, David Wagner - in Proc of the 2nd Int’l Conf on Embedded Networked Sensor Systems
"... We introduce TinySec, the first fully-implemented link layer security architecture for wireless sensor networks. In our design, we leverage recent lessons learned from design vulnerabilities in security protocols for other wireless networks such as 802.11b and GSM. Conventional security protocols te ..."
Abstract - Cited by 521 (0 self) - Add to MetaCart
We introduce TinySec, the first fully-implemented link layer security architecture for wireless sensor networks. In our design, we leverage recent lessons learned from design vulnerabilities in security protocols for other wireless networks such as 802.11b and GSM. Conventional security protocols tend to be conservative in their security guarantees, typically adding 16–32 bytes of overhead. With small memories, weak processors, limited energy, and 30 byte packets, sensor networks cannot afford this luxury. TinySec addresses these extreme resource constraints with careful design; we explore the tradeoffs among different cryptographic primitives and use the inherent sensor network limitations to our advantage when choosing parameters to find a sweet spot for security, packet overhead, and resource requirements. TinySec is portable to a variety of hardware and radio platforms. Our experimental results on a 36 node distributed sensor network application clearly demonstrate that software based link layer protocols are feasible and efficient, adding less than 10 % energy, latency, and bandwidth overhead.
(Show Context)

The flooding time synchronization protocol

by Miklos Maroti, Branislav Kusy, Gyula Simon, Akos Ledeczi , 2004
"... Wireless sensor network applications, similarly to other distributed systems, often require a scalable time synchronization service enabling data consistency and coordination. This paper introduces the robust Flooding Time Synchronization Protocol (FTSP), especially tailored for applications requir ..."
Abstract - Cited by 469 (16 self) - Add to MetaCart
Wireless sensor network applications, similarly to other distributed systems, often require a scalable time synchronization service enabling data consistency and coordination. This paper introduces the robust Flooding Time Synchronization Protocol (FTSP), especially tailored for applications requiring stringent precision on resource limited wireless platforms. The proposed time synchronization protocol utilizes low communication bandwidth, scales well for medium sized multi-hop networks, and is robust against topology changes and node failures. The FTSP achieves its robustness by utilizing periodic radio broadcast of synchronization messages, and implicit dynamic topology update. The unique high precision performance is reached by utilizing MAC-layer time-stamping, comprehensive error compensation, including linear regression, which reduces time skew and keeps network traffic overhead low. The performance of the FTSP, implemented on Berkeley MICA2 platform, was evaluated in a multi-hop experiment. The average network-wide synchronization error was in the microsecond range, which is approximately a magnitude lower than that of the existing RBS and TPSN algorithms. The protocol was further validated as part of our counter-sniper system that was field tested in a US military facility.

Collection Tree Protocol.

by Omprakash Gnawali , Rodrigo Fonseca , Kyle Jamieson , David Moss , Rincon Research , Philip Levis - Proceedings of the 7th ACM Conference on Embedded Networked Sensor Systems (SenSys’09), , 2009
"... Abstract This paper presents and evaluates two principles for wireless routing protocols. The first is datapath validation: data traffic quickly discovers and fixes routing inconsistencies. The second is adaptive beaconing: extending the Trickle algorithm to routing control traffic reduces route re ..."
Abstract - Cited by 339 (16 self) - Add to MetaCart
Abstract This paper presents and evaluates two principles for wireless routing protocols. The first is datapath validation: data traffic quickly discovers and fixes routing inconsistencies. The second is adaptive beaconing: extending the Trickle algorithm to routing control traffic reduces route repair latency and sends fewer beacons. We evaluate datapath validation and adaptive beaconing in CTP Noe, a sensor network tree collection protocol. We use 12 different testbeds ranging in size from 20-310 nodes, comprising seven platforms, and six different link layers, on both interference-free and interference-prone channels. In all cases, CTP Noe delivers > 90% of packets. Many experiments achieve 99.9%. Compared to standard beaconing, CTP Noe sends 73% fewer beacons while reducing topology repair latency by 99.8%. Finally, when using low-power link layers, CTP Noe has duty cycles of 3% while supporting aggregate loads of 30 packets/minute.
(Show Context)