CEDRIC - SEMpIA RSS feed

Job - Nouveau : Sathiya Prabhu Kumar

Tue, 23 Apr 2013 10:34:24 +0200

Paper - SERENDIPITY enabled CYBER GAMES (SeCG)

Fri, 19 Apr 2013 15:26:56 +0200

The report describes the main features of a cyber game environment for alternate reality environment/games. It helps to enrich research efforts. Behaviour change is a key issue addressed by the project.

Job - Nouveau : Salim El_Khediri

Fri, 05 Apr 2013 14:02:26 +0200

Job - Nouveau : Mussab Zneika

Fri, 05 Apr 2013 09:43:28 +0200

Job - Nouveau : Hassan Loulou

Fri, 05 Apr 2013 09:39:18 +0200

Paper - Resource Allocation for Real Time Services in LTE Networks Using Cooperative Game Theory and Virtual Token Mechanism

Tue, 19 Mar 2013 15:39:38 +0100

The LTE specification providesQoS for multimedia services with fast connectivity, high mobility and security. However, 3GPP specifications have not defined scheduling algorithms to exploit the LTE characteristics to support real time services. In this article we propose a two level scheduling scheme composed by cooperative game theory, a virtual token mechanism, and the well known algorithms EXP-RULE and M-LWDF in downlink system. By using cooperative game theory such as bankruptcy game and Shapley value, the proposed mechanism works by forming coalitions between flow classes to distribute the bandwidth fairly among all them. Both algorithms EXP-RULE andM-LWDF have been modified to use a virtual token mechanism to improve their performance, giving priority to real time flows. By taking the arrival rates of packets into account, the proposed mechanism partially included in previous schedulers has been adapted to this work to increase remarkably the performance of the resource allocation for real time flows. The performance evaluation is conducted in terms of system throughput, packet loss ratio (PLR), total cell spectral efficiency, delay and fairness index.

Paper - A Cloud based Dual-Root Trust Model for Secure Mobile Online Transactions

Sun, 16 Dec 2012 19:28:54 +0100

With rapid growth of mobile devices and the emergency of mobile cloud services, it is a trend to use mobile devices for mobile-centric applications, and expand the mobile capabilities and provide needed security by mobile cloud services. However, due to the mobility of the device and the semi-trust of the mobile cloud, how to build trust in the mobile applications is a big concern. In this paper, we propose a dual-root trust online transaction model that provides a dual-root trust model including both the user?s mobile device and a delegation mobile cloud. We design a dual-root trust protocol by leveraging a modified CP-ABE cryptography and the trust execution environment embedded in a mobile device to provide device-specific transaction confirmations for online transactions initiated by the mobile user. The performance evaluation of the protocol demonstrates that it is a lightweight scheme for mobile devices since most cryptographic functions are delegated from users to the mobile cloud. We also provided security assessments to prove that the proposed DRT protocol is resilient to impersonation attacks by considering each participant may run Dual-Root Trust (DRT) protocols on behalf of others.

Paper - MCC-OSGi: An OSGi-based Mobile Cloud Service Model

Sun, 02 Dec 2012 00:37:52 +0100

In this article, a mobile cloud service model is presented, in which it offers a dynamic and efficient remote access to information services and resources for mobile devices. Mobile cloud computing has been evolved as a distributed service model, where individual mobile users are cloud service providers. Compared to traditional Internet-centric cloud service models, the complexity of mobile service management in a dynamic and distributed service environment is increased dramatically. To address this challenge, we propose to establish an OSGi-based mobile cloud service model ? MCC-OSGi ? that uses OSGi Bundles as the basic mobile cloud service building components. The proposed solution supports OSGi bundles running on both mobile devices and cloud-side virtual machine OS platforms, and the bundles can be transferred and run on different platforms without compatibility issues. The presented solution is achieved: 1) by incorporating OSGi into Android software development platform, 2) by setting up a Remote-OSGi on the cloud and on mobile devices, and 3) by defining three service architecture models. The presented solution is validated through a demonstrative application with relevant performance measurements.

Paper - Contributions au rendement des protocoles de diffusion à ordre total et aux réseaux tolérants aux délais à base de RFID

Mon, 24 Sep 2012 16:14:17 +0200

