Pub Date : 2006-11-01DOI: 10.1109/COLCOM.2006.361835
L. Gruenwald
Summary form only given. National Science Foundation (NSF) has a long-standing interest in protecting, enhancing and evaluating information security, privacy and confidentiality in information systems. The interest is broad including new architectures, algorithms, data collection and evaluation methods. All these are in recognition of newly emerging environments and applications (e.g. pervasive computing, mobile, sensor and distributed databases, discovery and handling of future threats), newly emerging requirements and increasing public interest in this topic. This paper discusses NSF's past and current funding profile and future funding opportunities for secure information systems research
{"title":"Information Security, Privacy and Confidentiality National Science Foundation's Past and Current Funding Profile and Future Opportunities","authors":"L. Gruenwald","doi":"10.1109/COLCOM.2006.361835","DOIUrl":"https://doi.org/10.1109/COLCOM.2006.361835","url":null,"abstract":"Summary form only given. National Science Foundation (NSF) has a long-standing interest in protecting, enhancing and evaluating information security, privacy and confidentiality in information systems. The interest is broad including new architectures, algorithms, data collection and evaluation methods. All these are in recognition of newly emerging environments and applications (e.g. pervasive computing, mobile, sensor and distributed databases, discovery and handling of future threats), newly emerging requirements and increasing public interest in this topic. This paper discusses NSF's past and current funding profile and future funding opportunities for secure information systems research","PeriodicalId":315775,"journal":{"name":"2006 International Conference on Collaborative Computing: Networking, Applications and Worksharing","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126377320","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-11-01DOI: 10.1109/COLCOM.2006.361871
Joseph S. Gomes, Hyeong-Ah Choi
Sensors are envisioned to be at the center of distributed collaborative computing services involving time-critical decision support. Sensors are small devices with limited communication and computational capabilities that collect data on their neighboring physical world and send the data periodically to server machines. Sensors form a collaborative network with these servers, where the sensors gather information and the servers perform various operations (e.g. filter, aggregate, join etc) on the information streams in real-time according to predefined queries or rules. Sensor data streams are continuous, un-ending and have highly volatile characteristics. As a result, traditional database systems are inappropriate for handling queries for sensor streams, and several stream data management systems have been proposed in the literature. In this paper we focus on a special type of query, namely join queries, which is the most expensive query operator. Here, we address the problem of finding an optimal join tree that maximizes throughput for sliding window based multi-join queries over continuous sensor data streams. We present a polynomial time algorithm Fodp and three variants of Fodp. Our experiments in ARES show that for almost all instances, trees from Fodp and its variants perform close to the optimal trees from our exponential time algorithm OptDP (Gomes, 2006), and significantly better than existing XJoin based heuristic algorithms
{"title":"Cost-based Solution for Optimizing Multi-join Queries over Distributed Streaming Sensor Data","authors":"Joseph S. Gomes, Hyeong-Ah Choi","doi":"10.1109/COLCOM.2006.361871","DOIUrl":"https://doi.org/10.1109/COLCOM.2006.361871","url":null,"abstract":"Sensors are envisioned to be at the center of distributed collaborative computing services involving time-critical decision support. Sensors are small devices with limited communication and computational capabilities that collect data on their neighboring physical world and send the data periodically to server machines. Sensors form a collaborative network with these servers, where the sensors gather information and the servers perform various operations (e.g. filter, aggregate, join etc) on the information streams in real-time according to predefined queries or rules. Sensor data streams are continuous, un-ending and have highly volatile characteristics. As a result, traditional database systems are inappropriate for handling queries for sensor streams, and several stream data management systems have been proposed in the literature. In this paper we focus on a special type of query, namely join queries, which is the most expensive query operator. Here, we address the problem of finding an optimal join tree that maximizes throughput for sliding window based multi-join queries over continuous sensor data streams. We present a polynomial time algorithm Fodp and three variants of Fodp. Our experiments in ARES show that for almost all instances, trees from Fodp and its variants perform close to the optimal trees from our exponential time algorithm OptDP (Gomes, 2006), and significantly better than existing XJoin based heuristic algorithms","PeriodicalId":315775,"journal":{"name":"2006 International Conference on Collaborative Computing: Networking, Applications and Worksharing","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114651562","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-11-01DOI: 10.1109/COLCOM.2006.361877
Ingo Scholtes, Daniel Görgen, Patrick Gratz
This paper presents the idea of Web service interface syndication - a scheme for the collaborative creation of overlay networks based on common Web service interfaces. Rather than requiring complex management of dynamic peers we picture a setting of interconnected static Web applications forming syndicates and offering services in a self-organized fashion. Among other application scenarios, this paper will present vicinitySearch, a collaborative Weblog search service which has been created in order to demonstrate the concept. This service offers a remarkable added-value to the Weblog community, making use of existing collaborative structures and the interoperability provided by XML Web services. Apart from the general concept of Web service interface syndication, the paper presents an implementation of the vicinitySearch service that has been done in terms of a Wordpress plugin
{"title":"Web Service Interface Syndication and its Application to a Collaborative Weblog Search","authors":"Ingo Scholtes, Daniel Görgen, Patrick Gratz","doi":"10.1109/COLCOM.2006.361877","DOIUrl":"https://doi.org/10.1109/COLCOM.2006.361877","url":null,"abstract":"This paper presents the idea of Web service interface syndication - a scheme for the collaborative creation of overlay networks based on common Web service interfaces. Rather than requiring complex management of dynamic peers we picture a setting of interconnected static Web applications forming syndicates and offering services in a self-organized fashion. Among other application scenarios, this paper will present vicinitySearch, a collaborative Weblog search service which has been created in order to demonstrate the concept. This service offers a remarkable added-value to the Weblog community, making use of existing collaborative structures and the interoperability provided by XML Web services. Apart from the general concept of Web service interface syndication, the paper presents an implementation of the vicinitySearch service that has been done in terms of a Wordpress plugin","PeriodicalId":315775,"journal":{"name":"2006 International Conference on Collaborative Computing: Networking, Applications and Worksharing","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123889951","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-11-01DOI: 10.1109/COLCOM.2006.361833
I. Laso-Ballesteros
Summary form only given. In 2020 collaborative working environments will be based on collaborative systems including both general collaborative infrastructures and specific applications for supporting human-centric ubiquitous collaboration. Ubiquitous collaboration (UC) means the use of collaboration services at any stage of our work activities. UC will make possible to collaborate with anyone, at any place, at any moment as an evolution of current Web 2.0 waves. UC will be achieved after research on 3 major components: contextual collaboration, mobile collaboration, and integrated collaboration. UC will require a collaborative infrastructure as the foundation of future collaborative systems for seamless collaboration among people working together. Collaborative infrastructures will offer seamlessly integrated context-aware flexible support for distributed collaboration among individuals and will draw on service-oriented reference models for massive semantic collaboration. Collaborative infrastructures will provide proactive support for pervasive human collaboration within their own organisations, with other organisations and with virtual communities of experts and of practice. Collaborative infrastructure will provide system components that comply with the service oriented architectures allowing specific applications for group-driven composition of systems components to support synchronous and asynchronous teamwork freeing users from routine to focus on creativity with an effective use of distributed knowledge and competences. Converged networks and services, context modelling and reasoning, utility-like ICT, high-level middleware (upperware) and P2P infrastructures will be part of the collaborative infrastructure needed for collaborative systems for pervasive collaboration that offers enhanced knowledge sharing mechanisms, better decision making process and less burdensome group processes support in distributed, global networks of collaborators
{"title":"Collaboration@work 2020: Ubiquitous Collaboration Research Perspectives","authors":"I. Laso-Ballesteros","doi":"10.1109/COLCOM.2006.361833","DOIUrl":"https://doi.org/10.1109/COLCOM.2006.361833","url":null,"abstract":"Summary form only given. In 2020 collaborative working environments will be based on collaborative systems including both general collaborative infrastructures and specific applications for supporting human-centric ubiquitous collaboration. Ubiquitous collaboration (UC) means the use of collaboration services at any stage of our work activities. UC will make possible to collaborate with anyone, at any place, at any moment as an evolution of current Web 2.0 waves. UC will be achieved after research on 3 major components: contextual collaboration, mobile collaboration, and integrated collaboration. UC will require a collaborative infrastructure as the foundation of future collaborative systems for seamless collaboration among people working together. Collaborative infrastructures will offer seamlessly integrated context-aware flexible support for distributed collaboration among individuals and will draw on service-oriented reference models for massive semantic collaboration. Collaborative infrastructures will provide proactive support for pervasive human collaboration within their own organisations, with other organisations and with virtual communities of experts and of practice. Collaborative infrastructure will provide system components that comply with the service oriented architectures allowing specific applications for group-driven composition of systems components to support synchronous and asynchronous teamwork freeing users from routine to focus on creativity with an effective use of distributed knowledge and competences. Converged networks and services, context modelling and reasoning, utility-like ICT, high-level middleware (upperware) and P2P infrastructures will be part of the collaborative infrastructure needed for collaborative systems for pervasive collaboration that offers enhanced knowledge sharing mechanisms, better decision making process and less burdensome group processes support in distributed, global networks of collaborators","PeriodicalId":315775,"journal":{"name":"2006 International Conference on Collaborative Computing: Networking, Applications and Worksharing","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116587311","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-11-01DOI: 10.1109/COLCOM.2006.361862
Xiaoyu Yang, Yimin Hu
Distributed hash table based peer-to-peer systems are emerging as new paradigms for building large-scale distributed applications, due to their scalability, fault-tolerance and self-organization. However, most existing DHTs are designed for exact-key searching, and the support of multi-dimensional range queries in peer-to-peer networks is still a challenging problem. In this paper, we propose a distributed index architecture called Dak to support range queries on multi-dimensional data. Based on efficient space mapping and query routing mechanisms, Dak can provide a scalable platform to support any number of indexes with different dimensionalities. Significantly, this architecture does not need to generate or maintain any search trees. Instead, it exploits the embedded trees in the underlying distributed hash tables to refine and deliver queries. To deal with skewed data distribution, we also provide load-balancing mechanisms to ensure that no node in the system is unduly loaded
{"title":"A Scalable Index Architecture for Supporting Multi-Dimensional Range Queries in Peer-to-Peer Networks","authors":"Xiaoyu Yang, Yimin Hu","doi":"10.1109/COLCOM.2006.361862","DOIUrl":"https://doi.org/10.1109/COLCOM.2006.361862","url":null,"abstract":"Distributed hash table based peer-to-peer systems are emerging as new paradigms for building large-scale distributed applications, due to their scalability, fault-tolerance and self-organization. However, most existing DHTs are designed for exact-key searching, and the support of multi-dimensional range queries in peer-to-peer networks is still a challenging problem. In this paper, we propose a distributed index architecture called Dak to support range queries on multi-dimensional data. Based on efficient space mapping and query routing mechanisms, Dak can provide a scalable platform to support any number of indexes with different dimensionalities. Significantly, this architecture does not need to generate or maintain any search trees. Instead, it exploits the embedded trees in the underlying distributed hash tables to refine and deliver queries. To deal with skewed data distribution, we also provide load-balancing mechanisms to ensure that no node in the system is unduly loaded","PeriodicalId":315775,"journal":{"name":"2006 International Conference on Collaborative Computing: Networking, Applications and Worksharing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123030860","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-11-01DOI: 10.1109/COLCOM.2006.361886
S. Al-Omari, Weisong Shi
Extending the lifetime of wireless sensor networks remains the most challenging and demanding requirement that impedes large-scale deployments. Studies show that considerable energy saving can be achieved only by putting a node's radio into full sleep mode. In this paper we present RAT, which is a redundancy-aware topology management protocol. RAT selects a minimum set of active nodes that are good enough to maintain connectivity, and allows others to sleep and save energy. RAT is designed and implemented with underlying wireless channel irregularity in mind. Scalability and low overhead are the other primary design goals of RAT as well. We implement RAT in the context of Score, which is a cross-layer framework that provides RAT with the neighbor set and allows RAT to coordinate its SLEEP and ACTIVE state changes with the routing layer smoothly. Using TinyOS and PowerTOSSIM, we implement RAT on top of Score. Comparing with the all-active scenario, RAT simulation results show a total energy consumption decrease of 67% in a one-to-many routing scenario and up to 87% in a many-to-one routing scenario
{"title":"Redundancy-Aware Topology Management in Wireless Sensor Networks","authors":"S. Al-Omari, Weisong Shi","doi":"10.1109/COLCOM.2006.361886","DOIUrl":"https://doi.org/10.1109/COLCOM.2006.361886","url":null,"abstract":"Extending the lifetime of wireless sensor networks remains the most challenging and demanding requirement that impedes large-scale deployments. Studies show that considerable energy saving can be achieved only by putting a node's radio into full sleep mode. In this paper we present RAT, which is a redundancy-aware topology management protocol. RAT selects a minimum set of active nodes that are good enough to maintain connectivity, and allows others to sleep and save energy. RAT is designed and implemented with underlying wireless channel irregularity in mind. Scalability and low overhead are the other primary design goals of RAT as well. We implement RAT in the context of Score, which is a cross-layer framework that provides RAT with the neighbor set and allows RAT to coordinate its SLEEP and ACTIVE state changes with the routing layer smoothly. Using TinyOS and PowerTOSSIM, we implement RAT on top of Score. Comparing with the all-active scenario, RAT simulation results show a total energy consumption decrease of 67% in a one-to-many routing scenario and up to 87% in a many-to-one routing scenario","PeriodicalId":315775,"journal":{"name":"2006 International Conference on Collaborative Computing: Networking, Applications and Worksharing","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122573937","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-11-01DOI: 10.1109/COLCOM.2006.361832
Chung-Sheng Li
Summary form only given. As part the globalization trend, enterprises are facing a serious challenge of needing to be globally consistent and locally nimble at the same time. Recent rapid evolution of Web 2.0 and real-time event driven architecture served as the catalyst for new paradigms in enterprise information composition, and potentially enable much more flexible real-time global collaboration. This new paradigm will have profound impact on the enterprise IT architectures. The current state-of-the-art approach in enterprise information composition is often based on data federation and information integration. However, many information composition tasks can be much better served through situational applications (i.e. applications that are mash-uped for addressing some of the immediate business problems). A new class of integration technologies, also known as enterprise information mashup fabric, will emerge to serve these tasks. Meanwhile, there is also an emerging trend towards real-time business assurance in which enterprise wide information integrity is ensured through technologies such as provenance (who has done what on this information) and policy automation to facilitate "trusted" and fully automated information composition
{"title":"Enterprise Information Mashup and Real Time Business Assurance for Global Collaboration","authors":"Chung-Sheng Li","doi":"10.1109/COLCOM.2006.361832","DOIUrl":"https://doi.org/10.1109/COLCOM.2006.361832","url":null,"abstract":"Summary form only given. As part the globalization trend, enterprises are facing a serious challenge of needing to be globally consistent and locally nimble at the same time. Recent rapid evolution of Web 2.0 and real-time event driven architecture served as the catalyst for new paradigms in enterprise information composition, and potentially enable much more flexible real-time global collaboration. This new paradigm will have profound impact on the enterprise IT architectures. The current state-of-the-art approach in enterprise information composition is often based on data federation and information integration. However, many information composition tasks can be much better served through situational applications (i.e. applications that are mash-uped for addressing some of the immediate business problems). A new class of integration technologies, also known as enterprise information mashup fabric, will emerge to serve these tasks. Meanwhile, there is also an emerging trend towards real-time business assurance in which enterprise wide information integrity is ensured through technologies such as provenance (who has done what on this information) and policy automation to facilitate \"trusted\" and fully automated information composition","PeriodicalId":315775,"journal":{"name":"2006 International Conference on Collaborative Computing: Networking, Applications and Worksharing","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116193631","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-11-01DOI: 10.1109/COLCOM.2006.361870
T. Graham, W. Phillips, Christopher Wolfe
This paper identifies a set of distribution architectures for the development of synchronous groupware and provides an analysis of their quality attributes. The architectures and their quality attributes provide insight on how to structure the implementation of synchronous groupware applications, providing developers with precise guidance on the trade-offs between various implementation techniques. In contrast to many proposed architectures for groupware, these architectures have been synthesized through analysis of successful groupware systems whose properties are well-understood
{"title":"Quality Analysis of Distribution Architectures for Synchronous Groupware","authors":"T. Graham, W. Phillips, Christopher Wolfe","doi":"10.1109/COLCOM.2006.361870","DOIUrl":"https://doi.org/10.1109/COLCOM.2006.361870","url":null,"abstract":"This paper identifies a set of distribution architectures for the development of synchronous groupware and provides an analysis of their quality attributes. The architectures and their quality attributes provide insight on how to structure the implementation of synchronous groupware applications, providing developers with precise guidance on the trade-offs between various implementation techniques. In contrast to many proposed architectures for groupware, these architectures have been synthesized through analysis of successful groupware systems whose properties are well-understood","PeriodicalId":315775,"journal":{"name":"2006 International Conference on Collaborative Computing: Networking, Applications and Worksharing","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117180064","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-11-01DOI: 10.1109/COLCOM.2006.361899
S. Citro, J. McGovern, C. Ryan
Real time mobile collaboration systems allow two or more geographically separated users to work on a shared document at the same time. There has been a large amount of work on consistency management for real-time collaboration in replicated architectures, however, the algorithms depend on fixed membership, and are not suited to ad-hoc mobile networks. This paper builds on the previous work of the authors by enhancing the algorithm to handle membership events. The proposed algorithm is built on point to point membership management, and uses a state map to handle multiple sites joining the session at the same time. It is able to manage all membership events while maintaining document consistency. The algorithm has been implemented and evaluated across a number of mobile collaboration scenarios. The results show that the algorithm is able to handle membership events correctly with a relatively low impact on resource consumption
{"title":"Extending Real Time Mobile Collaboration Algorithms to Handle Membership Events in an Ad-Hoc Mobile Network","authors":"S. Citro, J. McGovern, C. Ryan","doi":"10.1109/COLCOM.2006.361899","DOIUrl":"https://doi.org/10.1109/COLCOM.2006.361899","url":null,"abstract":"Real time mobile collaboration systems allow two or more geographically separated users to work on a shared document at the same time. There has been a large amount of work on consistency management for real-time collaboration in replicated architectures, however, the algorithms depend on fixed membership, and are not suited to ad-hoc mobile networks. This paper builds on the previous work of the authors by enhancing the algorithm to handle membership events. The proposed algorithm is built on point to point membership management, and uses a state map to handle multiple sites joining the session at the same time. It is able to manage all membership events while maintaining document consistency. The algorithm has been implemented and evaluated across a number of mobile collaboration scenarios. The results show that the algorithm is able to handle membership events correctly with a relatively low impact on resource consumption","PeriodicalId":315775,"journal":{"name":"2006 International Conference on Collaborative Computing: Networking, Applications and Worksharing","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114149393","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-11-01DOI: 10.1109/COLCOM.2006.361880
Shuxin Yin, I. Ray, I. Ray
With the growth of mobile and sensor devices, embedded systems, and communication technologies, we are moving towards an era of pervasive computing. Pervasive computing applications typically involve interactions between a large number of entities that span different organizations. Uncontrolled disclosure of information or unconstrained interaction among entities may have extremely grave consequences. Traditional security policies and mechanisms are inadequate for pervasive computing applications. Unlike traditional applications, pervasive computing applications have no definite security perimeters and are dynamic in nature. Pervasive computing applications may need to interact with entities that are not known a priori and therefore cannot be trusted. The traditional binary notion of trust where known entities are completely trusted and unknown entities are distrusted are not suitable for such applications. To fill this gap, we develop a trust model useful for pervasive computing applications and develop strategies for establishing trust between entities. The model must accommodate the notion of different degrees of trust, identify how to determine the trust value, and define how trust changes over time
{"title":"A Trust Model for Pervasive Computing Environments","authors":"Shuxin Yin, I. Ray, I. Ray","doi":"10.1109/COLCOM.2006.361880","DOIUrl":"https://doi.org/10.1109/COLCOM.2006.361880","url":null,"abstract":"With the growth of mobile and sensor devices, embedded systems, and communication technologies, we are moving towards an era of pervasive computing. Pervasive computing applications typically involve interactions between a large number of entities that span different organizations. Uncontrolled disclosure of information or unconstrained interaction among entities may have extremely grave consequences. Traditional security policies and mechanisms are inadequate for pervasive computing applications. Unlike traditional applications, pervasive computing applications have no definite security perimeters and are dynamic in nature. Pervasive computing applications may need to interact with entities that are not known a priori and therefore cannot be trusted. The traditional binary notion of trust where known entities are completely trusted and unknown entities are distrusted are not suitable for such applications. To fill this gap, we develop a trust model useful for pervasive computing applications and develop strategies for establishing trust between entities. The model must accommodate the notion of different degrees of trust, identify how to determine the trust value, and define how trust changes over time","PeriodicalId":315775,"journal":{"name":"2006 International Conference on Collaborative Computing: Networking, Applications and Worksharing","volume":"67 4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132759857","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
扫码关注我们
求助内容：
应助结果提醒方式：