Sciweavers

2343 search results - page 155 / 469
» The Locomotive Routing Problem
Sort
View
ICC
2007
IEEE
122views Communications» more  ICC 2007»
16 years 17 days ago
Dynamic Programming for Scheduling a Single Route in Wireless Networks
— Multi-slot resource scheduling in a general two dimensional wireless ad hoc network, is a hard problem with no known polynomial-time solution. Recent optimization theoretic ana...
Gyouhwan Kim, Rohit Negi
GLOBECOM
2006
IEEE
16 years 9 days ago
Least Cost Routing in Inter-Carrier Context
Abstract— Carriers conveying long-distance traffic face different routing options with regard to service quality and cost. Thus, Least Cost Routing (LCR) solutions supporting op...
Piotr Cholda, Miroslaw Kantor, Andrzej Jajszczyk, ...
IPCCC
2006
IEEE
16 years 8 days ago
Energy-efficient cooperative routing in multi-hop wireless ad hoc networks
We study the routing problem for multi-hop wireless ad hoc networks based on cooperative transmission. We prove that the Minimum Energy Cooperative Path (MECP) routing problem, i....
Fulu Li, Kui Wu, Andrew Lippman
PODC
2004
ACM
15 years 11 months ago
Compact routing on euclidian metrics
We consider the problem of designing a compact communication network that supports efficient routing in an Euclidean plane. Our network design and routing scheme achieves 1+ stret...
Ittai Abraham, Dahlia Malkhi
DATE
2003
IEEE
101views Hardware» more  DATE 2003»
15 years 11 months ago
Exploiting the Routing Flexibility for Energy/Performance Aware Mapping of Regular NoC Architectures
In this paper, we present an algorithm which automatically maps the IPs onto a generic regular Network on Chip (NoC) architecture and constructs a deadlock-free deterministic rout...
Jingcao Hu, Radu Marculescu