Neither Shortest Path Nor Dominating Set: Aggregation Scheduling by Greedy Growing Tree in Multihop Wireless Sensor Networks

@article{Tian2011NeitherSP,
  title={Neither Shortest Path Nor Dominating Set: Aggregation Scheduling by Greedy Growing Tree in Multihop Wireless Sensor Networks},
  author={Chen Tian and Hongbo Jiang and Chonggang Wang and Zuodong Wu and Jinhua Chen and Wenyu Liu},
  journal={IEEE Transactions on Vehicular Technology},
  year={2011},
  volume={60},
  pages={3462-3472}
}
Data aggregation is a fundamental task in multihop wireless sensor networks. Minimum-latency aggregation scheduling (MLAS) seeks to minimize the number of scheduled time slots to perform an aggregation. In this paper, we present the first work on a solvable mathematical formulation of the MLAS problem. The optimal solution of small example networks suggests that an optimal scheduling can be neither shortest path nor dominating set based. Instead of yet another theoretical analysis with provable… CONTINUE READING
4 Extracted Citations
15 Extracted References
Similar Papers

Referenced Papers

Publications referenced by this paper.
Showing 1-10 of 15 references

Similar Papers

Loading similar papers…