Consider a set of n sensors deployed in a “belt region” – that is, a rectangular
ID: 3840567 • Letter: C
Question
Consider a set of n sensors deployed in a “belt region” – that is, a rectangular region R that is aligned with the x-y axes, where typically the width along the x-axis is much larger than the height along the y-axis. Assume that each sensor has a sensing range of r. That is, the sensor can detect movement anywhere in or on the circle of radius r centered at the sensor. This set of sensors provides k-weak barrier coverage for R if an intruder moving across R on any path parallel to the y axis will be detected by at least k sensors. Here is an example where the sensors provide 1-weak barrier coverage:
Give an O(n log n) algorithm to determine if a set of n sensors provides k-weak barrier coverage for R.
An illustration of weak 1.barrier caverage: any orthogonal crossing path (dashed lines)is covered by at least one sensor, However, uncovered path(s) may exist, such as the anes shawn in the solid curves.Explanation / Answer
I have designed and devleoped the O(n log n) algorithm for the sensors providing k-weak barrier coverage for R. I have written comments for the code and with the final output of it.
Let me explain you in simple and step-by-step manner:-
Step-1:
The initial part is to make use of Intruder detection as it helps you to important alert a station if they detects the presence of an intruder which is monitored circular area centered at its location,
Step-2:
The next step is to monitor the boundary of the regions which is provided by the barrier coverage for the most sufficient and cost-effective way,
Step-3:
Following this, The weak coverage sensor network is being applied when an intruder detects anyone follows the straight-line path across the barrier. The weak coverage is sufficient if its being not known by trespasser.
Step-4:
The final step is to achieve the weak coverage of the Rectangle R in a blocking configuration, which is used in a mobile sensors so that it will detect the network in any direction of a given area for placing the perpendicular to any side of the rectangle R.
O(n log n) Algorithm for K-weak barrier coverage:-
// It is the starting point of the algorithm
Compute the k-weak barrier coverage
// Applying the data variable for three types
Data: solidCurves, straightLine, dashedLines
Result: solidCurves
weakBarrierSensor
weakBarrierSolidC = 1;
weakBarRS solidCurves;
Update weakCoverageNC;
Apply WBC to weakCoverageNC;
// Uses the while loop condition
while NCK != 0 do
weakBarrierSolidC weakBarrierSolidC + 1;
Update weakBarRSOne and weakCoverageNCs;
Apply WBC to weakCoverageNCs;
// It is the end of the algorithm
end