Efficient heuristics for determining node-disjoint path pairs visiting specified nodes
Sign Up to like & getrecommendations! Published in 2017 at "Networks"
DOI: 10.1002/net.21778
Abstract: A new recursive heuristic is proposed to calculate a shortest simple path, from a source node to a destination node, that visits a specified set of nodes in a network. To provide survivability to failures… read more here.
Keywords: node disjoint; heuristics determining; disjoint path; efficient heuristics ... See more keywords
Node Disjoint Random and Optimal Path Selection (NDROPS) Algorithm for Security in MANETS
Sign Up to like & getrecommendations! Published in 2017 at "International Journal of Electrical and Computer Engineering"
DOI: 10.11591/ijece.v7i3.pp1197-1203
Abstract: Mobile Adhoc Networks are shortly called MANETs. In these types of networks, fixed infrastructures are absent and are dynamic in nature. Nodes are movable, and they are not connected with any wires. For monitoring or… read more here.
Keywords: node disjoint; disjoint random; random optimal; security ... See more keywords