An Optimized Dijkstra’s SPF Algorithm used MultiHop Clustering for Scalable IoT Systems

  • G.Dinesh, C.Rajinikanth, Dr.P.Maheswara Venkatesh, T.V.Vanitha

Abstract

The adaptability issue of the IoT framework could be helped by social affair the center points of the IoT organize into gatherings and devising an agent center point in each gathering partner with the Internet to support various centers in the bundle as opposed to devouring a for every center point Internet affiliation and correspondence. In this broadside, we recommend a multi-hop gathering framework for IoT frameworks to constrain the amount of fundamental Internet associations. In particular, the target of future instrument is to choose the base amount of facilitators, which play the job of a delegate hub for the group, i.e., consuming the Internet association for the remainder of the hubs in the group and to delineate segment of the IoT hubs onto the chosen set of organizers to limit the complete separation between the hubs and their individual organizer.

Published
2019-11-12
How to Cite
Dr.P.Maheswara Venkatesh, T.V.Vanitha, G. C. (2019). An Optimized Dijkstra’s SPF Algorithm used MultiHop Clustering for Scalable IoT Systems. International Journal of Advanced Science and Technology, 28(14), 298 - 306. Retrieved from http://sersc.org/journals/index.php/IJAST/article/view/1494
Section
Articles