P165 - I2CS: 10th International Conference on Innovative Internet Community Systems - Jubilee Edition 2010 -
Autor*innen mit den meisten Dokumenten
Auflistung nach:
Neueste Veröffentlichungen
- KonferenzbeitragOptimizing Distributed Test Generation(10th International Conferenceon Innovative Internet Community Systems (I2CS) – Jubilee Edition 2010 –, 2010) Gros-Désormeaux, Harry; Fouchal, Hacène; Hunel, PhilippeThis 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.
- KonferenzbeitragIdentifying open problems in random walk based service discovery in mobile(10th International Conferenceon Innovative Internet Community Systems (I2CS) – Jubilee Edition 2010 –, 2010) Noor Mian, Adnan; Beraldi, Roberto; Baldoni, RobertoService 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.
- KonferenzbeitragAdaptation process for ad hoc routing protocol(10th International Conferenceon Innovative Internet Community Systems (I2CS) – Jubilee Edition 2010 –, 2010) Yawut, Cholatip; Paillassa, Béatrice; Dhaou, RiadhBecause of several constraints in ad hoc networks, an adaptive ad hoc routing protocol is increasingly required. In this paper, we propose a synopsis of an adaptation process for an adaptive ad hoc routing protocol. Next, we put into practice the analysis of the process of adaptation to mobility by realizing an adaptive routing protocol: CSR (Cluster Source Routing) which is an extension of a widely used ad hoc routing protocol: DSR (Dynamic source Routing). Mobility and density metrics are considered to CSR<->DSR mode switching, it moves from a flat architecture working in DSR to a virtual hierarchical architecture. With this mode switching, CSR can enhance the scalability of the DSR routing protocol.
- KonferenzbeitragOptimizing mobile networks connectivity and routing using percolation theory(10th International Conferenceon Innovative Internet Community Systems (I2CS) – Jubilee Edition 2010 –, 2010) Amor, Soufian Ben; Bui, Marc; Lavallée, IvanMobile 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...).
- KonferenzbeitragStemming strategies for European languages(10th International Conferenceon Innovative Internet Community Systems (I2CS) – Jubilee Edition 2010 –, 2010) Savoy, JacquesIn this paper, we describe and evaluate different general stemming approaches for the French, Portuguese (Brazilian), German and Hungarian languages. Based on the CLEF test-collections, we demonstrate that light stemming approaches are quite effective for the French, Portuguese and Hungarian languages, and perform reasonably well for the German language. Variations in mean average precision among the different stemmers are also evaluated and are sometimes found to be statistically significant.
- KonferenzbeitragAd-hoc community composition of rescue forces in action situations(10th International Conferenceon Innovative Internet Community Systems (I2CS) – Jubilee Edition 2010 –, 2010) Schau, Volkmar; Kirchner, Kathrin; Erfurth, Christian; Eichler, GeraldSecure energy and transport networks, Internet and telecommunications, are vital nerves of our highly networked society. Global mobility makes it difficult to combat and natural disasters and technological accidents can cause serious damage in a closer-knit world. In this paper we introduce the challenges in dynamic community composition of heterogeneous rescue forces (culture clash) for rescue and protection tasks and discuss our approach in the context of the "SpeedUp project" how to present a solution for ad-hoc communication, situation-aware representation, tracking and guiding in dynamic inhomogeneous communities.
- KonferenzbeitragOn the demand for e-services by health communities(10th International Conferenceon Innovative Internet Community Systems (I2CS) – Jubilee Edition 2010 –, 2010) Dannecker, Achim; Lechner, UlrikeVirtual communities of patients provide health-related information and mutual support for members. This paper presents an analysis of the demand of virtual communities of patients for novel electronic services. Results include the success factors of virtual communities of patients, the demand for electronic services for new and experienced community members and the demand for electronic services for short-term affected and long-term affected patients.
- KonferenzbeitragImpossibility results on fair exchange(10th International Conferenceon Innovative Internet Community Systems (I2CS) – Jubilee Edition 2010 –, 2010) Garbinato, Benoît; Rickebusch, IanThe contribution of this paper is threefold. First, we propose a novel specification of the fair exchange problem that clearly separates safety and liveness. This specification assumes a synchronous model where processes communicate by message passing and might behave maliciously. In this model, we prove a first impossibility related to the notion of trust, stating that no solution to fair exchange exists in the absence of an identified process that every process can trust a priori. Finally, we derive an enriched model where processes are divided into trusted and untrusted processes, and we show that an additional assumption is still necessary to solve fair exchange. Intuitively, this result expresses a condition on the connectivity of correct but untrusted processes with respect to trusted processes. We also revisit existing fair exchange solutions described in the literature, in the light of our enriched model, and show that our second impossibility result applies to them.
- KonferenzbeitragA multi agent system application to support communities of practice: preliminary analysis(10th International Conferenceon Innovative Internet Community Systems (I2CS) – Jubilee Edition 2010 –, 2010) Sato, Gilson Yukio; Barthès, Jean-PaulThis paper presents a preliminary analysis for applying Multi Agent Systems to Communities of Practice. In this paper, we present some basic issues on Communities of Practice including a definition and some concepts, namely those of identity, trajectory and multi-membership. We analyze the adequacy of the Multi-Agent Systems technology to support Communities of Practice. We show how some characteristics of Communities of Practice can suggest different applications of Multi-Agent Systems, exploring one of the identified possibilities, more specifically the one related with a member's trajectory into and inside a community.