Sensor Networks (TOSN)


Search Issue
enter search term and/or author name


ACM Transactions on Sensor Networks (TOSN), Volume 4 Issue 2, March 2008

Adaptive probability-based broadcast forwarding in energy-saving sensor networks
Cigdem Sengul, Matthew J. Miller, Indranil Gupta
Article No.: 6
DOI: 10.1145/1340771.1340772

Networking protocols for multihop wireless sensor networks (WSNs) are required to simultaneously minimize resource usage as well as optimize performance metrics such as latency and reliability. This article explores the energy-latency-reliability...

Synopsis diffusion for robust aggregation in sensor networks
Suman Nath, Phillip B. Gibbons, Srinivasan Seshan, Zachary Anderson
Article No.: 7
DOI: 10.1145/1340771.1340773

Previous approaches for computing duplicate-sensitive aggregates in wireless sensor networks have used a tree topology, in order to conserve energy and to avoid double-counting sensor readings. However, a tree topology is not robust against node...

Programming models for sensor networks: A survey
Ryo Sugihara, Rajesh K. Gupta
Article No.: 8
DOI: 10.1145/1340771.1340774

Sensor networks have a significant potential in diverse applications some of which are already beginning to be deployed in areas such as environmental monitoring. As the application logic becomes more complex, programming difficulties are becoming...

Aggregation methods for large-scale sensor networks
Laukik Chitnis, Alin Dobra, Sanjay Ranka
Article No.: 9
DOI: 10.1145/1340771.1340775

The ability to efficiently aggregate information—for example compute the average temperature—in large networks is crucial for the successful employment of sensor networks. This article addresses the problem of designing truly...

Detecting cuts in sensor networks
Nisheeth Shrivastava, Subhash Suri, Csaba D. Tóth
Article No.: 10
DOI: 10.1145/1340771.1340776

We propose a low-overhead scheme for detecting a network partition or cut in a sensor network. Consider a network S of n sensors, modeled as points in a two-dimensional plane. An ϵ-cut, for any 0 < ϵ < 1, is...

Group-based key predistribution for wireless sensor networks
Donggang Liu, Peng Ning, Wenliang Du
Article No.: 11
DOI: 10.1145/1340771.1340777

Many key predistribution techniques have been developed recently to establish pairwise keys between sensor nodes in wireless sensor networks. To further improve these schemes, researchers have also proposed to take advantage of the sensors'...