Sciweavers

74 search results - page 7 / 15
» DPA-Resistance Without Routing Constraints
Sort
View
MASCOTS
2003
13 years 11 months ago
Multipath Routing in Mobile Ad Hoc Networks: Issues and Challenges
Mobile ad hoc networks (MANETs) consist of a collection of wireless mobile nodes which dynamically exchange data among themselves without the reliance on a fixed base station or a...
Stephen Mueller, Rose P. Tsang, Dipak Ghosal
FOCS
2000
IEEE
14 years 1 months ago
Approximating the single source unsplittable min-cost flow problem
Abstract. In the single source unsplittable min-cost flow problem, commodities must be routed simultaneously from a common source vertex to certain destination vertices in a given ...
Martin Skutella
CCR
2004
120views more  CCR 2004»
13 years 9 months ago
MAC-layer anycasting in ad hoc networks
A wireless ad hoc network is formed by a group of wireless hosts, without the use of any infrastructure. To enable communication, hosts cooperate among themselves to forward packet...
Romit Roy Choudhury, Nitin H. Vaidya
GIS
2007
ACM
14 years 11 months ago
Evacuation route planning: scalable heuristics
Given a transportation network, a vulnerable population, and a set of destinations, evacuation route planning identifies routes to minimize the time to evacuate the vulnerable pop...
Sangho Kim, Betsy George, Shashi Shekhar
GIS
2010
ACM
13 years 4 months ago
Supporting 3D route planning in indoor space based on the LEGO representation
With the prevalence of car navigation systems, indoor navigation systems are increasingly attracting attention in the indoor research area. However, the available models for indoo...
Wenjie Yuan, Markus Schneider