Data aggregation and routing in wireless sensor networks: Optimal and heuristic algorithms
From MaRDI portal
(Redirected from Publication:1017477)
Recommendations
- Efficient algorithms for maximum lifetime data gathering and aggregation in wireless sensor networks.
- Understanding optimal data gathering in the energy and latency domains of a wireless sensor network
- An energy efficient clustering scheme for data aggregation in wireless sensor networks
- A distributed energy-efficient data gathering and aggregation protocol for wireless sensor networks
- Contribution to the optimization of data aggregation scheduling in wireless sensor networks
Cited in
(9)- Modeling and optimization of energy efficient routing in wireless sensor networks
- Clustering protocols in wireless sensor network: a survey, classification, issues, and future directions
- Nature-inspired algorithms for wireless sensor networks: a comprehensive survey
- Energy-efficient node scheduling algorithms for wireless sensor networks using Markov random field model
- An efficient heuristic for selecting active nodes in wireless sensor networks
- A column generation based heuristic for sensor placement, activity scheduling and data routing in wireless sensor networks
- Understanding optimal data gathering in the energy and latency domains of a wireless sensor network
- Accurate data aggregation created by neural network and data classification processed through machine learning in wireless sensor networks
- Efficient algorithms for maximum lifetime data gathering and aggregation in wireless sensor networks.
This page was built for publication: Data aggregation and routing in wireless sensor networks: Optimal and heuristic algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1017477)