Abstract
This paper presents a basic and an extended heuristic to distribute operating system (0s) services over mobile ad hoc networks. The heuristics are inspired by the foraging behavior of ants and are used within our NanoOS, an OS for distributed applications. The NanoOS offers an uniform environment of execution and the code of the OS is distributed among nodes.
We propose a basic and an extended swarm optimization based heuristic to control the service migration in order to reduce the communication overhead. In the basic one, each service request leaves pheromone in the nodes on its path to the service provider (like ants leave pheromone when foraging). An optimization step occurs when the service provider migrates to the neighbor node with the higher pheromone concentration. The proposed extension takes into account the position of the node in the network and its energy.
Realized simulations have shown that the basic heuristic performs well. The total communication cost in average is just 40% higher than the global optimum. In addition, both heuristics have a low computational requirement.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Emin G Sirer, Rimon Barr, T. W. D Kim, and Lan Y Fung. Automatic code placement alternatives for ad-hoc and sensor networks. Technical report, Cornell University, Ithaca, NY, USA, 2001.
H. S. Stone. Multiprocessor scheduling with the aid of network flow algorithms. IEEE Trans. Software Eng., SE-3:85–93, 1977.
V. M. Lo. Heuristic algorithms for task assignment in distributed systems. IEEE Trans. Comput, 37(11):1384–1397, 1988.
S. Ramakrishnan, I. H. Cho, and L. Dunning. A close look at task assignment in distributed systems. In In IEEE INFOCOM 91, pages 806–812, Miami, 1991.
Kenjiro Taura and Andrew A. Chien. A heuristic algorithm for mapping communicating tasks on heterogeneous resources. In Heterogeneous Computing Workshop, pages 102–115, 2000.
Nectarios Koziris, Michael Romesis, Panayiotis Tsanakas, and George Papakonstantinou. An efficient algorithm for the physical mapping of clustered task graphs onto multiprocessor architectures. In Proc. of 8th Euromicro Workshop on Parallel and Distributed Processing (PDP2000), pages 406–413, Rhodes, Greece, 2000. IEEE Press.
M. Eshaghian and Y. Wu. Mapping heterogeneous task graphs onto heterogeneous system graphs. In Proceedings of Heterogeneous Computing Workshop, 1997.
R. F. Freund, M. Gherrity, S. Ambrosius, M. Campbell, M. Halderman, D. Hensgen, E. Keith, T. Kidd, M. Kussow, J. D. Lima, F. Mirabile, L. Moore, B. Rust, and H. J. Siegel. Scheduling resources in multi-user, heterogeneous, computing environments with smartnet. In In Proceedings of Heterogeneous Computing Workshop, 1998.
Christophe Lang, Michel Trehel, and Pierre Baptiste. A distributed placement algorithm based on process initiative and on a limited travel. In PDPTA, pages 2636–2641, 1999.
Shyamal Chowdhury. The greedy load sharing algorithm. J. Parallel Distrib. Comput, 9(1):93–99, 1990.
Eric Bonabeau, Marco Dorigo, and Guy Theraulaz. Swarm Intelligence: From Natural to Artificial Systems. Oxford University Press, New York, NY, 1999.
Sartaj Sahni and Teofilo Gonzalez. P-complete approximation problems. J. ACM, 23(3):555–565, 1976.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 International Federation for Information Processing
About this paper
Cite this paper
Heimfarth, T., Janacik, P. (2006). Ant Based Heuristic for OS Service Distribution on Ad Hoc Networks. In: Pan, Y., Rammig, F.J., Schmeck, H., Solar, M. (eds) Biologically Inspired Cooperative Computing. BICC 2006. IFIP International Federation for Information Processing, vol 216. Springer, Boston, MA . https://doi.org/10.1007/978-0-387-34733-2_8
Download citation
DOI: https://doi.org/10.1007/978-0-387-34733-2_8
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-34632-8
Online ISBN: 978-0-387-34733-2
eBook Packages: Computer ScienceComputer Science (R0)