1247 search results - page 198 / 250 » Dynamic Routing for Flying Ad Hoc Networks |
346
click to vote
SCN
2011
Springer
15 years 1 months ago
2011
Springer
An inelastic flow is a flow with inelastic rate: i.e., the rate is fixed, it cannot be dynamically adjusted to traffic and load condition as in elastic flows like TCP. Real ti...
157
click to vote
ICCSA
2009
Springer
16 years 1 months ago
2009
Springer
Swarm Intelligence (SI) inspired routing algorithms have become a research focus in recent years due to their self-organizing nature, which is very suitable to the routing problems...
163
click to vote
INFOCOM
2007
IEEE
16 years 21 days ago
2007
IEEE
Abstract— We propose a scalable and reliable point-topoint routing algorithm for ad hoc wireless networks and sensornets. Our algorithm assigns to each node of the network a virt...
170
click to vote
IPCCC
2007
IEEE
16 years 21 days ago
2007
IEEE
This paper proposes an efficient chaos-reducing information dissemination approach for spatiotemporal traffic information related to first responders and planned evacuation scenar...
202
click to vote
MOBIHOC
2006
ACM
16 years 6 months ago
2006
ACM
Geographic ad hoc networks use position information for routing. They often utilize stateless greedy forwarding and require the use of recovery algorithms when the greedy approach...