Sciweavers

315 search results - page 13 / 63
» Shortest path optimization under limited information
Sort
View
JNW
2008
124views more  JNW 2008»
13 years 7 months ago
A Position Based Ant Colony Routing Algorithm for Mobile Ad-hoc Networks
Position based routing algorithms use the knowledge of the position of nodes for routing of packets in mobile ad-hoc networks. Previously proposed position based routing algorithms...
Shahab Kamali, Jaroslav Opatrny
AAAI
2008
13 years 10 months ago
Mathematical Modeling and Convergence Analysis of Trail Formation
An ant deposits pheromone along the path that it travels and is more likely to choose a path with a higher concentration of pheromone. The sensing and dropping of pheromone makes ...
Sameena Shah, Ravi Kothari, Jayadeva, Suresh Chand...
IPSN
2004
Springer
14 years 1 months ago
Lattice sensor networks: capacity limits, optimal routing and robustness to failures
We study network capacity limits and optimal routing algorithms for regular sensor networks, namely, square and torus grid sensor networks, in both, the static case (no node failu...
Guillermo Barrenechea, Baltasar Beferull-Lozano, M...
MASS
2010
186views Communications» more  MASS 2010»
13 years 5 months ago
VAN: Vehicle-assisted shortest-time path navigation
Traffic congestion is a very serious problem in large cities. With the number of vehicles increasing rapidly, especially in cities whose economy is booming, the situation is gettin...
Wenping Chen, Sencun Zhu, Deying Li
INFOCOM
2010
IEEE
13 years 6 months ago
On the Fundamental Limits of Broadcasting in Wireless Mobile Networks
Abstract—In this paper, we investigate the fundamental properties of broadcasting in mobile wireless networks. In particular, we characterize broadcast capacity and latency of a ...
Giovanni Resta, Paolo Santi