Affordable Access

Data Gathering Schedule for Minimal Aggregation Time in Wireless Sensor Networks

International Journal of Distributed Sensor Networks
Publication Date
  • Computer Science
  • Mathematics


In this article we consider the MAT problem with collision-free transmission where a sensor can not receive any data if more than one sensors within its transmission range send data at the same time. We first prove that the MAT problem is NP-hard even if all sensors are deployed on a grid. We then propose a (∆ - 1)-approximation algorithms for the MAT problem, where ∆ is the maximum number of sensors within the transmission range of any sensor. By exploiting the geometric nature of wireless sensor networks, we obtain some better theoretical results for some special cases. We also simulate the proposed algorithm. The numerical results show that our algorithm has much better performance in practice than the theoretically proved guarantees and outperforms other existing algorithms.

There are no comments yet on this publication. Be the first to share your thoughts.