Sciweavers

135 search results - page 9 / 27
» Hierarchical source routing using implied costs
Sort
View
ETFA
2006
IEEE
13 years 11 months ago
Verification of The Minimum Cost Forwarding Protocol for Wireless Sensor Networks
Wireless sensor networks (WSN) consist of small self-contained devices with computational, sensing and wireless communication capabilities. They allow flexible, powerful, tetherles...
William D. Henderson, Steven Tron
STOC
2002
ACM
156views Algorithms» more  STOC 2002»
14 years 8 months ago
Selfish traffic allocation for server farms
We investigate the price of selfish routing in non-cooperative networks in terms of the coordination and bicriteria ratios in the recently introduced game theoretic network model ...
Artur Czumaj, Piotr Krysta, Berthold Vöcking
COCOON
2005
Springer
14 years 1 months ago
Share the Multicast Payment Fairly
Multicast routing uses a structure, either a tree or a mesh, to connect the receivers to the source, thus saving the bandwidth. How to share the cost among the receivers in a certa...
Weizhao Wang, Xiang-Yang Li, Zheng Sun
GISCIENCE
2010
Springer
192views GIS» more  GISCIENCE 2010»
13 years 8 months ago
Automatic Extraction of Destinations, Origins and Route Parts from Human Generated Route Directions
Researchers from the cognitive and spatial sciences are studying text descriptions of movement patterns in order to examine how humans communicate and understand spatial informatio...
Xiao Zhang, Prasenjit Mitra, Alexander Klippel, Al...
FCCM
2002
IEEE
127views VLSI» more  FCCM 2002»
14 years 17 days ago
Hardware-Assisted Fast Routing
To fully realize the benefits of partial and rapid reconfiguration of field-programmable devices, we often need to dynamically schedule computing tasks and generate instance-sp...
André DeHon, Randy Huang, John Wawrzynek