Download now Free registration required
Coverage is one of the fundamental measurements of quality in wireless sensor networks. In order to prolong the network lifetime while maintaining coverage, many node partition algorithms have been developed. In this paper, the authors model coverage problem by a set coverage problem. Based on the density of information, the optimal node partitions are investigated by solving an ILP problem. An Intersection Point Method (IPM) is introduced to reduce the number of variables in ILP to O(km) where m is the number of deployed sensors; k is the number of neighbors. Even though the ILP model can give an approximately optimal solution for generating a minimum cover set.
- Format: PDF
- Size: 149.9 KB