ALGORITHM 1: Energy Efficient Maximum Disjoint Coverage [square root of m]-approximation Algorithm (EMDC).
Figure 3 shows the average disjoint set covers generated under varying number of sensor nodes for EMDC and DSC-MDC .
Figure 4 shows disjoint set covers generated for varying number of targets.
In Figure 5, we observe the effect of sensing range on disjoint set covers.
In case of DSC-MDC, more number of disjoint set covers is computed compared to EMDC since there is no constraint on the sensor nodes to qualify as a member of the set covers.
EMDC has better network lifetime compared to DSC-MDC because EMDC considers the nodes with minimum energy in order to qualify for the set covers for both the disjoint sets.
The proposed algorithm EMDC maximizes network lifetime by using two energy efficient disjoint set covers in a single hop WSN with a single sink.
Hashemi, "New optimal solution to disjoint set K-coverage for lifetime extension in wireless sensor networks," IET Wireless Sensor Systems, vol.
Erlebach, "Approximating maximum disjoint coverage in wireless sensor networks," in Proceedings of the 12th International Conference on Ad-Hoc, Mobile, and Wireless Networks (ADHOC-NOW '13), Lecture Notes in Computer Science, pp.
Caption: FIGURE 2: A bipartite graph with two energy efficient disjoint set covers.
Caption: FIGURE 3: Number of disjoint set covers versus Number of Sensors.
Caption: FIGURE 4: Number of disjoint set covers versus Number of Targets.