Abstract
This article focuses on data aggregation scheduling problem with delay constraint in wireless sensor networks. Prior works on this problem have dealt with a tree topology wireless sensor network. H...
Highlights
In many wireless sensor network (WSN) applications, such as environmental monitoring, spatial exploration, and battlefield surveillance, sensed data are aggregated and transmitted to the sinks for analysis.[1]
We address the issue of scheduling data aggregation based on a more generic network model, in which the communication topology is graph
We propose a dynamic programming scheduling algorithm Dynamic Programme for DCDA Problem, which includes creating shortest path tree (SPT), dynamic programming on the aggregation tree, and removing transmissions with tree-outside collisions
Summary
In many wireless sensor network (WSN) applications, such as environmental monitoring, spatial exploration, and battlefield surveillance, sensed data are aggregated and transmitted to the sinks for analysis.[1]. Data aggregation with deadline constraint (DCDA) problem is a more valuable problem for real-time applications. This article studies delay-constrained data aggregation scheduling problem in WSNs, which is to schedule the transmission time to maximize the aggregated information collected by the sink node until the deadline. The research about DCDA problem had considered tree topology WSNs.[3,4,5,6,7] In the tree topology WSNs, data routing is determined, and wireless interference only exists between brother nodes. Data aggregation scheduling algorithm in the graph topology WSNs schedules the time slots that sensor nodes send the data without conflicts and simultaneously decides the aggregation routing tree structure. In section ‘‘Conclusion,’’ conclusions are given and some future research directions are outlined
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have