Dans les systèmes répartis asynchrones, l'horloge logique et le vecteur d'horloges sont deux outils fondamentaux pour gérer la communication et le partage de données entre les entités constitutives de ces systèmes. L'objectif de cette thèse est d'exploiter ces outils avec une perspective d'implantation. Dans une première partie, nous nous concentrons sur la communication de données et contribuons au domaine de la diffusion uniforme à ordre total. Nous proposons le protocole des trains : des jetons (appelés trains) circulent en parallèle entre les processus participants répartis sur un anneau virtuel. Chaque train est équipé d'une horloge logique utilisée pour retrouver les train(s) perdu(s) en cas de défaillance de processus. Nous prouvons que le protocole des trains est un protocole de diffusion uniforme à ordre total. Puis, nous créons une nouvelle métrique : le rendement en termes de débit. Cette métrique nous permet de montrer que le protocole des trains a un rendement supérieur au meilleur, en termes de débit, des protocoles présentés dans la littérature. Par ailleurs, cette métrique fournit une limite théorique du débit maximum atteignable en implantant un protocole de diffusion donné. Il est ainsi possible d'évaluer la qualité d'une implantation de protocole. Les performances en termes de débit du protocole des trains, notamment pour les messages de petites tailles, en font un candidat remarquable pour le partage de données entre coeurs d'un même processeur. De plus, sa sobriété en termes de surcoût réseau en font un candidat privilégié pour la réplication de données entre serveurs dans le cloud. Une partie de ces travaux a été implantée dans un système de contrôle-commande et de supervision déployé sur plusieurs dizaines de sites industriels. Dans une seconde partie, nous nous concentrons sur le partage de données et contribuons au domaine de la RFID. Nous proposons une mémoire répartie partagée basée sur des étiquettes RFID. Cette mémoire permet de s'affranchir d'un réseau informatique global. Pour ce faire, elle s'appuie sur des vecteurs d'horloges et exploite le réseau formé par les utilisateurs mobiles de l'application répartie. Ainsi, ces derniers peuvent lire le contenu d'étiquettes RFID distantes. Notre mémoire répartie partagée à base de RFID apporte une alternative aux trois architectures à base de RFID disponibles dans la littérature. Notre mémoire répartie partagée a été implantée dans un jeu pervasif qui a été expérimenté par un millier de personnes.

Paper - Chapter 10. Using RFID/NFC for pervasive serious games: the PLUG experience

Mon, 24 Sep 2012 16:07:31 +0200

This paper is use case oriented. It focuses on RFID/NFC architectures and their main features to provide serious pervasive games in a museum context. It relates our experiments and results issued from the PLUG (Play Ubiquitous Games and play more) research project. Two mixed reality games have been provided. Each one is supported by its own middleware. The two middlewares and their main characteristics are presented. We underline in each case the advantages of using RFID/NFC technologies.

Paper - Designing mobility: pervasiveness as the enchanting tool of mobility

Mon, 24 Sep 2012 16:04:05 +0200

PLUG ? Play Ubiquitous Games -, is a research project that deployed a fully distributed RFID architecture in the Museum of Arts and Crafts in Paris. A pervasive game was designed: "Plug: the Secrets of the Museum" (PSM) where players had to find virtual representations of the Museum artifacts, scatter them around or tidy them in the right spots, or swap them with other players. The analysis of the players? feed back showed that three main features characterize mobility when it is connected to pervasiveness. First, mobility appears as a way to read and collect information. Second, it is a tool to virtually mark the environment and the artifacts. Moving can be akin to "writing" a new scenario. Third, people become part of the network propagating and refreshing information not only on their mobiles but also on the RFID displays.

Paper - RFID-based replicated distributed memory for mobile applications

Mon, 24 Sep 2012 15:58:24 +0200

The goal of our work is to give a user equipped with an RFID-enabled mobile handset (mobile phone, PDA, laptop...) the ability to know the contents of distant passive RFID tags, without physically moving to them and without using a Wireless Area Network. The existing architectural patterns involving passive tags do not meet simultaneously all of these requirements. Our RFID-based distributed memory does. By associating vector clocks to tags, we replicate a view of this memory on each tag and each handset, and disseminate updates between all of the replicas. Thus a user can locally query the replica hold by their mobile handset without physically moving to a tag. We have developed a pervasive game as an application example. Using data collected during real game sessions, we evaluate the performance of our distributed memory. Then we discuss staleness and scalability issues. We conclude and give perspectives of our work.

Paper - Proposal for a Dynamic Synchronous Language

Thu, 20 Sep 2012 14:02:01 +0200

