NOuvelles TEchnologies de la REpartition最新文献

筛选
英文 中文
Content-based communication in disconnected mobile ad hoc networks 非连接移动自组织网络中基于内容的通信
NOuvelles TEchnologies de la REpartition Pub Date : 2008-06-23 DOI: 10.1145/1416729.1416756
J. Haillot, F. Guidec
{"title":"Content-based communication in disconnected mobile ad hoc networks","authors":"J. Haillot, F. Guidec","doi":"10.1145/1416729.1416756","DOIUrl":"https://doi.org/10.1145/1416729.1416756","url":null,"abstract":"Applications dedicated to information sharing, news distribution, service advertisement and discovery all need a communication model where information flows towards any interested receiver, rather than towards specifically set destinations. Content-based communication is a style of communication that perfectly fits the needs of such applications. In this paper we address the problem of supporting content-based communication in partially or intermittently connected mobile ad hoc networks (MANETs). The protocol we designed leverages on the concepts of opportunistic networking and delay-tolerant networking in order to account for the absence of end-to-end connectivity in disconnected MANETs. Simulation results are presented, showing the efficiency of this protocol in a mobile ad hoc network composed of devices carried by pedestrians evolving in a campus environment.","PeriodicalId":321308,"journal":{"name":"NOuvelles TEchnologies de la REpartition","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126139960","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 5
Swiss Experiment: from wireless sensor networks to e-science 瑞士实验:从无线传感器网络到电子科学
NOuvelles TEchnologies de la REpartition Pub Date : 2008-06-23 DOI: 10.1145/1416729.1416732
K. Aberer
{"title":"Swiss Experiment: from wireless sensor networks to e-science","authors":"K. Aberer","doi":"10.1145/1416729.1416732","DOIUrl":"https://doi.org/10.1145/1416729.1416732","url":null,"abstract":"The emergence of novel sensing devices and sensor network technologies provides a whole new opportunity for global environmental studies and environment-related decision making. The Swiss Experiment is a newly initiated multidisciplinary project aimed at building a large scale platform, to support field investigations of environmental processes, which is based on new sensor and data management technology. In this talk we will first give an overview of the environmental problems being addressed in the Swiss Experiment and identify opportunities of supporting environmental scientists by recent advances in communications and information systems. We will discuss in particular our approach to support data and information management throughout experimental campaigns. This includes support for distributed data stream management based on Global Sensor Networks, for data warehousing and analysis, for map-based visualizations developed in collaboration with Microsoft's SensorMap team and for information sharing using a WIKI-based and semantics-enabled platform. We will demonstrate our initial results and identify some future challenges towards developing a truly comprehensive information management support for environmental sciences.","PeriodicalId":321308,"journal":{"name":"NOuvelles TEchnologies de la REpartition","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125802423","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Agreement and consistency without knowing the number of processes 在不知道进程数量的情况下达成协议和一致性
NOuvelles TEchnologies de la REpartition Pub Date : 2008-06-23 DOI: 10.1145/1416729.1416777
Mohssen Abboud, C. Delporte-Gallet, H. Fauconnier
{"title":"Agreement and consistency without knowing the number of processes","authors":"Mohssen Abboud, C. Delporte-Gallet, H. Fauconnier","doi":"10.1145/1416729.1416777","DOIUrl":"https://doi.org/10.1145/1416729.1416777","url":null,"abstract":"We study in this paper three classical problems of fault tolerance in a system where the set of processes is unknown. These three problems are: the consensus, the implementation of atomics registers and the eventual leader election.\u0000 For this, we consider different models. In the first one, the communication and the processes are asynchronous. In this model, these three problems could not be solved, but we define the weakest failure detectors needed to solve them.\u0000 We consider then a model where the processes and the communication are synchronous, which permit to realize synchronous rounds. In this case, the processes are created dynamically and may have crash failures. We prove that, if for all rounds at least one process is alive in two consecutive rounds, the consensus and the implementation of registers could be solved. The eventual leader election, which is in this case less interesting, can be solved also.\u0000 Between these two extremities, we focus on the case where the communications are asynchronous. Concerning processes, we assume that, onetime a process is created, it remains alive forever. In this case, if the leader election is easy, the consensus and the implementation of registers are impossible. If we augment the system with the failure detector (Σ) which permits to realize a quorum, consensus and implementation of atomic register can be solved.\u0000 At the end, we consider a partially synchronous model and we prove that the consensus and the implementation of atomic register could be solved if there exists a process that can communicate synchronously with the other processes.","PeriodicalId":321308,"journal":{"name":"NOuvelles TEchnologies de la REpartition","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123743829","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
A location service for position-based routing in mobile ad hoc networks 移动自组织网络中用于基于位置的路由的一种位置服务
NOuvelles TEchnologies de la REpartition Pub Date : 2008-06-23 DOI: 10.1145/1416729.1416791
Ebtisam Amar, S. Boumerdassi
{"title":"A location service for position-based routing in mobile ad hoc networks","authors":"Ebtisam Amar, S. Boumerdassi","doi":"10.1145/1416729.1416791","DOIUrl":"https://doi.org/10.1145/1416729.1416791","url":null,"abstract":"Position-based routing protocols take advantage of location information so that stateless and efficient routing is achieved. To enable position-based routing, a node must be able to discover the location of the node it wants to communicate with. This task is typically accomplished by a location service. Recently, several location service protocols have been developed for ad hoc networks.\u0000 In this paper we propose a novel location service called PHLS: Predictive Hierarchical Location Service. In PHLS, the entire network is partitioned into a hierarchy of smaller and smaller regions. For each node, one node in each-level region of the hierarchy is chosen as its local location server. When network initializes or nodes attach the network, nodes contact their local location server with their current location information (position and velocity), the only need to update its location server when it moves away from its current region. Nodes query their location servers and get exact or predicted location of nodes to communicate with.","PeriodicalId":321308,"journal":{"name":"NOuvelles TEchnologies de la REpartition","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127395472","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 5
A power-aware middleware for mobile ad-hoc networks 用于移动自组织网络的电源感知中间件
NOuvelles TEchnologies de la REpartition Pub Date : 2008-06-23 DOI: 10.1145/1416729.1416757
Guilhem Paroux, I. Demeure, L. Reynaud
{"title":"A power-aware middleware for mobile ad-hoc networks","authors":"Guilhem Paroux, I. Demeure, L. Reynaud","doi":"10.1145/1416729.1416757","DOIUrl":"https://doi.org/10.1145/1416729.1416757","url":null,"abstract":"Energy management constitutes a crucial issue for battery-powered mobiles devices, such as Pocket PCs. This article presents a power-aware middleware for Mobile Ad-hoc Networks (MANets). The energy management mechanisms were integrated in the middleware during its design. Each middleware's functionality (communication, discovery, security and data sharing) is adaptable to the energy level. When the energy level decreases, the middleware services are progressively degraded in order to decrease the energy consumption. The management of adaptations is guided by a policy that defines battery level thresholds at which the adaptations are triggered. In addition, applications using middleware are also designed to adapt their behaviour according to the energy level. The first evaluations are encouraging: the energy consumption is significantly decreased.","PeriodicalId":321308,"journal":{"name":"NOuvelles TEchnologies de la REpartition","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129119058","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 8
Real time data consistency in component based embedded systems 基于组件的嵌入式系统中的实时数据一致性
NOuvelles TEchnologies de la REpartition Pub Date : 2008-06-23 DOI: 10.1145/1416729.1416789
Nadège Pontisso, G. Padiou, P. Quéinnec
{"title":"Real time data consistency in component based embedded systems","authors":"Nadège Pontisso, G. Padiou, P. Quéinnec","doi":"10.1145/1416729.1416789","DOIUrl":"https://doi.org/10.1145/1416729.1416789","url":null,"abstract":"Embedded systems use more and more distributed architectures. For example, several instrumentation components communicate with a calculator via a field bus. Such distributed systems need to be sufficiently deterministic despite the asynchronous characteristics of their hardware components.\u0000 This work fits in with these problematics and focuses on the control of the temporal compatibility of a set of interdependent data used by the components of the system. Indeed, even if the components keep a simple behaviour, periodic for example, latencies in computation and communication can cause inconsistencies during the use of these data.\u0000 The study focuses on the data consistency formalisation by defining a relation called influence. The data flow between components is abstracted to a graph and, from the definition of particular subgraphs called spindles, a data timestamping rule is elaborated. It permits to define consistency constraints using constraints on these timestamps.","PeriodicalId":321308,"journal":{"name":"NOuvelles TEchnologies de la REpartition","volume":"142 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133149720","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 3
EERP: energy-efficient routing protocol for wireless sensor networks 无线传感器网络的高能效路由协议
NOuvelles TEchnologies de la REpartition Pub Date : 2008-06-23 DOI: 10.1145/1416729.1416749
Samra Boulfekhar, M. Benmohammed
{"title":"EERP: energy-efficient routing protocol for wireless sensor networks","authors":"Samra Boulfekhar, M. Benmohammed","doi":"10.1145/1416729.1416749","DOIUrl":"https://doi.org/10.1145/1416729.1416749","url":null,"abstract":"Networking unattended sensors is expected to have a significant impact on the efficiency of many military and civil applications. Sensors in such systems are typically disposable and expected to last until their energy drains. Therefore, energy is a very scarce resource for such sensor systems and has to be managed wisely in order to extend the life of the sensors for the duration of a particular mission. In this paper, we present a new protocol of routing for wireless sensor networks named EERP (Energy-Efficient Routing Protocol for wireless sensor networks) that maximizes the lifetime of the sensors. Its principle is as follows: each node sends the data captured on the way which minimizes the consumption of energy as well as the variance of energies consumed by the sensors nodes.\u0000 Our experimental results show that our protocol increase the lifetime of the sensors network and conserve the energy of the nodes up to optimum level better than the Energy Aware Routing protocol (EAR).","PeriodicalId":321308,"journal":{"name":"NOuvelles TEchnologies de la REpartition","volume":"353 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122850501","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
P2P logging and timestamping for XWiki XWiki的P2P日志和时间戳
NOuvelles TEchnologies de la REpartition Pub Date : 2008-06-23 DOI: 10.1145/1416729.1416761
Mounir Tlili, W. Dedzoe, Esther Pacitti, P. Valduriez, Reza Akbarinia, L. Dubost, Sergiu Dumitriu, Stéphane Laurière, G. Canals, P. Molli, Julien Maire
{"title":"P2P logging and timestamping for XWiki","authors":"Mounir Tlili, W. Dedzoe, Esther Pacitti, P. Valduriez, Reza Akbarinia, L. Dubost, Sergiu Dumitriu, Stéphane Laurière, G. Canals, P. Molli, Julien Maire","doi":"10.1145/1416729.1416761","DOIUrl":"https://doi.org/10.1145/1416729.1416761","url":null,"abstract":"Collaborative applications are getting an increasing interest as a result of the rapid progress in distributed technologies such as grid computing. P2P applications, and mobile computing. Constructing these applications on top of P2P networks has many advantages which stem from P2P properties: decentralization, self-organization, scalability and fault-tolerance\u0000 In this paper, we address data replication and reconciliation in XWiki peer-to-peer (P2P) collaborative application. We propose a new mechanism of optimistic replication, which consists of an algorithm for data reconciliation based on operational transformation approach (OT) and an extension of KTS service that performs distributed timestamp generation running over a distributed hash table (DHT). While updating at collaborating XWiki peers, updates are timestamped and stored in a highly available P2P log. During reconciliation, these updates are retrieved in total order to enforce eventual consistencies.\u0000 The work presented here is partially supported by the National Agency of Research within RNTL XWiki Concerto project (2007--2009).","PeriodicalId":321308,"journal":{"name":"NOuvelles TEchnologies de la REpartition","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114137568","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
A policy-based context-aware approach for the commitment of mobile transactions 用于移动事务承诺的基于策略的上下文感知方法
NOuvelles TEchnologies de la REpartition Pub Date : 2008-06-23 DOI: 10.1145/1416729.1416753
Nadia Nouali-Taboudjemat, H. Drias
{"title":"A policy-based context-aware approach for the commitment of mobile transactions","authors":"Nadia Nouali-Taboudjemat, H. Drias","doi":"10.1145/1416729.1416753","DOIUrl":"https://doi.org/10.1145/1416729.1416753","url":null,"abstract":"The transaction paradigm ensures consistency in the presence of concurrent accesses to shared data and in the presence of failures. Traditionally, the transaction semantics is defined by the ACID properties (Atomicity, Consistency, Isolation and Durability) which implementation is through such mechanisms as commitment protocols ensuring Atomicity and concurrency control protocols ensuring Isolation. Many transactional models were developed to support the diverse and variable applications needs, and more recently to overcome the constraints induced by the evolution of distributed systems environments toward wireless and mobile. Indeed, the latter are characterized by limitations in computing resources, communications and energy as well as dynamic variations in terms of resource availability and configuration. In this paper, our contribution is mainly focused on the problem of atomic commitment. We adopted an approach based on the context-aware adaptation for the management of mobile transactions. We therefore present the commit protocol aTCP (Adaptable Transaction Commit Protocol) which allows for adaptation to the requirements of applications and mobile context in terms of transactional properties and execution cost. For the implementation of aTCP we offer a context-aware architecture based on policies.","PeriodicalId":321308,"journal":{"name":"NOuvelles TEchnologies de la REpartition","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129792690","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 5
Enhanced connectors to support hierarchical dependencies in software architecture 增强的连接器支持软件体系结构中的分层依赖关系
NOuvelles TEchnologies de la REpartition Pub Date : 2008-06-23 DOI: 10.1145/1416729.1416772
A. Amirat, M. Oussalah
{"title":"Enhanced connectors to support hierarchical dependencies in software architecture","authors":"A. Amirat, M. Oussalah","doi":"10.1145/1416729.1416772","DOIUrl":"https://doi.org/10.1145/1416729.1416772","url":null,"abstract":"The more important level of abstraction in the description of large and complex software is its architecture description. So, at this abstraction level we can describe the principal system components and their pathways of interaction. Software architecture is considered to be the driving aspect of the development process; it allows specifying which aspects and models in each level needed according to the software architecture design. Early Architecture Description Languages (ADLs), nearly exclusive, focus on structural abstraction hierarchy ignoring behavioural description hierarchy, conceptual hierarchy, and metamodeling hierarchy. In this paper we show that all those hierarchies constitute views to appropriately \"reason about\" software architectures described using our C3 metamodel which is a minimal and complete ADL. We provide a set of mechanisms to deal with different levels of each hierarchy; also we introduce a new enhanced definition for connector concept deployed in C3 architectures.","PeriodicalId":321308,"journal":{"name":"NOuvelles TEchnologies de la REpartition","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121004304","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 8
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信