Sciweavers

1058 search results - page 202 / 212
» Secure Group Communications Using Key Graphs
Sort
View
76
Voted
INFOCOM
2007
IEEE
15 years 3 months ago
Network Coding for Distributed Storage Systems
—Distributed storage systems provide reliable access to data through redundancy spread over individually unreliable nodes. Application scenarios include data centers, peer-to-pee...
Alexandros G. Dimakis, Brighten Godfrey, Martin J....
MOBICOM
2010
ACM
14 years 9 months ago
Differential forms for target tracking and aggregate queries in distributed networks
Consider mobile targets moving in a plane and their movements being monitored by a network such as a field of sensors. We develop distributed algorithms for in-network tracking an...
Rik Sarkar, Jie Gao
SENSYS
2006
ACM
15 years 3 months ago
Supporting concurrent applications in wireless sensor networks
It is vital to support concurrent applications sharing a wireless sensor network in order to reduce the deployment and administrative costs, thus increasing the usability and efï¬...
Yang Yu, Loren J. Rittle, Vartika Bhandari, Jason ...
SIROCCO
2008
14 years 11 months ago
Remembering without Memory: Tree Exploration by Asynchronous Oblivious Robots
In the effort to understand the algorithmic limitations of computing by a swarm of robots, the research has focused on the minimal capabilities that allow a problem to be solved. ...
Paola Flocchini, David Ilcinkas, Andrzej Pelc, Nic...
INFOCOM
2008
IEEE
15 years 4 months ago
Area Avoidance Routing in Distance-Vector Networks
Network routing may be required, under certain applications, to avoid certain areas (or nodes) These areas can be of potential security threat, possess poor quality or have other ...
Haim Zlatokrilov, Hanoch Levy