A reinforcement learning based framework for prediction of near likely nodes in data-centric mobile wireless networks

  • Authors:

  • Yingying Chen;Hui Wang;Xiuyuan Zheng;Jie Yang

  • Affiliations:

  • Department of Electrical Engineering, Stevens Institute of Technology, Hoboken, NJ;Department of Computer Science, Stevens Institute of Technology, Hoboken, NJ;Department of Electrical Engineering, Stevens Institute of Technology, Hoboken, NJ;Department of Electrical Engineering, Stevens Institute of Technology, Hoboken, NJ

  • Venue:
  • EURASIP Journal on Wireless Communications and Networking
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

Data-centric storage provides energy-efficient data dissemination and organization for the increasing amount of wireless data. One of the approaches in data-centric storage is that the nodes that collected data will transfer their data to other neighboring nodes that store the similar type of data. However, when the nodes are mobile, type-based data distribution alone cannot provide robust data storage and retrieval, since the nodes that store similar types may move far away and cannot be easily reachable in the future. In order to minimize the communication overhead and achieve efficient data retrieval in mobile environments, we propose a reinforcement learning-based framework called PARIS, which utilizes past node trajectory information to predict the near likely nodes in the future as the best content distributee. Our framework can adaptively improve the prediction accuracy by using the reinforcement learning technique. Our experiments demonstrate that our approach can effectively and efficiently predict the future neighborhood.