Abstract:
Data collection, sensing coverage, and device control depend on sweep coverage. This paper addresses the cooperative sweep coverage problem with multiple mobile sensors to periodically cover all surveillance region PoIs.
In contrast to traditional sweep coverage scenarios, the cooperative sweep coverage (CSC) problem allows multiple sensors on the same trajectory to reduce sweep period or detection delay. Due to limited storage and power, mobile sensors must periodically transmit their data to a base station in the multi-sink sweep coverage (MSSC) problem.
We propose CoCycle and SinkCycle constant-factor approximations to minimize the maximum sweep period for these two problems. CoCycle and SinkCycle have 4 and 6 approximation ratios. SinkCycle is the first multi-sink sweep coverage approximation.
We offer two optimal algorithms for the one-dimensional CSC problem and a useful insight into the MSSC problem with one sink. Numerical experiments verify our designs’ efficacy and efficiency.
Note: Please discuss with our team before submitting this abstract to the college. This Abstract or Synopsis varies based on student project requirements.
Did you like this final year project?
To download this project Code with thesis report and project training... Click Here