This paper is available as
We have written a series of papers we are writing about mobile agents for routing on multi-hop, dynamic networks. This paper is published in volume 3 number 2 of the ACM SIGMOBILE publication Mobile Computing and Communications Review (MC2R). Their version is more nicely formatted.As portable digital devices of all kinds proliferate, wireless networks that allow for flexible, timely and efficient data communication become more and more important. Networks for mobile devices are quite difficult to design for several reasons, chief among them the problem of routing packets across networks characterized by constantly changing topology. In this article we describe ways to address the routing problem using a new technique for distributed programming, mobile software agents.
@Article{kramer-sigmobile-routes, author = {Kwindla Hultman Kramer and Nelson Minar and Pattie Maes}, title = {Tutorial: Mobile Software Agents for Dynamic Routing}, journal = {Mobile Computing and Communications Review}, year = {1999}, volume = {3}, number = {2}, pages = {12--16}, url = {http://nelson.www.media.mit.edu/people/nelson/research/routes-sigmobile/} }
This copy is posted with permission of the ACM and may not be redistributed.
ACM COPYRIGHT NOTICE. Copyright © 1999 by the Association for Computing Machinery, Inc. Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, to republish, to post on servers, or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from Publications Dept, ACM Inc., fax +1 (212) 869-0481, or permissions@acm.org
Nelson Minar | Created: Jun 10, 1999 |
<nelson@media.mit.edu> | Updated: June 10, 1999 |