We propose a new scripting language called DSL bas- ed on the synchronous/reactive model. In DSL, sys- tems are composed of several sites executed asyn- chronously, and each site is running scripts in a syn- chronous parallel way. Scripts may call functions that are considered in an abstract way: their effect on the memory is not considered, but only their "orchestra- tion" i.e. the organisation of their calls in time and in place (the site where they are called). The mapping of sites onto cores allows one to benefit from multi- core architectures. Two properties are assumed by DSL: reactivity of sites and absence of interferences between scripts run by distinct sites. We consider several variants of DSL. In the first variant, functions are defined in FunLoft. In the second variant of DSL, functions are defined in ReactiveML and the JoCaml system is used for asynchronous inter-sites communi- cations. The third variant is based on SugarCubes which is a Java based framework for reactive pro- gramming. Finally, in the fourth variant, functions are defined in Scheme/Bigloo.

Paper - HIP-Tags Architecture Implementation for the Internet of Things

Thu, 20 Sep 2012 13:43:53 +0200

HIP-Tags Architecture Implementation for the Internet of Things

Paper - RFID and the Internet of Things

Thu, 20 Sep 2012 13:22:16 +0200

RFID (Radio Frequency Identification) technology allows for automatic identification of information contained in a tag by scanning and interrogation using radio frequency (RF) waves. An RFID tag contains an antenna and a microchip that allows it to transmit and receive. This technology is a possible alternative to the use of barcodes, which are frequently inadequate in the face of rapid growth in the scale and complexity of just-in-time inventory requirements, regional and international trade, and emerging new methods of trade based on it. Use of RFID tags will likely eventually become as widespread as barcodes today. This book describes the technologies used for implementation of RFID: from hardware, communication protocols, cryptography, to applications (including electronic product codes, or EPC) and middleware. The five parts of this book will provide the reader with a detailed description of all the elements that make up a RFID system today, including hot topics such as the privacy concerns, and the Internet of Things.

Paper - RFID et l'internet des choses

Thu, 20 Sep 2012 13:17:59 +0200

RFID et l'internet des choses dresse un panorama des techniques utilisées pour les étiquettes RFID (Radio Frequency Identification) : hardware, protocoles de communications, cryptographie, applications (dont EPC) et finalement intergiciels. Ces cinq parties permettent aux lecteurs d'avoir en un seul ouvrage une description scientifique précise de l'ensemble des éléments constituant les systèmes RFID d'aujourd'hui , en couvrant des problématiques récentes comme le respect de la vie privée ou l'internet des choses.

Paper - RFID et l'internet des choses

Thu, 20 Sep 2012 13:17:36 +0200

Job - Nouveau : Sami Taktak

Thu, 30 Aug 2012 17:02:27 +0200

Paper - Survey of Synchronization Algorithms: Wireless Sensor Networks Case Study

Thu, 30 Aug 2012 15:04:12 +0200

Time synchronization becomes in recent years as a part and parcel for any distributed system such as sensors networks. Many applications of sensors networks need local clocks of sensors nodes to be synchronized and keep synchronization between sensors in order to communicate with each other via radio links for sharing and treatment of reliable information. The key point of consideration in this article is to examine and evaluate the most important synchronization algorithms based on a set of factors like energy efficiency, mobility and complexity

Paper - Is Multicast useful in Health Care Monitoring Systems?

Thu, 30 Aug 2012 14:41:04 +0200

Health care monitoring is a technique for early detection of numerous symptoms and illness. As a step forward to ubiquitous monitoring, wireless sensor networks could be a solution for health care monitoring. However, wireless sensor networks do not support heavy load because they have limited energy, short transmission range, low throughput and small memory storage. In this paper, we are interested in multicast protocols which can reduce the network load. We tested some multicast and unicast routing protocols under a mixed mobility model for health care using the NS-2 simulator in wireless sensor networks. Our simulation results show that the Protocol for Unified Multicasting Through Announcements (PUMA) performs better than other routing protocols. However, Packet Delivery Ratio (PDR) is low because of the low throughput of IEEE 802.15.4.

Paper - Is Multicast useful in Health Care Monitoring Systems?

Thu, 30 Aug 2012 14:38:33 +0200

Paper - A Range-Free Localization Protocol for Wireless Sensor Networks

Thu, 30 Aug 2012 14:27:27 +0200

Localization is a fundamental issue for many wireless network applications. Without additional ranging devises, the range-free localization scheme offers a cost-effective solution for low-cost indoor sensor networks. As a typical range-free algorithm, DV-hop (Distance Vector - hop) algorithm has the advantage to localize normal nodes that have less than three neighbor anchors. In order to implement the DV-hop based algorithms in network scenarios, we create a new DV-hop localization protocol. This new protocol is presented in this paper with details, including the frame formats, the improvement of medium access method, as well as parameters used in deciding the end of each DV-hop step. Finally, using the new localization protocol, we investigate into some DV-hop algorithms (DV-hop, Checkout DV-hop and Selective 3-Anchor DV-hop) in terms of localization accuracy and synchronization. Simulation results show the good performance of our localization protocol.

