EURASIP Journal on Wireless Communications and Networking - Special issue on theoretical and algorithmic foundations of wireless ad hoc and sensor networks
| Hi-index | 0.00 |
A major concern in wireless sensor networks is to maximize network lifetime while maintaining a high quality of service at each round, which includes target coverage and network connectivity. There are two competing objectives presented to determine where to place the sensor nodes, the coverage rate and the number of working nodes. And then a novel algorithm for selecting the optimal coverage set based on improved immune clone selection algorithm is proposed. As another new contribution, we apply the novel algorithm in the K-disjoint coverage sets problem, which divides all the sensors into K-disjoint sets, guaranteeing each set with complete coverage. This method can shorten coding length, incarnate the characteristic of mutation and improve the capability of search and convergence of algorithm. By alternating coverage subsets and using only one at each round, the maximum network lifetime is achieved. Numerical and simulation results are provided to examine our analysis for wireless sensor networks