Sciweavers

5079 search results - page 17 / 1016
» Hidden-Action in Network Routing
Sort
View
SAPIR
2004
Springer
15 years 3 months ago
Probabilistic Routing in Intermittently Connected Networks
We consider the problem of routing in intermittently connected networks. In such networks there is no guarantee that a fully connected path between source and destination exist at...
Anders Lindgren, Avri Doria, Olov Schelén
ADHOCNOW
2004
Springer
15 years 3 months ago
Routing Table Dynamics in Mobile Ad-Hoc Networks: A Continuum Model
Abstract. This paper gives a simple continuum model for generic proactive routing protocols in a mobile ad-hoc network. Rate constants characterize the routing protocol and the net...
Ernst W. Grundke
101
Voted
TPDS
2010
222views more  TPDS 2010»
14 years 8 months ago
Energy-Efficient Beaconless Geographic Routing in Wireless Sensor Networks
—Geographic routing is an attractive localized routing scheme for wireless sensor networks (WSNs) due to its desirable scalability and efficiency. Maintaining neighborhood inform...
Haibo Zhang, Hong Shen
NETWORKS
2002
14 years 9 months ago
Approximation algorithms for constructing wavelength routing networks
Consider a requirement graph whose vertices represent customers and an edge represents the need to route a unit of flow between its end vertices along a single path. All of these ...
Refael Hassin, Asaf Levin
CORR
2010
Springer
123views Education» more  CORR 2010»
14 years 8 months ago
A Stackelberg Strategy for Routing Flow over Time
Routing games are used to to understand the impact of individual users’ decisions on network efficiency. Most prior work on routing games uses a simplified model of network fl...
Umang Bhaskar, Lisa Fleischer, Elliot Anshelevich