This study investigates how a virtual organization can be built in a distributed computing environment which includes wireless technology to support the work of a multi-disciplinary healthcare team collaborating to provide patient care in the cancer domain. It focuses on identifying the functionality required at the wireless device interface to provide the information from distributed resources needed by different members of the healthcare team to fulfil their role in a patient's care at the point of care. It presents the concept of virtual organization in a clinical environment supporting multi-disciplinary care teams whose members are collaborating to treat a patient more effectively by providing and storing relevant data from a variety of medical records/data resources available in a distributed computing environment to the virtual organization. An analysis of the healthcare teams at the Velindre Cancer Hospital, NHS Trust has identified the functionality and information required by different members of the care team at the point of care. This information will be used in the next stage of the project to inform the creation of a prototype virtual organization which will be used to evaluate this approach to supporting the work of healthcare teams. The paper concentrates on the role of wireless devices in the virtual organization particularly their use at the point of care
{"title":"Incorporating wireless technology into virtual organizations supporting the work of healthcare teams","authors":"Mohyuddin, W. A. Gray, D. Morrey, W. Jones","doi":"10.1109/PERCOMW.2006.67","DOIUrl":"https://doi.org/10.1109/PERCOMW.2006.67","url":null,"abstract":"This study investigates how a virtual organization can be built in a distributed computing environment which includes wireless technology to support the work of a multi-disciplinary healthcare team collaborating to provide patient care in the cancer domain. It focuses on identifying the functionality required at the wireless device interface to provide the information from distributed resources needed by different members of the healthcare team to fulfil their role in a patient's care at the point of care. It presents the concept of virtual organization in a clinical environment supporting multi-disciplinary care teams whose members are collaborating to treat a patient more effectively by providing and storing relevant data from a variety of medical records/data resources available in a distributed computing environment to the virtual organization. An analysis of the healthcare teams at the Velindre Cancer Hospital, NHS Trust has identified the functionality and information required by different members of the care team at the point of care. This information will be used in the next stage of the project to inform the creation of a prototype virtual organization which will be used to evaluate this approach to supporting the work of healthcare teams. The paper concentrates on the role of wireless devices in the virtual organization particularly their use at the point of care","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":"125432858","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}
With the growing prevalence of wireless devices, infrastructure-less ad hoc networking is coming closer to reality. Research in this field has mainly been concerned with routing. However, to justify the relevance of ad hoc networks, there have to be applications. Distributed applications require basic services such as naming. In an ad hoc network, these services have to be provided in a decentralized way. We believe that structured peer-to-peer overlays are a good basis for their design. Prior work has been focused on the long-run performance of virtual peer-to-peer overlays over ad hoc networks. In this paper, we consider a vital functionality of any peer-to-peer network: bootstrapping. We formally show that the self-configuration process of a spontaneously deployed chord network has a time complexity linear in the network size. In addition to that, its centralized bootstrapping procedure causes an unfavorable traffic load imbalance
{"title":"Bootstrapping chord in ad hoc networks not going anywhere for a while","authors":"Curt Cramer, T. Fuhrmann","doi":"10.1109/PERCOMW.2006.28","DOIUrl":"https://doi.org/10.1109/PERCOMW.2006.28","url":null,"abstract":"With the growing prevalence of wireless devices, infrastructure-less ad hoc networking is coming closer to reality. Research in this field has mainly been concerned with routing. However, to justify the relevance of ad hoc networks, there have to be applications. Distributed applications require basic services such as naming. In an ad hoc network, these services have to be provided in a decentralized way. We believe that structured peer-to-peer overlays are a good basis for their design. Prior work has been focused on the long-run performance of virtual peer-to-peer overlays over ad hoc networks. In this paper, we consider a vital functionality of any peer-to-peer network: bootstrapping. We formally show that the self-configuration process of a spontaneously deployed chord network has a time complexity linear in the network size. In addition to that, its centralized bootstrapping procedure causes an unfavorable traffic load imbalance","PeriodicalId":250624,"journal":{"name":"Fourth Annual IEEE International Conference on Pervasive Computing and Communications Workshops (PERCOMW'06)","volume":"4 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":"128139034","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}
Many solutions for securing inter-provider handover proposed to date make use of the concept of security context transfer. However, none of these solutions addresses problems arising from subsequent handover. In this paper, we provide a formal model for subsequent security context transfer and define a set of security requirements. We furthermore present a new solution that meets all but one of these requirements. In particular, we combine the concept of a history-enriched security context transfer with a policy-based handover decision process
{"title":"Introducing history-enriched security context transfer to enhance the security of subsequent handover","authors":"Ulrike Meyer, S. Wetzel","doi":"10.1109/PERCOMW.2006.70","DOIUrl":"https://doi.org/10.1109/PERCOMW.2006.70","url":null,"abstract":"Many solutions for securing inter-provider handover proposed to date make use of the concept of security context transfer. However, none of these solutions addresses problems arising from subsequent handover. In this paper, we provide a formal model for subsequent security context transfer and define a set of security requirements. We furthermore present a new solution that meets all but one of these requirements. In particular, we combine the concept of a history-enriched security context transfer with a policy-based handover decision process","PeriodicalId":250624,"journal":{"name":"Fourth Annual IEEE International Conference on Pervasive Computing and Communications Workshops (PERCOMW'06)","volume":"8 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":"122266375","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 describes our vision for next-generation context-aware enterprise communications that achieves the integration of backend business processes with user communications. We envision a new class of enterprise applications in which communications between users in response to a variety of enterprise events will be driven by an automated process in which an appropriate group of users will be selected for communicating at an appropriate time on an appropriate media. To achieve this goal, the applications must exploit a variety of context information such as enterprise knowledge, user knowledge and application knowledge. This paper describes our platform Hermes that enables the creation and execution of such context-aware applications. It briefly presents experiences with Hermes in several demonstrations
{"title":"Hermes: a platform for context-aware enterprise communication","authors":"A. John, R. Klemm, Ankur Mani, D. Seligmann","doi":"10.1109/PERCOMW.2006.64","DOIUrl":"https://doi.org/10.1109/PERCOMW.2006.64","url":null,"abstract":"This paper describes our vision for next-generation context-aware enterprise communications that achieves the integration of backend business processes with user communications. We envision a new class of enterprise applications in which communications between users in response to a variety of enterprise events will be driven by an automated process in which an appropriate group of users will be selected for communicating at an appropriate time on an appropriate media. To achieve this goal, the applications must exploit a variety of context information such as enterprise knowledge, user knowledge and application knowledge. This paper describes our platform Hermes that enables the creation and execution of such context-aware applications. It briefly presents experiences with Hermes in several demonstrations","PeriodicalId":250624,"journal":{"name":"Fourth Annual IEEE International Conference on Pervasive Computing and Communications Workshops (PERCOMW'06)","volume":"29 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":"120953217","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}
Communication-efficiency is of key importance when constructing robust services in limited bandwidth environments, such as sensor networks. We focus on communication-efficiency in the context of quorum systems, which are useful primitives for building reliable distributed systems. To this end, we exhibit a new probabilistic quorum construction in which every node transmits at most O(log2 n) bits per quorum access, where n is the number of nodes in the system. Our implementation, in addition to being communication efficient, is also robust in the face of communication failures. In particular, it guarantees consistency (with high probability) in the face of network partitions. To the best of our knowledge, no existing probabilistic quorum systems achieve polylogarithmic communication complexity and are resilient to network partitions
{"title":"Communication-efficient probabilistic quorum systems for sensor networks","authors":"G. Chockler, Seth Gilbert, B. Patt-Shamir","doi":"10.1109/PERCOMW.2006.30","DOIUrl":"https://doi.org/10.1109/PERCOMW.2006.30","url":null,"abstract":"Communication-efficiency is of key importance when constructing robust services in limited bandwidth environments, such as sensor networks. We focus on communication-efficiency in the context of quorum systems, which are useful primitives for building reliable distributed systems. To this end, we exhibit a new probabilistic quorum construction in which every node transmits at most O(log2 n) bits per quorum access, where n is the number of nodes in the system. Our implementation, in addition to being communication efficient, is also robust in the face of communication failures. In particular, it guarantees consistency (with high probability) in the face of network partitions. To the best of our knowledge, no existing probabilistic quorum systems achieve polylogarithmic communication complexity and are resilient to network partitions","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":"131153936","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.106
C. Kamienski, D. Sadok, J. Fidalgo, Jennifer Lima, B. Ohlman
Scalable distributed management is a key challenge for current Internet services and necessary for future ubiquitous services of wireless mobile users. Policy-based management (PBM) is seen as a practical solution for dealing with the needs of new advanced services for highly dynamic wireless environments. The IETF developed a two-tier client/server PBM framework, yet it requires some important extensions in such environments. In this paper we look into new management mechanisms for dealing with these limitations by proposing the peer-to-peer policy management infrastructure (P4MI), a PBM framework based on peer-to-peer technology as the main enabling mechanism. We instantiate this abstract framework to ambient networks, a new concept aimed at creating network solutions for new mobile and wireless systems. We show that the P4MI is both a scalable and a complete PBM solution for coping with the challenges of ambient networks
{"title":"On the use of peer-to-peer architectures for the management of highly dynamic environments","authors":"C. Kamienski, D. Sadok, J. Fidalgo, Jennifer Lima, B. Ohlman","doi":"10.1109/PERCOMW.2006.106","DOIUrl":"https://doi.org/10.1109/PERCOMW.2006.106","url":null,"abstract":"Scalable distributed management is a key challenge for current Internet services and necessary for future ubiquitous services of wireless mobile users. Policy-based management (PBM) is seen as a practical solution for dealing with the needs of new advanced services for highly dynamic wireless environments. The IETF developed a two-tier client/server PBM framework, yet it requires some important extensions in such environments. In this paper we look into new management mechanisms for dealing with these limitations by proposing the peer-to-peer policy management infrastructure (P4MI), a PBM framework based on peer-to-peer technology as the main enabling mechanism. We instantiate this abstract framework to ambient networks, a new concept aimed at creating network solutions for new mobile and wireless systems. We show that the P4MI is both a scalable and a complete PBM solution for coping with the challenges of ambient networks","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":"131128361","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 introduces MobiCare - a novel service architecture that enables a wide range of health-related services for efficient and mobile patient care. These services include: (1) health-related services in medical devices and sensors to remotely install, self-activate, reconfigure or even self-repair with new health services and applications, (2) secure and reliable dynamic software upgrade or update services applied to the native code of the clinical device, and, (3) remote registration and (re)configuration of body sensors as well as remote health-data services such as patient health report downloads and diagnosis data uploads with provider servers. Collectively these services address a range of patient medical monitoring needs by accelerating deployment of new health-related services, thus reducing medical costs and improving the quality of patient care. We are currently implementing a proof-of-concept prototype. Early experiences with MobiCare do show that it has the potential to become a feasible and a useful infrastructure paradigm for the next generation healthcare
{"title":"A programmable service architecture for mobile medical care","authors":"R. Chakravorty","doi":"10.1109/PERCOMW.2006.11","DOIUrl":"https://doi.org/10.1109/PERCOMW.2006.11","url":null,"abstract":"This paper introduces MobiCare - a novel service architecture that enables a wide range of health-related services for efficient and mobile patient care. These services include: (1) health-related services in medical devices and sensors to remotely install, self-activate, reconfigure or even self-repair with new health services and applications, (2) secure and reliable dynamic software upgrade or update services applied to the native code of the clinical device, and, (3) remote registration and (re)configuration of body sensors as well as remote health-data services such as patient health report downloads and diagnosis data uploads with provider servers. Collectively these services address a range of patient medical monitoring needs by accelerating deployment of new health-related services, thus reducing medical costs and improving the quality of patient care. We are currently implementing a proof-of-concept prototype. Early experiences with MobiCare do show that it has the potential to become a feasible and a useful infrastructure paradigm for the next generation healthcare","PeriodicalId":250624,"journal":{"name":"Fourth Annual IEEE International Conference on Pervasive Computing and Communications Workshops (PERCOMW'06)","volume":"35 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":"133120153","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.129
C. Barrett, V. S. A. Kumar, M. Marathe, Shripad Thite, Gabriel Istrate
We give efficient sequential and distributed approximation algorithms for strong edge coloring graphs modeling wireless networks. Strong edge coloring is equivalent to computing a conflict-free assignment of channels or frequencies to pairwise links between transceivers in the network
{"title":"Strong edge coloring for channel assignment in wireless radio networks","authors":"C. Barrett, V. S. A. Kumar, M. Marathe, Shripad Thite, Gabriel Istrate","doi":"10.1109/PERCOMW.2006.129","DOIUrl":"https://doi.org/10.1109/PERCOMW.2006.129","url":null,"abstract":"We give efficient sequential and distributed approximation algorithms for strong edge coloring graphs modeling wireless networks. Strong edge coloring is equivalent to computing a conflict-free assignment of channels or frequencies to pairwise links between transceivers in the network","PeriodicalId":250624,"journal":{"name":"Fourth Annual IEEE International Conference on Pervasive Computing and Communications Workshops (PERCOMW'06)","volume":"291 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":"133154706","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 environments consist of numerous interacting components, many of which have been developed in isolation from each other. Unless appropriate measures are taken, interference (where a component's behavior in a deployed system differs from its behavior when in isolation) is likely to be commonplace. In this paper we explore the importance of this problem and present our work-in-progress on a framework that enables designers, developers, and researchers to describe and thus reason about interference in ubicomp environments
{"title":"A framework for describing interference in ubiquitous computing environments","authors":"Ricardo Morla, N. Davies","doi":"10.1109/PERCOMW.2006.6","DOIUrl":"https://doi.org/10.1109/PERCOMW.2006.6","url":null,"abstract":"Ubiquitous computing environments consist of numerous interacting components, many of which have been developed in isolation from each other. Unless appropriate measures are taken, interference (where a component's behavior in a deployed system differs from its behavior when in isolation) is likely to be commonplace. In this paper we explore the importance of this problem and present our work-in-progress on a framework that enables designers, developers, and researchers to describe and thus reason about interference in ubicomp environments","PeriodicalId":250624,"journal":{"name":"Fourth Annual IEEE International Conference on Pervasive Computing and Communications Workshops (PERCOMW'06)","volume":"201 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":"114969943","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 this paper, we study the problem of utility maximization in multi-hop wireless systems. To study the effect of wireless interference constraints on the utility maximization problem, we introduce a new class of weighted matching problems, namely maximum weighted K-valid matching problems (MWKVMPs). For K = 1, MWKVMP corresponds to the well studied maximum weighted matching problem (MWMP) in the literature, which can be solved in polynomial time. We prove several interesting results concerning the hardness of these problems for K ges 2. In particular, we show that MWKVMP does not even belong to APX; where APX denotes the class of problems to which a constant factor approximation can be obtained in polynomial time. Our results have strong implications concerning the hardness of scheduling transmissions in multi-hop wireless systems
{"title":"Maximum weighted matching with interference constraints","authors":"G. Sharma, N. Shroff, R. Mazumdar","doi":"10.1109/PERCOMW.2006.79","DOIUrl":"https://doi.org/10.1109/PERCOMW.2006.79","url":null,"abstract":"In this paper, we study the problem of utility maximization in multi-hop wireless systems. To study the effect of wireless interference constraints on the utility maximization problem, we introduce a new class of weighted matching problems, namely maximum weighted K-valid matching problems (MWKVMPs). For K = 1, MWKVMP corresponds to the well studied maximum weighted matching problem (MWMP) in the literature, which can be solved in polynomial time. We prove several interesting results concerning the hardness of these problems for K ges 2. In particular, we show that MWKVMP does not even belong to APX; where APX denotes the class of problems to which a constant factor approximation can be obtained in polynomial time. Our results have strong implications concerning the hardness of scheduling transmissions in multi-hop wireless systems","PeriodicalId":250624,"journal":{"name":"Fourth Annual IEEE International Conference on Pervasive Computing and Communications Workshops (PERCOMW'06)","volume":"119 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":"116379543","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
扫码关注我们
求助内容：
应助结果提醒方式：