Algorithmic Aspects of Wireless Sensor Networks
From MaRDI portal
Publication:5312958
Recommendations
- Exact and approximate balanced data gathering in energy-constrained sensor networks
- Efficient algorithms for maximum lifetime data gathering and aggregation in wireless sensor networks.
- Optimally Fast Data Gathering in Sensor Networks
- Maximum lifetime data sensing and extraction in energy constrained networked sensor systems
- Algorithmic Aspects of Wireless Sensor Networks
Cited in
(14)- Collision-free path coloring with application to minimum-delay gathering in sensor networks
- Optimal path selection under different data
- Efficient algorithms for maximum lifetime data gathering and aggregation in wireless sensor networks.
- Data relaying with constraints in hierarchical sensor networks
- Algorithmic Aspects of Wireless Sensor Networks
- Integer Maximum Flow in Wireless Sensor Networks with Energy Constraint
- Optimal flow control for utility-lifetime tradeoff in wireless sensor networks
- Maximum lifetime data sensing and extraction in energy constrained networked sensor systems
- Optimization and distributed control for fair data gathering in wireless sensor networks
- Exact and approximate balanced data gathering in energy-constrained sensor networks
- Gathering with Minimum Delay in Tree Sensor Networks
- A framework for overall storage overflow problem to maximize the lifetime in WSNs
- From eager or lazy constrained data acquisition: A general framework
- A branch-and-bound algorithm for building optimal data gathering tree in wireless sensor networks
This page was built for publication: Algorithmic Aspects of Wireless Sensor Networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5312958)