Efficient network QoS provisioning based on per node traffic shaping
IEEE/ACM Transactions on Networking (TON)
Exact admission control for networks with a bounded delay service
IEEE/ACM Transactions on Networking (TON)
Directed diffusion for wireless sensor networking
IEEE/ACM Transactions on Networking (TON)
Efficient Admission Control for EDF Schedulers
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
TAG: a Tiny AGgregation service for ad-hoc sensor networks
ACM SIGOPS Operating Systems Review - OSDI '02: Proceedings of the 5th symposium on Operating systems design and implementation
End-to-end delay service in high-speed packet networks using earliest deadline first scheduling
End-to-end delay service in high-speed packet networks using earliest deadline first scheduling
Synopsis diffusion for robust aggregation in sensor networks
SenSys '04 Proceedings of the 2nd international conference on Embedded networked sensor systems
Tributaries and deltas: efficient and robust aggregation in sensor network streams
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
DAG Based In-Network Aggregation for Sensor Network Monitoring
SAINT '06 Proceedings of the International Symposium on Applications on Internet
Heuristic algorithms for real-time data aggregation in wireless sensor networks
Proceedings of the 2006 international conference on Wireless communications and mobile computing
IEEE Transactions on Parallel and Distributed Systems
A new In-network data aggregation technology of wireless sensor networks
SKG '06 Proceedings of the Second International Conference on Semantics, Knowledge, and Grid
Efficient aggregation of delay-constrained data in wireless sensor networks
AICCSA '05 Proceedings of the ACS/IEEE 2005 International Conference on Computer Systems and Applications
An Adaptive Schedule Medium Access Control for Wireless Sensor Networks
ICN '07 Proceedings of the Sixth International Conference on Networking
Energy efficient routing and scheduling for real-time data aggregation in WSNs
Computer Communications
Enhancing throughput over wireless LANs using channel state dependent packet scheduling
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 3
Minimum data aggregation time problem in wireless sensor networks
MSN'05 Proceedings of the First international conference on Mobile Ad-hoc and Sensor Networks
In-network aggregation techniques for wireless sensor networks: a survey
IEEE Wireless Communications
A calculus for network delay. I. Network elements in isolation
IEEE Transactions on Information Theory
Quality of service guarantees in virtual circuit switched networks
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.00 |
Data aggregation in wireless sensor networks (WSNs) is known as a method of energy saving through reducing the number of communications. Due to the failure-prone nature of communications in WSNs caused by harsh environments, fault-tolerant aggregation methods are employed to address the problem of packet loss in such networks. On the other hand, many applications are time constrained in which data needs to be gathered in a timely fashion. Although real-time communication has been considered in tree-based WSNs, to the best of the authors' knowledge, we are unaware of any work on real-time data aggregation in a fault-tolerant fashion. In this paper, we propose a real-time fault-tolerant data aggregation method for WSNs. Moreover, we investigate the problem of temporal distance which usually causes aggregation of unrelated samples in WSNs by proposing a traffic shaping scheme to solve this problem. We also propose a statistical real-time packet scheduling method, called Adaptive Rate Controlled-EDF (ARC-EDF), to better utilize the inherent delay budget of aggregation. Simulation results show that ARC-EDF performs well in solving the temporal distance problem, meeting deadlines of packets, and improving aggregation efficiency, even at high error rates.