Delay-tolerant delivery of quality information in ad hoc networks

DOI10.1016/J.JPDC.2010.11.007zbMath1219.68033OpenAlexW1995550296MaRDI QIDQ635374

Stathes Hadjiefthymiades, Christos-Nikolaos 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

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

Related Items (1)

Optimal, quality-aware scheduling of data consumption in mobile ad hoc networks

Cites Work

• Unnamed Item
• The finite-memory secretary problem
• Optimal stopping problem with finite-period reservation
• Optimal stopping problem with recall cost
• Improved Algorithms and Analysis for Secretary Problems and Generalizations
• Optimal Algorithms for the Online Time Series Search Problem
• The Secretary Problem and Its Extensions: A Review
• Optimal Sequential Selection From a Known Distribution With Holding Costs
• An optimal parking problem
• Optimal search and one-way trading online algorithms

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