1017 search results - page 81 / 204 » On the Computational Complexity of Sensor Network Localizati... |
IJRR
2006
13 years 9 months ago
2006
ABSTRACT. We introduce tools from computational homology to verify coverage in an idealized sensor network. Our methods are unique in that, while they are coordinate-free and assum...
MOBIHOC
2000
ACM
14 years 1 months ago
2000
ACM
— We consider challenges associated with application domains in which a large number of distributed, networked sensors must perform a sensing task repeatedly over time. We addres...
NSDI
2007
13 years 11 months ago
2007
Routing protocols for wireless sensor networks must address the challenges of reliable packet delivery at increasingly large scale and highly constrained node resources. Attempts ...
JUCS
2010
13 years 7 months ago
2010
: We present a table-less position based routing scheme for low power data centric wireless sensor networks. Our proposed scheme is localized, uses greedy forwarding approach, and ...
INFOCOM
2010
IEEE
13 years 7 months ago
2010
IEEE
—We study how to characterize the families of paths between any two nodes s, t in a sensor network with holes. Two paths that can be deformed to one another through local changes...