an optimal location update and searching algorithm for tracking mobile agent
Mobility management is necessary especially in case of highly dynamic and large scale of mobile agents working together. The lack of efficient location update schemes of mobile agent system made us propose a basic $dU-SSM$ scheme for tracking mobile agent. With it, a mobile agent Updates it location once every $d$ movements and is then searched by Sequential Searching Method. In this paper, we analyze the agent's mobility features and formulate its cost functions based on a single agent's itinerary. We solve the optimal $d$ functions by minimizing the total cost of location updating and searching. By applying the proposed algorithm we obtain very good numerical results. The algorithm is very simple, straightforward and flexible. A sample Aglets code of embedding the algorithm is given. Further on, some improvements on the basic model are discussed.
mobility management sequential searching mobile agent location update