Sciweavers

15 search results - page 2 / 3
» On Interval Routing Schemes and Treewidth
Sort
View
SIGCOMM
2012
ACM
11 years 7 months ago
Revealing contact interval patterns in large scale urban vehicular ad hoc networks
Contact interval between moving vehicles is one of the key metrics in vehicular ad hoc networks (VANETs), which is important to routing schemes and network capacity. In this work,...
Yong Li, Depeng Jin, Pan Hui, Li Su, Lieguang Zeng
STACS
2007
Springer
13 years 11 months ago
Compact Forbidden-Set Routing
We study the following problem. Given a weighted planar graph G, assign labels L(v) to vertices so that given L(u), L(v) and L(x) for x ∈ X for any X ⊂ V (G), compute the dist...
Bruno Courcelle, Andrew Twigg
MST
2010
106views more  MST 2010»
13 years 3 months ago
Constrained-Path Labellings on Graphs of Bounded Clique-Width
Given a graph G we consider the problem of preprocessing it so that given two vertices x,y and a set X of vertices, we can efficiently report the shortest path (or just its length...
Bruno Courcelle, Andrew Twigg
JPDC
2008
127views more  JPDC 2008»
13 years 5 months ago
E-ODMRP: Enhanced ODMRP with motion adaptive refresh
On Demand Multicast Routing Protocol (ODMRP) is a multicast routing protocol for mobile ad hoc networks. Its efficiency, simplicity, and robustness to mobility render it one of th...
Soon-Young Oh, Joon-Sang Park, Mario Gerla
APNOMS
2006
Springer
13 years 9 months ago
Network-Adaptive QoS Routing Using Local Information
In this paper, we propose the localized adaptive QoS routing scheme using POMDP(partially observable Markov Decision Processes) and Exploration Bonus. In order to deal with POMDP p...
Jeongsoo Han