Owing to the absence of any support structures, ad-hoc networks are prone to link failures. In such a dynamic environment the assessment of link connectivity can help alleviate the mobility-induced mal-effects. This paper discusses the applications of residual-link-lifetime appraisal. Herein we propose an optimal route discretion policy, effective route cache management technique and dynamic po...

DSR algorithm is applied to selects best path for communication between two nodes in a highly dynamic environment. As highly dynamic environment changes frequently, the probability of breakage of established path is high in such environment. Every time when established path breaks, a new route has to be discovered for communication between the nodes. In order to avoid path discovery every time,...

Clustering is an important technique in mobile ad hoc networks to provide a framework for management and reduce the overhead of route acquisition. Many clustering techniques had been proposed in the literature, but few of them had considered the status of network from the aspect of stability. In this paper, a stability-based clustering (SBC) technique is proposed. SBC only constructs stable eno...

There is a vast amount of researched literature available on Route Finding and Link Establishment in MANET protocols based on various concepts such as “pro-active”, “reactive”, “power awareness”, “cross-layering” etc. Most of these techniques are rather restrictive, taking into account a few of the several aspects that go into effective route establishment. When we look at practical implementat...

A solution to the shortest path problem in Martinez de la Torre, a city in the state of Veracruz, Mexico, is presented. Dijkstra’s algorithm was applied to find the shortest route and additional parameter that is used to choose the optimal route was also added. The shortest path problem is a specific case of optimization problems and can be addressed using graph theory. From a computational poi...