Performance of multipath routing for on-demand protocols in mobile ad hoc networks
Mobile Networks and Applications
Recurrent Neural Networks for Prediction: Learning Algorithms,Architectures and Stability
Recurrent Neural Networks for Prediction: Learning Algorithms,Architectures and Stability
Ad hoc on-demand multipath distance vector routing
ACM SIGMOBILE Mobile Computing and Communications Review
An adaptive framework for QoS routing through multiple paths in ad hoc wireless networks
Journal of Parallel and Distributed Computing - Special issue on Routing in mobile and wireless ad hoc networks
An Extended Dynamic Source Routing Scheme in Ad Hoc Wireless Networks
HICSS '02 Proceedings of the 35th Annual Hawaii International Conference on System Sciences (HICSS'02)-Volume 9 - Volume 9
Multi-path Ad Hoc Routing Considering Path Redundancy
ISCC '03 Proceedings of the Eighth IEEE International Symposium on Computers and Communications
On-Demand Multi Path Distance Vector Routing in Ad Hoc Networks
ICNP '01 Proceedings of the Ninth International Conference on Network Protocols
Ant Agents for Hybrid Multipath Routing in Mobile Ad Hoc Networks
WONS '05 Proceedings of the Second Annual Conference on Wireless On-demand Network Systems and Services
A framework for misuse detection in ad hoc Networks-part I
IEEE Journal on Selected Areas in Communications
An approach to stabilize interdomain routing protocol after failure
Computers and Electrical Engineering
Hi-index | 0.00 |
Topological changes in mobile ad hoc networks frequently render routing paths unusable. Such recurrent path failures have detrimental effects on quality of service. A suitable technique for eliminating this problem is to use multiple backup paths between the source and the destination in the network. Most of the proposed on-demand routing protocols however, build and rely on single route for each data session. Whenever there is a link disconnection on the active route, the routing protocol must perform a path recovery process. This paper proposes an effective and efficient protocol for backup and disjoint path set in an ad hoc wireless network. This protocol converges into a highly reliable path set very fast with no message exchange overhead. The paths selection according to this algorithm is beneficial for mobile ad hoc networks, since it produces a set of backup paths with much higher reliability. Simulations are conducted to evaluate the performance of our algorithm in terms of route numbers in the path set and its reliability. In order to acquire link reliability estimates, we use link expiration time (LET) between each two nodes. In another experiment, we save the LET of entire links in the ad hoc network during a specific time period, then use them as a data base for predicting the probability of proper operation of links. Links reliability obtains from LET. Prediction is done by using a multi-layer perceptron (MLP) network which is trained with error back-propagation error algorithm. Experimental results show that the MLP net can be a good choice to predict the reliability of the links between the mobile nodes with more accuracy.