Paper - A Real-Time Services Performance and Interference Mitigation for Femtocell Scenarios in LTE Networks

Thu, 30 Aug 2012 14:22:48 +0200

In order to enhance the Quality of Service in LTE, femtocell architecture has been proposed as a promising solution. However, interference is the main weak point in femtocell scenarios which causes a serious impact on multimedia services performance. Femtocell interference mitigation in LTE networks is the principle objective of this paper. We propose an enhancement of the well known four-coloring method for interference mitigation by combining it with cooperative game theory. Our proposed scheme aims to provide a solution to effectively achieve femtocell interference mitigation while guaranteeing the bitrate application for real-time services. The basic metrics of quality of service (QoS) such as throughput, Packet Loss Ratio (PLR), delay and Signal-to-Interference-plus-Noise-Ratio (SINR) are investigated. Our simulation environment is derived from realistic scenarios in order to study the performance of real-time service like Video and VoIP applications. Throughout our numerical results, we demonstrate the improvement of QoS constraints along with balancing between interference reduction requirement and resource allocation efficiency for real-time applications.

Paper - Interference Mitigation by Dynamic Self-Power Control in Femtocell Scenarios in LTE Networks

Thu, 30 Aug 2012 14:18:36 +0200

Efficient radio resource management and Quality of Service (QoS) guarantee are very important aspects in order to provide a good service in LTE Networks. Although the base station performs a smart scheduling scheme for resource allocation, the expected result could be affected due to interference, specially in femtocell scenarios. This article investigates the problem of interference in femtocell networks in LTE. The proposed method achieves inter-cell interference mitigation though a dynamic power self-control performed at each femtocell. In this paper we use the modulation and coding scheme (MCS) to obtain the optimum power value which assures a trade-off between Signalto- Interference-plus-Noise-Ratio (SINR) and bit-rate efficiency. The main objective of our work is to optimize the sub-bands in order to decrease the interference and maintain the throughput at the same time. The performance evaluation is conducted in terms of throughput, Packet Loss Ratio (PLR) and SINR.

Paper - Interference Mitigation by Dynamic Self-Power Control in Femtocell Scenarios in LTE Networks

Thu, 30 Aug 2012 14:12:50 +0200

Paper - Folding and Unfolding Bloom Filters - an Off-line Planing and on Line-Optimisation

Mon, 27 Aug 2012 22:46:34 +0200

The Internet of the things has reached a stage that enables an easy access to information and services anywhere, anytime. However, such vision still comes with practical limitation mainly relating to limited bandwidth and energy. It is henceforth crucial to devise novel solutions for supporting lightweight networking, data flow and service access so as to impact as less as possible bandwidth and energy. This paper touches upon such an issue by resizing the Bloom filter, which hence permits to keep to a minimum the bandwith and energy usage associated with exchanging a Bloom filter. The basic idea consists in folding or unfolding a Bloom filter so that the false positive rate keeps neglicted. We herein generalize this approach by introducing the concept of foldin/unfolding along with a novel formulation of the problem: the key challenge consists in determining how a folding should be performed, namely the number of times that Bloom filter should be folded/unfolded and the reduction factor associated with each fold/ unfold. We formulate that as an off-line planing of the factorization of an integer (corresponding to the Bloom filter size) and further proposed directions for optimising the dynamic folding/unfolding of a Bloom filter.

Paper - An OSGi Based Service Architecture in The Context of Tag-to-MobiCloud Computing

Tue, 10 Jul 2012 14:23:54 +0200

