Mathematical Model for Target Detection and Localization Using Directional Antennas

The coverage area problem in Directional Sensor Networks (DSNs) presents several research challenges, including optimizing the number of active directional antennas and minimizing overlapping sensing area among them. In this manipulation, the problem of target detection and the overlapped coverage area where the target is located are solved by constructing a mathematical model with two different algorithms to precisely determine the location of a target detected with four directional antennas located in specific places on the ground with defined coordinates. The two models depend on the intensity of the power received by each antenna and accordingly a beam is constructed towards the target from each antenna with a known, calculated angle. Using these four beams, the area of the polygon in the first algorithm formed by the intersection parts between the coverage belt (the 4 beams) of the four directional antennas is calculated. And, an approximate confidence circle formed by the intersections of four virtual lines from the four antennas is calculated in the second algorithm where the target is located. A solved example is executed and examined to validate the model with two algorithms. Also, a C++ simulation is used to test the efficiency of the algorithms.