Cart (Loading....) | Create Account
Close category search window
 

High reliable disjoint path set selection in mobile ad-hoc network using hopfield neural network

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $31
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Sheikhan, M. ; Dept. of Electr. Eng., Islamic Azad Univ., Tehran, Iran ; Hemmati, E.

Mobile ad-hoc network (MANET) is a collection of wireless mobile computers forming a temporary network without any fixed infrastructure or wired backbone. Topological changes in MANET frequently render routing paths unusable. A suitable technique for addressing this problem is to enhance the diversity of paths between the source and destination. However, multipath routing is a challenging task. In particular, the correlation between the failures of the paths in a path set should be as small as possible. Shared nodes and links between the paths are usual failure points. Disjointed path sets require the multiple paths to be link-disjoint or node-disjoint. However, selecting an optimal path set is an NP-complete problem. Artificial neural networks have been proposed as computational tools to solve constrained optimisation problems. The use of Hopfield neural network as a path set selection algorithm is explored. Since this algorithm produces a set of backup paths with much higher reliability, it is beneficial for MANETs. We use link expiration time (LET) between two nodes to estimate link reliability. In this approach, node-disjoint and link-disjoint path sets can be found simultaneously with route discovery algorithm. So, if someone wants to find both node-disjoint and link-disjoint path sets, there is no need to submit extra control messages, as overhead, to the MANET. Simulation results show that the proposed protocol can find path sets with higher reliability in comparison to the other recent proposed algorithms.

Published in:

Communications, IET  (Volume:5 ,  Issue: 11 )

Date of Publication:

July 22 2011

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.