| From the battlefield to everyday life, health, safety, education, exploration, surveillance, the operation table, and construction, everywhere sensors and a sensor network are being used. Due to the heavy increase in the use of sensor networks, it is a very significant research field. There is no complete bundle of solutions for a sustainable sensor network.;In this research, we design the differentiated, coverage-preserved, sensor-scheduling model of a heterogeneous sensor network. We implement an optimization solver which minimizes the cost of a generalized network flow model. The development phase of the code also took a significant software engineering research effort. Our code gives the similar optimal value like commercial codes.;In the next phase, we design the network flow model of a sensor network. We generate test cases by writing code and do the empirical testing. We show the optimal value which is the minimum number of duty cycles to provide the coverage of a feasible network. Our algorithm can check the feasibility of the problem domain. Our method also computes the saved duty cycles if the minimum numbers of sensors are awake. In fact, this research introduces a novel method to find optimal scheduling in a heterogeneous sensor network. In our model, we simulate sensor scheduling using different inputs, such as battery life-time which is represented by different numbers of duty cycles, different numbers of sensor nodes, and different sizes of network area which are represented by the sets of grid-points. We simulate with different coverage capabilities of sensors and with different levels of coverage requirements at the grid-points. We implement another heuristic which keeps a sensor "on" based on its maximum coverage capability to compare the coverage performance of our method. We show that our method performs better. We show that the heuristic does not meet the demand of a sensor network. Our scheduling method spends the minimum number of duty cycles providing coverage. |
