Prediction-based Routing Algorithm Research Articles

Travel Time Prediction-Based Routing Algorithms for Automated Highway Systems

Travel Time Prediction-Based Routing Algorithms for Automated Highway Systems

Traffic prediction-based routing algorithm over structured P2P networks

Routing has always been a great challenge for structured Peer-to-Peer (P2P) networks. There are a lot of representative structured routing algorithms for P2P networks, but these algorithms do not guarantee the quality of service (QoS) for real-time P2P applications. Addressing this challenge, a traffic prediction-based structured routing algorithm over P2P networks (TPSR) is proposed. Our contributions are described as below. We firstly analyze P2P traffic features and then build a wavelet neural-network predicting model. Secondly, we employ the traffic prediction model to predict the future state of each peer, such as normal or congestion, and let each peer update its routing table. In this way the requesting peers always get a resource list which contains the best resource peers. Simulation results demonstrate that TPSR has higher transmission success rate and lower end to end delay than other structured routing algorithms. Thus, TPSR can guarantee the QoS for real-time P2P applications.

Maximizing the Effective Lifetime of Mobile Ad Hoc Networks

This paper presents a new routing approach to extend the effective lifetime of mobile ad hoc networks (MANET) considering both residual battery energy of the participating nodes and routing cost. As the nodes in ad hoc networks are limited in power, a power failure occurs if a node has insufficient remaining energy to send, receive or forward a message. So, it is important to minimize the energy expenditure as well as to balance the remaining battery power among the nodes. Cost effective routing algorithms attempt to minimize the total power needed to transmit a packet which causes a large number of nodes to loose energy quickly and die. On the other hand, lifetime prediction based routing algorithms try to balance the remaining energies among the nodes in the networks and ignore the transmission cost. These approaches extend the lifetime of first few individual nodes. But as nodes spend more energy for packet transfer, power failures occurs, within short interval resulting more number of total dead node earlier. This reduces the effective lifetime of the network, as at this stage successful communication is not possible due to the lack of forwarding node. The proposed method keeps the transmission power in modest range and at the same time tries to reduce the variance of the residual energy of the nodes more effectively to obtain the highest useful lifetime of the networks in the long run. Nonetheless, movement of nodes frequently creates network topology changes via link breaks and link creation and thus effects on the stability of the network. So, the pattern of the node movement is also incorporated in our route selection procedure.

Reliable Ad Hoc Routing Based on Mobility Prediction

Reliability is a very important issue in Mobile Ad hoc NETworks (MANETs). Shortest paths are usually used to route packets in MANETs. However, a shortest path may fail quickly, because some of the wireless links along a shortest path may be broken shortly after the path is established due to mobility of mobile nodes. Rediscovering routes may result in substantial data loss and message exchange overhead. In this paper, we study reliable ad hoc routing in the urban environment. Specifically, we formulate and study two optimization problems. In the minimum Cost Duration-bounded Path (CDP) routing problem, we seek a minimum cost source to destination path with duration no less than a given threshold. In the maximum Duration Cost-bounded Path (DCP) routing problem, we seek a maximum duration source to destination path with cost no greater than a given threshold. We use a waypoint graph to model the working area of a MANET and present an offline algorithm to compute a duration prediction table for the given waypoint graph. An entry in the duration prediction table contains the guaranteed worst-case duration of the corresponding wireless link. We then present an efficient algorithm which computes a minimum cost duration-bounded path, using the information provided in the duration prediction table. We also present a heuristic algorithm for the DCP routing problem. In addition, we show that the proposed prediction and routing schemes can be easily applied for designing reliable ad hoc routing protocols. Simulation results show that our mobility prediction based routing algorithms lead to higher network throughput and longer average path duration, compared with the shortest path routing.