Determining k-partitions of Mobile WSN ensuring one-hop communication with total coverage
Azad Hossain, Safikureshi Mondal, Zeenat Rehena · 2022
State-of-the-art research shows that sink mobility in Wireless Sensor Networks (WSNs) can prolong the lifetime of the WSN network. We have proposed an algorithm to automatically calculate the no. of partitions (k) of WSN. Each sink will move in every partition in such a way that it will visit every data collection site within the tolerance limit of every sensor nodes under the single-hop communication range of that site. A sink is placed within each partition of WSN and trajectory with data collection sites of each sink within each partition is determined in such a way that each and every sensor node should be able to send its data to its own sink directly with single-hop communication when the sink is at the site which is within communication range of it. Simulation results show that the proposed algorithm generates different no. of partitions with different tolerance limits providing total coverage of sensor nodes in the WSN.