Miloud Bagaa
Distributed low-latency data aggregation scheduling in wireless sensor networks
Bagaa, Miloud; Younis, Mohamed; Djenouri, Djamel; Derhab, Abdelouahid; Badache, Nadjib
Authors
Mohamed Younis
Dr Djamel Djenouri Djamel.Djenouri@uwe.ac.uk
Associate Professor in Computer Science
Abdelouahid Derhab
Nadjib Badache
Abstract
This article considers the data aggregation scheduling problem, where a collision-free schedule is determined in a distributed way to route the aggregated data from all the sensor nodes to the base station within the least time duration. The algorithm proposed in this article (Distributed algorithm for Integrated tree Construction and data Aggregation (DICA)) intertwines the tree formation and node scheduling to reduce the time latency. Furthermore, while forming the aggregation tree, DICA maximizes the available choices for parent selection at every node, where a parent may have the same, lower, or higher hop count to the base station. The correctness of the DICA is formally proven, and upper bounds for time and communication overhead are derived. Its performance is evaluated through simulation and compared with six delay-aware aggregation algorithms. The results show that DICA outperforms competing schemes. The article also presents a general hardware-in-the-loop framework (DAF) for validating data aggregation schemes on Wireless Sensor Networks (WSNs). The framework factors in practical issues such as clock synchronization and the sensor node hardware. DICA is implemented and validated using this framework on a test bed of sensor motes that runs TinyOS 2.x, and it is compared with a distributed protocol (DAS) that is also implemented using the proposed framework.
Journal Article Type | Article |
---|---|
Acceptance Date | Mar 1, 2015 |
Online Publication Date | Apr 1, 2015 |
Publication Date | May 1, 2015 |
Deposit Date | Jan 21, 2020 |
Journal | ACM Transactions on Sensor Networks |
Print ISSN | 1550-4859 |
Electronic ISSN | 1550-4867 |
Publisher | Association for Computing Machinery (ACM) |
Peer Reviewed | Peer Reviewed |
Volume | 11 |
Issue | 3 |
Article Number | 49 |
DOI | https://doi.org/10.1145/2744198 |
Public URL | https://uwe-repository.worktribe.com/output/5193057 |
Publisher URL | https://doi.org/10.1145/2744198 |
You might also like
A gradual solution to detect selfish nodes in mobile ad hoc networks
(2010)
Journal Article
Towards immunizing MANET's source routing protocols against packet droppers
(2009)
Journal Article
On eliminating packet droppers in MANET: A modular solution
(2008)
Journal Article
Struggling against selfishness and black hole attacks in MANETs
(2007)
Journal Article
Efficient on-demand multi-node charging techniques for wireless sensor networks
(2016)
Journal Article
Downloadable Citations
About UWE Bristol Research Repository
Administrator e-mail: repository@uwe.ac.uk
This application uses the following open-source libraries:
SheetJS Community Edition
Apache License Version 2.0 (http://www.apache.org/licenses/)
PDF.js
Apache License Version 2.0 (http://www.apache.org/licenses/)
Font Awesome
SIL OFL 1.1 (http://scripts.sil.org/OFL)
MIT License (http://opensource.org/licenses/mit-license.html)
CC BY 3.0 ( http://creativecommons.org/licenses/by/3.0/)
Powered by Worktribe © 2024
Advanced Search