Sensor Networks (TOSN)


Search Issue
enter search term and/or author name


ACM Transactions on Sensor Networks (TOSN), Volume 2 Issue 3, August 2006

Communication power optimization in a sensor network with a path-constrained mobile observer
Arnab Chakrabarti, Ashutosh Sabharwal, Behnaam Aazhang
Pages: 297-324
DOI: 10.1145/1167935.1167936
We present a procedure for communication power optimization in a network of randomly distributed sensors with an observer (data collector) moving on a fixed path. The key challenge in using a mobile observer is that it remains within communication...

Stochastic coverage in heterogeneous sensor networks
Loukas Lazos, Radha Poovendran
Pages: 325-358
DOI: 10.1145/1167935.1167937
We study the problem of coverage in planar heterogeneous sensor networks. Coverage is a performance metric that quantifies how well a field of interest is monitored by the sensor deployment. To derive analytical expressions of coverage for...

On conditions for constant throughput in wireless networks
Christina Fragouli, Tarik Tabet
Pages: 359-379
DOI: 10.1145/1167935.1167938
In this article we propose a set of necessary and sufficient conditions under which the long-term averaged throughput in an ad hoc network can remain constant as the number of nodes n increases. Throughput refers to the minimum...

Distributed metric calibration of ad hoc camera networks
Dhanya Devarajan, Richard J. Radke, Haeyong Chung
Pages: 380-403
DOI: 10.1145/1167935.1167939
We discuss how to automatically obtain the metric calibration of an ad hoc network of cameras with no centralized processor. We model the set of uncalibrated cameras as nodes in a communication network, and propose a distributed algorithm in which...

Dynamic data fusion for future sensor networks
Umakishore Ramachandran, Rajnish Kumar, Matthew Wolenetz, Brian Cooper, Bikash Agarwalla, Junsuk Shin, Phillip Hutto, Arnab Paul
Pages: 404-443
DOI: 10.1145/1167935.1167940
DFuse is an architectural framework for dynamic application-specified data fusion in sensor networks. It bridges an important abstraction gap for developing advanced fusion applications that takes into account the dynamic nature of applications and...

A simple improved distributed algorithm for minimum CDS in unit disk graphs
Stefan Funke, Alexander Kesselman, Ulrich Meyer, Michael Segal
Pages: 444-453
DOI: 10.1145/1167935.1167941
Several routing schemes in ad hoc networks first establish a virtual backbone and then route messages via backbone nodes. One common way of constructing such a backbone is based on the construction of a connected dominating set (CDS). In this article...