Abstract
Wireless sensor network (WSN) is an accumulation of smart sensor nodes which has firmly restricted control, calculation ability, storage and communication facility. Wireless sensor network (WSN) is the most standard services engaged in commercial and industrial applications like military surveillance, animal monitoring, target tracking, forest fire detection and industry security. The Sensor Node (SN) automatically construct a network connected to the sink node after deploying manually. Each SN is accountable for monitoring surrounding environment and data which is delivered to the sink node in a one-hop or multihop manner. The collected data are transmitted to the remote server by sink node through satellites or internet. Hence, an energy optimization technique is used to reduce the actual power consumption of the SN in place of sink node. Here, the Bellman Ford Shortest Path Algorithm is used for efficient data transmission purposes which helps in reducing the energy consumption of sensor nodes. The Bellman-Ford algorithm is used as a shortest path algorithm in this work. In a given paper K-medoid clustering algorithm is used for cluster formation. K-medoid clustering chooses the sensor node as a cluster head (CH) which lies at the center of the cluster. Further, The MATLAB software is used for the simulation of the Bellman Ford Shortest Path Algorithm for acquiring better results. The simulated results show that the Bellman Ford Shortest Path Algorithm is better than the K-Medoid Algorithm in place of energy consumption and network lifetime.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Koriem, S.M., Bayoumi, M.A. Detecting and measuring holes in wireless sensor network. J. King Saud Univ. Comput. Inf. Sci. (2018),https://doi.org/10.1016/j.jksuci.2018.08.001
Umale, M., Markande, S.D.: Energy-efficient routing algorithm on the target tracking in wireless sensor network. In: 2015 International Conference on Information Processing (ICIP) (2015). https://doi.org/10.1109/infop.2015.7489373
Li, P., Xu, S., Sun, K., Qiu, X., Qi, F.: A path planning method of wireless sensor networks based on service priority. In: 2017 13th International Conference on Network and Service Management (CNSM) (2017). https://doi.org/10.23919/cnsm.2017.8255984
Nanda, A., Rath, A.K.: Cost-effective ModLeach-A∗ search algorithm for shortest path routing in Wireless Sensor Networks. In: 2016 Sixth International Symposium on Embedded Computing and System Design (ISED) (2016). https://doi.org/10.1109/ised.2016.7977072
Khediri, S.E., Thaljaoui, A., Dallali, A., Kachouri, A.: Clustering Algorithm in wireless sensor networks based on the shortest path. In: 2018 30th International Conference on Microelectronics (ICM) (2018). https://doi.org/10.1109/icm.2018.8704059
Li, Y., Wang, J., Zheng, G., Shi, X., Lu, D.: Compressive data gathering in wireless sensor networks based on random path. In: 2018 International Conference on Virtual Reality and Intelligent Systems (ICVRIS) (2018). https://doi.org/10.1109/icvris.2018.00131
Wang, N., Li, J.: Shortest path routing with risk control for compromised wireless sensor networks. IEEE Access 1, 19303–19311 (2019). https://doi.org/10.1109/access.2019.2897339
El Khedira, S., Thaljaoui, A., Dallali, A., Harakti, S., Kachouri, A.: A novel connectivity algorithm based on shortest path for wireless sensor networks. In: 2018 1st International Conference on Computer Applications & Information Security (ICCAIS) (2018). https://doi.org/10.1109/cais.2018.8442032
Wang, J., Wang, K., Niu, J., Liu, W.: A K-medoids based Clustering Algorithm for wireless sensor networks. In: International Workshop on Advanced Image Technology (IWAIT) (2018)
Author information
Authors and Affiliations
Corresponding authors
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2020 Springer Nature Switzerland AG
About this paper
Cite this paper
Sharma, G., Kumar, P., Shrivastava, L. (2020). An Efficient Performance of Enhanced Bellman-Ford Algorithm in Wireless Sensor Network Using K-Medoid Clustering. In: Pandit, M., Srivastava, L., Venkata Rao, R., Bansal, J. (eds) Intelligent Computing Applications for Sustainable Real-World Systems. ICSISCET 2019. Proceedings in Adaptation, Learning and Optimization, vol 13. Springer, Cham. https://doi.org/10.1007/978-3-030-44758-8_6
Download citation
DOI: https://doi.org/10.1007/978-3-030-44758-8_6
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-44757-1
Online ISBN: 978-3-030-44758-8
eBook Packages: Intelligent Technologies and RoboticsIntelligent Technologies and Robotics (R0)