Sciweavers

66 search results - page 4 / 14
» Optimal oblivious routing in polynomial time
Sort
View
CNSR
2007
IEEE
336views Communications» more  CNSR 2007»
13 years 11 months ago
Energy Efficient Data Routing in Wireless Sensor Network: A Mixed Approach
This paper presents a data routing protocol for a non-mobile, locationaware wireless sensor network that is primarily designed for continuous monitoring application (e.g. environm...
Md. Ashiqur Rahman, Sajid Hussain
WAOA
2010
Springer
256views Algorithms» more  WAOA 2010»
13 years 5 months ago
The Train Delivery Problem - Vehicle Routing Meets Bin Packing
Abstract. We consider the train delivery problem which is a generalization of the bin packing problem and is equivalent to a one dimensional version of the vehicle routing problem ...
Aparna Das, Claire Mathieu, Shay Mozes
QOSIP
2005
Springer
14 years 26 days ago
Unicast and Multicast QoS Routing with Multiple Constraints
Abstract. We explore techniques for efficient Quality of Service Routing in the presence of multiple constraints. We first present a polynomial time approximation algorithm for th...
Dan Wang, Funda Ergün, Zhan Xu
JUCS
2010
142views more  JUCS 2010»
13 years 5 months ago
Mobile Agent Routing with Time Constraints: A Resource Constrained Longest-Path Approach
: Mobile agent technology advocates the mobility of code rather than the transfer of data. As data is found in several sites, a mobile agent has to plan an itinerary to visit sever...
Eduardo Camponogara, Ricardo Boveto Shima
ICC
2009
IEEE
190views Communications» more  ICC 2009»
14 years 2 months ago
Decomposition for Low-Complexity Near-Optimal Routing in Multi-Hop Wireless Networks
Abstract—Network flow models serve as a popular mathematical framework for the analysis and optimization of Multi-hop Wireless Networks. They also serve to provide the understan...
Vinay Kolar, Nael B. Abu-Ghazaleh, Petri Mäh&...