Optimal Stochastic Location Updates Using Dream in Mobile Ad Hoc Networks

A cost effective location update using Dream is proposed. The algorithm evaluates the cost in terms of location updates. The cost of updating a location is computed in terms of hops used. Based on this, the number of copies as well as the number of hops the control messages travel are both optimized (minimized) without sacrificing quality. The well known algorithm is incorporated into MDP model where node’s neighboring region can follow different update frequencies and also the separation principle would not affected when the user subjective behavior also incorporated into MDP model. Therefore to minimize the overall costs, location update strategies need to be carefully designed.