Abstract
In some mobile wireless sensor network applications, it is not necessary to monitor the entire field all the time, and only a number of critical points or points of interest (POIs) need to be monitored periodically. In this paper, we address the minimum-delay POIs coverage in mobile wireless sensor networks problem with cost restriction, which is how to schedule the limited number of mobile sensors monitoring to minimize the service delay of POIs. We study two scenarios of the problem. In the first scenario, the start positions of mobile sensors are determined in advance, we propose the SSR algorithm to address this problem. In the second scenario, without pre-defined start positions, we propose two algorithms, the TSP-S and the SSNOR. By the comprehensive simulations, we evaluate the performance of the proposed algorithms. The simulation results show the efficiency of our algorithms.
Highlights
Wireless sensor networks (WSNs) have been widely studied in recent years
We will propose two algorithms for the Minimum-Delay points of interest (POIs) Coverage problem to deal with the scenario that the mobile sensors are not restricted to start sweeping from the determined positions, which is more flexible in practical applications
With the determined start positions of mobile sensors, we propose the SSR algorithm
Summary
Wireless sensor networks (WSNs) have been widely studied in recent years. Coverage is one of the most important issues in WSNs. The end time of one round of monitoring for M1 and M2 is almost the same This is mainly because in every step of SSR algorithm, when choosing the POI to join one of the mobile sensors’ trajectory, we always guarantee that the 2MDkT of current schedule is always minimized after this POI is added. We will propose two algorithms for the Minimum-Delay POIs Coverage problem to deal with the scenario that the mobile sensors are not restricted to start sweeping from the determined positions, which is more flexible in practical applications. 5.2 Modified stretched searching algorithm for the Minimum-Delay POIs Coverage problem without restriction In this subsection, we modify the SSR algorithm to apply to the scenario that the start-positions of mobile sensors are not restricted. We can conclude that the delay and T of the SSR algorithm change little when the number of POIs increasing
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
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 callMore From: EURASIP Journal on Wireless Communications and Networking
Disclaimer: 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.
