TY - JOUR
T1 - SMS2DC
T2 - Synchronous mobile sinks scheduling for data collection in internet of things-enabled wireless sensor networks
AU - Swapna, Nagalapuram Selvarajan
AU - Krishna, Raguru Jaya
AU - Reddy, Avija Vishnuvardhan
AU - Rao, Patike Kiran
AU - Prakash, Perumalla Suman
N1 - Publisher Copyright:
© 2024 John Wiley & Sons Ltd.
PY - 2024
Y1 - 2024
N2 - Energy-efficient data collection in wireless sensor networks (WSNs) is crucial due to the limited battery capacity of sensor nodes (SNs). Using a mobile sink (MS) for data collection can lower the energy consumption of SNs to avoid relaying in WSNs. However, a single MS is not a feasible solution for large-scale WSNs, so it was necessary to use multiple MSs to collect data. A synchronous MS scheduling strategy for data collection (SMS2DC) is proposed in this paper, which uses two types of MS, a local MS to collect data from SN and a global MS to collect data from local MS. In this process, we begin by partitioning the network based on chemical reaction optimization. For each partition, a MS is assigned and scheduled using a path construction strategy according to a geometric path construction approach. In addition, a global MS is scheduled based on a local MS trajectory by identifying the most appropriate collision point to collect data. As a result, the algorithm increases data collection accuracy while minimizing network data loss. The asymptotic time complexity of the proposed SMS2DC algorithm needed (Formula presented.). The comparison results show the superiority of the proposed SMS2DC strategy under multiple scenarios under various deployment conditions.
AB - Energy-efficient data collection in wireless sensor networks (WSNs) is crucial due to the limited battery capacity of sensor nodes (SNs). Using a mobile sink (MS) for data collection can lower the energy consumption of SNs to avoid relaying in WSNs. However, a single MS is not a feasible solution for large-scale WSNs, so it was necessary to use multiple MSs to collect data. A synchronous MS scheduling strategy for data collection (SMS2DC) is proposed in this paper, which uses two types of MS, a local MS to collect data from SN and a global MS to collect data from local MS. In this process, we begin by partitioning the network based on chemical reaction optimization. For each partition, a MS is assigned and scheduled using a path construction strategy according to a geometric path construction approach. In addition, a global MS is scheduled based on a local MS trajectory by identifying the most appropriate collision point to collect data. As a result, the algorithm increases data collection accuracy while minimizing network data loss. The asymptotic time complexity of the proposed SMS2DC algorithm needed (Formula presented.). The comparison results show the superiority of the proposed SMS2DC strategy under multiple scenarios under various deployment conditions.
UR - http://www.scopus.com/inward/record.url?scp=85190994595&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85190994595&partnerID=8YFLogxK
U2 - 10.1002/nem.2267
DO - 10.1002/nem.2267
M3 - Article
AN - SCOPUS:85190994595
SN - 1055-7148
VL - 35
JO - International Journal of Network Management
JF - International Journal of Network Management
IS - 1
M1 - e2267
ER -