Sciweavers

2343 search results - page 99 / 469
» The Locomotive Routing Problem
Sort
View
WEA
2009
Springer
103views Algorithms» more  WEA 2009»
14 years 4 months ago
Pareto Paths with SHARC
Abstract. Up to now, research on speed-up techniques for DIJKSTRA’s algorithm focused on single-criteria scenarios. The goal was to find the quickest route within a transportati...
Daniel Delling, Dorothea Wagner
ICCCN
2007
IEEE
14 years 2 months ago
Load-aware Traffic Engineering for Mesh Networks
Abstract--The static nature of mesh nodes imposes requirements for designing routing metrics that support high throughput and low packet delay. This paper considers the problem of ...
Devu Manikantan Shila, Tricha Anjali
DCOSS
2006
Springer
14 years 1 months ago
An Optimal Data Propagation Algorithm for Maximizing the Lifespan of Sensor Networks
We consider the problem of data propagation in wireless sensor networks and revisit the family of mixed strategy routing schemes. We show that maximizing the lifespan, balancing th...
Aubin Jarry, Pierre Leone, Olivier Powell, Jos&eac...
IWCMC
2010
ACM
14 years 2 days ago
Using connection expansion to reduce control traffic in MANETs
We consider the problem of control traffic overhead in MANETs with long-lived connections, operating under a reactive routing protocol (e.g. AODV). In such settings, control traff...
Zeki Bilgin, Bilal Khan, Ala I. Al-Fuqaha
SBBD
2007
165views Database» more  SBBD 2007»
13 years 11 months ago
Peer-to-Peer Information Search
We consider the network structure and query processing capabilities of social communities like bookmarks and photo sharing communities such as del.icio.us or flickr. A common fea...
Sebastian Michel, Josiane Xavier Parreira