A New Scheduling Algorithm for Reducing Data Aggregation Latency in Wireless Sensor Networks

HTML  Download Download as PDF (Size: 1985KB)  PP. 679-688  
DOI: 10.4236/ijcns.2010.38091    4,458 Downloads   9,086 Views  Citations

Affiliation(s)

.

ABSTRACT

Existing works on data aggregation in wireless sensor networks (WSNs) usually use a single channel which results in a long latency due to high interference, especially in high-density networks. Therefore, data aggre- gation is a fundamental yet time-consuming task in WSNs. We present an improved algorithm to reduce data aggregation latency. Our algorithm has a latency bound of 16R + Δ – 11, where Δ is the maximum degree and R is the network radius. We prove that our algorithm has smaller latency than the algorithm in [1]. The simulation results show that our algorithm has much better performance in practice than previous works.

Share and Cite:

M. Ren, L. Guo and J. Li, "A New Scheduling Algorithm for Reducing Data Aggregation Latency in Wireless Sensor Networks," International Journal of Communications, Network and System Sciences, Vol. 3 No. 8, 2010, pp. 679-688. doi: 10.4236/ijcns.2010.38091.

Copyright © 2024 by authors and Scientific Research Publishing Inc.

Creative Commons License

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.