Open Access Open Access  Restricted Access Subscription Access

Reduced Delay for Mobile Ad Hoc Networks using Shortest Path Network

K. Thamizhmaran

Abstract


The accessibility of a way relies upon the quantity of connections and the unwavering quality of each connection framing the way. Many steering measurements as far as number of connections have been proposed, for example, the most brief way directing. Most brief way steering chooses a way having least expense to advance the information to the objective hub. Most limited way steering calculation determination relies upon direct traffic structure source to objective, boosting the organization execution and limiting the expense. Execution of the organization can be improved through briefest way steering however it additionally relies on the usefulness of the directing convention and the boundaries that are chosen for the most limited way steering. The essential objective of such an impromptu organization directing convention is right and productive course foundation between a couple of hubs so that messages might be conveyed as quickly as possibly. Course development ought to be finished with at least expense, above and transfer speed utilization. Some of scientists investigated the idea of briefest way directing over specially appointed network. Every one purposes his own boundaries with various geography. Nobody utilizes all boundaries. We will talk about the ideas for solutions that they have suggested in this paper.


Full Text:

PDF

References


Applegate, D.L.; Bixby, R.E.; Chvatal, V.; Cook, W.J. “The Traveling Salesman Problem: A Computational Study”, Princeton University Press: Princeton, NJ, USA, 2011.

Eppstein, D., Finding the K Shortest Paths, SIAM COMPUT 28(2), 652-673.

T.Korkmaz and M. Krunz, “Multi-Constrained Optimal Path Selection,” IEEE INFOCOM’2001, April 2001.

Fu. L., Rilett, L.R., “Expected shortest paths in dynamic and stochastic traffic networks”. Transportation research B 32(7), 1998.

Tseng W-LD. The shortest path problem, 2013.

http://www.cs.cornell.edu/~wdtseng/icpc/notes/graph_part2.pdf. Accessed 1 Jan 2015.

Emmerich, M.; Deutz, A. A tutorial on multiobjective optimization: Fundamentals and evolutionary methods. Nat. Comput. 2018, 17, 585–609

Festa, Paola. "Shortest path algorithms." Handbook of optimization in telecommunications. Springer US, 2006. 185-210.

Li Lin, Variable Query Algebra and Shortest Path Analysis, Acta Geodaetica et Cartographica Sinica, 29(1): 47-51.

Jain, A., Datta, U., & Joshi, N. (2016) “Implemented modification in Dijkstra‟ s Algorithm to find the shortest path for N nodes with constraint”, International Journal of Scientific Engineering and Applied Science, 2(2), 420-426.


Refbacks

  • There are currently no refbacks.