Sciweavers

273 search results - page 40 / 55
» Distributed computation of a sparse cover in sensor networks...
Sort
View
PODC
2006
ACM
14 years 1 months ago
Computing separable functions via gossip
Motivated by applications to sensor, peer-to-peer, and adhoc networks, we study the problem of computing functions of values at the nodes in a network in a totally distributed man...
Damon Mosk-Aoyama, Devavrat Shah
ICRA
2010
IEEE
149views Robotics» more  ICRA 2010»
13 years 6 months ago
Towards simplicial coverage repair for mobile robot teams
— In this note, we present initial results towards developing a distributed algorithm for repairing topological holes in the sensor cover of a mobile robot team. Central to our a...
Jason C. Derenick, Vijay Kumar, Ali Jadbabaie
MSWIM
2004
ACM
14 years 25 days ago
Mobile dynamic content distribution networks
Mobile networks are becoming increasingly popular as a means for distributing information to a large number of users. In comparison to wired networks, mobile networks are distingu...
Wagner Moro Aioffi, Geraldo Robson Mateus, Jussara...
ICDCS
2007
IEEE
14 years 1 months ago
A Virtual Node-Based Tracking Algorithm for Mobile Networks
— We introduce a virtual-node based mobile object tracking algorithm for mobile sensor networks, VINESTALK. The algorithm uses the Virtual Stationary Automata programming layer, ...
Tina Nolte, Nancy A. Lynch
SASN
2004
ACM
14 years 25 days ago
Revisiting random key pre-distribution schemes for wireless sensor networks
Key management is one of the fundamental building blocks of security services. In a network with resource constrained nodes like sensor networks, traditional key management techni...
Joengmin Hwang, Yongdae Kim