This Article 
 Bibliographic References 
 Add to: 
Tracking Mobile Units for Dependable Message Delivery
May 2002 (vol. 28 no. 5)
pp. 433-448

As computing components get smaller and people become accustomed to having computational power at their disposal at any time, mobile computing is developing as an important research area. One of the fundamental problems in mobility is maintaining connectivity through message passing as the user moves through the network. An approach to this is to have a single home node constantly track the current location of the mobile unit and forward messages to this location. One problem with this approach is that, during the update to the home agent after movement, messages are often dropped, especially in the case of frequent movement. In this paper, we present a new algorithm which uses a home agent, but maintains information regarding a subnet within which the mobile unit must be present. We also present a reliable message delivery algorithm which is superimposed on the region maintenance algorithm. Our strategy is based on ideas from diffusing computations as first proposed by Dijkstra and Scholten. Finally, we present a second algorithm which limits the size of the subnet by keeping only a path from the home node to the mobile unit.

[1] C.E. Perkins, “IP Mobility Support,” Technical Report RFC 2002, IETF Network Working Group, Oct. 1996.
[2] A. Myles and D. Skellern, “Comparing Four IP Based Mobile Host Protocols,” Computer Networks and ISDN Systems, vol. 26, no. 3, pp. 349-355, 1993.
[3] M. Steenstrup, Routing in Comm. Networks. Prentice Hall, 1995.
[4] A. Fuggetta, G. Picco, and G. Vigna, "Understanding Code Mobility," IEEE Trans. Software Eng., May 1998, pp. 352-361.
[5] E.W. Dijkstra and C. Scholten, “Termination Detection for Diffusing Computations,” Information Processing Letters, vol. 11, no. 1, 1980.
[6] A.L. Murphy and G.P. Picco, "Reliable Communication for Highly Mobile Agents," Proc. 1st Int'l Symp. Agent Systems and Applications and 3rd Int'l Symp. Mobile Agents (ASA/MA 99), IEEE CS Press, Los Alamitos, Calif., 1999, pp. 141-150.
[7] M. Ahuja, “Flush Primitives for Asynchronous Distributed Systems,” Information Processing Letters, vol. 34, no. 1, pp. 5-12, Feb. 1990.
[8] A.L. Murphy, G.-C. Roman, and G. Varghese, “Algorithms for Message Delivery in a Micromobility Environment,” Technical Report WUCS98-02, Washington, Univ. St. Louis, Mo., Feb. 1998.
[9] Y. Rekhter and T. Li, “A Border Gateway Protocol 4 (BGP-4),” RFC 1771, Mar. 1995.
[10] B. Sanders, B. Massingill, and S. Kryukova, “Derivation of an Algorithm for Location Management for Mobile Communication Devices,” Parallel Processing Letters, vol. 8, no. 4, pp. 473-488, Dec. 1998.
[11] A. Archarys and B.R. Badrinath, “A Framework for Delivering Multicast Messages in Networks with Mobile Hosts,” ACM/Baltzer J. Mobile Networks and Applications, vol. 1, no. 2, pp. 199-219, 1996.
[12] A.L. Murphy, G.-C. Roman, and G. Varghese, “Tracking Mobile Units for Dependable Message Delivery,” Technical Report WUCS 99-30, Washington Univ., St. Louis, Mo., Aug. 2001.

Index Terms:
mobile computing, message delivery, diffusing computations
A.L. Murphy, G.-C. Roman, G. Varghese, "Tracking Mobile Units for Dependable Message Delivery," IEEE Transactions on Software Engineering, vol. 28, no. 5, pp. 433-448, May 2002, doi:10.1109/TSE.2002.1000448
Usage of this product signifies your acceptance of the Terms of Use.