http://dl.gi.de/handle/20.500.12116/19003 2026-07-21T13:39:34Z 2026-07-21T13:39:34Z Gros-Désormeaux, Harry Fouchal, Hacène Hunel, Philippe http://dl.gi.de/handle/20.500.12116/19052 2019-01-11T09:33:45Z 2010-01-01T00:00:00Z

Optimizing Distributed Test Generation Gros-Désormeaux, Harry; Fouchal, Hacène; Hunel, Philippe Eichler, Gerald; Kropf, Peter; Lechner, Ulrike; Meesad, Phayung; Unger, Herwig This paper presents two optimizations of the master-slave paradigm which provides more robustness. The former uses a mobile master which randomly jumps from node to node in order to dispatch the bandwidth load during the application execution. The latter aims to fully decentralize the paradigm like peer-to-peer systems. We present and experiment our new schemes on an application dedicated to test generation used in protocol engineering. We show that they can help for unknown dynamic environments where no information is given about nodes configuration.

2010-01-01T00:00:00Z Noor Mian, Adnan Beraldi, Roberto Baldoni, Roberto http://dl.gi.de/handle/20.500.12116/19053 2019-01-11T09:33:45Z 2010-01-01T00:00:00Z

Identifying open problems in random walk based service discovery in mobile Noor Mian, Adnan; Beraldi, Roberto; Baldoni, Roberto Eichler, Gerald; Kropf, Peter; Lechner, Ulrike; Meesad, Phayung; Unger, Herwig Service discovery in mobile ad hoc networks (MANETs) is a challenging issue. The nodes in a MANETs offer spontaneous and variable connectivity. Also the proximity of a given service as well as the kind and the number of services vary unpredictably with time. Traditional directory based architectural solutions can hardly cope with such a dynamic environment while a directory-less approach has to resort to network-wide searches. Some solutions integrate a Service Discovery Protocol (SDP) with the routing protocol. These can improve performance but still there is need for network wide searches which is a source of inefficiency. There has been lot of work on the problem of service discovery by leveraging on the random walk based search in wired peer-to-peer networks. These works present interesting results that can be useful for MANETs and can be good candidates for SDP, as these methods require fewer resources as compared to SDPs using some sort of flooding. In this paper we have tried to identify some of the open problems in service discovery in MANETs that use random walk.

2010-01-01T00:00:00Z http://dl.gi.de/handle/20.500.12116/19049 2019-01-11T09:33:44Z 2010-01-01T00:00:00Z

10th International Conferenceon Innovative Internet Community Systems (I2CS) – Jubilee Edition 2010 – Eichler, Gerald; Kropf, Peter; Lechner, Ulrike; Meesad, Phayung; Unger, Herwig

2010-01-01T00:00:00Z Amor, Soufian Ben Bui, Marc Lavallée, Ivan http://dl.gi.de/handle/20.500.12116/19051 2019-01-11T09:33:44Z 2010-01-01T00:00:00Z

Optimizing mobile networks connectivity and routing using percolation theory Amor, Soufian Ben; Bui, Marc; Lavallée, Ivan Eichler, Gerald; Kropf, Peter; Lechner, Ulrike; Meesad, Phayung; Unger, Herwig Mobile Ad-hoc NETworks (MANETs) are complex systems presenting a phase transition phenomenon : an abrupt change in the behavior of the network around a critical value of a certain key parameter. The reliability and connectivity of MANETs depend on their size and on the efficiency of the routing protocol. In this paper we propose a new approach in MANETs modeling, combining percolation theory and epidemic algorithms. Using percolation theory we show the existence of a connectivity threshold (in a square lattice) needed to guarantee the communications in the network, in particular when the number of direct links are limited. Epidemic algorithms are used to provide a good propagation of information in the network wile minimizing the resources cost (energy, number of messages...).

2010-01-01T00:00:00Z