203 search results - page 29 / 41 » On greedy geographic routing algorithms in sensing-covered n... |
SODA
2000
ACM
13 years 9 months ago
2000
ACM
We study the edge-disjoint escape problem in grids. Given a set of n sources in a two-dimensional grid, the problem is to connect all sources to the grid boundary using a set of n...
INFOCOM
2005
IEEE
14 years 1 months ago
2005
IEEE
— Wireless sensor networks offer the potential to span and monitor large geographical areas inexpensively. Sensor network databases like TinyDB [1] are the dominant architectures...
IPPS
2006
IEEE
14 years 1 months ago
2006
IEEE
Wireless Sensor Networks (WSNs) are characterized by having scarce resources. The usual way of designing network functions is to consider them isolatedly, a strategy which may not...
ICDCS
2007
IEEE
14 years 1 months ago
2007
IEEE
Abstract— Overlay routing has emerged as a promising approach to improving performance and reliability of Internet paths. To fully realize the potential of overlay routing under ...
COR
2007
13 years 7 months ago
2007
This paper deals with the generation of minimal risk paths for the road transportation of hazardous materials between an origin–destination pair of a given regional area. The ma...