483 search results - page 85 / 97 » On extracting consistent graphs in wireless sensor networks |
132
click to vote
MOBISYS
2005
ACM
15 years 11 months ago
2005
ACM
Sensor network nodes exhibit characteristics of both embedded systems and general-purpose systems. They must use little energy and be robust to environmental conditions, while als...
121
click to vote
INFOCOM
2009
IEEE
15 years 6 months ago
2009
IEEE
Abstract—Stateless opportunistic forwarding is a simple faulttolerant distributed approach for data delivery and information querying in wireless ad hoc networks, where packets a...
INFOCOM
2009
IEEE
15 years 6 months ago
2009
IEEE
—Greedy routing is a novel routing paradigm where messages are always forwarded to the neighbor that is closest to the destination. Our main result is a polynomial-time algorithm...
IPSN
2007
Springer
15 years 6 months ago
2007
Springer
The development of high-level programming environments is essential if wireless sensor networks are to be accessible to nonexperts. In this paper, we present the Regiment system, ...
MOBIHOC
2006
ACM
15 years 11 months ago
2006
ACM
Localization is an important and extensively studied problem in ad-hoc wireless sensor networks. Given the connectivity graph of the sensor nodes, along with additional local info...