Sciweavers

118 search results - page 22 / 24
» Randomness in Wireless Networks: How to Deal with It
Sort
View
DCOSS
2011
Springer
12 years 5 months ago
Planning the trajectories of multiple mobile sinks in large-scale, time-sensitive WSNs
—Controlled sink mobility has been shown to be very beneficial in lifetime prolongation of wireless sensor networks (WSNs) by avoiding the typical hot-spot problem near the sink...
Wint Yi Poe, Michael Beck, Jens B. Schmitt
PODS
2006
ACM
96views Database» more  PODS 2006»
14 years 5 months ago
Efficient gossip-based aggregate computation
Recently, there has been a growing interest in gossip-based protocols that employ randomized communication to ensure robust information dissemination. In this paper, we present a ...
Srinivas R. Kashyap, Supratim Deb, K. V. M. Naidu,...
GLOBECOM
2009
IEEE
13 years 3 months ago
Time-Critical Data Dissemination in Cooperative Peer-to-Peer Systems
How to rapidly disseminate a large-sized file to many recipients is a fundamental problem in many applications, such as updating software patches and distributing large scientific ...
Chi-Jen Wu, Cheng-Ying Li, Kai-Hsiang Yang, Jan-Mi...
PERCOM
2007
ACM
14 years 5 months ago
Securing distributed data storage and retrieval in sensor networks
Sensor networks have been an attractive platform for pervasive computing and communication. Due to the lack of physical protection, however, sensor networks are vulnerable to atta...
Nalin Subramanian, Chanjun Yang, Wensheng Zhang
INFOCOM
2008
IEEE
14 years 5 days ago
Sensor-Aided Overlay Deployment and Relocation for Vast-Scale Sensor Networks
—The overlay-based network architecture has been recognized as an effective way to deal with the funneling effect in sensor networks, where sensors closer to the sink are usually...
Guanqun Yang, Bin Tong, Daji Qiao, Wensheng Zhang