• DOI:10.1109/INFCOM.2007.50
Corpus ID: 1984413

Nearly Constant Approximation for Data Aggregation Scheduling in Wireless Sensor Networks

@article{Huang2007NearlyCA,
  title={Nearly Constant Approximation for Data Aggregation Scheduling in Wireless Sensor Networks},
  author={S. Huang and P. Wan and C. Vu and Y. Li and F. Yao},
  journal={IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications},
  year={2007},
  pages={366-372}
}

S. Huang, P. Wan, +2 authors F. Yao

Published 2007

Computer Science

IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications

Data aggregation is a fundamental yet time-consuming task in wireless sensor networks. We focus on the latency part of data aggregation. Previously, the data aggregation algorithm of least latency [1] has a latency bound of (Delta - 1)R, where Delta is the maximum degree and R is the network radius. Since both Delta and R could be of the same order of the network size, this algorithm can still have a rather high latency. In this paper, we designed an algorithm based on maximal independent sets… CONTINUE READING

View on IEEE

cs.iit.edu

Save to Library

Create Alert

Cite

Launch Research Feed