Optimal Location Updates in Mobile Ad Hoc Networks: A Separable Cost Case
Zhenzhen Ye
Abouzeid, A.A.
Dept. of Electr., Rensselaer Polytech. Inst., Troy, NY;
This paper appears in: Global Telecommunications Conference, 2008. IEEE GLOBECOM 2008. IEEE
Publication Date: Nov. 30 2008-Dec. 4 2008
On page(s): 1-6
Location: New Orleans, LO,
ISSN: 1930-529X
ISBN: 978-1-4244-2324-8
INSPEC Accession Number: 10413367
Digital Object Identifier: 10.1109/GLOCOM.2008.ECP.86
Current Version Published: 2008-12-08
Abstract
We consider the location service in a mobile ad-hoc network (MANET), where each node needs to maintain its location information in the network by (i) frequently updating its location information within its neighboring region, which is called neighborhood update (NU), and (ii) occasionally updating its location information to a certain (fixed) distributed location server in the network, which is called location server update (LU). A trade-off exists between the costs in location update operations, on one hand, and the additional incurred costs in (position-based) routing due to location errors, on the other hand. In this paper, we develop a stochastic sequential decision framework to analyze this trade-off and provide design guidelines on selecting good location update strategies in practice. Under a Markovian mobility model, the location update decision problem is modeled as a Markovian decision process (MDP). Based on the separable cost structure of the proposed MDP model, we first show that the location update decisions on NU and LU can be independently carried out without loss of optimality. Then we investigate the optimality of simple threshold-based updating rules in NU and LU operations. We finally introduce a model-free learning approach which is practically useful to find a near-optimal solution for the problem.
Index
Terms
Available to subscribers and IEEE members.
References
Available to subscribers and IEEE members.
Citing Documents
Available to subscribers and IEEE members.
Cart
