{"title":"Secure Reincarnation of Compromised Servers Using Xen Based Time-Forking Virtual Machines","authors":"Z. Anwar, R. Campbell","doi":"10.1109/PERCOMW.2007.103","DOIUrl":"https://doi.org/10.1109/PERCOMW.2007.103","url":null,"abstract":"Mission-critical telecom servers are being ported from their safe PSTN haven to the Internet to cator to the VoIP user base increasing failures due to greater susceptibility to attacks. Virtual machines are becoming increasing popular for deploying servers because they allow checkpointing and live migration facilities. The challenges are dealing with non-virtual state elements, like ongoing network communications that can't be check-pointed, and recovering state changed between failure and the last check-point. Other complications include dependence on human intervention and precise timing so as not to revert to an un-healthy VM already in the state of compromise. This paper describes a Xen based middleware that pervasively detects terminated VM servers and reincarnates them in a safe state such that they don't lose connectivity to their network clients. It also attempts to isolate messages that caused the failure and generates rules to disallow them from effecting the newly reincarnated VM in the future. Since it essentially allows a VM to start a new life from a point in time before it got compromised, we dubbed it: a time-forking virtual machine (TFVM) following the Copenhagen school's \"many worlds theory\" that postulates that every historical event forks a new universe for every possible outcome. Currently TFVM works in the context of our particular application but we discuss how to extend our model to allow reincarnation of generalized services","PeriodicalId":352348,"journal":{"name":"Fifth Annual IEEE International Conference on Pervasive Computing and Communications Workshops (PerComW'07)","volume":"42 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":"134400548","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":"RIPP-FS: An RFID Identification, Privacy Preserving Protocol with Forward Secrecy.","authors":"M. Conti, R. D. Pietro, L. Mancini, A. Spognardi","doi":"10.1109/PERCOMW.2007.100","DOIUrl":"https://doi.org/10.1109/PERCOMW.2007.100","url":null,"abstract":"This paper presents a new RFID identification protocol: RIPP-FS. The proposed protocol is based on hash chains and it enforces privacy and forward secrecy. Further, unlike other protocols based on hash chains, our proposal is resilient to a specific DoS attack, in which the attacker attempts to exhaust the hash chain the tag is programmed to spend. The computations required on the tag side are very limited, just three hash functions; on the reader side RIPP-FS allows to leverage pre-computations, in such a way that tag identification resolves to a lookup in pre-computed tables, speeding up the identification process. To the best of our knowledge this is the first protocol providing all these features at once","PeriodicalId":352348,"journal":{"name":"Fifth Annual IEEE International Conference on Pervasive Computing and Communications Workshops (PerComW'07)","volume":"13 12-13","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-03-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132844934","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":"Wireless Self-Organizing Backbone Mesh Network (WiSoNet)","authors":"H. Kopp, Martin Krohn, R. Daher, D. Tavangarian","doi":"10.1109/PERCOMW.2007.127","DOIUrl":"https://doi.org/10.1109/PERCOMW.2007.127","url":null,"abstract":"Despite significant advances in parts of the physical layer, available WLAN systems still cannot offer wired equivalent bandwidth. In this paper we propose a novel concept, called wireless self-organizing backbone mesh network (WiSoNet), for a wireless network infrastructure as a backbone and describe its long-term potential. WiSoNet combines two major IEEE standards - IEEE 802.11 (WLAN) and IEEE 802.16 (WiMAX) to build a heterogeneous wireless network topology. To aggregate bandwidth of multiple WLAN connections we introduce a hybrid network solution that uses ad-hoc mechanisms. Further, to decrease the amount of administration and resource management, we use specific algorithms for the self-organization of routing and channels assignment. Since the WiMAX-based supply network already supports quality of service, we propose mechanisms to extend the QoS to end users. Accordingly, we present our prototypical system implementation and discuss the issues we will focus on in the future","PeriodicalId":352348,"journal":{"name":"Fifth Annual IEEE International Conference on Pervasive Computing and Communications Workshops (PerComW'07)","volume":"44 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":"114359090","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":"Energy-Efficient Data Dissemination for Wireless Sensor Networks","authors":"M. Busse, T. Haenselmann, W. Effelsberg","doi":"10.1109/PERCOMW.2007.44","DOIUrl":"https://doi.org/10.1109/PERCOMW.2007.44","url":null,"abstract":"In order to disseminate a large amount of data through a sensor network, it is common to split the data into small-sized chunk packets. If the data is additionally encoded by a forward error correction (FEC) code, missed chunks can be recovered. Fountain codes are a special kind of FEC code which have the property that the sender provides the data in a virtually endless stream by combining original chunks at random. No matter which chunks get lost, each receiver only needs any k chunks from the stream. In broadcast scenarios, fountains have the additional advantage that only little redundancy is required, even if several receivers have missed different chunks. We will show the benefit of Fountain codes in wireless sensor networks in comparison to raw transmissions and other FEC codes. To support the actual data dissemination, we propose two generic distributed protocols: an acknowledgement-based and a request-based protocol. The evaluation is carried out in a real testbed consisting of 20 sensor nodes","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":"116969848","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":"Hoarding Context Information with Context Clusters","authors":"Myilone Anandarajah, R. Robinson, J. Indulska","doi":"10.1109/PERCOMW.2007.54","DOIUrl":"https://doi.org/10.1109/PERCOMW.2007.54","url":null,"abstract":"The components of a context-aware system can often become disconnected because of the dynamic environments within which they are deployed. Hoarding context information on the client application side can improve the probability that the application will continue to behave correctly in the event of disconnection. While traditional approaches to caching and hoarding can be used to combat this problem, we contend that a cache management solution that uses the extra information captured by context modelling techniques will provide more robust operation. Specifically, we focus on the metadata provided by the context modelling language (CML), which may enable smarter decisions to be made by a cache management system for context information","PeriodicalId":352348,"journal":{"name":"Fifth Annual IEEE International Conference on Pervasive Computing and Communications Workshops (PerComW'07)","volume":"124 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":"116330917","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":"ADLS: Attack Detection for Wireless Localization Using Least Squares","authors":"Yingying Chen, W. Trappe, R. Martin","doi":"10.1109/percomw.2007.19","DOIUrl":"https://doi.org/10.1109/percomw.2007.19","url":null,"abstract":"Obtaining accurate positions of wireless devices is critical for location-dependent services. However, as more location-based services are deployed, the more tempting the localization service is as a target for malicious attacks. In this work, we propose an attack detection scheme using least squares (ADLS) for localization in wireless networks. ADLS is based on statistical significance testing. We provide both a theoretical formulation and analytic solution for our ADLS scheme. We further conducted a trace-driven evaluation by applying signal strength attacks to real data collected in an office building. Our experimental study provides strong evidence for the effectiveness of ADLS with high detection rates and low false positive rates","PeriodicalId":352348,"journal":{"name":"Fifth Annual IEEE International Conference on Pervasive Computing and Communications Workshops (PerComW'07)","volume":"38 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":"123459427","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}
Christian Hiedels, C. Hoff, S. Rothkugel, Ulf Wehling
{"title":"UbiSettlers--A Dynamically Adapting Mobile P2P Multiplayer Game for Hybrid Networks","authors":"Christian Hiedels, C. Hoff, S. Rothkugel, Ulf Wehling","doi":"10.1109/PERCOMW.2007.120","DOIUrl":"https://doi.org/10.1109/PERCOMW.2007.120","url":null,"abstract":"UbiSettlers is a prototype of a mobile multiplayer game for hybrid networks running on real hardware. It uses dynamic adaptation and topology control mechanisms to deal with problems inherent to ad hoc and wireless infrastructured networks. In particular, a globally consistent view on the game's state is not mandatory. This is facilitated by resolving inconsistencies through appropriate integration into the semantics of the game itself. In addition to that, we focus also on network feedback to integrate changing network topologies into the game. Moreover, stimulating cooperation is another major facet of the game design and implementation","PeriodicalId":352348,"journal":{"name":"Fifth Annual IEEE International Conference on Pervasive Computing and Communications Workshops (PerComW'07)","volume":"18 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":"127298595","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":"XCML: A Runtime Representation for the Context Modelling Language","authors":"R. Robinson, K. Henricksen, J. Indulska","doi":"10.1109/PERCOMW.2007.140","DOIUrl":"https://doi.org/10.1109/PERCOMW.2007.140","url":null,"abstract":"The context modelling language (CML), derived from object role modeling (ORM), is a powerful approach for capturing the pertinent object types and relationships between those types in context-aware applications. Its support for data quality metrics, context histories and fact type classifications make it an ideal design tool for context-aware systems. However, CML currently lacks a suitable representation for exchanging context models and instances in distributed systems. A runtime representation can be used by context-aware applications and supporting infrastructure to exchange context information and models between distributed components, and it can be used as the storage representation when relational database facilities are not present. This paper shows the benefits of using CML for modelling context as compared to commonly used RDF/OWL-based context models, shows that translations of CML to RDF or OWL are lossy, discusses existing techniques for serialising ORM models, and presents an alternative XML-based representation for CML called XCML","PeriodicalId":352348,"journal":{"name":"Fifth Annual IEEE International Conference on Pervasive Computing and Communications Workshops (PerComW'07)","volume":"150 5 Suppl 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":"128885491","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":"An Ontology-Based Approach to Context Modeling and Reasoning in Pervasive Computing","authors":"D. Ejigu, Vasile-Marian Scuturici, L. Brunie","doi":"10.1109/PERCOMW.2007.22","DOIUrl":"https://doi.org/10.1109/PERCOMW.2007.22","url":null,"abstract":"The behavior of pervasive applications should depend not only on their internal state and user interactions but also on the context sensed during their execution. In this paper, we propose an ontology-based generic context management (GCoM) model. The GCoM model facilitates context reasoning by providing structure for contexts, rules and their semantics. Context and context semantics in GCoM model are represented using the upper and the lower level ontology. Rules are represented using ontology compatible rule languages. Even though ontology data has static nature, GCoM model is designed to be dynamic and reusable in multiple domains of pervasive applications where resource limitation is a key issue. Initial prototype of the use of the model is created and the result obtained is promising","PeriodicalId":352348,"journal":{"name":"Fifth Annual IEEE International Conference on Pervasive Computing and Communications Workshops (PerComW'07)","volume":"38 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":"127614986","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. Halem, A. Patwardhan, S. Dornbush, M. Seablom, Y. Yesha
{"title":"Sensor Web Design Studies for Realtime Dynamic Congestion Pricing","authors":"M. Halem, A. Patwardhan, S. Dornbush, M. Seablom, Y. Yesha","doi":"10.1109/PERCOMW.2007.106","DOIUrl":"https://doi.org/10.1109/PERCOMW.2007.106","url":null,"abstract":"Traffic congestion is a multi-billion dollar national problem and is worsening every year with population growth and increase in freight traffic. We present a model for realistic simulation studies to mitigate congestion in urban areas using dynamic congestion pricing on express toll lanes. Specifically, we identify and address the design issues needed to develop a real time event driven sensor Web observation system for traffic monitoring that provides dynamic congestion pricing. To assess the feasibility of this sensor Web system, we are in the process of conducting simulation studies based on real data for various system configurations to validate the mitigating impact of dynamic congestion pricing on intermodal freight flow to and from the ports in urban areas. In this paper, we focus on freight flow into the Baltimore corridor from its ports","PeriodicalId":352348,"journal":{"name":"Fifth Annual IEEE International Conference on Pervasive Computing and Communications Workshops (PerComW'07)","volume":"73 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":"132036831","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}