Abstract
This paper focuses on data aggregation latency in wireless sensors networks. A distributed algorithm to generate a collision-free schedule for data aggregation in wireless sensor networks is proposed. The proposed algorithm is based on maximal independent sets. It modifies DAS scheme and proposes criteria for node selection amongst available competitors. The selection objective function captures the node degree (number of neighbors) and the level (number of hops) contrary to DAS that simply uses node ID. The proposed solution augments parallel transmissions, which reduces the latency. The time latency of the aggregation schedule generated by the proposed algorithm is also minimized. The latency upper-bound of the schedule is 17R+6Δ+8 time-slots, where R is the network radius and Δ is the maximum node degree. This clearly outperforms the state-of-the-art distributed data aggregation algorithms, whose latency upper-bound is not less than 48R+6Δ+16 time-slots. The proposed protocol is analyzed through a comparative simulation study, where the obtained results confirm the improvement over the existing solutions.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Yu, B., Li, J., Li, Y.: Distributed data aggregation scheduling in wireless sensor networks. In: INFOCOM, pp. 2159–2167 (2009)
Solis, I., Obraczka, K.: The impact of timing in data aggregation for sensor networks communications. In: IEEE International Conference on Communications, vol. 6, pp. 3640–3645 (June 2004)
Li, H., Yu, H., Yang, B., Liu, A.: Timing control for delay-constrained data aggregation in wireless sensor networks: Research articles. Int. J. Commun. Syst. 20(7), 875–887 (2007)
Quan, S.G., Kim, Y.Y.: Fast data aggregation algorithm for minimum delay in clustered ubiquitous sensor networks. In: Proceedings of the 2008 International Conference on Convergence and Hybrid Information Technology, ICHIT 2008, pp. 327–333. IEEE Computer Society, Washington, DC (2008)
Upadhyayula, S., Gupta, S.K.S.: Spanning tree based algorithms for low latency and energy efficient data aggregation enhanced convergecast (dac) in wireless sensor networks. Ad Hoc Netw. 5(5), 626–648 (2007)
Galluccio, L., Palazzo, S.: End-to-end delay and network lifetime analysis in a wireless sensor network performing data aggregation. In: Proceedings of the 28th IEEE Conference on Global Telecommunications, GLOBECOM 2009, pp. 146–151. IEEE Press, Piscataway (2009)
Chen, X., Hu, X., Zhu, J.: Minimum Data Aggregation Time Problem in Wireless Sensor Networks. In: Jia, X., Wu, J., He, Y. (eds.) MSN 2005. LNCS, vol. 3794, pp. 133–142. Springer, Heidelberg (2005)
Huang, S.C.-H., Wan, P.-J., Vu, C.T., Li, Y., Yao, F.F.: Nearly constant approximation for data aggregation scheduling in wireless sensor networks. In: INFOCOM, pp. 366–372 (2007)
Zhu, J., Hu, X.: Improved algorithm for minimum data aggregation time problem in wireless sensor networks. Journal of Systems Science and Complexity 21(14), 626–636 (2008)
Xu, X., Wang, S., Mao, X., Tang, S., Li, X.Y.: An improved approximation algorithm for data aggregation in multi-hop wireless sensor networks. In: Proceedings of the 2nd ACM International Workshop on Foundations of Wireless Ad Hoc and Sensor Networking and Computing, FOWANC 2009, pp. 47–56. ACM (2009)
Wan, P.-J., Alzoubi, K.M., Frieder, O.: Distributed construction of connected dominating set in wireless ad hoc networks. MONET 9(2), 141–149 (2004)
Wan, P.-J., Yi, C.-W., Jia, X., Kim, D.: Approximation algorithms for conflict-free channel assignment in wireless ad hoc networks: Research articles. Wirel. Commun. Mob. Comput. 6(2), 201–211 (2006)
Lutz, M.: Python Pocket Reference, 4th edn. O’Reilly Media (2009)
Rossum, G.V., Drake, F.L.: The python language reference, vol. 24(10), p. 47881 (October 2010)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Boulkaboul, S., Djenouri, D., Badache, N. (2012). FDAP: Fast Data Aggregation Protocol in Wireless Sensor Networks. In: Andreev, S., Balandin, S., Koucheryavy, Y. (eds) Internet of Things, Smart Spaces, and Next Generation Networking. ruSMART NEW2AN 2012 2012. Lecture Notes in Computer Science, vol 7469. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-32686-8_38
Download citation
DOI: https://doi.org/10.1007/978-3-642-32686-8_38
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-32685-1
Online ISBN: 978-3-642-32686-8
eBook Packages: Computer ScienceComputer Science (R0)