Ting He
ABSTRACT
We consider the problem of disseminating data from a base station to a sparse, partitioned mobile network by controllable data ferries with limited ferry-node and ferry-ferry communication ranges. Existing solutions to data ferry control mostly assume the nodes to be stationary, which reduces the problem to designing fixed ferry routes. In the more challenging scenario of mobile networks, existing solutions have focused on single-ferry control and left out an important issue of ferry cooperation in the presence of multiple ferries. In this paper, we jointly address the issues of ferry navigation and cooperation using the approach of stochastic control. Under the assumption that ferries can communicate within each partition, we propose a hierarchical control system called Dispatch-and-Search (DAS), consisting of a global controller that dispatches ferries to individual partitions and local controllers that coordinate the search for nodes within each partition. Formulating the global and the local control as Partially Observable Markov Decision Processes (POMDPs), we develop efficient control policies to optimize the (discounted) total throughput, which significantly improve the performance of their predetermined counterparts in cases of limited prior knowledge.
- G. D. Celik and E. Modiano. Dynamic vehicle routing for data gathering in wireless networks. In IEEE CDC, December 2010.Google Scholar
Cross Ref
- T. He, K.-W. Lee, and A. Swami. Flying in the dark: Controlling autonomous data ferries with partial observations. In ACM MobiHoc, 2010. Google ScholarDigital Library
- D. Henkel and T. Brown. On controlled node mobility in delay-tolerant networks of unmannned aerial vehicles. In ISART, 2006.Google Scholar
- D. Henkel and T. Brown. Towards autonomous data ferry route design through reinforcement learning. In IEEE/ACM WoWMoM, 2008. Google ScholarDigital Library
- D. Jea, A. Somasundara, and M. Srivastava. Multiple controlled mobile elements (data mules) for data collection in sensor networks. In DCOSS'05. Google ScholarDigital Library
- V. Kavitha and E. Altman. Analysis and design of message ferry routes in sensor networks using polling models. In IEEE WiOpt, May 2010.Google Scholar
- C. Papadimitriou and J. Tsitsiklis. The complexity of markov decision processes. Math, of Operation Research, 1987. Google ScholarDigital Library
- E. Sondik. The optimal control of partially observable markov processes over the infinite horizon: Discounted costs. OR, 1978.Google Scholar
- M. Tariq, M. Ammar, and E. Zegura. Message ferry route design for sparse ad hoc networks with mobile nodes. In ACM MobiHoc, 2006. Google ScholarDigital Library
- B. Walker, T. Clancy, and J. Glenn. Using localized random walks to model delay-tolerant networks. In IEEE MILCOM, 2008.Google ScholarCross Ref
- J. Wu, S. Yang, and F. Dai. Logarithmic store-carry-forward routing in mobile ad hoc networks. IEEE Trans. PDS, 2007. Google ScholarDigital Library
- Z. Zhang and Z. Fei. Route design for multiple ferries in delay tolerant networks. In IEEE WCNC, 2007.Google ScholarDigital Library
- W. Zhao, M. Ammar, and E. Zegura. Controlling the mobility of multiple data transport ferries in a delay-tolerant network. In IEEE INFOCOM'05.Google Scholar
- W. Zhao, M. Ammar, and E. Zegura. A message ferrying approach for data delivery in sparse mobile ad hoc networks. In ACM MobiHoc, 2004. Google ScholarDigital Library
Index Terms
- Dispatch-and-search: dynamic multi-ferry control in partitioned mobile networks
Recommendations
Flying in the dark: controlling autonomous data ferries with partial observations
MobiHoc '10: Proceedings of the eleventh ACM international symposium on Mobile ad hoc networking and computingWe seek to support communications in highly-partitioned mobile wireless networks via controllable data ferries. While existing ferry control techniques assume either stationary nodes or complete ferry observation of node locations, we address the more ...
Planning and acting in partially observable stochastic domains
In this paper, we bring techniques from operations research to bear on the problem of choosing optimal actions in partially observable stochastic domains. We begin by introducing the theory of Markov decision processes (mdps) and partially observable ...
On Near Optimality of the Set of Finite-State Controllers for Average Cost POMDP
We consider the average cost problem for partially observable Markov decision processes (POMDP) with finite state, observation, and control spaces. We prove that there exists an ε-optimal finite-state controller (FSC) functionally independent of initial ...
Comments