Mobile Sensor Nodes Traversal Schemes to Attend Events at Random Locations With Minimal Energy Depletion

A group of homogeneous mobile sensor nodes (MSNs) with fixed amount of energy are deployed randomly over the region of interest (ROI). Events might happen at a random location within the ROI. MSNs must travel a certain distance to reach the random location for information collection. The modified Min-Heap approach helps to identify a suitable MSN from the group of MSNs. The selected MSN will reach the random location by traveling a shorter distance than its counterparts. The proposed mathematical models are helpful in uniformly distributing the workload among the MSNs, to ensure that all the MSNs have an approximately equal amount of residual energy.