Copyright © 2026 Authors retain the copyright of this article. This article is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

@article{146808,
        author = {Shabnam Kumari and Pinkee and Reema},
        title = {Shortest Hop Multi-Path Algorithm For WSN},
        journal = {International Journal of Innovative Research in Technology},
        year = {},
        volume = {5},
        number = {2},
        pages = {419-423},
        issn = {2349-6002},
        url = {https://ijirt.org/article?manuscript=146808},
        abstract = {Wireless Sensor Networks (WSNs) are a research themealluring over the recent years because of its ample applications. WSNs are a set of wireless embedded devices which have the ability of processing and communicating video and audio streams collected from the environment in a distributed fashion.This workpresents a Dijkstra’s algorithm tofigure out the shortest path between the source node and destination node with lower cost. Emanating on the multidimensional scaling (MDS) technique the node locations can be procured to fit the approximate distances between pairs of nodes. It uses the Shortest Path Position Estimation between Source and Destination nodes in Wireless Sensor Networks with Lower Cost},
        keywords = {WSN, WTE, STL, SWSN},
        month = {},
        }