Pub Date : 2005-12-19DOI: 10.1109/COLCOM.2005.1651223
S. Biaz, Yiming Ji, P. Agrawal
The demand for location based applications including network intrusion detection has grown tremendously lately. However, location determination of indoor mobile users is challenging because of the complexities of the indoor radio propagation characteristics. A radio-frequency (RF) based indoor localization system, like ARIADNE, typically operates by first constructing a lookup table mapping the radio signal strength at different known locations in the building, and then a mobile user's location at an arbitrary point in the building is determined by measuring the signal strength at the location in question and searching the corresponding location from the above lookup table. Usually, the mobile user's signal strength is measured by three or more sniffers mechanically deployed inside the building. Obviously, the sniffers position configuration and the number of available sniffers greatly affect the localization performance. This paper presents experimental results that explore the impact of the sniffers deployment on the localization based on the ARIADNE system. The results demonstrate that the triangular deployment and extra available sniffers generally generate better localization performance
{"title":"Impact of sniffer deployment on indoor localization","authors":"S. Biaz, Yiming Ji, P. Agrawal","doi":"10.1109/COLCOM.2005.1651223","DOIUrl":"https://doi.org/10.1109/COLCOM.2005.1651223","url":null,"abstract":"The demand for location based applications including network intrusion detection has grown tremendously lately. However, location determination of indoor mobile users is challenging because of the complexities of the indoor radio propagation characteristics. A radio-frequency (RF) based indoor localization system, like ARIADNE, typically operates by first constructing a lookup table mapping the radio signal strength at different known locations in the building, and then a mobile user's location at an arbitrary point in the building is determined by measuring the signal strength at the location in question and searching the corresponding location from the above lookup table. Usually, the mobile user's signal strength is measured by three or more sniffers mechanically deployed inside the building. Obviously, the sniffers position configuration and the number of available sniffers greatly affect the localization performance. This paper presents experimental results that explore the impact of the sniffers deployment on the localization based on the ARIADNE system. The results demonstrate that the triangular deployment and extra available sniffers generally generate better localization performance","PeriodicalId":365186,"journal":{"name":"2005 International Conference on Collaborative Computing: Networking, Applications and Worksharing","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114302788","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 : 2005-12-19DOI: 10.1109/COLCOM.2005.1651225
J. E. Ferreira, Osvaldo Kotaro Takai, C. Pu
Business process integration is a serious challenge in collaborative information systems due to the potential interference among them. This paper describes RiverFish architecture to solving integration problems in collaborative information systems that belong to e-commerce environment. DECA application has been used to show a good example of a non-trivial problem of this integration. DECA application controls the processing application involving several government agencies to illustrate a new application called DECA. Each step of DECA processes various levels of check points and stores the results into associated collaborative information systems. This application has served more than 2 million users since 2000, demonstrating the reliability and support for evolution of RiverFish approach
{"title":"Integration of collaborative information system in Internet applications using RiverFish architecture","authors":"J. E. Ferreira, Osvaldo Kotaro Takai, C. Pu","doi":"10.1109/COLCOM.2005.1651225","DOIUrl":"https://doi.org/10.1109/COLCOM.2005.1651225","url":null,"abstract":"Business process integration is a serious challenge in collaborative information systems due to the potential interference among them. This paper describes RiverFish architecture to solving integration problems in collaborative information systems that belong to e-commerce environment. DECA application has been used to show a good example of a non-trivial problem of this integration. DECA application controls the processing application involving several government agencies to illustrate a new application called DECA. Each step of DECA processes various levels of check points and stores the results into associated collaborative information systems. This application has served more than 2 million users since 2000, demonstrating the reliability and support for evolution of RiverFish approach","PeriodicalId":365186,"journal":{"name":"2005 International Conference on Collaborative Computing: Networking, Applications and Worksharing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130501401","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 : 2005-12-19DOI: 10.1109/COLCOM.2005.1651236
Praveen Kumar, S. Gopalan, V. Sridhar
Peer-to-peer (P2P) networks are increasingly gaining acceptance over the Internet as they provide an infrastructure for content search and exchange between anonymous peers. The open and anonymous nature of P2P networks exposes a number of security vulnerabilities including the problem of finding reliable trustworthy communication partners. In this paper, we propose Q-Chain which provides a trust computation framework by building reputation based trust chains in decentralized P2P networks. Separate Q-Chains are established to evaluate trustworthiness of a peer for the different content types it provides to other peers in the P2P network. A peer's trust rating value is present across several Q-Chains which makes trust computation and management more fault-tolerant in a highly dynamic P2P environment. We implemented Q-Chain using GnutellaSim simulator and the trust computation results obtained are encouraging and more accurate than some of the existing models
{"title":"Q-Chain: building reputation based trust chains in decentralized peer-to-peer networks","authors":"Praveen Kumar, S. Gopalan, V. Sridhar","doi":"10.1109/COLCOM.2005.1651236","DOIUrl":"https://doi.org/10.1109/COLCOM.2005.1651236","url":null,"abstract":"Peer-to-peer (P2P) networks are increasingly gaining acceptance over the Internet as they provide an infrastructure for content search and exchange between anonymous peers. The open and anonymous nature of P2P networks exposes a number of security vulnerabilities including the problem of finding reliable trustworthy communication partners. In this paper, we propose Q-Chain which provides a trust computation framework by building reputation based trust chains in decentralized P2P networks. Separate Q-Chains are established to evaluate trustworthiness of a peer for the different content types it provides to other peers in the P2P network. A peer's trust rating value is present across several Q-Chains which makes trust computation and management more fault-tolerant in a highly dynamic P2P environment. We implemented Q-Chain using GnutellaSim simulator and the trust computation results obtained are encouraging and more accurate than some of the existing models","PeriodicalId":365186,"journal":{"name":"2005 International Conference on Collaborative Computing: Networking, Applications and Worksharing","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125395506","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 : 2005-12-01DOI: 10.1109/COLCOM.2005.1651264
David Hales, Stefano Arteconi, Özalp Babaoglu
Peer-to-peer applications can benefit from human friendship networks (e.g., e-mail contacts or instant message buddy lists). However these are not always available. We propose an algorithm, called SLACER that allows peer nodes to create their own friendship networks, through randomized interactions, producing an artificial social network (ASN) where nodes share high trust with their neighbors
{"title":"SLACER: randomness to cooperation in peer-to-peer networks","authors":"David Hales, Stefano Arteconi, Özalp Babaoglu","doi":"10.1109/COLCOM.2005.1651264","DOIUrl":"https://doi.org/10.1109/COLCOM.2005.1651264","url":null,"abstract":"Peer-to-peer applications can benefit from human friendship networks (e.g., e-mail contacts or instant message buddy lists). However these are not always available. We propose an algorithm, called SLACER that allows peer nodes to create their own friendship networks, through randomized interactions, producing an artificial social network (ASN) where nodes share high trust with their neighbors","PeriodicalId":365186,"journal":{"name":"2005 International Conference on Collaborative Computing: Networking, Applications and Worksharing","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125568321","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 : 2005-09-27DOI: 10.1109/COLCOM.2005.1651227
Frederic Montagut, R. Molva
As opposed to existing workflow management systems, the distributed execution of workflows in pervasive environments can not rely on centralized control. The dynamic nature of the pervasive environments on the other hand does not allow a permanent assignment of roles to devices. In this paper, we suggest an architecture supporting distributed execution of workflows in pervasive environments based on a fully decentralized control and dynamic assignment of roles to devices. The architecture is defined in terms of data structures associated with the workflow execution plan and dynamic information, a protocol for the exchange of the workflow data among devices and a new function called role discovery dealing with the dynamic assignment of roles to devices. This architecture is applied in the context of Web services using BPEL as workflow description language
{"title":"Enabling pervasive execution of workflows","authors":"Frederic Montagut, R. Molva","doi":"10.1109/COLCOM.2005.1651227","DOIUrl":"https://doi.org/10.1109/COLCOM.2005.1651227","url":null,"abstract":"As opposed to existing workflow management systems, the distributed execution of workflows in pervasive environments can not rely on centralized control. The dynamic nature of the pervasive environments on the other hand does not allow a permanent assignment of roles to devices. In this paper, we suggest an architecture supporting distributed execution of workflows in pervasive environments based on a fully decentralized control and dynamic assignment of roles to devices. The architecture is defined in terms of data structures associated with the workflow execution plan and dynamic information, a protocol for the exchange of the workflow data among devices and a new function called role discovery dealing with the dynamic assignment of roles to devices. This architecture is applied in the context of Web services using BPEL as workflow description language","PeriodicalId":365186,"journal":{"name":"2005 International Conference on Collaborative Computing: Networking, Applications and Worksharing","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-09-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133478729","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 : 2005-02-01DOI: 10.1109/COLCOM.2005.1651216
James S. K. Newell, Indranil Gupta
Peer-to-peer distributed hash tables (P2P DHTs) are individually built by their designers with specific performance goals in mind. However, no individual DHT can satisfy an application that requires a "best of all worlds" performance, viz., adaptive behavior at run-time. We propose the MultiRouter, a light-weight solution that provides adaptivity to the application using a DHT-independent approach. By merely making run-time choices to select from among multiple DHT protocols using simple cost functions, we show the MultiRouter is able to provide a best-of-all-DHTs run-time performance with respect to object access times and churn-resistance. In addition, the MultiRouter is not limited to any particular set of DHT implementations since the interaction occurs in a black box manner, i.e., through well-defined interfaces. We present microbenchmark and trace-driven experiments to show that if one fixes bandwidth at each node, the MultiRouter outperforms the component DHTs
{"title":"The P2P MultiRouter: a black box approach to run-time adaptivity for P2P DHTs","authors":"James S. K. Newell, Indranil Gupta","doi":"10.1109/COLCOM.2005.1651216","DOIUrl":"https://doi.org/10.1109/COLCOM.2005.1651216","url":null,"abstract":"Peer-to-peer distributed hash tables (P2P DHTs) are individually built by their designers with specific performance goals in mind. However, no individual DHT can satisfy an application that requires a \"best of all worlds\" performance, viz., adaptive behavior at run-time. We propose the MultiRouter, a light-weight solution that provides adaptivity to the application using a DHT-independent approach. By merely making run-time choices to select from among multiple DHT protocols using simple cost functions, we show the MultiRouter is able to provide a best-of-all-DHTs run-time performance with respect to object access times and churn-resistance. In addition, the MultiRouter is not limited to any particular set of DHT implementations since the interaction occurs in a black box manner, i.e., through well-defined interfaces. We present microbenchmark and trace-driven experiments to show that if one fixes bandwidth at each node, the MultiRouter outperforms the component DHTs","PeriodicalId":365186,"journal":{"name":"2005 International Conference on Collaborative Computing: Networking, Applications and Worksharing","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126468096","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 : 2005-02-01DOI: 10.1109/COLCOM.2005.1651260
Ramsés Morales, Indranil Gupta
Distributed systems are typically designed for scale and performance first, which makes it difficult to add security later without affecting the original properties. This paper proposes the design of the Folklore persistent distributed storage system, which adopts an alternative design methodology. Folklore's design relies on a single core protocol for providing both probabilistic scalability and untraceability, the latter being a special notion of probabilistic security. The core protocol is a biologically inspired model of endemic replication that migrates replicas of files among all hosts in a continuous and proactive manner. The emergent behavior is chaotic, meaning that the exact number and location of all replicas of any file is changing all the time. This makes it difficult for an attacker to target any file. Yet, the protocol is scalable - it consumes constant per-host bandwidth, and the number of replicas per file stays close to a small self-stabilizing value. The self-stabilizing value is reached even if only one replica survives a massive attack. The simplicity of the core protocol allows augmentation with mechanisms that allow data integrity, availability, and updatability. We describe the internals of the Folklore system, present attack analysis, and give experimental results from a prototype that shows high resilience to large-scale attacks
{"title":"Providing both scale and security through a single core probabilistic protocol","authors":"Ramsés Morales, Indranil Gupta","doi":"10.1109/COLCOM.2005.1651260","DOIUrl":"https://doi.org/10.1109/COLCOM.2005.1651260","url":null,"abstract":"Distributed systems are typically designed for scale and performance first, which makes it difficult to add security later without affecting the original properties. This paper proposes the design of the Folklore persistent distributed storage system, which adopts an alternative design methodology. Folklore's design relies on a single core protocol for providing both probabilistic scalability and untraceability, the latter being a special notion of probabilistic security. The core protocol is a biologically inspired model of endemic replication that migrates replicas of files among all hosts in a continuous and proactive manner. The emergent behavior is chaotic, meaning that the exact number and location of all replicas of any file is changing all the time. This makes it difficult for an attacker to target any file. Yet, the protocol is scalable - it consumes constant per-host bandwidth, and the number of replicas per file stays close to a small self-stabilizing value. The self-stabilizing value is reached even if only one replica survives a massive attack. The simplicity of the core protocol allows augmentation with mechanisms that allow data integrity, availability, and updatability. We describe the internals of the Folklore system, present attack analysis, and give experimental results from a prototype that shows high resilience to large-scale attacks","PeriodicalId":365186,"journal":{"name":"2005 International Conference on Collaborative Computing: Networking, Applications and Worksharing","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131643291","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 : 1900-01-01DOI: 10.1109/colcom.2005.1651256
{"title":"StoDiS 2005: 1stWorkshop on Stochasticity in Distributed Systems","authors":"","doi":"10.1109/colcom.2005.1651256","DOIUrl":"https://doi.org/10.1109/colcom.2005.1651256","url":null,"abstract":"","PeriodicalId":365186,"journal":{"name":"2005 International Conference on Collaborative Computing: Networking, Applications and Worksharing","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116800244","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 : 1900-01-01DOI: 10.1109/COLCOM.2005.1651206
S. Madhani, M. Tauil, Zhang Tao
This paper considers how uncontrolled mobiles can be used to collaboratively accomplish sensing tasks. Uncontrolled mobiles are mobile devices whose movements cannot be easily controlled for the purpose of achieving a task. Examples include sensors mounted on mobile vehicles of people to monitor air quality and to detect potential airborne nuclear, biological, or chemical agents. We describe an approach for using uncontrolled mobile devices for collaborative sensing. Considering the potentially large number of mobile sensors that may be required to monitor a large geographical area such as a city, a key issue is how to achieve a proper balance between performance and costs. We present analytical results on the rate of information reporting by uncontrolled mobile sensors needed to cover a given geographical area. We also present results from testbed implementations to demonstrate the feasibility of using existing low-cost software technologies and platforms with existing standard protocols for information reporting and retrieval to support a large system of uncontrolled mobile sensors
{"title":"Collaborative sensing using uncontrolled mobile devices","authors":"S. Madhani, M. Tauil, Zhang Tao","doi":"10.1109/COLCOM.2005.1651206","DOIUrl":"https://doi.org/10.1109/COLCOM.2005.1651206","url":null,"abstract":"This paper considers how uncontrolled mobiles can be used to collaboratively accomplish sensing tasks. Uncontrolled mobiles are mobile devices whose movements cannot be easily controlled for the purpose of achieving a task. Examples include sensors mounted on mobile vehicles of people to monitor air quality and to detect potential airborne nuclear, biological, or chemical agents. We describe an approach for using uncontrolled mobile devices for collaborative sensing. Considering the potentially large number of mobile sensors that may be required to monitor a large geographical area such as a city, a key issue is how to achieve a proper balance between performance and costs. We present analytical results on the rate of information reporting by uncontrolled mobile sensors needed to cover a given geographical area. We also present results from testbed implementations to demonstrate the feasibility of using existing low-cost software technologies and platforms with existing standard protocols for information reporting and retrieval to support a large system of uncontrolled mobile sensors","PeriodicalId":365186,"journal":{"name":"2005 International Conference on Collaborative Computing: Networking, Applications and Worksharing","volume":"257 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133648862","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
扫码关注我们
求助内容：
应助结果提醒方式：