Pub Date : 2013-03-18DOI: 10.1109/PerComW.2013.6529570
Thibaut Le Guilly, Petur Olsen, A. Ravn, Jesper Brix Rosenkilde, A. Skou
Ambient Intelligence systems use many sensors and actuators, with a diversity of networks, protocols and technologies which makes it impossible to access the devices in a common manner. This paper presents the HomePort software, which provides an open source RESTful interface to heterogeneous sensor networks, allowing a simple unified access to virtually any kind of protocol using well known standards. HomePort includes means to provide event notification, as well as a tracing mechanism. The software is implemented and we report on initial experiments and provide an evaluation that shows the feasibility and scalability of the approach.
{"title":"HomePort: Middleware for heterogeneous home automation networks","authors":"Thibaut Le Guilly, Petur Olsen, A. Ravn, Jesper Brix Rosenkilde, A. Skou","doi":"10.1109/PerComW.2013.6529570","DOIUrl":"https://doi.org/10.1109/PerComW.2013.6529570","url":null,"abstract":"Ambient Intelligence systems use many sensors and actuators, with a diversity of networks, protocols and technologies which makes it impossible to access the devices in a common manner. This paper presents the HomePort software, which provides an open source RESTful interface to heterogeneous sensor networks, allowing a simple unified access to virtually any kind of protocol using well known standards. HomePort includes means to provide event notification, as well as a tracing mechanism. The software is implemented and we report on initial experiments and provide an evaluation that shows the feasibility and scalability of the approach.","PeriodicalId":101502,"journal":{"name":"2013 IEEE International Conference on Pervasive Computing and Communications Workshops (PERCOM Workshops)","volume":"73 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115935243","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 : 2013-03-18DOI: 10.1109/PerComW.2013.6529480
M. Demirbas, Y. Yilmaz, Muhammed Fatih Bulut
Here we present our ubiquitous computing vision, Eywa. Eywa is an open publish-subscribe system that employs crowdsourcing for tasking and social networks & machine learning for identifying relevance. We argue that crowdsourcing (and the social networks and machine learning that enable it) should be a first class citizen in ubiquitous computing. We also observe that cloud computing is a natural platform to host such future ubiquitous computing systems. We discuss about some applications enabled by Eywa, and focus on our CuratedLiving application (which emphasizes “less choice more relevance” approach) as a case study.
{"title":"Eywa: Crowdsourced and cloudsourced omniscience","authors":"M. Demirbas, Y. Yilmaz, Muhammed Fatih Bulut","doi":"10.1109/PerComW.2013.6529480","DOIUrl":"https://doi.org/10.1109/PerComW.2013.6529480","url":null,"abstract":"Here we present our ubiquitous computing vision, Eywa. Eywa is an open publish-subscribe system that employs crowdsourcing for tasking and social networks & machine learning for identifying relevance. We argue that crowdsourcing (and the social networks and machine learning that enable it) should be a first class citizen in ubiquitous computing. We also observe that cloud computing is a natural platform to host such future ubiquitous computing systems. We discuss about some applications enabled by Eywa, and focus on our CuratedLiving application (which emphasizes “less choice more relevance” approach) as a case study.","PeriodicalId":101502,"journal":{"name":"2013 IEEE International Conference on Pervasive Computing and Communications Workshops (PERCOM Workshops)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130625797","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 : 2013-03-18DOI: 10.1109/PerComW.2013.6529462
Chien-Lung Hsu, Tzu-Wei Lin
In a single-server mobile network, authorized users can dynamically login to the server for requiring internet services or resources. A password authenticated key exchange protocol can be used to authenticate user's legitimacy and establish a secure communication between a user and his logon server by using his friendly memorized password. In generally, users can dynamically access internet resources and services from multiple servers via mobile networks. However, it is difficult for users and servers to easily and securely manage passwords and secret keys in multi-server mobile networks. This paper proposes a password authenticated key exchange protocol for multi-server mobile networks based on Chebyshev chaotic map. Properties of the proposed protocol are given below. (i) The user can easily memorize a single password to login different servers without the assistance of a trusted registration authority. (ii) The user can share distinct secret information with different servers, and hence a malicious server cannot use it to masquerade as the user to login the other server(s). (iii) It is secure against some potential attacks. (iv) An authenticated key shared between the user and the server can be established for securing their communications. (v) It can provide key confirmation for the shared session key. (vi) It can provide higher security assurance in generating secret keys.
{"title":"Password authenticated key exchange protocol for multi-server mobile networks based on Chebyshev chaotic map","authors":"Chien-Lung Hsu, Tzu-Wei Lin","doi":"10.1109/PerComW.2013.6529462","DOIUrl":"https://doi.org/10.1109/PerComW.2013.6529462","url":null,"abstract":"In a single-server mobile network, authorized users can dynamically login to the server for requiring internet services or resources. A password authenticated key exchange protocol can be used to authenticate user's legitimacy and establish a secure communication between a user and his logon server by using his friendly memorized password. In generally, users can dynamically access internet resources and services from multiple servers via mobile networks. However, it is difficult for users and servers to easily and securely manage passwords and secret keys in multi-server mobile networks. This paper proposes a password authenticated key exchange protocol for multi-server mobile networks based on Chebyshev chaotic map. Properties of the proposed protocol are given below. (i) The user can easily memorize a single password to login different servers without the assistance of a trusted registration authority. (ii) The user can share distinct secret information with different servers, and hence a malicious server cannot use it to masquerade as the user to login the other server(s). (iii) It is secure against some potential attacks. (iv) An authenticated key shared between the user and the server can be established for securing their communications. (v) It can provide key confirmation for the shared session key. (vi) It can provide higher security assurance in generating secret keys.","PeriodicalId":101502,"journal":{"name":"2013 IEEE International Conference on Pervasive Computing and Communications Workshops (PERCOM Workshops)","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117259082","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 : 2013-03-18DOI: 10.1109/PerComW.2013.6529512
N. Schnelle, S. Funke, Sabine Storandt
We propose a technique to distribute the workload of online route planners as offered for example by Bing/Google/Yahoo Maps, etc. among the clients requesting the routes. Our scheme not only increases the throughput of a server answering the requests of clients but also yields a simple way of providing some degree of privacy for the user. A prototype implementation of our system is available as an Android app in Google Play and on Github.
{"title":"DORC: Distributed online route computation - Higher throughput, more privacy","authors":"N. Schnelle, S. Funke, Sabine Storandt","doi":"10.1109/PerComW.2013.6529512","DOIUrl":"https://doi.org/10.1109/PerComW.2013.6529512","url":null,"abstract":"We propose a technique to distribute the workload of online route planners as offered for example by Bing/Google/Yahoo Maps, etc. among the clients requesting the routes. Our scheme not only increases the throughput of a server answering the requests of clients but also yields a simple way of providing some degree of privacy for the user. A prototype implementation of our system is available as an Android app in Google Play and on Github.","PeriodicalId":101502,"journal":{"name":"2013 IEEE International Conference on Pervasive Computing and Communications Workshops (PERCOM Workshops)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128661699","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 : 2013-03-18DOI: 10.1109/PerComW.2013.6529566
Amitangshu Pal, A. Nasipuri
We propose a joint channel selection and quality aware routing scheme for multi-channel wireless sensor networks to improve the network lifetime. A data collection traffic pattern is assumed, where all sensor nodes perform periodic sensing and forward data to a centralized base station (sink). The proposed scheme achieves improvement of the battery lifetime by reducing the energy consumed from overhearing and also by dynamically balancing the battery lifetimes of nodes. Performance evaluations are presented from experimental studies as well as from extensive simulation studies to show the effectiveness of the proposed scheme.
{"title":"DRCS: A Distributed Routing and Channel Selection scheme for multi-channel wireless sensor networks","authors":"Amitangshu Pal, A. Nasipuri","doi":"10.1109/PerComW.2013.6529566","DOIUrl":"https://doi.org/10.1109/PerComW.2013.6529566","url":null,"abstract":"We propose a joint channel selection and quality aware routing scheme for multi-channel wireless sensor networks to improve the network lifetime. A data collection traffic pattern is assumed, where all sensor nodes perform periodic sensing and forward data to a centralized base station (sink). The proposed scheme achieves improvement of the battery lifetime by reducing the energy consumed from overhearing and also by dynamically balancing the battery lifetimes of nodes. Performance evaluations are presented from experimental studies as well as from extensive simulation studies to show the effectiveness of the proposed scheme.","PeriodicalId":101502,"journal":{"name":"2013 IEEE International Conference on Pervasive Computing and Communications Workshops (PERCOM Workshops)","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125517820","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 : 2013-03-18DOI: 10.1109/PerComW.2013.6529487
M. Rossi, S. Feese, O. Amft, Nils Braune, S. Martis, G. Tröster
This paper presents design, implementation, and evaluation of AmbientSense, a real-time ambient sound recognition system on a smartphone. AmbientSense continuously recognizes user context by analyzing ambient sounds sampled from a smartphone's microphone. The phone provides a user with realtime feedback on recognised context. AmbientSense is implemented as an Android app and works in two modes: in autonomous mode processing is performed on the smartphone only. In server mode recognition is done by transmitting audio features to a server and receiving classification results back. We evaluated both modes in a set of 23 daily life ambient sound classes and describe recognition performance, phone CPU load, and recognition delay. The application runs with a fully charged battery up to 13.75 h on a Samsung Galaxy SII smartphone and up to 12.87 h on a Google Nexus One phone. Runtime and CPU load were similar for autonomous and server modes.
{"title":"AmbientSense: A real-time ambient sound recognition system for smartphones","authors":"M. Rossi, S. Feese, O. Amft, Nils Braune, S. Martis, G. Tröster","doi":"10.1109/PerComW.2013.6529487","DOIUrl":"https://doi.org/10.1109/PerComW.2013.6529487","url":null,"abstract":"This paper presents design, implementation, and evaluation of AmbientSense, a real-time ambient sound recognition system on a smartphone. AmbientSense continuously recognizes user context by analyzing ambient sounds sampled from a smartphone's microphone. The phone provides a user with realtime feedback on recognised context. AmbientSense is implemented as an Android app and works in two modes: in autonomous mode processing is performed on the smartphone only. In server mode recognition is done by transmitting audio features to a server and receiving classification results back. We evaluated both modes in a set of 23 daily life ambient sound classes and describe recognition performance, phone CPU load, and recognition delay. The application runs with a fully charged battery up to 13.75 h on a Samsung Galaxy SII smartphone and up to 12.87 h on a Google Nexus One phone. Runtime and CPU load were similar for autonomous and server modes.","PeriodicalId":101502,"journal":{"name":"2013 IEEE International Conference on Pervasive Computing and Communications Workshops (PERCOM Workshops)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129189012","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 : 2013-03-18DOI: 10.1109/PerComW.2013.6529475
Marcos Roriz, Marco Aurelio Lino Massarani, L. A. Freitas, R. Rocha, F. Costa
Current sharing-based applications combine new computing devices with smart spaces to provide content-level ubiquity, i.e., the possibility to exchange and move content freely in a ubiquitous environment. However, due to the environment complexity and lack of infrastructure platforms, most of the work in the area is repeatedly built from scratch using raw techniques, such as socket and rpc, to express content sharing. Aiming to provide an infrastructure for the development of this kind of applications, we propose Content Sharing for Smart Spaces (C3S), a middleware that offers a high-level programming model using primitives that are based on a set of content sharing semantics. They express a set of behaviors, move, clone, and mirror, which serve as a building blocks for developers to implement sharing and content ubiquity features.
{"title":"C3S: A content sharing middleware for smart spaces","authors":"Marcos Roriz, Marco Aurelio Lino Massarani, L. A. Freitas, R. Rocha, F. Costa","doi":"10.1109/PerComW.2013.6529475","DOIUrl":"https://doi.org/10.1109/PerComW.2013.6529475","url":null,"abstract":"Current sharing-based applications combine new computing devices with smart spaces to provide content-level ubiquity, i.e., the possibility to exchange and move content freely in a ubiquitous environment. However, due to the environment complexity and lack of infrastructure platforms, most of the work in the area is repeatedly built from scratch using raw techniques, such as socket and rpc, to express content sharing. Aiming to provide an infrastructure for the development of this kind of applications, we propose Content Sharing for Smart Spaces (C3S), a middleware that offers a high-level programming model using primitives that are based on a set of content sharing semantics. They express a set of behaviors, move, clone, and mirror, which serve as a building blocks for developers to implement sharing and content ubiquity features.","PeriodicalId":101502,"journal":{"name":"2013 IEEE International Conference on Pervasive Computing and Communications Workshops (PERCOM Workshops)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127693918","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 : 2013-03-18DOI: 10.1109/PerComW.2013.6529471
Marc-Oliver Pahl, G. Carle
With the Virtual State Layer (VSL), an abstraction for software-based orchestration of smart spaces is presented. The aim of the VSL is to ease the programming of orchestration software while not limiting its functionality. The VSL primarily provides: the virtualization of that part of the real world that can be orchestrated via sensors and actuators, a base for the creation of portable orchestration services, mechanisms to easily couple services, and the availability of state over time. The VSL approach is conceptually situated between ontology-based systems and protocol-translating systems for orchestrating smart spaces. The concept and its implementation - a Java-based distributed P2P publish-subscribe system - are presented.
{"title":"The missing layer — Virtualizing smart spaces","authors":"Marc-Oliver Pahl, G. Carle","doi":"10.1109/PerComW.2013.6529471","DOIUrl":"https://doi.org/10.1109/PerComW.2013.6529471","url":null,"abstract":"With the Virtual State Layer (VSL), an abstraction for software-based orchestration of smart spaces is presented. The aim of the VSL is to ease the programming of orchestration software while not limiting its functionality. The VSL primarily provides: the virtualization of that part of the real world that can be orchestrated via sensors and actuators, a base for the creation of portable orchestration services, mechanisms to easily couple services, and the availability of state over time. The VSL approach is conceptually situated between ontology-based systems and protocol-translating systems for orchestrating smart spaces. The concept and its implementation - a Java-based distributed P2P publish-subscribe system - are presented.","PeriodicalId":101502,"journal":{"name":"2013 IEEE International Conference on Pervasive Computing and Communications Workshops (PERCOM Workshops)","volume":"74 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116364289","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 : 2013-03-18DOI: 10.1109/PerComW.2013.6529514
Kai Dong, Tao Gu, Xianping Tao, Jian Lu
The emerging location based services have brought forth a privacy risk where users expose their location information. Most of the existing solutions preserve location privacy relying on a trusted anonymizer, which may not exist in real situation. Several peer-to-peer approaches are proposed, but these techniques require large-scale data storage and communication, and they cannot provide up-to-date context information to users. To address this issue, we propose a novel method JointCache to preserve location privacy by confusing nearby users' paths. Using this technique, users do not need to buffer context information of a large area and they only need to transfer little information to each other for cooperation. We use simulation to compare JointCache with the traditional path confusion, the results show that our technique solves the same place same time problem, and achieves higher anonymity even in a low user density situation.
{"title":"JointCache: Collaborative path confusion through lightweight P2P communication","authors":"Kai Dong, Tao Gu, Xianping Tao, Jian Lu","doi":"10.1109/PerComW.2013.6529514","DOIUrl":"https://doi.org/10.1109/PerComW.2013.6529514","url":null,"abstract":"The emerging location based services have brought forth a privacy risk where users expose their location information. Most of the existing solutions preserve location privacy relying on a trusted anonymizer, which may not exist in real situation. Several peer-to-peer approaches are proposed, but these techniques require large-scale data storage and communication, and they cannot provide up-to-date context information to users. To address this issue, we propose a novel method JointCache to preserve location privacy by confusing nearby users' paths. Using this technique, users do not need to buffer context information of a large area and they only need to transfer little information to each other for cooperation. We use simulation to compare JointCache with the traditional path confusion, the results show that our technique solves the same place same time problem, and achieves higher anonymity even in a low user density situation.","PeriodicalId":101502,"journal":{"name":"2013 IEEE International Conference on Pervasive Computing and Communications Workshops (PERCOM Workshops)","volume":"09 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123797169","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 : 2013-03-18DOI: 10.1109/PerComW.2013.6529529
Chien-Ming Cheng
With advances in information and communication technologies, vehicles on roads can cooperatively share and retrieve information in a distributed manner to support Intelligent Transportation Systems (ITS) services such as traffic management and infotainment services. A system is needed to retrieve information and data from moving vehicles and roadside facilities in an efficient manner. However, existing distributed vehicular systems rely on either vehicular ad hoc networks (VANETs) or application-layer peer-to-peer (P2P) protocols over an infrastructure-based wireless network suffering from low success rate or long latency in information retrieval. In this work, we propose a two-tier VANET/P2P system that integrates low-tier VANETs and a high-tier infrastructure-based P2P overlay. The proposed two-tier system aims to achieve high success rate, reduce latency, and minimize overhead for information retrieval in vehicular environments.
{"title":"A two-tier VANET/P2P system for information retrieval in vehicular environments","authors":"Chien-Ming Cheng","doi":"10.1109/PerComW.2013.6529529","DOIUrl":"https://doi.org/10.1109/PerComW.2013.6529529","url":null,"abstract":"With advances in information and communication technologies, vehicles on roads can cooperatively share and retrieve information in a distributed manner to support Intelligent Transportation Systems (ITS) services such as traffic management and infotainment services. A system is needed to retrieve information and data from moving vehicles and roadside facilities in an efficient manner. However, existing distributed vehicular systems rely on either vehicular ad hoc networks (VANETs) or application-layer peer-to-peer (P2P) protocols over an infrastructure-based wireless network suffering from low success rate or long latency in information retrieval. In this work, we propose a two-tier VANET/P2P system that integrates low-tier VANETs and a high-tier infrastructure-based P2P overlay. The proposed two-tier system aims to achieve high success rate, reduce latency, and minimize overhead for information retrieval in vehicular environments.","PeriodicalId":101502,"journal":{"name":"2013 IEEE International Conference on Pervasive Computing and Communications Workshops (PERCOM Workshops)","volume":"74 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127363572","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
扫码关注我们
求助内容：
应助结果提醒方式：