Route directions are usually conveyed either by graphical means, i.e. by illustrating the route in a map or drawing a sketch-maps or, linguistically by giving spoken or written route instructions, or by combining both kinds of external representations. In most cases route directions are given in advance, i.e. prior to the actual traveling. But they may also be communicated quasisimultaneously t...

This paper presents an event-driven way finding algorithm for pedestrians in an evacuation scenario, which operates on a graph-based structure. The motivation of each pedestrian is to leave the facility. The events used to redirect pedestrians include the identification of a jam situation and/or identification of a better route than the current. This study considers two types of pedestrians: fa...

This paper develops a simple robust framework for the problem of finding the least expected travel time route from any node to any given destination in a stochastic and time-dependent network. We consider both spatial and temporal link travel time correlations in the proposed solution based on a dynamic programming approach. In particular, the spatial correlation is represented by a Markovian p...

Wireless multihop mobile networks, also known as ad hoc networks, are characterized by stochastic topology variations. Random movements of mobile hosts in and out of each other’s range encumber smooth system operation and impose limitations on the network performance. Various routing protocols suitable for such networks have been proposed however implementation and performance issues are still ...

A novel technique for optimising the efficiency of route discovery is proposed. The optimisation aims to minimise the number of cached route replies (RREP), which is a significant source of overhead for the dynamic source routing (DSR) protocol. Performance results show that the overall route discovery overhead can be reduced by more than 30% under high node mobility.

Many routing algorithms, proposed for ad-hoc wireless networks, are based on source routing scheme. When a route is broken in source routing, route recovery and maintenance procedures are executed. However, these procedures consume many resources. To minimize route breaking, it’s important to find a route that endures longer time. Shortest path route has short lifetime especially in highly dens...