Sciweavers

540 search results - page 26 / 108
» Competitive Routing over Time
Sort
View
ADHOCNOW
2008
Springer
14 years 3 months ago
Geographic Routing with Early Obstacles Detection and Avoidance in Dense Wireless Sensor Networks
Existing geographic routing algorithms for sensor networks are mainly concerned with finding a path toward a destination, without explicitly addressing the impact of obstacles on ...
Luminita Moraru, Pierre Leone, Sotiris E. Nikolets...
GLOBECOM
2006
IEEE
14 years 3 months ago
Coverage-Preserving Routing Protocols for Randomly Distributed Wireless Sensor Networks
— Sensing coverage is an important issue for sensor networks, since it is viewed as one of the critical measures of performance offered by a sensor network. The design of a routi...
Yuh-Ren Tsai
MAM
2006
95views more  MAM 2006»
13 years 9 months ago
Stochastic spatial routing for reconfigurable networks
FPGA placement and routing is time consuming, often serving as the major obstacle inhibiting a fast edit-compile-test loop in prototyping and development and the major obstacle pr...
André DeHon, Randy Huang, John Wawrzynek
ICCBR
1995
Springer
14 years 17 days ago
Route Planning by Analogy
There have been several e orts to create and use real maps in computer applications that automatically nd good map routes. In general, online map representations do not include in...
Karen Zita Haigh, Manuela M. Veloso
WINET
2008
77views more  WINET 2008»
13 years 9 months ago
VE-mobicast: a variant-egg-based mobicast routing protocol for sensornets
In this paper, we present a new "spatiotemporal multicast", called a "mobicast", protocol for supporting applications which require spatiotemporal coordination...
Yuh-Shyan Chen, Shin-Yi Ann, Yun-Wei Lin