Abstract
A routing protocol called ‘Centroid-Based Routing (CBR)’ is proposed to optimize the total system energy for a given wireless sensor network. We have designed the CBR protocol to optimize the battery life of the sensor nodes, by using a mobile Sink Node (SN). In CBR, several clusters are formed for the sensor nodes and each cluster is assigned a ‘Cluster Head (CH)’ node, and these CHs act as a local Base Station. The SN moves to a coordinate point (Xc, Yc) which we call a ‘Centroid Point (CP)’ to collect data from the CH nodes. This ‘CP’ is dependent on the coordinates of all the CHs and also on their residual or remaining energy left over at any given round. This way the CH nodes have to pump a balanced amount of energy to send and receive data from SN, which makes the nodes last for a longer period. The simulation results imply that the CBR model is much efficient compared to other existing models in terms of energy utilization and network lifetime for the non-uniformly distributed sensor nodes in a given network area.
Similar content being viewed by others
References
Dressler F (2007) Self-organization in sensor and actor networks. Wiley, New York
Anastasi G, Conti M, Francesco MD (2009) Extending the lifetime of wireless sensor networks through adaptive sleep. IEEE Trans Ind Inf 5(3):1
Dewal P, Narula GS, Jain V, Baliyan A (2013) Security attacks in wireless sensor networks: a survey. In: International conference on intelligent systems and signal processing (ISSP)
Huang CF, Lin WC (2015) Data collection for multiple mobile users in wireless sensor networks. J Supercomput 72:2651–2669
Karimi A, Amini SM (2019) Reduction of energy consumption in wireless sensor networks based on predictable routes for multi-mobile sink. J Supercomput 75:7290–7313
Amini SM, Karimi A, Esnaashari M (2019) Energy-efficient data dissemination algorithm based on virtual hexagonal cell-based infrastructure and multi-mobile sink for wireless sensor networks. J Supercomput 76:150–173
Mottaghi S, Zahabi MR (2015) Optimizing LEACH clustering algorithm with mobile sink and rendezvous nodes. AEU Int J Electron Commun 69(2):475–608
Chauhan V, Soni S (2019) Mobile sink-based energy efficient cluster head selection strategy for wireless sensor networks. J Ambient Intell Humaniz Comput 1:1–14
Rajaram V, Kumaratharan N (2020) Multi-hop optimized routing algorithm and load balanced fuzzy clustering in wireless sensor networks. J Ambient Intell Humaniz Comput 1:1–9
Heinzelman WB, Chandrakasan A, Balakrishnan H (2000) Energy-efficient communication protocol for wireless microsensor networks. In: Proceedings of the 33rd Hawaii international conference on system sciences
Nayak SP, Rai SC, Pradhan SK (2016) MERA-A multi-clustered energy efficient routing algorithm in WSN. In: International conference on information technology (ICIT)
Lindsey S, Raghavendra CS (2003) PEGASIS: power-efficient gathering in sensor information systems. In: Proceedings, IEEE Aerospace Conference
Sert SA, Bagci H, Yazici A (2015) MOFCA: multi-objective fuzzy clustering algorithm for wireless sensor networks. Appl Soft Comput 30:151–165
Balakrishnan B, Balachandran S (2017) FLECH: fuzzy logic based energy efficient clustering hierarchy for nonuniform wireless sensor networks. Wirel Commun Mobile Comput 3:1–13
Shin K, Kim S (2012) Predictive routing for mobile sinks in wireless sensor networks: a milestone-based approach. J Supercomput 62:1519–1536
Roy S, Mazumdar N, Pamula R (2020) An energy and coverage sensitive approach to hierarchical data collection for mobile sink based wireless sensor networks. J Ambient Intell Humaniz Comput 1:1–25
Wang J, Cao J, Ji S, Park JH (2017) Energy-efficient cluster-based dynamic routes adjustment approach for wireless sensor networks with mobile sinks. J Supercomput 73:3277–3290
Liu B, Bras P, Dousse O, Nain P, Towsley DF (2005) Mobility improves coverage of sensor networks. In: Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing, pp 300–308
Gu Y, Ji Y, Li J, Xhao B (2013) ESWC: efficient Scheduling for the Mobile Sink in Wireless Sensor Networks with Delay Constraint. IEEE Trans Parall Distrib Syst 24(7):1310–1320
Liu W, Lu K, Wang J, Xing G, Huang L (2012) Performance analysis of wireless sensor networks with mobile sinks. IEEE Trans Vehic Technol 61(6):2777–2788
Wang G, Wang T, Jia W, Guo M, Li J (2008) Adaptive location updates for mobile sinks in wireless sensor networks. J Supercomput 47:127–145
Wang J, Cao J, Sherratt RS, Park JH (2017) An improved ant colony optimization-based approach with mobile sink for wireless sensor networks. J Supercomput 74:6633–6645
Hartigan JA, Wong MA (1979) Algorithm as 136: a k-means clustering algorithm. J R Stat Soc Ser C (Appl Stat) 28:100–108
Lijun L, Hongtao W, Peng C (2007) Discuss in round rotation policy of hierarchical route in wireless sensor networks. In: International conference on wireless communications, networking and mobile computing
Jain A, Goel AK (2020) Energy efficient fuzzy routing protocol for wireless sensor networks. Wireless Pers Commun 110:1459–1474
Louail L, Felea V (2019) Centroid-based single sink placement in wireless sensor networks. Wireless Pers Commun 108:121–140
Mhatre V, Rosenberg C (2004) Homogeneous vs heterogeneous clustered sensor networks: a comparative study. In: IEEE international conference on communications (IEEE Cat. No. 04CH37577), 26 July 2004
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Basumatary, H., Debnath, A., Barma, M.K.D. et al. Centroid-Based Routing protocol with moving sink node for uniform and non-uniform distribution of wireless sensor nodes. J Supercomput 77, 3727–3751 (2021). https://doi.org/10.1007/s11227-020-03414-8
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11227-020-03414-8