Towards autonomous data ferry route design through reinforcement learning

2008 IEEE International Symposium on A World of Wireless, Mobile and Multimedia Networks, WoWMoM2008

Volumn , Issue , 2008, Pages

  Henkel, Daniel ^a   Brown, Timothy X ^a  

^a UNIVERSITY OF COLORADO   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMMUNICATION CHANNELS (INFORMATION THEORY); EDUCATION; LEARNING ALGORITHMS; LEARNING SYSTEMS; PROCESS ENGINEERING; REINFORCEMENT; REINFORCEMENT LEARNING; TECHNICAL PRESENTATIONS; TRAVELING SALESMAN PROBLEM;

AVERAGE PACKET DELAYS; DELAY-TOLERANT NETWORKS; FERRY ROUTE DESIGN; INTERNATIONAL SYMPOSIUM; LOWER AVERAGE; MACHINE-LEARNING; MARKOV DECISION PROCESS; MULTIMEDIA NETWORKS; NETWORK NODES; OPTIMAL DECISIONS; PATH PLANNING; PATH-PLANNING ALGORITHMS; SIMULATION EXPERIMENTS; STOCHASTIC MODELLING; TRANSPORT DATA; TRAVELING SALESMAN;

WIRELESS NETWORKS;

EID: 52049095095     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/WOWMOM.2008.4594888     Document Type: Conference Paper

References (14)

1. D. Bertsekas and J. Tsitsiklis. Neuro-Dynamic Programming. Athena Scientific, Belmont, MA, 1996.
2. T. X. Brown, S. Doshi, S. Jadhav, D. Henkel, and R.-G. Thekkekunnel. A full scale wireless ad hoc network test bed. In Proc. of ISART'05, NTIA Special Publications SP05-418, pages 51-60, Mar 2005.
3. K. Fall. A delay tolerant network architecture for challenged networks. In Proceedings of ACM SIGCOMM, pages 27-31. ACM, 2003.
4. M. Kearns and S. Singh. Near-optimal reinforcement learning in polynomial time. Machine Learning Journal, 49(2), 2002.
5. A. Y. Ng and M. Jordan. PEGASUS: A policy search method for large MDPs and POMDPs. In Proc. 16th Conference on Uncertainty in Artificial Intelligence, pages 406-415, 2000.
6. S. M. Ross. Introduction to stochastic dynamic programming. New York : Academic Press, 1983.
7. K. Sanzgiri and E. M. Belding-Royer. Leveraging mobility to improve quality of service in mobile networks. In Proc. of MOBIQUITOUS'04, pages 128-137, August 22-26 2004.
8. R. C. Shah, S. Roy, S. Jain, and W. Brunette. Data MULEs: Modelling and analysis of a three-tier architecture for sparse sensor networks. Elsevier Ad Hoc Networks Journal, (1):215-233, Sept. 2003.
9. A. A. Somasundara, A. Ramamoorthy, and M. B. Srivastava. Mobile element scheduling with dynamic deadlines. IEEE Transactions on Mobile Computing, 6(4):395-410, 2007.
10. R. S. Sutton and A. G. Barto. Reinforcement Learning: An Introduction. MIT Press, March 1, 1998.
11. A. Vahdat and D. Becker. Epidemic routing for partially-connected ad hoc networks. Technical report, Duke University, 2000.
12. R. Viswanathan, J. T. Li, and M. C. Chuah. Message ferrying for constrained scenarios. In Proc. of IEEE WoWMoM, pages 487-489, Taormina, Italy, 13-16 June 2005.
13. Z. Zhang and Z. Fei. Route design for multiple ferries in delay tolerant networks. In Proc. of IEEE Wireless Communications and Networking Conference, WCNC'2007., pages 3460-3465, 11-15 March, 2007.
14. W. Zhao, M. Ammar, and E. Zegura. A message ferrying approach for data delivery in sparse mobile ad hoc networks. In Proc. of MobiHoc'04, May 24-26 2004.