Sciweavers

119 search results - page 22 / 24
» Geographic Gossip: Efficient Averaging for Sensor Networks
Sort
View
CISIS
2009
IEEE
14 years 9 months ago
Lifetime in Wireless Sensor Networks
The following paper deals with criterion used to measure communication protocol efficiency in Wireless Sensor Networks. As energy is a crucial characteristic of those networks, it...
Julien Champ, Clément Saad, Anne-Elisabeth ...
INFOCOM
2010
IEEE
14 years 9 months ago
Maintaining Approximate Minimum Steiner Tree and k-center for Mobile Agents in a Sensor Network
Abstract--We study the problem of maintaining group communication between m mobile agents, tracked and helped by n static networked sensors. We develop algorithms to maintain a O(l...
Dengpan Zhou, Jie Gao
PODS
2006
ACM
96views Database» more  PODS 2006»
15 years 12 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,...
PERCOM
2005
ACM
15 years 11 months ago
When Does Opportunistic Routing Make Sense?
Different opportunistic routing protocols have been proposed recently for routing in sensor networks. These protocols exploit the redundancy among nodes by using a node that is av...
Adam Wolisz, Jan M. Rabaey, Rahul C. Shah, Sven Wi...
TON
2008
107views more  TON 2008»
14 years 11 months ago
Efficient routing in intermittently connected mobile networks: the multiple-copy case
Abstract--Intermittently connected mobile networks are wireless networks where most of the time there does not exist a complete path from the source to the destination. There are m...
Thrasyvoulos Spyropoulos, Konstantinos Psounis, Ca...