Mobile ad hoc networks support multi hop routing where the deployment of central base station is neither economic nor easy. Efficient routing of the packets is a major challenge in the ad hoc networks. There exist several proactive (like DSDV etc.) and reactive (Like AODV etc.) routing algorithms for the dynamic networks.The EEAODV ALGORITHM selects the path with minimum cost value indicating t...

The differential evolution algorithm has been widely applied on unmanned aerial vehicle (UAV) path planning. At present, four random tuning parameters exist for differential evolution algorithm, namely, population size, differential weight, crossover, and generation number. These tuning parameters are required, together with user setting on path and computational cost weightage. However, the op...

By increasing, the complexity of chips and the need to integrating more components into a chip has made network –on- chip known as an important infrastructure for network communications on the system, and is a good alternative to traditional ways and using the bus. By increasing the density of chips, the possibility of failure in the chip network increases and providing correction and fault tol...

In the traveling salesman path problem, we are given a set of cities, traveling costs between city pairs and fixed source and destination cities. The objective is to find a minimum cost path from the source to destination visiting all cities exactly once. In this paper, we study polyhedral and combinatorial properties of a variant we call the traveling salesman walk problem, in which the object...

Given a rectilinear domain P of h pairwise-disjoint rectilinear obstacles with a total of n vertices in the plane, we study the problem of computing bicriteria rectilinear shortest paths between two points s and t in P. Three types of bicriteria rectilinear paths are considered: minimum-link shortest paths, shortest minimum-link paths, and minimum-cost paths where the cost of a path is a non-de...

In this paper, we introduce a distributed algorithm for single source shortest path problem for undirected graphs. In this problem, we find the shortest path from a given source node to other nodes in the graph. We start with undirected unweighted graphs in which the shortest path is a path with minimum number of edges. Following, we modify the algorithm to find shortest path for weighted graph...

We propose an algorithm forfinding a multicast tree in packet-switched networks. The objective is to minimize total cost incurred at the multicast path. The routing model is based on the minimum cost Steiner tree problem The Steiner problem is extended, in our papes to incorpomte two additional requirements. First , the delay experienced along the path from the source to each destination is bou...

Many recent approximation algorithms for different variants of the traveling salesman problem (asymmetric TSP, graph TSP, s-t-path TSP) exploit the well-known fact that a solution of the natural linear programming relaxation can be written as convex combination of spanning trees. The main argument then is that randomly sampling a tree from such a distribution and then completing the tree to a t...

Structural and functional brain connectivity are increasingly used to identify and analyze group differences in studies of brain disease. This study presents methods to analyze uni- and bi-modal brain connectivity and evaluate their ability to identify differences. Novel visualizations of significantly different connections comparing multiple metrics are presented. On the global level, "bi-moda...