F. Almenárez, Andrés Marín López, Daniel Díaz Sánchez, J. Sánchez
Pervasive devices interacting in open and dynamic spaces with each others require a mechanism that allows them acting autonomously in a secure way and protecting their resources. Trust is fundamental to establish communication with other users, because the identity is often uncertain and on one's own does not provide trust information, for instance, could an unknown user be trustworthy? Nowadays, these devices have a so limited security support. So, we propose a simple trust management model to enhance such support, allowing them interact in ad hoc networks and peer-to-peer applications in a secure way. In this paper, our main contribution is a mathematical and a probabilistic model, as well as demonstrating the model feasibility, since it has been assessed through the prototype implementation, which has been tested in a Pocket PC
{"title":"Developing a model for trust management in pervasive devices","authors":"F. Almenárez, Andrés Marín López, Daniel Díaz Sánchez, J. Sánchez","doi":"10.1109/PERCOMW.2006.41","DOIUrl":"https://doi.org/10.1109/PERCOMW.2006.41","url":null,"abstract":"Pervasive devices interacting in open and dynamic spaces with each others require a mechanism that allows them acting autonomously in a secure way and protecting their resources. Trust is fundamental to establish communication with other users, because the identity is often uncertain and on one's own does not provide trust information, for instance, could an unknown user be trustworthy? Nowadays, these devices have a so limited security support. So, we propose a simple trust management model to enhance such support, allowing them interact in ad hoc networks and peer-to-peer applications in a secure way. In this paper, our main contribution is a mathematical and a probabilistic model, as well as demonstrating the model feasibility, since it has been assessed through the prototype implementation, which has been tested in a Pocket PC","PeriodicalId":250624,"journal":{"name":"Fourth Annual IEEE International Conference on Pervasive Computing and Communications Workshops (PERCOMW'06)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-03-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115285010","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}
Pub Date : 2006-03-13DOI: 10.1109/PERCOMW.2006.115
Jérémie Leguay, T. Friedman
The optimized link state routing (OLSR) protocol is a proactive link-state protocol for ad-hoc networks. It uses an optimization called multi-point relays (MPRs) to provide an efficient broadcast structure and to reduce the number of link advertisements. Various propositions have been made to enhance the quality of service (QoS) of the routes that OLSR provides, selecting routes according to metrics such as their expected loss rate or throughput. This paper analyzes the existing propositions and finds them lacking. By building upon OLSR's link announcement mechanism, these solutions permit the advertisement of links with non desirable properties and can only support one class of service. We propose ways to improve one of the propositions, QOLSR. Our QOLSR+ uses MPRs only to create a reliable broadcast structure and employs modified link announcements to increase the number of advertised links
OLSR (optimized link state routing)协议是面向ad-hoc网络的一种主动链路状态协议。它使用一种称为多点中继(MPRs)的优化来提供有效的广播结构并减少链路广告的数量。为了提高OLSR提供的路由的服务质量(QoS)，根据预期损失率或吞吐量等指标选择路由，已经提出了各种建议。本文分析了现有的命题，发现其不足之处。通过构建OLSR的链接公告机制，这些解决方案允许发布不需要的属性的链接，并且只能支持一类服务。我们提出了改进其中一个命题——QOLSR的方法。我们的QOLSR+仅使用mpr来创建可靠的广播结构，并使用修改的链路公告来增加发布的链路数量
{"title":"QoS routing in OLSR with several classes of service","authors":"Jérémie Leguay, T. Friedman","doi":"10.1109/PERCOMW.2006.115","DOIUrl":"https://doi.org/10.1109/PERCOMW.2006.115","url":null,"abstract":"The optimized link state routing (OLSR) protocol is a proactive link-state protocol for ad-hoc networks. It uses an optimization called multi-point relays (MPRs) to provide an efficient broadcast structure and to reduce the number of link advertisements. Various propositions have been made to enhance the quality of service (QoS) of the routes that OLSR provides, selecting routes according to metrics such as their expected loss rate or throughput. This paper analyzes the existing propositions and finds them lacking. By building upon OLSR's link announcement mechanism, these solutions permit the advertisement of links with non desirable properties and can only support one class of service. We propose ways to improve one of the propositions, QOLSR. Our QOLSR+ uses MPRs only to create a reliable broadcast structure and employs modified link announcements to increase the number of advertised links","PeriodicalId":250624,"journal":{"name":"Fourth Annual IEEE International Conference on Pervasive Computing and Communications Workshops (PERCOMW'06)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-03-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116915558","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}
M. Moore, A. Enomoto, T. Nakano, R. Egashira, T. Suda, A. Kayasuga, H. Kojima, H. Sakakibara, K. Oiwa
Molecular communication is one solution for nano-scale communication between nanomachines. Nanomachines (e.g., biological molecules, artificial devices) represent small devices or components that perform computation, sensing, or actuation. Molecular communication provides a mechanism for one nanomachine to encode or decode information into molecules and to send information to another nanomachine. This paper describes a molecular motor communication system in terms of a high level architecture for molecular communication. We also briefly discuss current and future work in molecular communication
{"title":"A design of a molecular communication system for nanomachines using molecular motors","authors":"M. Moore, A. Enomoto, T. Nakano, R. Egashira, T. Suda, A. Kayasuga, H. Kojima, H. Sakakibara, K. Oiwa","doi":"10.1109/PERCOMW.2006.4","DOIUrl":"https://doi.org/10.1109/PERCOMW.2006.4","url":null,"abstract":"Molecular communication is one solution for nano-scale communication between nanomachines. Nanomachines (e.g., biological molecules, artificial devices) represent small devices or components that perform computation, sensing, or actuation. Molecular communication provides a mechanism for one nanomachine to encode or decode information into molecules and to send information to another nanomachine. This paper describes a molecular motor communication system in terms of a high level architecture for molecular communication. We also briefly discuss current and future work in molecular communication","PeriodicalId":250624,"journal":{"name":"Fourth Annual IEEE International Conference on Pervasive Computing and Communications Workshops (PERCOMW'06)","volume":"88 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-03-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124859110","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}
Given a wireless network, we need to assign transmission power to each of the nodes, that will enable communication between any two nodes (via other nodes). Moreover, due to possible faults, we would like to have at least k vertex-disjoint paths from any node to any other node, where k is some fixed integer, depending on the reliability of the nodes. The goal is to achieve this directed k-connectivity with minimal overall power consumption. The problem is NP-Hard for any k ges 1, already for planar networks. Here we develop an O(k)-approximation algorithm for the planar case. We also address the problem of constructing a connected backbone, for which we present an efficient constant-factor approximation algorithm
{"title":"Fault-tolerant power assignment and backbone in wireless networks","authors":"Paz Carmi, M. J. Katz, M. Segal, Hanan Shpungin","doi":"10.1109/PERCOMW.2006.55","DOIUrl":"https://doi.org/10.1109/PERCOMW.2006.55","url":null,"abstract":"Given a wireless network, we need to assign transmission power to each of the nodes, that will enable communication between any two nodes (via other nodes). Moreover, due to possible faults, we would like to have at least k vertex-disjoint paths from any node to any other node, where k is some fixed integer, depending on the reliability of the nodes. The goal is to achieve this directed k-connectivity with minimal overall power consumption. The problem is NP-Hard for any k ges 1, already for planar networks. Here we develop an O(k)-approximation algorithm for the planar case. We also address the problem of constructing a connected backbone, for which we present an efficient constant-factor approximation algorithm","PeriodicalId":250624,"journal":{"name":"Fourth Annual IEEE International Conference on Pervasive Computing and Communications Workshops (PERCOMW'06)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-03-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126064424","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}
This paper presents a multi-hop localization technique for WSNs exploiting acquired received signal strength indications. The proposed system aims at providing an effective solution for the self localization of nodes in static/semi-static wireless sensor networks without requiring previous deployment information
{"title":"A RSSI-based and calibrated centralized localization technique for wireless sensor networks","authors":"C. Alippi, Giovanni Vanini","doi":"10.1109/PERCOMW.2006.13","DOIUrl":"https://doi.org/10.1109/PERCOMW.2006.13","url":null,"abstract":"This paper presents a multi-hop localization technique for WSNs exploiting acquired received signal strength indications. The proposed system aims at providing an effective solution for the self localization of nodes in static/semi-static wireless sensor networks without requiring previous deployment information","PeriodicalId":250624,"journal":{"name":"Fourth Annual IEEE International Conference on Pervasive Computing and Communications Workshops (PERCOMW'06)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-03-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114944530","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}
Molecular communication is a new communication paradigm using molecules as a communication carrier. In molecular communication, information is encoded onto molecules at senders and the molecules propagate to receivers in a controlled manner. The receivers, upon receiving the molecules, decode the encoded information and react biochemically. Molecular communication provides means to deliver molecules to destinations and allows biological and artificially-created components to communicate with each other. This paper describes a design of a molecular communication system that has potentialities to enable future health care applications
{"title":"Molecular communication for health care applications","authors":"Y. Moritani, S. Hiyama, T. Suda","doi":"10.1109/PERCOMW.2006.97","DOIUrl":"https://doi.org/10.1109/PERCOMW.2006.97","url":null,"abstract":"Molecular communication is a new communication paradigm using molecules as a communication carrier. In molecular communication, information is encoded onto molecules at senders and the molecules propagate to receivers in a controlled manner. The receivers, upon receiving the molecules, decode the encoded information and react biochemically. Molecular communication provides means to deliver molecules to destinations and allows biological and artificially-created components to communicate with each other. This paper describes a design of a molecular communication system that has potentialities to enable future health care applications","PeriodicalId":250624,"journal":{"name":"Fourth Annual IEEE International Conference on Pervasive Computing and Communications Workshops (PERCOMW'06)","volume":"62 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-03-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128237816","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}
I. Roussaki, M. Strimpakou, N. Kalatzis, M. Anagnostou, C. Pils
Context awareness is an inherent feature of pervasive computing. It enhances the proactiveness of the system thus requiring less user attention and fewer human-machine interactions, it supports intelligent personalization features, and it can assist the system to address the user requirements considering the current conditions. Nevertheless, in such environments, various types of context information are involved and need to be efficiently managed and maintained, soundly interpreted, rapidly processed, and securely disseminated by the system. Thus, an interoperable and flexible context representation scheme is necessary that will support efficient context interpretation and reasoning and will perform well in distributed large-scale context-aware systems. This paper is concerned with the development of a hybrid context representation scheme that aims to combine the maintenance, distribution and administrative facilities of a location-based context model and the semantic advantages of context ontologies
{"title":"Hybrid context modeling: a location-based scheme using ontologies","authors":"I. Roussaki, M. Strimpakou, N. Kalatzis, M. Anagnostou, C. Pils","doi":"10.1109/PERCOMW.2006.65","DOIUrl":"https://doi.org/10.1109/PERCOMW.2006.65","url":null,"abstract":"Context awareness is an inherent feature of pervasive computing. It enhances the proactiveness of the system thus requiring less user attention and fewer human-machine interactions, it supports intelligent personalization features, and it can assist the system to address the user requirements considering the current conditions. Nevertheless, in such environments, various types of context information are involved and need to be efficiently managed and maintained, soundly interpreted, rapidly processed, and securely disseminated by the system. Thus, an interoperable and flexible context representation scheme is necessary that will support efficient context interpretation and reasoning and will perform well in distributed large-scale context-aware systems. This paper is concerned with the development of a hybrid context representation scheme that aims to combine the maintenance, distribution and administrative facilities of a location-based context model and the semantic advantages of context ontologies","PeriodicalId":250624,"journal":{"name":"Fourth Annual IEEE International Conference on Pervasive Computing and Communications Workshops (PERCOMW'06)","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-03-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124680023","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}
Migratory interactive services play an important role in supporting mobile users because they allow them to continue their activities across interaction with different devices. When designing architectures and infrastructures for supporting such services, one important issue is how to manage the dynamic set of interactive devices that can be involved. In this paper, we present a solution able to flexibly manage dynamic discovery of interactive devices and their monitoring and exploit such information
{"title":"Dynamic discovery and monitoring in migratory interactive services","authors":"R. Bandelloni, F. Paternò, Zigor Salvador","doi":"10.1109/PERCOMW.2006.45","DOIUrl":"https://doi.org/10.1109/PERCOMW.2006.45","url":null,"abstract":"Migratory interactive services play an important role in supporting mobile users because they allow them to continue their activities across interaction with different devices. When designing architectures and infrastructures for supporting such services, one important issue is how to manage the dynamic set of interactive devices that can be involved. In this paper, we present a solution able to flexibly manage dynamic discovery of interactive devices and their monitoring and exploit such information","PeriodicalId":250624,"journal":{"name":"Fourth Annual IEEE International Conference on Pervasive Computing and Communications Workshops (PERCOMW'06)","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-03-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124346903","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}
Pub Date : 2006-03-13DOI: 10.1109/PERCOMW.2006.139
S. Goel, T. Imielinski, A. Passarella
In a sensor network monitoring natural environment, the readings of sensor nodes show high temporal and spatial correlation. This stems from the fact that most characteristics of natural environment (chemical concentration, temperature, humidity, pollution, etc.) do not change abruptly in space and time. From a sensor's perspective then, the environmental phenomena are quite predictable, and hence, "boring". In this paper, we introduce the novel idea of buddies to exploit temporal correlation. We propose a simple Buddy protocol to implement this idea. We analyze the performance of the protocol and identify factors that influence it. We discuss research challenges that would pave the way for more efficient protocols based on this idea
{"title":"Using buddies to live longer in a boring world [sensor network protocol]","authors":"S. Goel, T. Imielinski, A. Passarella","doi":"10.1109/PERCOMW.2006.139","DOIUrl":"https://doi.org/10.1109/PERCOMW.2006.139","url":null,"abstract":"In a sensor network monitoring natural environment, the readings of sensor nodes show high temporal and spatial correlation. This stems from the fact that most characteristics of natural environment (chemical concentration, temperature, humidity, pollution, etc.) do not change abruptly in space and time. From a sensor's perspective then, the environmental phenomena are quite predictable, and hence, \"boring\". In this paper, we introduce the novel idea of buddies to exploit temporal correlation. We propose a simple Buddy protocol to implement this idea. We analyze the performance of the protocol and identify factors that influence it. We discuss research challenges that would pave the way for more efficient protocols based on this idea","PeriodicalId":250624,"journal":{"name":"Fourth Annual IEEE International Conference on Pervasive Computing and Communications Workshops (PERCOMW'06)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-03-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127895205","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}
In this paper we present a framework to provide dependability through accountability. Our proposal exploits the asymmetry present in the majority of sensor data processing to cheaply validate events and processing which occurs at various points in a distributed middleware system. We exemplify our framework with reference to two real-world distributed location middlewares. We adapt one of these to evaluate our framework and present performance results
{"title":"Dependability and accountability for context-aware middleware systems","authors":"A. Rice, A. Beresford","doi":"10.1109/PERCOMW.2006.36","DOIUrl":"https://doi.org/10.1109/PERCOMW.2006.36","url":null,"abstract":"In this paper we present a framework to provide dependability through accountability. Our proposal exploits the asymmetry present in the majority of sensor data processing to cheaply validate events and processing which occurs at various points in a distributed middleware system. We exemplify our framework with reference to two real-world distributed location middlewares. We adapt one of these to evaluate our framework and present performance results","PeriodicalId":250624,"journal":{"name":"Fourth Annual IEEE International Conference on Pervasive Computing and Communications Workshops (PERCOMW'06)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-03-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126373366","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：