Real-time data gathering in sensor networks
DOI10.1016/J.DAM.2009.11.001zbMATH Open1185.90030OpenAlexW2130626076MaRDI QIDQ968174FDOQ968174
Liron Yedidsion, Michael Segal, Yoram Revah
Publication date: 5 May 2010
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2009.11.001
Recommendations
Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Communication networks in operations research (90B18)
Cites Work
Cited In (7)
- Collision-free path coloring with application to minimum-delay gathering in sensor networks
- Optimally Fast Data Gathering in Sensor Networks
- A comparison of priority rules for minimizing the maximum lateness in tree data gathering networks
- Data gathering and personalized broadcasting in radio grids with interference
- Real-time data gathering in sensor networks
- Information gathering in ad-hoc radio networks with tree topology
- Gathering with Minimum Delay in Tree Sensor Networks
This page was built for publication: Real-time data gathering in sensor networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q968174)