Aggregation Convergecast Scheduling in Wireless Sensor Networks

• Author(s) / Creator(s)

  • Malhotra, Baljeet
  • Nikolaidis, Ioanis
  • Nascimento, Mario

• Technical report TR09-14. We consider the problem of aggregation convergecast scheduling in wireless sensor networks. Aggregation convergecast differs from regular convergecast in that it accommodates transmission dependencies that allow in-network aggregation to be performed. We formulate the abstract problem of aggregation convergecast and review the existing literature. We observe that existing schemes adopt essentially a two phase approach, consisting of, first, a tree construction and, second, a scheduling phase. Following a similar approach, we propose two new improvements, one to each of the two phases. Starting with a new lower bound on the schedule length, we make use of it in the tree construction step. The tree construction step consists of solutions to instances of bipartite graph semi-matching. The scheduling step is a weight-based priority scheme that obeys dependency (tree) and interference constraints. The combination of both improvements is demonstrated to outperform all existing solutions in the literature. We also study the impact of each of the two improvements alone and pay attention to cases where the tree construction is obviated due to the existence of extrinsic dependency constraints. | TRID-ID TR09-14

• Date created

  2009

• Subjects / Keywords

  • Database Systems

• Type of Item

  Report

• DOI

  https://doi.org/10.7939/R3DT7H

• License

  Attribution 3.0 International