Ant based heuristic for OS service distribution on ad hoc networks

This paper presents a basic and an extended heuristic to distribute operating system (OS) 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 o...

Descripción completa

Guardado en:
Detalles Bibliográficos
Autores principales: Heimfarth, Tales, Janacik, Peter
Formato: Objeto de conferencia
Lenguaje:Inglés
Publicado: 2006
Materias:
Acceso en línea:http://sedici.unlp.edu.ar/handle/10915/24002
Aporte de:
id I19-R120-10915-24002
record_format dspace
institution Universidad Nacional de La Plata
institution_str I-19
repository_str R-120
collection SEDICI (UNLP)
language Inglés
topic Ciencias Informáticas
Heuristic methods
Cellular architecture (e.g., mobile)
Wireless communication
spellingShingle Ciencias Informáticas
Heuristic methods
Cellular architecture (e.g., mobile)
Wireless communication
Heimfarth, Tales
Janacik, Peter
Ant based heuristic for OS service distribution on ad hoc networks
topic_facet Ciencias Informáticas
Heuristic methods
Cellular architecture (e.g., mobile)
Wireless communication
description This paper presents a basic and an extended heuristic to distribute operating system (OS) 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.
format Objeto de conferencia
Objeto de conferencia
author Heimfarth, Tales
Janacik, Peter
author_facet Heimfarth, Tales
Janacik, Peter
author_sort Heimfarth, Tales
title Ant based heuristic for OS service distribution on ad hoc networks
title_short Ant based heuristic for OS service distribution on ad hoc networks
title_full Ant based heuristic for OS service distribution on ad hoc networks
title_fullStr Ant based heuristic for OS service distribution on ad hoc networks
title_full_unstemmed Ant based heuristic for OS service distribution on ad hoc networks
title_sort ant based heuristic for os service distribution on ad hoc networks
publishDate 2006
url http://sedici.unlp.edu.ar/handle/10915/24002
work_keys_str_mv AT heimfarthtales antbasedheuristicforosservicedistributiononadhocnetworks
AT janacikpeter antbasedheuristicforosservicedistributiononadhocnetworks
bdutipo_str Repositorios
_version_ 1764820466476777475