Sciweavers

410 search results - page 36 / 82
» Upgrading Shortest Paths in Networks
Sort
View
AICCSA
2005
IEEE
168views Hardware» more  AICCSA 2005»
15 years 7 months ago
A dynamic range resource reservation protocol for QoS support in wireless networks
— Mobile ad hoc networks (MANETs) provide a powerful and dynamic platform to enable mobile computers to establish communications without an existing infrastructure. In order to p...
Imad Jawhar, Jie Wu
INFOCOM
2007
IEEE
15 years 7 months ago
Navigation in Distance Vector Spaces and Its Use for Node Avoidance Routing
—Traditional network routing uses the single (shortest) path paradigm. This paradigm exposes sessions to various attacks along this path, such as eavesdropping, DoS attacks etc. ...
Haim Zlatokrilov, Hanoch Levy
ICDE
2009
IEEE
130views Database» more  ICDE 2009»
16 years 3 months ago
Recursive Computation of Regions and Connectivity in Networks
In recent years, the data management community has begun to consider situations in which data access is closely tied to network routing and distributed acquisition: examples includ...
Mengmeng Liu, Nicholas E. Taylor, Wenchao Zhou, Za...
TKDE
2010
152views more  TKDE 2010»
14 years 12 months ago
Maintaining Recursive Views of Regions and Connectivity in Networks
— The data management community has recently begun to consider declarative network routing and distributed acquisition: e.g., sensor networks that execute queries about contiguou...
Mengmeng Liu, Nicholas E. Taylor, Wenchao Zhou, Za...
MOBICOM
2003
ACM
15 years 6 months ago
Minimum energy disjoint path routing in wireless ad-hoc networks
We develop algorithms for finding minimum energy disjoint paths in an all-wireless network, for both the node and linkdisjoint cases. Our major results include a novel polynomial...
Anand Srinivas, Eytan Modiano