Delay-tolerant delivery of quality information in ad hoc networks

DOI10.1016/J.JPDC.2010.11.007MaRDI QIDQ635374zbMATH OpenOpenAlexFDO

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

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)

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

Cites work

• scientific article; zbMATH DE number 3906232 (Why is no real title available?)
• An optimal parking problem
• Improved algorithms and analysis for secretary problems and generalizations
• Optimal Algorithms for the Online Time Series Search Problem
• Optimal Sequential Selection From a Known Distribution With Holding Costs
• Optimal search and one-way trading online algorithms
• Optimal stopping problem with finite-period reservation
• Optimal stopping problem with recall cost
• The Secretary Problem and Its Extensions: A Review
• The finite-memory secretary 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)