Pub Date : 2013-03-18DOI: 10.1109/PerComW.2013.6529560
Wafa Ben Jaballah, M. Mosbah, H. Youssef
Broadcast source authentication is a critical security service in wireless sensor networks which is still in its infancy. This service allows senders to broadcast messages to multiple receivers in a secure way. This paper evaluates the integration of staggered authentication in multi-level μTesla source authentication protocol called staggered multilevel μTesla. These two protocols are evaluated in terms of authentication delay, authentication probability, number of forged packets in the receiver's buffer, delay of forged packets in the receiver's buffer, memory, and energy consumption overhead. Simulation results show that these two protocols introduce negligible overhead without impeding the system performance. Moreover, staggered multi-level μTesla achieves better performance compared to multi-level μTesla, when reducing the average number and the delay of forged packets in the receiver's buffer.
{"title":"Performance evaluation of key disclosure delay-based schemes in wireless sensor networks","authors":"Wafa Ben Jaballah, M. Mosbah, H. Youssef","doi":"10.1109/PerComW.2013.6529560","DOIUrl":"https://doi.org/10.1109/PerComW.2013.6529560","url":null,"abstract":"Broadcast source authentication is a critical security service in wireless sensor networks which is still in its infancy. This service allows senders to broadcast messages to multiple receivers in a secure way. This paper evaluates the integration of staggered authentication in multi-level μTesla source authentication protocol called staggered multilevel μTesla. These two protocols are evaluated in terms of authentication delay, authentication probability, number of forged packets in the receiver's buffer, delay of forged packets in the receiver's buffer, memory, and energy consumption overhead. Simulation results show that these two protocols introduce negligible overhead without impeding the system performance. Moreover, staggered multi-level μTesla achieves better performance compared to multi-level μTesla, when reducing the average number and the delay of forged packets in the receiver's buffer.","PeriodicalId":101502,"journal":{"name":"2013 IEEE International Conference on Pervasive Computing and Communications Workshops (PERCOM Workshops)","volume":"37 3","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121005979","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.6529472
Honguk Woo, Hongsoo Kim, Kyusik Kim, Dongkyoung Kim
In this paper, we present a scalable presence network architecture for emerging pervasive social applications in which the interaction of not only people but surrounding physical objects seamlessly occurs. The architecture combines the server-based messaging and the peer-to-peer communication schemes, thereby rendering itself deployable at the large scale beyond social networks so as to incorporate a sheer number of embedded devices in a ubiquitous environment.
{"title":"A large scale presence network for pervasive social computing","authors":"Honguk Woo, Hongsoo Kim, Kyusik Kim, Dongkyoung Kim","doi":"10.1109/PerComW.2013.6529472","DOIUrl":"https://doi.org/10.1109/PerComW.2013.6529472","url":null,"abstract":"In this paper, we present a scalable presence network architecture for emerging pervasive social applications in which the interaction of not only people but surrounding physical objects seamlessly occurs. The architecture combines the server-based messaging and the peer-to-peer communication schemes, thereby rendering itself deployable at the large scale beyond social networks so as to incorporate a sheer number of embedded devices in a ubiquitous environment.","PeriodicalId":101502,"journal":{"name":"2013 IEEE International Conference on Pervasive Computing and Communications Workshops (PERCOM Workshops)","volume":"28 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":"121753184","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.6529548
Kisung Lee, R. Ganti, M. Srivatsa, P. Mohapatra
Spatio-temporal attributes represent two aspects of physical presence - space and time - which are integral to human activities. Space-time markers of an entity in conjunction with correlation with other networks such as movements in social network, the road/transportation network encodes a wealth of provenance information. With the advent of mobile computing and cheap and improved location estimation techniques, encoding such information has become commonplace. In this paper, we will focus on deriving such location provenance information from unstructured text generated by social media. As social media such as Facebook and Twitter are integrated with mobile devices, information generated by individuals in these networks gets tagged with spatial markers. We can classify such markers into explicit and implicit tags, where explicit tags encode the spatial data explicitly by providing the accurate location attributes. On the other hand, a lot of social network data may not encode such information explicitly. Our hypothesis in this paper is that the unstructured textual data contains implicit spatial markers at a fine granularity. We develop algorithms to support this hypothesis and evaluate these algorithms on data from FourSquare to show that the spatial category information can be identified with an accuracy of over 80%.
{"title":"Spatio-temporal provenance: Identifying location information from unstructured text","authors":"Kisung Lee, R. Ganti, M. Srivatsa, P. Mohapatra","doi":"10.1109/PerComW.2013.6529548","DOIUrl":"https://doi.org/10.1109/PerComW.2013.6529548","url":null,"abstract":"Spatio-temporal attributes represent two aspects of physical presence - space and time - which are integral to human activities. Space-time markers of an entity in conjunction with correlation with other networks such as movements in social network, the road/transportation network encodes a wealth of provenance information. With the advent of mobile computing and cheap and improved location estimation techniques, encoding such information has become commonplace. In this paper, we will focus on deriving such location provenance information from unstructured text generated by social media. As social media such as Facebook and Twitter are integrated with mobile devices, information generated by individuals in these networks gets tagged with spatial markers. We can classify such markers into explicit and implicit tags, where explicit tags encode the spatial data explicitly by providing the accurate location attributes. On the other hand, a lot of social network data may not encode such information explicitly. Our hypothesis in this paper is that the unstructured textual data contains implicit spatial markers at a fine granularity. We develop algorithms to support this hypothesis and evaluate these algorithms on data from FourSquare to show that the spatial category information can be identified with an accuracy of over 80%.","PeriodicalId":101502,"journal":{"name":"2013 IEEE International Conference on Pervasive Computing and Communications Workshops (PERCOM Workshops)","volume":"1 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":"124649174","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.6529496
K. Mano, Kazuhiro Minami, H. Maruyama
As smart phones with a GPS receiver have been becoming popular recently, many people have realized the issue of protecting their location privacy. Previous research on location privacy mainly focuses on anonymization techniques for removing identifiable information from users' location traces. Although anonymized location data is useful to many applications, such as traffic monitoring, we can provide a new class of location-based services by utilizing path information of mobile users. In this paper, we present a dynamic pseudonym scheme for constructing alternate possible paths of mobile users to protect their location privacy. We introduce a formal definition of location privacy for pseudonym-based location data sets and show an efficient verification algorithm for determining whether each user in a given location data set has sufficient number of possible paths to disguise the user's true movements.
{"title":"Protecting location privacy with k-confusing paths based on dynamic pseudonyms","authors":"K. Mano, Kazuhiro Minami, H. Maruyama","doi":"10.1109/PerComW.2013.6529496","DOIUrl":"https://doi.org/10.1109/PerComW.2013.6529496","url":null,"abstract":"As smart phones with a GPS receiver have been becoming popular recently, many people have realized the issue of protecting their location privacy. Previous research on location privacy mainly focuses on anonymization techniques for removing identifiable information from users' location traces. Although anonymized location data is useful to many applications, such as traffic monitoring, we can provide a new class of location-based services by utilizing path information of mobile users. In this paper, we present a dynamic pseudonym scheme for constructing alternate possible paths of mobile users to protect their location privacy. We introduce a formal definition of location privacy for pseudonym-based location data sets and show an efficient verification algorithm for determining whether each user in a given location data set has sufficient number of possible paths to disguise the user's true movements.","PeriodicalId":101502,"journal":{"name":"2013 IEEE International Conference on Pervasive Computing and Communications Workshops (PERCOM Workshops)","volume":"148 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":"116532584","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.6529562
A. Reinhardt, D. Reinhardt, R. Steinmetz
Energy is a scarce resource on battery-powered wireless sensor nodes, and wireless communication represents the major consumer of electric energy on most current platforms. Reducing the number and size of radio transmissions thus represents a viable approach to save energy and extend a node's operational time. In the domain of pervasive computing, where a periodic reporting of data (e.g., a user's vital parameters) is often being used, packets cannot always be simply omitted from transmission. Even if the contained data have not changed, these periodically transmitted message double as beacons to indicate that the sensor node has not run out of energy. Hence, reducing the sizes of transmitted messages remains the only available solution to achieve energy savings in such sensor networks. In this paper, we show how precomputed codebooks can be used to encode messages in an energy-efficient way and thus reduce the size of the transmitted packets. We present how we extract these code mappings from real-world data, and describe how packets are encoded prior to their transmission in order to reduce the incurred energy demand. We practically assess the energy demand on TelosB nodes and prove that up to 17.2% of energy can be saved when our approach is applied.
{"title":"Pre-allocating code mappings for energy-efficient data encoding in Wireless Sensor Networks","authors":"A. Reinhardt, D. Reinhardt, R. Steinmetz","doi":"10.1109/PerComW.2013.6529562","DOIUrl":"https://doi.org/10.1109/PerComW.2013.6529562","url":null,"abstract":"Energy is a scarce resource on battery-powered wireless sensor nodes, and wireless communication represents the major consumer of electric energy on most current platforms. Reducing the number and size of radio transmissions thus represents a viable approach to save energy and extend a node's operational time. In the domain of pervasive computing, where a periodic reporting of data (e.g., a user's vital parameters) is often being used, packets cannot always be simply omitted from transmission. Even if the contained data have not changed, these periodically transmitted message double as beacons to indicate that the sensor node has not run out of energy. Hence, reducing the sizes of transmitted messages remains the only available solution to achieve energy savings in such sensor networks. In this paper, we show how precomputed codebooks can be used to encode messages in an energy-efficient way and thus reduce the size of the transmitted packets. We present how we extract these code mappings from real-world data, and describe how packets are encoded prior to their transmission in order to reduce the incurred energy demand. We practically assess the energy demand on TelosB nodes and prove that up to 17.2% of energy can be saved when our approach is applied.","PeriodicalId":101502,"journal":{"name":"2013 IEEE International Conference on Pervasive Computing and Communications Workshops (PERCOM Workshops)","volume":"485 ","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120881671","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.6529541
Brendan Juba
We give an overview of a theory of semantic communication proposed by Goldreich, Juba, and Sudan. The theory is intended to capture the obstacles that arise when a diverse population of independently designed devices must communicate with one another. The aim of the theory is to provide conceptual foundations for the design and evaluation of devices that are compatible with such a diverse population. Conclusions drawn from the theory (i) identify a kind of information-sensing that is inherently necessary for compatibility whenever the population is sufficiently diverse and (ii) identify tensions between the richness of diversity and the computational cost of coping with such diversity in a population. We will review how these considerations are reflected in the formulation and design of an example application, a self-patching packet network stack. In particular, this application will illustrate the utility of explicit consideration of various computational complexity measures in addressing both (i) and (ii). We will also review work aimed at identifying kinds of populations across which compatibility can be achieved efficiently.
{"title":"Compatibility among diversity Foundations, lessons, and directions of semantic communication","authors":"Brendan Juba","doi":"10.1109/PerComW.2013.6529541","DOIUrl":"https://doi.org/10.1109/PerComW.2013.6529541","url":null,"abstract":"We give an overview of a theory of semantic communication proposed by Goldreich, Juba, and Sudan. The theory is intended to capture the obstacles that arise when a diverse population of independently designed devices must communicate with one another. The aim of the theory is to provide conceptual foundations for the design and evaluation of devices that are compatible with such a diverse population. Conclusions drawn from the theory (i) identify a kind of information-sensing that is inherently necessary for compatibility whenever the population is sufficiently diverse and (ii) identify tensions between the richness of diversity and the computational cost of coping with such diversity in a population. We will review how these considerations are reflected in the formulation and design of an example application, a self-patching packet network stack. In particular, this application will illustrate the utility of explicit consideration of various computational complexity measures in addressing both (i) and (ii). We will also review work aimed at identifying kinds of populations across which compatibility can be achieved efficiently.","PeriodicalId":101502,"journal":{"name":"2013 IEEE International Conference on Pervasive Computing and Communications Workshops (PERCOM Workshops)","volume":"10 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":"131995477","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.6529568
Piotr Kamisinski, V. Goebel, T. Plagemann
Sensor nodes and complex event processing (CEP) are important and powerful means for gathering data and detecting phenomena of interest in mission-critical pervasive systems, e.g. for emergency and rescue operations. However, the dynamic network does not allow using centralized CEP. To address this issue, we present a component-based distributed CEP middleware. Its main goal is easy reconfigurability to different mobility scenarios. This is achieved by providing an extensible collection of algorithms that are tailored for specific scenarios. The middleware makes it possible to select on demand the algorithms that are most suitable for the current scenario. Our evaluation shows that the middleware works in a broad spectrum of mobility scenarios. We also investigate the trade-off between efficiency and reliability of distributed CEP.
{"title":"A reconfigurable distributed CEP middleware for diverse mobility scenarios","authors":"Piotr Kamisinski, V. Goebel, T. Plagemann","doi":"10.1109/PerComW.2013.6529568","DOIUrl":"https://doi.org/10.1109/PerComW.2013.6529568","url":null,"abstract":"Sensor nodes and complex event processing (CEP) are important and powerful means for gathering data and detecting phenomena of interest in mission-critical pervasive systems, e.g. for emergency and rescue operations. However, the dynamic network does not allow using centralized CEP. To address this issue, we present a component-based distributed CEP middleware. Its main goal is easy reconfigurability to different mobility scenarios. This is achieved by providing an extensible collection of algorithms that are tailored for specific scenarios. The middleware makes it possible to select on demand the algorithms that are most suitable for the current scenario. Our evaluation shows that the middleware works in a broad spectrum of mobility scenarios. We also investigate the trade-off between efficiency and reliability of distributed CEP.","PeriodicalId":101502,"journal":{"name":"2013 IEEE International Conference on Pervasive Computing and Communications Workshops (PERCOM Workshops)","volume":"8 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":"114141552","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.6529569
Yu Lu, L. Wong
The rapid advancement in context-aware computing techniques greatly facilitates capturing the context information of the Internet clients, which can be utilized by the Internet services and applications to manage different network resources. Based on the built context-aware system and the deduced highly abstract context information, we propose a resource distribution framework that incentivizes context sharing and moderate competition among the selfish but rational Internet clients. Under the proposed framework, the Internet client, which provides its both negative and positive context, can be assigned to the prioritized class and accordingly receive more resources from the resource owner. Meanwhile, all the clients are motivated by the framework to compete moderately and the aggressive ones are penalized by receiving fewer resources. The Web system exemplar is used to aid understanding of our motivation. We further model the resource distribution process as a non-cooperative game and accordingly provide the theoretical insight of the proposed framework.
{"title":"Towards context-aware internet services with unselfish clients","authors":"Yu Lu, L. Wong","doi":"10.1109/PerComW.2013.6529569","DOIUrl":"https://doi.org/10.1109/PerComW.2013.6529569","url":null,"abstract":"The rapid advancement in context-aware computing techniques greatly facilitates capturing the context information of the Internet clients, which can be utilized by the Internet services and applications to manage different network resources. Based on the built context-aware system and the deduced highly abstract context information, we propose a resource distribution framework that incentivizes context sharing and moderate competition among the selfish but rational Internet clients. Under the proposed framework, the Internet client, which provides its both negative and positive context, can be assigned to the prioritized class and accordingly receive more resources from the resource owner. Meanwhile, all the clients are motivated by the framework to compete moderately and the aggressive ones are penalized by receiving fewer resources. The Web system exemplar is used to aid understanding of our motivation. We further model the resource distribution process as a non-cooperative game and accordingly provide the theoretical insight of the proposed framework.","PeriodicalId":101502,"journal":{"name":"2013 IEEE International Conference on Pervasive Computing and Communications Workshops (PERCOM Workshops)","volume":"34 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":"114301286","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.6529465
T. Tsunoda, A. Fujii, N. Fujino
UPnP is a networking protocol that allows devices embracing personal computers, smartphones and tablet computers to discover other devices and control their services. Using portable smart devices, the UPnP services needed by these devices often vary. According to the locations or the situations of users, the required roles of the devices that support users' activities change and the services needed for achieving the roles also vary. However, it is difficult to dynamically add or update UPnP services and change the roles of the devices. We propose a new dynamic update method of UPnP services in this paper. `Service-updater service', one of UPnP services, is utilized in this method, which can update other UPnP services of its own device. Users do not have to install many services manually in advance. In addition, applying our method, it is also possible for smart devices to change their roles; according to users' situations, the devices can be turned into UPnP controllers, which control UPnP services of other devices. We have developed a prototype to which this method is applied and we have confirmed through the experiment that this technique effectively supports users' activities.
{"title":"Dynamically updatable UPnP service for device role management","authors":"T. Tsunoda, A. Fujii, N. Fujino","doi":"10.1109/PerComW.2013.6529465","DOIUrl":"https://doi.org/10.1109/PerComW.2013.6529465","url":null,"abstract":"UPnP is a networking protocol that allows devices embracing personal computers, smartphones and tablet computers to discover other devices and control their services. Using portable smart devices, the UPnP services needed by these devices often vary. According to the locations or the situations of users, the required roles of the devices that support users' activities change and the services needed for achieving the roles also vary. However, it is difficult to dynamically add or update UPnP services and change the roles of the devices. We propose a new dynamic update method of UPnP services in this paper. `Service-updater service', one of UPnP services, is utilized in this method, which can update other UPnP services of its own device. Users do not have to install many services manually in advance. In addition, applying our method, it is also possible for smart devices to change their roles; according to users' situations, the devices can be turned into UPnP controllers, which control UPnP services of other devices. We have developed a prototype to which this method is applied and we have confirmed through the experiment that this technique effectively supports users' activities.","PeriodicalId":101502,"journal":{"name":"2013 IEEE International Conference on Pervasive Computing and Communications Workshops (PERCOM Workshops)","volume":"9 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":"116267686","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.6529522
S. Bendel, T. Springer, Daniel Schuster, A. Schill, R. Ackermann, M. Ameling
Following the vision of an Internet of Things (IoT) real world objects are integrated into the Internet to provide data as sensors and to manipulate the real world as actors. While current IoT approaches focus on the integration of things based on service technologies, scenarios in domains like smart cities, automotive or crisis management require service platforms involving real world objects, backend-systems and mobile devices. In this paper we introduce a service platform based on the Extensible Messaging and Presence Protocol (XMPP) for the development and provision of services for such pervasive infrastructures. We argue for XMPP as protocol for unified, real-time communication and introduce the major concepts of our platform. Based on two case studies we demonstrate real-time capabilities of XMPP for remote robot control and service development in the e-mobility domain.
{"title":"A service infrastructure for the Internet of Things based on XMPP","authors":"S. Bendel, T. Springer, Daniel Schuster, A. Schill, R. Ackermann, M. Ameling","doi":"10.1109/PerComW.2013.6529522","DOIUrl":"https://doi.org/10.1109/PerComW.2013.6529522","url":null,"abstract":"Following the vision of an Internet of Things (IoT) real world objects are integrated into the Internet to provide data as sensors and to manipulate the real world as actors. While current IoT approaches focus on the integration of things based on service technologies, scenarios in domains like smart cities, automotive or crisis management require service platforms involving real world objects, backend-systems and mobile devices. In this paper we introduce a service platform based on the Extensible Messaging and Presence Protocol (XMPP) for the development and provision of services for such pervasive infrastructures. We argue for XMPP as protocol for unified, real-time communication and introduce the major concepts of our platform. Based on two case studies we demonstrate real-time capabilities of XMPP for remote robot control and service development in the e-mobility domain.","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":"124351669","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
扫码关注我们
求助内容：
应助结果提醒方式：