Delay-tolerant delivery of quality information in ad hoc networks

DOI10.1016/J.JPDC.2010.11.007zbMATH Open1219.68033OpenAlexW1995550296MaRDI QIDQ635374FDOQ635374

Authors: Stathes Hadjiefthymiades, Christos Anagnostopoulos 

Publication date: 19 August 2011

Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jpdc.2010.11.007

Recommendations

• Optimal, quality-aware scheduling of data consumption in mobile ad hoc networks
• An information search algorithm based on stationary distribution in delay tolerant networks
• Optimal Delay–Throughput Tradeoffs in Mobile Ad Hoc Networks
• Minimum expected \(^*\)-cast time in DTNs
• Performance evaluations of data-centric information retrieval schemes for DTNs

zbMATH Keywords

optimal stopping theorydelay-tolerant information deliverydiscounted secretary problemoptimal online search algorithm

Mathematics Subject Classification ID

Online algorithms; streaming algorithms (68W27) Distributed systems (68M14)

Cites Work

• Title not available (Why is that?)
• The Secretary Problem and Its Extensions: A Review
• Optimal search and one-way trading online algorithms
• Improved algorithms and analysis for secretary problems and generalizations
• The finite-memory secretary problem
• Optimal stopping problem with finite-period reservation
• Optimal stopping problem with recall cost
• Optimal Sequential Selection From a Known Distribution With Holding Costs
• An optimal parking problem
• Optimal Algorithms for the Online Time Series Search Problem

Cited In (2)

• An information search algorithm based on stationary distribution in delay tolerant networks
• Optimal, quality-aware scheduling of data consumption in mobile ad hoc networks

This page was built for publication: Delay-tolerant delivery of quality information in ad hoc networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q635374)