Shortest Path Algorithms for Sensor Node Localization for Internet of Things

Internet of Things have gained the interest of researchers and other academic communities due to their applications in various fields. Determining the location of a sensor node within the specified area consisting of number of sensors and smart devices is very crucial, which requires association between the devices and the sensor nodes[1]. Localization is the basic requirement for other services of any smart network like communication, clustering, distribution, routing etc. Multidimensional scaling is one of the approach used effectively for the sensor node localization. In this approach the process to obtain the minimum distance path between the pair of sensors are used which helps in estimating the relative positions of the nodes. This paper includes the explanation and comparison of different types shortest path algorithms. Then, we discuss about the use of multidimensional scaling process to obtain the absolute positions of nodes with reduced error cumulation in a smart network. It is mandatory to have a efficient, economic and scalable sensor node position estimation process for a wireless sensor network and hence for internet of Things. The results obtained experimentally proves the efficiency and effectiveness of the methods discussed for use in Internet of Things with various routing, topology and area.