Delay-tolerant delivery of quality information in ad hoc networks

Journal of Parallel and Distributed Computing

Volumn 71, Issue 7, 2011, Pages 974-987

  Anagnostopoulos, Christos ^a   Hadjiefthymiades, Stathes ^a  

^a UNIVERSITY OF ATHENS   (Greece)

Author keywords

Delay tolerant information delivery; Discounted secretary problem; Optimal online search algorithm; Optimal stopping theory

Indexed keywords

DELAY TOLERANT; DELAY-TOLERANT APPLICATIONS; GENERATION TIME; INFORMATION DELIVERY; INFORMATION SOURCES; ONLINE SEARCH; OPTIMAL ONLINE SEARCH ALGORITHM; OPTIMAL STOPPING; QUALITY INDICATORS; QUALITY INFORMATION; RECEIVING NODES; SCHEDULING INFORMATION; SECRETARY PROBLEM;

AD HOC NETWORKS; LEARNING ALGORITHMS; MIDDLEWARE; ONLINE SEARCHING; OPTIMIZATION; WIRELESS SENSOR NETWORKS;

INFORMATION DISSEMINATION;

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

References (34)

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. M. Akdere, C. Cagatay, O. Gerdaneri, I. Korpeoglu, O. Ulusoy, and U. Cetintemel A comparison of epidemic algorithms in wireless sensor networks Elsevier Computer Communications 29 13 2006 2450 2557
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 2009
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 NetworksIEEE Int. Conference on Mobile Ad-Hoc and Sensor Systems, 2007, pp. 17.
5. M. Babaioff, M. Dinitz, A. Gupta, N. Immorlica, K. Talwar, Secretary problems: weights and discounts, in: Proc. of the 20th Annual ACMSIAM Symposium on Discrete Algorithms, pp. 12451254.
6. M. Caleffi, and L. Paura Opportunistic routing for disruption tolerant networks Proc. of Intl. Conf. on Advanced Information Networking and Applications Workshops 2009 IEEE WAINA 826 831
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 6 7 2008 1098 1116
9. J. Crowcroft, E. Yoneki, P. Hui, and T. Henderson Promoting tolerance for delay tolerant network research ACM SIGCOMM Computer Communication Review 38 5 2008 63 68
10. R. El-Yaniv, A. Fiat, R.M. Karp, and G. Turpin Optimal search and one-way trading online algorithms Algorithmica 30 1 2001 101 139 (Pubitemid 33711213)
11. P. Eugster, R. Guerraoui, Anne-Marie Kermarrec, and L. Massoulie Epidemic information dissemination in distributed systems IEEE Computer 37 5 2004 60 67
12. P. Eugster, R. Guerraoui, A. Kermarrec, and L. Massoulie From epidemics to distributed computing IEEE Computer 37 5 2004 60 67
13. 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
14. P.R. Freeman The secretary problem and its extensions: a review International Statistical Review, Revue Internationale de Statistique 51 1983 189 206
15. J. Gilbert, and F. Mosteller Recognizing the maximum of a sequence Journal of the American Statistical Association 61 1966 35 73
16. R. Gray, D. Kotz, C. Newport, N. Dubrovsky, A. Fiske, J. Liu, C. Masone, S. McGrath, Y. Yuan, CRAWDADdata set dartmouthoutdoor (v. 2006-11-06), Downloaded from: http://crawdad.cs.dartmouth.edu/dartmouth/outdoor, November 2006.
17. S. Huang, X. Liu, Z. Ding, Opportunistic spectrum access in cognitive radio networks, in: Proc. of the IEEE INFOCOM 2008, 2008, pp. 14271435.
18. P. Juang, H. Oki, Y. Wang, Energy-efficient computing for wildlife tracking: design tradeoffs and early experiences with ZebraNet, in: Proc. of the 10th International Conference on Architectural Support for Programming Languages and Operating Systems, ASPLOS-X, October 2002.
19. B.K. Kang Optimal stopping problem with recall cost European Journal of Operational Research 117 1999 222 238
20. 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. 105114.
21. C. Liu, J. Wu, I. Cardei, Message forwarding in cyclic MobiSpace: the multi-copy case, in: Proc. of the IEEE International Conference on Mobile Ad-Hoc and Sensor Systems, MASS, 2009, pp. 413422.
22. C. Perkins, Ad Hoc on-demand distance vector (AODV) routing, RFC3561, IETF MANET Working Group, July 2003.
23. 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. 16.
24. R. Ramanathan, R. Hansen, P. Basu, R. Rosales-Hain, R. Krishnan, Prioritized epidemic routing for opportunistic networks, in: Proc. of the ACM 1st Intl. MobiSys. Workshop on Mobile Opportunistic Networking, MobiOpp '07.
25. Willis T. Rasmussen, and Stanley R. Pliska Choosing the maximum from a sequence with a discount function Applied Mathematics and Optimization 2 3 19751976 279 289
26. S.M. Ross Introduction to Stochastic Dynamic Programming: Probability and Mathematical 1983 Academic Press, Inc.
27. E. Royer, and C. Toh A review of current routing protocol for ad hoc mobile wireless networks IEEE Personal Communications Magazine 6 1999 46 55 (Pubitemid 129305711)
28. H. Rubin, and S. Samuels The finite memory secretary problem The Annals of Probability 5 4 1977 627 635
29. T. Saito Optimal stopping problem with finite-period reservation European Journal of Operational Research 118 3 1999 605 619
30. Strategic Technology Office (STO): disruption tolerant networking program. http://www.darpa.mil/sto/programs/dtn/index.html.
31. M. Tamaki An optimal parking problem Journal of Applied Probability 19 1982 803 814
32. A. Vahdat, D. Becker, Epidemic routing for partially connected ad hoc networks, TR. April 2000.
33. Y. Xu, W. Zhang, and F. Zheng Optimal algorithms for the online time series search problem Proc. of the 3rd International Conference on Combinatorial Optimization and Applications LNCS vol. 5573 2009 322 333
34. 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. 110.