Abstract
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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
