Computationally Efficient Transmission Scheduling for Sensor Networks

In this paper a new heuristic for transmission scheduling in sensor networks is proposed, using a model suggested by Chen et al. The performance and complexity of their algorithms are analyzed and it seems that the procedure for optimal scheduling with global channel state information is computationally too intensive for practical networks, while the heuristic methods used result in far from optimal network lifetimes. In this paper, a new heuristic is proposed, called the ratio minimisation heuristic, which has near optimal performance while maintaining linear complexity in the number of sensors.