Authors : M. V. Sarode and S. K. Korde
Page Nos : 84-88
Description :
The updating of location in a MANET, in this the information of locations needs to be maintain by each nodes, neighboring region updates its location frequently which is nothing called as neighborhood update(NU). In a network certain distributed location server Updates its location information, this is called location server update (LSU). In Location Update the operation costs and the performance losses of the target application due to location application costs which imposes question for nodes to decide the optimal strategy to update the location information, where the optimality is used for minimizing the costs. The location update decision problem is modeled as a Markov Decision Process (MDP). The monotonicity belongings of optimal NU and LSU operations with respect to location application cost under a general cost setting. Distinguishable cost structure shows the location update decisions of NU and LSU. This can be individually carried out without loss of optimality that is a separation property. From the separation property of the problem structure and the monotonicity properties of optimal actions which finds that 1) there always exists a simple optimal update rule for LSU operations 2) for NU operations. If no prior information of the MDP model is available, then also it introduces a model-free learning approach to find a near-optimal solution for the problem.
Keywords- Java markov decision process, Least square policy iteration, Location server update, Location update, Mobile ad hoc network, Markov decision process, Neighborhood update.
