Open Access Open Access  Restricted Access Subscription Access

Efficient Non-Base-Station based Wireless Communication in MANET using Shortest Path Algorithm

K. Thamizhmaran

Abstract


Shortest path routing has the potential to improve network performance, but its effectiveness is partly dependent on the routing protocol's functioning and the settings chosen. Establishing an accurate and effective route between two nodes is the main objective of such an ad-hoc network routing protocol in order to deliver messages on time. The least amount of money, overhead, and bandwidth should be used when building a route. The idea of shortest path routing over ad hoc networks was investigated by a few researchers. Everybody utilizes different topologies and their own parameters.


Full Text:

PDF

References


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.

SV.Pavlov, V.A. Dokuchaev, V.V.Makkachkova and S.S.Mytenkov, “Features of supporting decision making in modern enterprise info communication systems”, T-Comm, vol. 13, no. 3, pp.71-74, 2019.


Refbacks

  • There are currently no refbacks.