David Evans, A. Beresford, T. Burbridge, A. Soppera
{"title":"Context-Derived Pseudonyms for Protection of Privacy in Transport Middleware and Applications","authors":"David Evans, A. Beresford, T. Burbridge, A. Soppera","doi":"10.1109/PERCOMW.2007.31","DOIUrl":"https://doi.org/10.1109/PERCOMW.2007.31","url":null,"abstract":"This paper outlines why context-aware transport applications necessarily record information about people and describes how we can use anonymity techniques to minimise the resulting invasion of privacy. In particular we: (i) describe how to generate unlinkable personal pseudonyms; (ii) describe a method of creating group pseudonyms (an opaque pseudonym representing several individuals); and (iii) describe how to store these pseudonyms safely in a database. We go on to present two sample transport applications which utilise our technique and suggest areas for future work","PeriodicalId":352348,"journal":{"name":"Fifth Annual IEEE International Conference on Pervasive Computing and Communications Workshops (PerComW'07)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-03-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123486785","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}
{"title":"Data Quality and Query Cost in Wireless Sensor Networks","authors":"D. Yates, E. Nahum, J. Kurose, P. Shenoy","doi":"10.1109/PERCOMW.2007.35","DOIUrl":"https://doi.org/10.1109/PERCOMW.2007.35","url":null,"abstract":"This research is motivated by emerging, real-world wireless sensor network applications for monitoring and control. We examine the benefits and costs of caching data for such applications. We propose and evaluate several approaches to querying for, and then caching data in a sensor field data server. We show that for some application requirements (i.e., when delay drives data quality), policies that emulate cache hits by computing and returning approximate values for sensor data yield a simultaneous quality improvement and cost savings. This win-win is because when system delay is sufficiently important, the benefit to both query cost and data quality achieved by using approximate values outweighs the negative impact on quality due to the approximation. In contrast, when data accuracy drives quality, a linear trade-off between query cost and data quality emerges. We also identify caching and lookup policies for which the sensor field query rate is bounded when servicing an arbitrary workload of user queries. This upper bound is achieved by having multiple user queries share the cost of a sensor field query. Finally, we demonstrate that our results are robust to the manner in which the environment being monitored changes using two different sensor field models","PeriodicalId":352348,"journal":{"name":"Fifth Annual IEEE International Conference on Pervasive Computing and Communications Workshops (PerComW'07)","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-03-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122667635","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}
{"title":"A State-Based Programming Model and System for Wireless Sensor Networks","authors":"Urs Bischoff, Gerd Kortuem","doi":"10.1109/PERCOMW.2007.14","DOIUrl":"https://doi.org/10.1109/PERCOMW.2007.14","url":null,"abstract":"Sensor networks are one important building block towards the realisation of context-aware applications. Suitable communication protocols and middleware solutions are necessary to facilitate the development of sensor network applications. Additionally, the vast number of nodes in sensor networks necessitates a new programming model for application developers. Commonly used programming abstractions force the programmer to express the global behaviour of a network in terms of local actions taken at individual nodes. We argue that global programming abstractions are needed to express global behaviour of a network. We present RuleCaster, a novel state-based programming framework for sensor network applications. RuleCaster provides a high-level language for application definition, a compiler that splits the high-level specification into individual tasks and assigns them to the nodes, and a service-based middleware that provides the interface for collaborative execution of these tasks","PeriodicalId":352348,"journal":{"name":"Fifth Annual IEEE International Conference on Pervasive Computing and Communications Workshops (PerComW'07)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-03-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129094145","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}
{"title":"A Context Middleware Based on Sensor and RFID Information","authors":"T. López, Daeyoung Kim","doi":"10.1109/PERCOMW.2007.4","DOIUrl":"https://doi.org/10.1109/PERCOMW.2007.4","url":null,"abstract":"Pervasive computing environments have traditionally used distributed sensors to gather user context. EPC (electronic product code) information extracted from RFID tags could additionally provide identification information associated with that context. However, the process of matching sensor and RFID information around the same context is not a trivial task. In our previous work, we proposed to move the sensors to the same objects that carry the RFID tags. By providing association capabilities among those objects using their EPCs, we can effectively build user and object context information while maintaining a global context identity. In this paper we analyze how the use of the EPC network could greatly benefit our framework by providing the means for extracting, organizing and querying the context data. Additionally, we outline how services can be offered to the context data producers and how they can be built in a pervasive manner by linking them directly to the EPC network infrastructure.","PeriodicalId":352348,"journal":{"name":"Fifth Annual IEEE International Conference on Pervasive Computing and Communications Workshops (PerComW'07)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-03-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129161120","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}
{"title":"A Testing Methodology for a MANET Routing Protocol Using a Node Self-Similarity Approach","authors":"C. Grepet, S. Maag","doi":"10.1109/PERCOMW.2007.16","DOIUrl":"https://doi.org/10.1109/PERCOMW.2007.16","url":null,"abstract":"In this paper we present a new approach to test the conformance of a wireless ad hoc routing protocol. This approach is based on a formal specification of the DSR protocol described by using the SDL language. Test scenarii are automatically generated by a tool developed in our laboratory and a method enabling to execute them on an implementation into a real network is illustrated. The concept of self-similarity is presented to reduce by combination the number of nodes in a network enabling to execute the test scenarii in defining a relationship between the network and specification topologies","PeriodicalId":352348,"journal":{"name":"Fifth Annual IEEE International Conference on Pervasive Computing and Communications Workshops (PerComW'07)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-03-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132425812","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}
C. Nino, J. Marques, D. Barbosa, C. Geyer, J. Barbosa, Iara Augustin
{"title":"Context-Aware Model in a Ubiquitous Learning Environment","authors":"C. Nino, J. Marques, D. Barbosa, C. Geyer, J. Barbosa, Iara Augustin","doi":"10.1109/PERCOMW.2007.30","DOIUrl":"https://doi.org/10.1109/PERCOMW.2007.30","url":null,"abstract":"The idea of ubiquitous learning is to create a network of devices, people and situation that allows learning experiences to play out. This idea is attractive but it is not easily implemented. The GlobalEdu is a ubiquitous learning architecture integrated in ISAM, a software architecture that manages a large-scale pervasive environment. This paper presents a context-aware model implemented in GlobalEdu. Especially, we present the context management educational service and its interface with a pedagogical agent. A scenario application will be present too","PeriodicalId":352348,"journal":{"name":"Fifth Annual IEEE International Conference on Pervasive Computing and Communications Workshops (PerComW'07)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-03-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134031393","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}
{"title":"On Mobile Sink Node for Target Tracking in Wireless Sensor Networks","authors":"Thanh Hai Trinh, H. Youn","doi":"10.1109/PERCOMW.2007.86","DOIUrl":"https://doi.org/10.1109/PERCOMW.2007.86","url":null,"abstract":"Energy efficiency is an important factor in the design of wireless sensor networks. The sensor nodes around the sink node in the network forward the data received from all other nodes to the sink, and thus deplete their energy very quickly. In this paper we propose a scheme which adopts a mobile sink for target tracking applications to maximize the network lifetime. Using the sensed information the sink moves toward the target for reducing the communication cost. Computer simulation shows that the proposed scheme can significantly prolong the network lifetime compared to the earlier schemes where the sink node is fixed or randomly moved","PeriodicalId":352348,"journal":{"name":"Fifth Annual IEEE International Conference on Pervasive Computing and Communications Workshops (PerComW'07)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-03-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126471766","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}
{"title":"Primary-Context Model and Ontology: A Combined Approach for Pervasive Transportation Services","authors":"Deirdre Lee, R. Meier","doi":"10.1109/PERCOMW.2007.95","DOIUrl":"https://doi.org/10.1109/PERCOMW.2007.95","url":null,"abstract":"Advanced pervasive transportation services aim to improve the safety and efficiency of public and private transportation facilities, while reducing operating costs and improving the travel experience for drivers, passengers and other travellers. In order to achieve these goals, such services require access to context information from a myriad of distributed, heterogeneous intelligent transportation systems. A context management scheme that models information in a standard fashion is essential to support information sharing between individual systems, and higher-level information reasoning. This paper presents an ontology-based spatial context model, which takes a combined approach to modelling context information utilised by pervasive transportation services: the primary-context model facilitates interoperation across independent intelligent transportation systems, whereas the primary-context ontology enables pervasive transportation services to reason about shared context information and to react accordingly. The independently defined, distributed information is correlated based on its primary-context: location, time, identity, and quality of service. The primary-context model and ontology have been evaluated by modelling a car park system for a smart parking space locator service","PeriodicalId":352348,"journal":{"name":"Fifth Annual IEEE International Conference on Pervasive Computing and Communications Workshops (PerComW'07)","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-03-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128943554","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}
{"title":"Unlinkability and Real World Constraints in RFID Systems","authors":"Yasunobu Nohara, Sozo Inoue, H. Yasuura","doi":"10.1109/PERCOMW.2007.122","DOIUrl":"https://doi.org/10.1109/PERCOMW.2007.122","url":null,"abstract":"Unlinkability, the property that prevents an adversary recognizing whether outputs are from the same user, is an important concept in RFID. There are many proposed schemes that provide unlinkability, however most of the schemes don't consider constraints of the real world. In this paper, we discuss the unlinkability and the real world constraints in RFID systems, and simulate the attack by an adversary. The simulation results show the real world constraints have possibility that break the unlinkability. We also analyze the simulation results from three viewpoints","PeriodicalId":352348,"journal":{"name":"Fifth Annual IEEE International Conference on Pervasive Computing and Communications Workshops (PerComW'07)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-03-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114869564","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}
{"title":"Tork: A Variable-Hop Overlay for Heterogeneous Networks","authors":"A. Brown, J. Buford, M. Kolberg","doi":"10.1109/PERCOMW.2007.117","DOIUrl":"https://doi.org/10.1109/PERCOMW.2007.117","url":null,"abstract":"We present a new variable-hop peer-to-peer overlay that combines active stabilization and opportunistic maintenance to provide overlay nodes with a large range of hop-count versus peer bandwidth capabilities. Because of the variable-hop design, Tork is suitable for use in large-scale heterogeneous peer-to-peer networks where peers have a range of bandwidth capacities. For high-bandwidth peers Tork has O(I)-hop performance, and for low-bandwidth, most likely mobile peers, Tork has multi-hop performance. We further show that mapping overlay messaging to multi-destination routing in the underlay reduces Tork message overhead by up to 35%","PeriodicalId":352348,"journal":{"name":"Fifth Annual IEEE International Conference on Pervasive Computing and Communications Workshops (PerComW'07)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-03-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126572408","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}