Sciweavers

258 search results - page 45 / 52
» Non-cooperative routing in loss networks
Sort
View
SASN
2006
ACM
14 years 1 months ago
Attack-resilient hierarchical data aggregation in sensor networks
In a large sensor network, in-network data aggregation, i.e., combining partial results at intermediate nodes during message routing, significantly reduces the amount of communic...
Sankardas Roy, Sanjeev Setia, Sushil Jajodia
BROADNETS
2004
IEEE
13 years 11 months ago
Capacity-Efficient Protection with Fast Recovery in Optically Transparent Mesh Networks
Survivability becomes increasingly critical in managing high-speed networks as data traffic continues to grow in both size and importance. In addition, the impact of failures is e...
Sun-il Kim, Steven S. Lumetta
SENSYS
2004
ACM
14 years 1 months ago
An analysis of a large scale habitat monitoring application
Habitat and environmental monitoring is a driving application for wireless sensor networks. We present an analysis of data from a second generation sensor networks deployed during...
Robert Szewczyk, Alan M. Mainwaring, Joseph Polast...
IWCMC
2010
ACM
13 years 11 months ago
Cooperative contention-based forwarding for wireless sensor networks
Cooperative forwarding has been considered as an effective strategy for improving the geographic routing performance in wireless sensor networks (WSNs). However, we observe that ...
Long Cheng, Jiannong Cao, Canfeng Chen, Hongyang C...
SENSYS
2004
ACM
14 years 1 months ago
Synopsis diffusion for robust aggregation in sensor networks
Previous approaches for computing duplicate-sensitive aggregates in sensor networks (e.g., in TAG) have used a tree topology, in order to conserve energy and to avoid double-count...
Suman Nath, Phillip B. Gibbons, Srinivasan Seshan,...