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

Journal of Parallel and Distributed Computing

Volumn 72, Issue 10, 2012, Pages 1269-1279

  Anagnostopoulos, Christos ^a   Hadjiefthymiades, Stathes ^b  

^a IONIAN UNIVERSITY   (Greece)

^b UNIVERSITY OF ATHENS   (Greece)

Author keywords

Mobile ad hoc networks; Optimal stopping theory; Quality information delivery

Indexed keywords

CONTEXT AWARE APPLICATIONS; CONTEXTUAL INFORMATION; DYNAMIC NATURE; MOBILE NODES; OPTIMAL SCHEDULING; OPTIMAL STOPPING; QUALITY INFORMATION; QUALITY LEVELS; SCHEDULING INFORMATION;

OPTIMIZATION; SCHEDULING; TELECOMMUNICATION NETWORKS;

MOBILE AD HOC NETWORKS;

EID: 84865064778     PISSN: 07437315     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jpdc.2012.05.011     Document Type: Article

References (29)

1. M. Ajtai, N. Megiddo, and O. Waarts Improved algorithms and analysis for secretary problems and generalizations SIAM Journal on Discrete Mathematics 14 1995 1 27
2. C. Anagnostopoulos, and S. Hadjiefthymiades Delay-tolerant delivery of quality information in ad hoc networks Journal of Parallel and Distributed Computing 71 7 2011 974 987
3. C. Anagnostopoulos, and S. Hadjiefthymiades On the application of epidemical spreading in collaborative context aware computing ACM SIGMOBILE Mobile Computing and Communications Review 12 4 2008 43 55
4. C. Anagnostopoulos, O. Sekkas, S. Hadjiefthymiades, Context fusion: dealing with sensor reliability, in: IEEE Int. Workshop on Information Fusion and Dissemination in Wireless Sensor Networks - IEEE Int. Conference on Mobile Ad-hoc and Sensor Systems, 2007, pp. 1-7.
5. M. Babaioff, M. Dinitz, A. Gupta, N. Immorlica, K. Talwar, Secretary problems: weights and discounts, in: Proc. 20th ACM-SIAM SODA 2009, pp. 1245-1254.
6. D.P. Bertsekas, Dynamic Programming and Optimal Control, vol. I, third ed., ISBN: 1-886529-26-4, 2005.
7. D. Chakrabarti, Y. Wang, C. Wang, J. Leskovec, and C. Faloutsos Epidemic thresholds in real networks ACM Transactions on Information and System Security 10 4 2008 1 26
8. J. Chen, M. Gerla, Y.Z. Lee, and M.Y. Sanadidi TCP with delayed ack for wireless networks Ad Hoc Networks vol. 6 2008 Elsevier Science Publishers 1098 1116 no. 7 sep
9. P. Eugster, R. Guerraoui, Anne-Marie Kermarrec, and L. Massoulie Epidemic information dissemination in distributed systems IEEE Computer 37 5 2004 60 67
10. P. Eugster, R. Guerraoui, A. Kermarrec, and L. Massoulie From epidemics to distributed computing IEEE Computer 37 5 2004 60 67
11. E.Z. Ferenstein, and E.G. Enns Optimal sequential selection from a known distribution with holding costs Journal of the American Statistical Association 83 402 1988 382 386
12. T.S. Ferguson, Mathematics Department, UCLA, Optimal Stopping and Applications. [Online]. Available: http://www.math.ucla.edu/tom/Stopping/ Contents.html (accessed: 25.8.2010).
13. J.P. Gilbert, and F. Mosteller Recognizing the maximum of a sequence S.E. Fienberg, D.C. Hoaglin, Selected Papers of Frederick Mosteller Springer Series in Statistics 2006 Springer-Verglag 355 398
14. B.K. Kang Optimal stopping problem with recall cost European Journal of Operational Research 117 1999 222 238
15. C. Liu, J. Wu, An optimal probabilistic forwarding protocol in delay tolerant networks, in: Proc. of the 10th ACM International Symposium on Mobile Ad Hoc Networking and Computing, 2009, pp. 105-114.
16. L. Moser On a problem of Cayley Scripta Mathematica 22 1956 289 292
17. W. Navidi, and T. Camp Stationary distributions for the random waypoint mobility model IEEE Transactions on Mobile Computing 3 2004
18. G. Peskir, and A. Shiryaev Optimal Stopping and Free Boundary Problems, ETH Zuerich 2006 Birkhauser
19. M. Poulakis, S. Vassaki, S. Hadjiefthymiades, Proactive radio resource management using optimal stopping theory, in: Proc. of the IEEE Intl. Symposium on World of Wireless, Mobile and Multimedia Networks & Workshops, 2009, pp. 1-6.
20. P.E. Protter Stochastic Integration and Differential Equations second ed. 2003 Springer
21. Willis T. Rasmussen, and Stanley R. Pliska Choosing the maximum from a sequence with a discount function Applied Mathematics and Optimization 2 3 1975/76 279 289
22. S.M. Ross Introduction to Stochastic Dynamic Programming: Probability and Mathematical 1983 Academic Press, Inc.
23. H. Rubin, and S. Samuels The finite memory secretary problem The Annals of Probability 5 4 1977 627 635
24. T. Saito Optimal stopping problem with finite-period reservation European Journal of Operational Research 118 3 1999 605 619
25. M. Sakaguchi Dynamic programming of some sequential sampling design Journal of Mathematical Analysis and Applications 2 3 1961 446 466
26. A. Shiryaev Optimal Stopping Rules 1978 Springer-Verlag New York
27. M. Tamaki An optimal parking problem Journal of Applied Probability 19 1982 803 814
28. S. Zahedi, C. Bisdikian, A framework for QoI-inspired analysis for sensor network deployment planning, in: Proc. 3rd ICST WICON 2007, Article 28.
29. D. Zheng, W. Ge, J. Zhang, Distributed opportunistic scheduling for ad-hoc communications: an optimal stopping approach, in: Proc. of the 8th ACM Intl. Symposium on Mobile Ad Hoc Networking and Computing, 2007, pp. 1-10.