2808 search results - page 125 / 562 » Routing betweenness centrality |
156
click to vote
ESOA
2006
15 years 9 months ago
2006
We present a simple model of self-organization for sensor networks that addresses two conflicting requirements: hazard situations should be reported to a sink node with as little ...
166
click to vote
ESA
2010
Springer
15 years 7 months ago
2010
Springer
We show how to route on very large public transportation networks (up to half a billion arcs) with average query times of a few milliseconds. We take into account many realistic fe...
129
click to vote
INFORMS
2008
15 years 6 months ago
2008
Most traditional routing problems assume perfect operability of all arcs and nodes. However, when independent arc failure probabilities exist, a secondary objective must be presen...
159
click to vote
ICNP
2006
IEEE
16 years 6 days ago
2006
IEEE
Abstract— In many energy-rechargeable wireless sensor networks, sensor nodes must both sense data from the environment, and cooperatively forward sensed data to data sinks. Both ...
179
click to vote
WONS
2005
IEEE
15 years 11 months ago
2005
IEEE
In this paper we describe AntHocNet, an algorithm for routing in mobile ad hoc networks based on ideas from the Nature-inspired Ant Colony Optimization framework. The algorithm co...