4037 search results - page 4 / 808 » Routing without ordering |
PADS
2005
ACM
14 years 1 months ago
2005
ACM
A fundamental requirement for any network simulation environment is the realistic forwarding of packets from a source to a destination in the simulated topology. The routing decis...
IPSN
2010
Springer
14 years 2 months ago
2010
Springer
Current data collection protocols for wireless sensor networks are mostly based on quasi-static minimum-cost routing trees. We consider an alternative, highly-agile approach calle...
ADHOC
2007
13 years 7 months ago
2007
One of the most challenging problems in wireless sensor networks is the design of scalable and efficient routing algorithms without location information. The use of specialized ha...
ASPDAC
2008
ACM
13 years 9 months ago
2008
ACM
Abstract-- Routing for high-speed boards is largely a timeconsuming manual task today. In this work we consider the ordered escape routing problem which is a key problem in boardle...