Mobile Cloud services offer a dynamic and efficient remote access to information services and resources, but they introduce at the same time, additional coupled interactions increasing complexity of the applications integration. In this dynamic and distributed environment, adding, updating or deleting instances can directly influence the current instances running on the Cloud. Hence, the management of distributed components becomes in this context a real challenge. The OSGi framework with his bundle based model addresses very well these issues. With OSGi, components can easily be managed remotely thanks to the native support of the dynamic behavior of applications, and to the elasticity offered by a modular bundles management on the other hand. We present a new OSGi-based SOA framework to design Android applications based on OSGi bundles. Our solutions target to develop a component-based software package that implements the service-component model with modularity and reusability capabilities. These solutions make Android platforms more dynamic by providing SOA features such as dynamic class-loading, versioning management, and dynamic bundle configuration avoiding the Android platform restart. In fact, we have defined a middleware to launch Felix, a compact implementation of OSGi, on Android terminals, and to manage the life cycle of the bundles that are used by Android applications. We have then extended the use of OSGi bundles from the mobile local environment execution to a distributed mobile Cloud environment so that the mobile cloud architecture is based completely on OSGi service model. To allow interaction between Android platforms bundles and the cloud services, we installed R-OSGi on the cloud side and we integrate within Android platforms R-OSGi as a proxy bundle service. Hence, an OSGi bundle is considered as a Cloud service?s deployment unit. The cloud provider exposes the services that can be managed on a distributed and autonomous way with OSGi bundles management System. To illustrate the use of OSGi remote services hosted on a cloud, we have developed an application that runs on NFC cell phones. The application that reads the product ID from a tag, searches this ID in a remote data base through a call to a local bundle. The local bundle then performs a remote call through R-OSGi to the cloud and carries the cloud?s response to the Android application.

Event - DRAMATURGIES INTERACTIVES ET DISPOSITIFS TRANSMEDIA

Wed, 06 Jun 2012 12:03:50 +0200

14/06/2012 - 14/06/2012 - CNAM, amphi 3

Un séminaire proposé par Isabelle Astic, Eric Gressier-Soudan, Alok Nandi et co-organisé par le CEDRIC, CoCreationCamp, A/~Architempo.

Les écrans abondent, les images saturent, les textos débordent. Dans un environnement où les flux de données fusent, quelles sont les places possibles pour être force de proposition avec des dispositifs qui font sens, avec des écritures et des dramaturgies qui nous emportent dans des univers narratifs ?

Quels sont les motifs narratifs (patterns) qui émergent à l’intersection des usages multi-écrans et/ou multi-espaces, des technologies en mutation ou celles existantes ?

Les spectateurs / visiteurs / internautes occupent des fragments de parcours et sautent d’écrans en écrans, de supports en supports.
La dramaturgie se voit-elle distribuée dans de multiples espaces, aux temporalités variables ? Comment ? Comment attraper l’attention du récepteur et jouer sur la tension dramaturgique pour lui permettre d’apprendre ou de passer un moment de détente.

Cette séance propose de faire dialoguer des praticiens et des théoriciens venant de multiples horizons: des musées, des séries télé, de la web bande dessinée, de la scénographie et des technologies bien sûr …

CNAM - Amphi 3 (accès 31 – 3ème étage)
2 rue Conté - Paris 75003

Métro Arts et Métiers

http://www.cnam.fr/adminsite/photo.jsp?ID_MEDIA=1147941706053

N'oubliez pas de vous enregistrer sur le site web de l'événement.

http://www.narrative.in/media-art/cnam-paris/

Paper - Le premier algorithme stabilisant de construction d'arbre totalement polynomial

Fri, 11 May 2012 15:48:32 +0200

Un algorithme stabilisant $A$ est dit \emph{totalement polynomial} s'il existe deux constantes $a$ et $b$ tel que pour tout réseau $\cal{R}$ (de diamètre $d$ comportant $n$ noeuds), la complexité de notre algorithme $A$ appartient à $O(d^a)$ rondes et $O(n^b)$ pas de calcul. La construction d'un arbre couvrant est un problème fondamental des systèmes distribués. L'utilisation d'un arbre couvrant permet de résoudre plus efficacement d'autres problèmes comme le routage, l'exclusion mutuelle ou la réinitialisation d'un réseau. La stabilisation est une technique générale et flexible permettant de traiter les fautes transitoires qui peuvent survenir dans un réseau. Or les solutions existantes résolvent ce problème soit avec un nombre de pas de calcul exponentiel soit avec un nombre de rondes fonction de la taille du réseau. Ces caractéristiques les rendent inappropriées dans le cadre du passage à l'échelle. Nous proposons le premier algorithme stabilisant totalement polynomial permettant de construire un arbre couvrant en largeur ayant une complexité en rondes de $O(d^2)$ et en pas de calcul de $O(n^6)$. Le diamètre est généralement inférieur à la taille du réseau ($\log(n)$ en moyenne). Ainsi, cet algorithme atteint le meilleur compromis entre les complexités en rondes et en pas de calcul.

Job - Nouveau : Fatiha Houacine

Mon, 30 Apr 2012 10:27:09 +0200