Key predistribution schemes are a favoured solution for establishing secure communication in sensor networks. Often viewed as the safest way to bootstrap trust, the main drawback is seen to be the large storage overhead imposed on resource-constrained devices. In this paper, we argue that predistribution schemes can actually be quite insecure: pre-loading global secrets onto exposed devices strengthens the incentive for attackers to compromise nodes. Furthermore, lack of coordination between nodes arising from localised communication helps attackers hide misbehaviour. We consider one scheme in particular - Chan et al.'s random pairwise key predistribution (2003) - and demonstrate an attack where colluding nodes reuse selected pairwise keys to create many false identities. We find that a small, colluding minority can hijack a majority of node communication channels. Finally, we consider countermeasures, from improved detection to scrapping predistribution altogether
{"title":"A collusion attack on pairwise key predistribution schemes for distributed sensor networks","authors":"T. Moore","doi":"10.1109/PERCOMW.2006.3","DOIUrl":"https://doi.org/10.1109/PERCOMW.2006.3","url":null,"abstract":"Key predistribution schemes are a favoured solution for establishing secure communication in sensor networks. Often viewed as the safest way to bootstrap trust, the main drawback is seen to be the large storage overhead imposed on resource-constrained devices. In this paper, we argue that predistribution schemes can actually be quite insecure: pre-loading global secrets onto exposed devices strengthens the incentive for attackers to compromise nodes. Furthermore, lack of coordination between nodes arising from localised communication helps attackers hide misbehaviour. We consider one scheme in particular - Chan et al.'s random pairwise key predistribution (2003) - and demonstrate an attack where colluding nodes reuse selected pairwise keys to create many false identities. We find that a small, colluding minority can hijack a majority of node communication channels. Finally, we consider countermeasures, from improved detection to scrapping predistribution altogether","PeriodicalId":250624,"journal":{"name":"Fourth Annual IEEE International Conference on Pervasive Computing and Communications Workshops (PERCOMW'06)","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-03-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123127496","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2006-03-13DOI: 10.1109/PERCOMW.2006.124
Stephan Urbanski, C. Becker, K. Rothermel
Users' tasks are typically a sequence of steps. Today, the goal of pervasive computing applications - to support users in their tasks by using context information - is only partially met as applications supported by current infrastructures focus on individual steps instead of supporting the coordination of the whole sequence. In this paper, we present an approach for supporting multi-step user tasks by using a process-based application model, called sentient processes. Along with the model, the paper introduces the design of an execution engine for such processes
{"title":"Sentient processes - process-based applications in pervasive computing","authors":"Stephan Urbanski, C. Becker, K. Rothermel","doi":"10.1109/PERCOMW.2006.124","DOIUrl":"https://doi.org/10.1109/PERCOMW.2006.124","url":null,"abstract":"Users' tasks are typically a sequence of steps. Today, the goal of pervasive computing applications - to support users in their tasks by using context information - is only partially met as applications supported by current infrastructures focus on individual steps instead of supporting the coordination of the whole sequence. In this paper, we present an approach for supporting multi-step user tasks by using a process-based application model, called sentient processes. Along with the model, the paper introduces the design of an execution engine for such processes","PeriodicalId":250624,"journal":{"name":"Fourth Annual IEEE International Conference on Pervasive Computing and Communications Workshops (PERCOMW'06)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-03-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116683040","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}
By the end of 2004, the GSM Association reported that over 600 networks in more than 200 countries were serving more than 1.2 billion users (2004). This extraordinary development of inexpensive and flexible mobile communications is also a source of new security challenges. This paper briefly lists the forensic challenges raised by handsets and overviews the handset analysis techniques used (or usable) by law enforcement officers in the course of criminal investigations
{"title":"Law enforcement, forensics and mobile communications","authors":"Vanessa Gratzer, D. Naccache, D. Znaty","doi":"10.1109/PERCOMW.2006.73","DOIUrl":"https://doi.org/10.1109/PERCOMW.2006.73","url":null,"abstract":"By the end of 2004, the GSM Association reported that over 600 networks in more than 200 countries were serving more than 1.2 billion users (2004). This extraordinary development of inexpensive and flexible mobile communications is also a source of new security challenges. This paper briefly lists the forensic challenges raised by handsets and overviews the handset analysis techniques used (or usable) by law enforcement officers in the course of criminal investigations","PeriodicalId":250624,"journal":{"name":"Fourth Annual IEEE International Conference on Pervasive Computing and Communications Workshops (PERCOMW'06)","volume":"101 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-03-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121480904","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2006-03-13DOI: 10.1109/PERCOMW.2006.114
Anni-Yasmin Turhan, T. Springer, M. Berger
In this paper we present an integrated view for modeling and reasoning for context applications using OWL DL. In our case study, we describe a task driven approach to model typical situations as context concepts in an OWL DL ontology. At run-time OWL individuals form situation descriptions and by use of realization we recognise a certain context. We demonstrate the feasibility of our approach by performance measurements of available highly optimised description logics (DL) reasoners for OWL DL
{"title":"Pushing doors for modeling contexts with OWL DL - a case study","authors":"Anni-Yasmin Turhan, T. Springer, M. Berger","doi":"10.1109/PERCOMW.2006.114","DOIUrl":"https://doi.org/10.1109/PERCOMW.2006.114","url":null,"abstract":"In this paper we present an integrated view for modeling and reasoning for context applications using OWL DL. In our case study, we describe a task driven approach to model typical situations as context concepts in an OWL DL ontology. At run-time OWL individuals form situation descriptions and by use of realization we recognise a certain context. We demonstrate the feasibility of our approach by performance measurements of available highly optimised description logics (DL) reasoners for OWL DL","PeriodicalId":250624,"journal":{"name":"Fourth Annual IEEE International Conference on Pervasive Computing and Communications Workshops (PERCOMW'06)","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-03-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121496132","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}
The most significant obstacle to multi-hop communications in wireless sensor networks is high link error rate. Thus, an efficient hop-by-hop reliability support scheme is highly required. In this paper, we identify the characteristics of two typical communication patterns in wireless sensor networks and address the problems of previous end-to-end sequence based hop-by-hop error recovery protocols, which cannot work properly with route change events and have a scalability problem with multiple senders. We propose a new hop-by-hop reliability support scheme named HRS. It uses hop-by-hop sequence numbers for hop-by-hop error recovery and operates in two separate modes depending on communication patterns. Through ns-2 based simulations, we show that both modes of HRS outperform the existing protocols in most metrics
{"title":"A hop-by-hop reliability support scheme for wireless sensor networks","authors":"Haejun Lee, Y. Ko, Dongman Lee","doi":"10.1109/PERCOMW.2006.9","DOIUrl":"https://doi.org/10.1109/PERCOMW.2006.9","url":null,"abstract":"The most significant obstacle to multi-hop communications in wireless sensor networks is high link error rate. Thus, an efficient hop-by-hop reliability support scheme is highly required. In this paper, we identify the characteristics of two typical communication patterns in wireless sensor networks and address the problems of previous end-to-end sequence based hop-by-hop error recovery protocols, which cannot work properly with route change events and have a scalability problem with multiple senders. We propose a new hop-by-hop reliability support scheme named HRS. It uses hop-by-hop sequence numbers for hop-by-hop error recovery and operates in two separate modes depending on communication patterns. Through ns-2 based simulations, we show that both modes of HRS outperform the existing protocols in most metrics","PeriodicalId":250624,"journal":{"name":"Fourth Annual IEEE International Conference on Pervasive Computing and Communications Workshops (PERCOMW'06)","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-03-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122785820","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. Weal, Don Cruickshank, D. Michaelides, D. Millard, D. D. Roure, E. Hornecker, J. Halloran, G. Fitzpatrick
This paper describes a reusable pervasive information infrastructure developed as part of the Equator IRC, designed to allow the construction of literacy based eLearning activities on top of material created as part of a more traditional visitors system. The architecture of the system is described along with details of the creation of the curated material and the subsequent adaption of the system by local primary school teachers to create a literacy experiences. Results of the first trials of the system are presented with conclusions drawn and discussion of future directions
{"title":"A reusable, extensible infrastructure for augmented field trips","authors":"M. Weal, Don Cruickshank, D. Michaelides, D. Millard, D. D. Roure, E. Hornecker, J. Halloran, G. Fitzpatrick","doi":"10.1109/PERCOMW.2006.12","DOIUrl":"https://doi.org/10.1109/PERCOMW.2006.12","url":null,"abstract":"This paper describes a reusable pervasive information infrastructure developed as part of the Equator IRC, designed to allow the construction of literacy based eLearning activities on top of material created as part of a more traditional visitors system. The architecture of the system is described along with details of the creation of the curated material and the subsequent adaption of the system by local primary school teachers to create a literacy experiences. Results of the first trials of the system are presented with conclusions drawn and discussion of future directions","PeriodicalId":250624,"journal":{"name":"Fourth Annual IEEE International Conference on Pervasive Computing and Communications Workshops (PERCOMW'06)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-03-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131207953","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2006-03-13DOI: 10.1109/PERCOMW.2006.140
Simon Oechsner, T. Hossfeld, K. Tutschku, Frank-Uwe Andersen, L. Caviglione
Configuration and management of radio access nodes in beyond 3G (B3G) networks such as nodeBs, wireless LAN or WIMAX access points is a complex task that consumes a high amount of resources. Most configuration changes have to be done by an operator, especially when it comes to the adaption of a node to its environment, i.e., the cells surrounding its own. This is an expensive and inflexible method. Moreover, the required manual interference hampers the adaptivity of B3G networks towards topology changes. In this work, we present an architecture that allows for the detection of neighboring cells, thereby enabling an easy or even autonomic configuration of the access nodes. In addition to this, the presented Kademlia-based overlay network enables the storage of information needed for network management, such as configuration data or performance measures
{"title":"Using Kademlia for the configuration of B3G radio access nodes","authors":"Simon Oechsner, T. Hossfeld, K. Tutschku, Frank-Uwe Andersen, L. Caviglione","doi":"10.1109/PERCOMW.2006.140","DOIUrl":"https://doi.org/10.1109/PERCOMW.2006.140","url":null,"abstract":"Configuration and management of radio access nodes in beyond 3G (B3G) networks such as nodeBs, wireless LAN or WIMAX access points is a complex task that consumes a high amount of resources. Most configuration changes have to be done by an operator, especially when it comes to the adaption of a node to its environment, i.e., the cells surrounding its own. This is an expensive and inflexible method. Moreover, the required manual interference hampers the adaptivity of B3G networks towards topology changes. In this work, we present an architecture that allows for the detection of neighboring cells, thereby enabling an easy or even autonomic configuration of the access nodes. In addition to this, the presented Kademlia-based overlay network enables the storage of information needed for network management, such as configuration data or performance measures","PeriodicalId":250624,"journal":{"name":"Fourth Annual IEEE International Conference on Pervasive Computing and Communications Workshops (PERCOMW'06)","volume":"290 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-03-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116527540","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
This paper reports our experience with representing and reasoning with context information within the CARE middleware. CARE was developed to support context-aware service adaptation for mobile users. Expressiveness and computational issues are discussed and the specific solution adopted in CARE is presented
{"title":"Experience report: ontological reasoning for context-aware Internet services","authors":"A. Agostini, C. Bettini, Daniele Riboni","doi":"10.1109/PERCOMW.2006.52","DOIUrl":"https://doi.org/10.1109/PERCOMW.2006.52","url":null,"abstract":"This paper reports our experience with representing and reasoning with context information within the CARE middleware. CARE was developed to support context-aware service adaptation for mobile users. Expressiveness and computational issues are discussed and the specific solution adopted in CARE is presented","PeriodicalId":250624,"journal":{"name":"Fourth Annual IEEE International Conference on Pervasive Computing and Communications Workshops (PERCOMW'06)","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-03-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132610586","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
In the IEEE 802.15.4 standard, two different operation modes are specified: the beacon-enabled networks, and non-beacon networks. The devices in a beacon-enabled network synchronize with each other and the beacon frame which is treated as synchronization signal also provides some extended features. On the other hand, a beacon-enabled device is hard to implement. Highly processing power is required to meet the constrained timing events and process the beacon packets. In this paper, we propose a priority based scheduling mechanism to implement the beacon-enabled devices. We also evaluate the performance of our implementation. It can be shown that although we use preambles to prevent loss of beacons. They bring almost no impact to the overall performance and duty cycle
{"title":"Design and implementation of IEEE 802.15.4 beacon-enabled network devices","authors":"Li-chun Ko, Yung-Chih Liu, Hua-Wei Fang","doi":"10.1109/PERCOMW.2006.37","DOIUrl":"https://doi.org/10.1109/PERCOMW.2006.37","url":null,"abstract":"In the IEEE 802.15.4 standard, two different operation modes are specified: the beacon-enabled networks, and non-beacon networks. The devices in a beacon-enabled network synchronize with each other and the beacon frame which is treated as synchronization signal also provides some extended features. On the other hand, a beacon-enabled device is hard to implement. Highly processing power is required to meet the constrained timing events and process the beacon packets. In this paper, we propose a priority based scheduling mechanism to implement the beacon-enabled devices. We also evaluate the performance of our implementation. It can be shown that although we use preambles to prevent loss of beacons. They bring almost no impact to the overall performance and duty cycle","PeriodicalId":250624,"journal":{"name":"Fourth Annual IEEE International Conference on Pervasive Computing and Communications Workshops (PERCOMW'06)","volume":"71 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-03-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125656576","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}
Ubiquitous computing has thus far not touched the realm of electronic prescriptions. This paper describes a Jini-based solution for electronic prescriptions, which allows for their wireless transmission to in-range pharmacies and the augmentation of the service levels rendered to the user, with, for instance, information about queue lengths and estimated waiting times being provided to patients. Clinical evaluation of the prototype has highlighted general consensus in respect of its effectiveness, ease of use and usefulness
{"title":"Electronic prescriptions: a ubiquitous solution using Jini","authors":"G. Ghinea, Arash Moradi, S. Asgari, T. Serif","doi":"10.1109/PERCOMW.2006.49","DOIUrl":"https://doi.org/10.1109/PERCOMW.2006.49","url":null,"abstract":"Ubiquitous computing has thus far not touched the realm of electronic prescriptions. This paper describes a Jini-based solution for electronic prescriptions, which allows for their wireless transmission to in-range pharmacies and the augmentation of the service levels rendered to the user, with, for instance, information about queue lengths and estimated waiting times being provided to patients. Clinical evaluation of the prototype has highlighted general consensus in respect of its effectiveness, ease of use and usefulness","PeriodicalId":250624,"journal":{"name":"Fourth Annual IEEE International Conference on Pervasive Computing and Communications Workshops (PERCOMW'06)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-03-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116777382","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
扫码关注我们
求助内容：
应助结果提醒方式：