While unstructured P2P systems have been embraced widely in mobile ad-hoc networks (MANETs), the applicability of structured approaches like distributed hash tables (DHTs) to such settings remains controversial. Existing research delivers promising empirical results addressing the concerns about performance, complexity, and reliability, but does not analyze the principles of combining DHTs and MANETs. This paper identifies and discusses the fundamental implications of non-infrastructural networks for DHTs and analyzes solutions to these challenges
{"title":"Adapting distributed hash tables for mobile ad hoc networks","authors":"T. Heer, S. Götz, S. Rieche, Klaus Wehrle","doi":"10.1109/PERCOMW.2006.16","DOIUrl":"https://doi.org/10.1109/PERCOMW.2006.16","url":null,"abstract":"While unstructured P2P systems have been embraced widely in mobile ad-hoc networks (MANETs), the applicability of structured approaches like distributed hash tables (DHTs) to such settings remains controversial. Existing research delivers promising empirical results addressing the concerns about performance, complexity, and reliability, but does not analyze the principles of combining DHTs and MANETs. This paper identifies and discusses the fundamental implications of non-infrastructural networks for DHTs and analyzes solutions to these challenges","PeriodicalId":250624,"journal":{"name":"Fourth Annual IEEE International Conference on Pervasive Computing and Communications Workshops (PERCOMW'06)","volume":"16 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":"117001571","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.104
H. Pourreza, P. Graham
Dynamically creating new, composite services "on the fly" using existing ones in a local interaction environment (e.g. a home, meeting room, airport lounge, etc.) presents challenging problems. In this paper, we describe a middleware model for such service composition targeted, initially, to a home area network (HAN) scenario. Being able to automatically synthesize new and useful services in a HAN (or other environment) without user intervention makes the use of the network simpler and more attractive for non-expert users (e.g. home owners). We propose a service composition model which involves third-party "service providers" (SPs) in the composition process thereby allowing the discovery of services without direction from the users as to what type of service is desired. We also discuss our experiences with our initial prototype system where ontology based matching is done by the service providers and the resulting composite service is deployed as a workflow using available in-home protocols (e.g. UPnP, Jini, etc.)
{"title":"On the fly service composition for local interaction environments","authors":"H. Pourreza, P. Graham","doi":"10.1109/PERCOMW.2006.104","DOIUrl":"https://doi.org/10.1109/PERCOMW.2006.104","url":null,"abstract":"Dynamically creating new, composite services \"on the fly\" using existing ones in a local interaction environment (e.g. a home, meeting room, airport lounge, etc.) presents challenging problems. In this paper, we describe a middleware model for such service composition targeted, initially, to a home area network (HAN) scenario. Being able to automatically synthesize new and useful services in a HAN (or other environment) without user intervention makes the use of the network simpler and more attractive for non-expert users (e.g. home owners). We propose a service composition model which involves third-party \"service providers\" (SPs) in the composition process thereby allowing the discovery of services without direction from the users as to what type of service is desired. We also discuss our experiences with our initial prototype system where ontology based matching is done by the service providers and the resulting composite service is deployed as a workflow using available in-home protocols (e.g. UPnP, Jini, etc.)","PeriodicalId":250624,"journal":{"name":"Fourth Annual IEEE International Conference on Pervasive Computing and Communications Workshops (PERCOMW'06)","volume":"44 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":"116973707","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}
We propose a novel mechanism for authentication of flooded queries in sensor networks. Each sensor can verify with certain probability that the query is sent by the base station. Implicit cooperation between sensor nodes during the flooding process ensures that the propagation of fake queries is limited to a small part of the network
{"title":"Authenticated query flooding in sensor networks","authors":"Z. Benenson, L. Pimenidis, F. Freiling, S. Lucks","doi":"10.1109/PERCOMW.2006.23","DOIUrl":"https://doi.org/10.1109/PERCOMW.2006.23","url":null,"abstract":"We propose a novel mechanism for authentication of flooded queries in sensor networks. Each sensor can verify with certain probability that the query is sent by the base station. Implicit cooperation between sensor nodes during the flooding process ensures that the propagation of fake queries is limited to a small part of the network","PeriodicalId":250624,"journal":{"name":"Fourth Annual IEEE International Conference on Pervasive Computing and Communications Workshops (PERCOMW'06)","volume":"32 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":"132168789","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.130
T. Hossfeld, Simon Oechsner, K. Tutschku, Frank-Uwe Andersen, L. Caviglione
Vertical handovers (VHO) are expected to be a key feature in beyond 3G (B3G) networks. This paper presents a pastry-based P2P overlay network for supporting vertical handover in B3G networks. The P2P overlay is used to quickly locate attachment points (APs) for mobile entities and to rapidly retrieve the configuration and coverage information of these APs. The advantage of the P2P-based solution is its distributed nature, its scalability, and its self-organizing capability
{"title":"Supporting vertical handover by using a pastry peer-to-peer overlay network","authors":"T. Hossfeld, Simon Oechsner, K. Tutschku, Frank-Uwe Andersen, L. Caviglione","doi":"10.1109/PERCOMW.2006.130","DOIUrl":"https://doi.org/10.1109/PERCOMW.2006.130","url":null,"abstract":"Vertical handovers (VHO) are expected to be a key feature in beyond 3G (B3G) networks. This paper presents a pastry-based P2P overlay network for supporting vertical handover in B3G networks. The P2P overlay is used to quickly locate attachment points (APs) for mobile entities and to rapidly retrieve the configuration and coverage information of these APs. The advantage of the P2P-based solution is its distributed nature, its scalability, and its self-organizing capability","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":"129977369","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.135
Yong Liu, Kay Connelly
In the vision of ubiquitous computing, there are billions of context sources that continuously publish their contextual information, and even more user agents that search for and consume such information. These context producers and consumers form a large-scale, wide-area, context-aware network which is both dynamic and heterogeneous. Existing service discovery mechanisms do not address the unique challenges imposed by such environments. In this paper we identify these challenges and propose a large scale context service discovery infrastructure for context-aware computing. We describe an approach for context service discovery and description that addresses these challenges
{"title":"Towards wide area context-aware environments","authors":"Yong Liu, Kay Connelly","doi":"10.1109/PERCOMW.2006.135","DOIUrl":"https://doi.org/10.1109/PERCOMW.2006.135","url":null,"abstract":"In the vision of ubiquitous computing, there are billions of context sources that continuously publish their contextual information, and even more user agents that search for and consume such information. These context producers and consumers form a large-scale, wide-area, context-aware network which is both dynamic and heterogeneous. Existing service discovery mechanisms do not address the unique challenges imposed by such environments. In this paper we identify these challenges and propose a large scale context service discovery infrastructure for context-aware computing. We describe an approach for context service discovery and description that addresses these challenges","PeriodicalId":250624,"journal":{"name":"Fourth Annual IEEE International Conference on Pervasive Computing and Communications Workshops (PERCOMW'06)","volume":"114 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":"132608548","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.122
S. Repp, C. Meinel
In this paper, we present a general architecture and a new retrieval method for an educational system that is based on a knowledge base of existing recorded lectures. The extraction of metadata from the multimedia resources is one of the main parts of this paper. The recorded lectures are transcripted by an out-of-the-box speech recognition software. The speech recognition software generates a time stamp for each word. These resources are divided into clusters, marked by timestamps, so that search engines are able to find the exact position of particular information inside a course. Finally, a retrieval method is presented that allows users to find "example", "explanation", "overview", "repetition", "exercise" for a particular word or topic-word. This is useful for the student's learning process and allows easy navigation of the multimedia database for pervasive learning
{"title":"Semantic indexing for recorded educational lecture videos","authors":"S. Repp, C. Meinel","doi":"10.1109/PERCOMW.2006.122","DOIUrl":"https://doi.org/10.1109/PERCOMW.2006.122","url":null,"abstract":"In this paper, we present a general architecture and a new retrieval method for an educational system that is based on a knowledge base of existing recorded lectures. The extraction of metadata from the multimedia resources is one of the main parts of this paper. The recorded lectures are transcripted by an out-of-the-box speech recognition software. The speech recognition software generates a time stamp for each word. These resources are divided into clusters, marked by timestamps, so that search engines are able to find the exact position of particular information inside a course. Finally, a retrieval method is presented that allows users to find \"example\", \"explanation\", \"overview\", \"repetition\", \"exercise\" for a particular word or topic-word. This is useful for the student's learning process and allows easy navigation of the multimedia database for pervasive learning","PeriodicalId":250624,"journal":{"name":"Fourth Annual IEEE International Conference on Pervasive Computing and Communications Workshops (PERCOMW'06)","volume":"109 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":"132650913","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.133
A. A. Gomes, A. Ziviani, N. A. D. S. E. Silva, R. A. Feijóo
After an acute myocardial infarction (AMI), the sooner the patient is approached, the greater are the chances that pharmacological therapy (using thrombolytics) be more effective than surgical intervention. Nevertheless, the thrombolytic therapy may have hazard effects on AMI patients that present any contraindication to it. As a consequence, paramedics usually hesitate about applying the thrombolytic therapy - preferring to immediately transfer patients to coronary care units (CCUs) - unless cardiologists support their decision. To cope with this scenario, we envision a ubiquitous telemedicine system for supporting cardiologists and paramedics in (i) the remote decision upon the eligibility of AMI patients to the thrombolytic therapy and (ii) the remote monitoring of patients being transferred, so-called In this paper, we present AToMS (AMI teleconsultation & monitoring), a system that makes extensive use of (possibly heterogeneous) wireless communication technology to allow its use by a paramedic at the location where the AMI patient is first assisted, thus reducing the delay between the onset of symptoms and the eventual application of proper treatment. All exchanged messages among paramedics and cardiologists are recorded, thus rendering a fully auditable system
{"title":"Towards a ubiquitous healthcare system for acute myocardial infarction patients in Brazil","authors":"A. A. Gomes, A. Ziviani, N. A. D. S. E. Silva, R. A. Feijóo","doi":"10.1109/PERCOMW.2006.133","DOIUrl":"https://doi.org/10.1109/PERCOMW.2006.133","url":null,"abstract":"After an acute myocardial infarction (AMI), the sooner the patient is approached, the greater are the chances that pharmacological therapy (using thrombolytics) be more effective than surgical intervention. Nevertheless, the thrombolytic therapy may have hazard effects on AMI patients that present any contraindication to it. As a consequence, paramedics usually hesitate about applying the thrombolytic therapy - preferring to immediately transfer patients to coronary care units (CCUs) - unless cardiologists support their decision. To cope with this scenario, we envision a ubiquitous telemedicine system for supporting cardiologists and paramedics in (i) the remote decision upon the eligibility of AMI patients to the thrombolytic therapy and (ii) the remote monitoring of patients being transferred, so-called In this paper, we present AToMS (AMI teleconsultation & monitoring), a system that makes extensive use of (possibly heterogeneous) wireless communication technology to allow its use by a paramedic at the location where the AMI patient is first assisted, thus reducing the delay between the onset of symptoms and the eventual application of proper treatment. All exchanged messages among paramedics and cardiologists are recorded, thus rendering a fully auditable system","PeriodicalId":250624,"journal":{"name":"Fourth Annual IEEE International Conference on Pervasive Computing and Communications Workshops (PERCOMW'06)","volume":"111 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":"133858274","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}
Writing software for sensor networks requires full understanding of the physical phenomenon under observation. Nevertheless, in many cases knowing the details of the area of operation is difficult or unfeasible. This leads to the necessity of configuring and tuning the application executed on the sensor nodes even after the network has been deployed. We present a solution where a layer of computation is inserted between the application and the sensing equipment. This layer acts like a tiny interpreter and can be used to customize the behavior of already running applications. Experimental validation of the architecture and examples of use are also shown
{"title":"Configuration and tuning of sensor network applications through virtual sensors","authors":"P. Corsini, P. Masci, Alessio Vecchio","doi":"10.1109/PERCOMW.2006.32","DOIUrl":"https://doi.org/10.1109/PERCOMW.2006.32","url":null,"abstract":"Writing software for sensor networks requires full understanding of the physical phenomenon under observation. Nevertheless, in many cases knowing the details of the area of operation is difficult or unfeasible. This leads to the necessity of configuring and tuning the application executed on the sensor nodes even after the network has been deployed. We present a solution where a layer of computation is inserted between the application and the sensing equipment. This layer acts like a tiny interpreter and can be used to customize the behavior of already running applications. Experimental validation of the architecture and examples of use are also shown","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":"133549809","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.117
M. Shinohara, H. Hayashi, T. Hara, S. Nishio
In ad hoc networks, it is effective that each mobile host creates replicas of data items held by other hosts for improving data accessibility. However, a mobile host holding data items frequently accessed by other hosts needs to transmit them many times and consumes more power than other hosts. In this paper, we propose a replica allocation method for not only improving data accessibility but also balancing the power consumption among mobile hosts. In this method, each mobile host replicates data items considering their access frequencies, the numbers of their replicas, and the remaining amount of its battery. We present simulation results to evaluate the performance of our proposed method
{"title":"Replica allocation considering power consumption in mobile ad hoc networks","authors":"M. Shinohara, H. Hayashi, T. Hara, S. Nishio","doi":"10.1109/PERCOMW.2006.117","DOIUrl":"https://doi.org/10.1109/PERCOMW.2006.117","url":null,"abstract":"In ad hoc networks, it is effective that each mobile host creates replicas of data items held by other hosts for improving data accessibility. However, a mobile host holding data items frequently accessed by other hosts needs to transmit them many times and consumes more power than other hosts. In this paper, we propose a replica allocation method for not only improving data accessibility but also balancing the power consumption among mobile hosts. In this method, each mobile host replicates data items considering their access frequencies, the numbers of their replicas, and the remaining amount of its battery. We present simulation results to evaluate the performance of our proposed method","PeriodicalId":250624,"journal":{"name":"Fourth Annual IEEE International Conference on Pervasive Computing and Communications Workshops (PERCOMW'06)","volume":"27 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":"114388480","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.102
S. Loke
Context-aware pervasive systems are emerging as an important class of applications. Such work attempts to recognize the situations of entities. This position paper notes three points when modelling situations: (1) there can be multiple ways to represent a situation; (2) a situation can be viewed as comprising relations between objects and so recognizing a situation boils down to determining if a prescribed set of such relations hold or not hold at that given point in time; and (3) situations can be represented in a modular manner, emphasizing an incremental approach and reuse when building a knowledge base of situations. We also present a declarative approach to building context-aware pervasive systems, where relations that are in a situation can be recognized
{"title":"On representing situations for context-aware pervasive computing: six ways to tell if you are in a meeting","authors":"S. Loke","doi":"10.1109/PERCOMW.2006.102","DOIUrl":"https://doi.org/10.1109/PERCOMW.2006.102","url":null,"abstract":"Context-aware pervasive systems are emerging as an important class of applications. Such work attempts to recognize the situations of entities. This position paper notes three points when modelling situations: (1) there can be multiple ways to represent a situation; (2) a situation can be viewed as comprising relations between objects and so recognizing a situation boils down to determining if a prescribed set of such relations hold or not hold at that given point in time; and (3) situations can be represented in a modular manner, emphasizing an incremental approach and reuse when building a knowledge base of situations. We also present a declarative approach to building context-aware pervasive systems, where relations that are in a situation can be recognized","PeriodicalId":250624,"journal":{"name":"Fourth Annual IEEE International Conference on Pervasive Computing and Communications Workshops (PERCOMW'06)","volume":"13 2 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":"124608748","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
扫码关注我们
求助内容：
应助结果提醒方式：