Pub Date : 2003-03-23DOI: 10.1109/PERCOM.2003.1192724
S. Ponnekanti, A. Fox
To programmatically discover and interact with services in ubiquitous computing environments, an application needs to solve two problems: (1) is it semantically meaningful to interact with a service? If the task is "printing a file", a printer service would be appropriate, but a screen rendering service or CD player service would not. (2) If yes, what are the mechanics of interacting with the service - remote invocation mechanics, names of methods, numbers and types of arguments, etc.? Existing service frameworks such as Jini and UPnP conflate these problems - two services are "semantically compatible" if and only if their interface signatures match. As a result, interoperability is severely restricted unless there is a single, globally agreed-upon, unique interface for each service type. By separating the two subproblems and delegating different parts of the problem to the user and the system, we show how applications can interoperate with services even when globally unique interfaces do not exist for certain services.
{"title":"Application-service interoperation without standardized service interfaces","authors":"S. Ponnekanti, A. Fox","doi":"10.1109/PERCOM.2003.1192724","DOIUrl":"https://doi.org/10.1109/PERCOM.2003.1192724","url":null,"abstract":"To programmatically discover and interact with services in ubiquitous computing environments, an application needs to solve two problems: (1) is it semantically meaningful to interact with a service? If the task is \"printing a file\", a printer service would be appropriate, but a screen rendering service or CD player service would not. (2) If yes, what are the mechanics of interacting with the service - remote invocation mechanics, names of methods, numbers and types of arguments, etc.? Existing service frameworks such as Jini and UPnP conflate these problems - two services are \"semantically compatible\" if and only if their interface signatures match. As a result, interoperability is severely restricted unless there is a single, globally agreed-upon, unique interface for each service type. By separating the two subproblems and delegating different parts of the problem to the user and the system, we show how applications can interoperate with services even when globally unique interfaces do not exist for certain services.","PeriodicalId":230787,"journal":{"name":"Proceedings of the First IEEE International Conference on Pervasive Computing and Communications, 2003. (PerCom 2003).","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124097453","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 : 2003-03-23DOI: 10.1109/PERCOM.2003.1192787
Jeong-Joon Yoo, Dong-Ik Lee
Cyber apartment is a home network consisting of hundreds of homes and/or offices. In this home network system, hundreds of processes are simultaneously instantiated. In such a case, a home gateway that connects one home network with other home networks results in a bottleneck. To solve this problem, the remote interactions and network load between home networks must be reduced. We propose the use of mobile agents, referred to as a remote service integration agent and a content adaptation agent, in order to reduce the remote interactions and the network load, respectively. We show that our mobile agent models are effective methods for a scalable home network through a comparison with a traditional client server model.
{"title":"Scalable home network interaction model based on mobile agents","authors":"Jeong-Joon Yoo, Dong-Ik Lee","doi":"10.1109/PERCOM.2003.1192787","DOIUrl":"https://doi.org/10.1109/PERCOM.2003.1192787","url":null,"abstract":"Cyber apartment is a home network consisting of hundreds of homes and/or offices. In this home network system, hundreds of processes are simultaneously instantiated. In such a case, a home gateway that connects one home network with other home networks results in a bottleneck. To solve this problem, the remote interactions and network load between home networks must be reduced. We propose the use of mobile agents, referred to as a remote service integration agent and a content adaptation agent, in order to reduce the remote interactions and the network load, respectively. We show that our mobile agent models are effective methods for a scalable home network through a comparison with a traditional client server model.","PeriodicalId":230787,"journal":{"name":"Proceedings of the First IEEE International Conference on Pervasive Computing and Communications, 2003. (PerCom 2003).","volume":"86 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114606974","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 : 2003-03-23DOI: 10.1109/PERCOM.2003.1192730
C. Borcea, C. Intanagonwiwat, Akhilesh Saxena, L. Iftode
Smart messages (SMs) are dynamic collections of code and data that migrate to nodes of interest in the network and execute on these nodes. A key challenge in programming pervasive computing environments using SMs is the ability to route SMs to nodes named by content. This paper describes the SM self-routing mechanism, which allows SMs to route themselves at each hop in the path toward a node of interest. SM applications can choose among multiple content based routing algorithms, switch dynamically the routing algorithm in use, or even implement the best suited routing algorithm for their needs. The main benefits provided by self-routing are high flexibility and resilience to adverse network conditions. To demonstrate these benefits, we present proof-of-concept implementation, simulation results, and analysis for the SM self-routing mechanism using several content-based routing algorithms. We also show preliminary results for SM routing algorithms executed over our SM prototype implementation.
{"title":"Self-routing in pervasive computing environments using smart messages","authors":"C. Borcea, C. Intanagonwiwat, Akhilesh Saxena, L. Iftode","doi":"10.1109/PERCOM.2003.1192730","DOIUrl":"https://doi.org/10.1109/PERCOM.2003.1192730","url":null,"abstract":"Smart messages (SMs) are dynamic collections of code and data that migrate to nodes of interest in the network and execute on these nodes. A key challenge in programming pervasive computing environments using SMs is the ability to route SMs to nodes named by content. This paper describes the SM self-routing mechanism, which allows SMs to route themselves at each hop in the path toward a node of interest. SM applications can choose among multiple content based routing algorithms, switch dynamically the routing algorithm in use, or even implement the best suited routing algorithm for their needs. The main benefits provided by self-routing are high flexibility and resilience to adverse network conditions. To demonstrate these benefits, we present proof-of-concept implementation, simulation results, and analysis for the SM self-routing mechanism using several content-based routing algorithms. We also show preliminary results for SM routing algorithms executed over our SM prototype implementation.","PeriodicalId":230787,"journal":{"name":"Proceedings of the First IEEE International Conference on Pervasive Computing and Communications, 2003. (PerCom 2003).","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132944394","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 : 2003-03-23DOI: 10.1109/PERCOM.2003.1192733
A. Kameas, S. Bellis, I. Mavrommati, K. Delaney, M. Colley, Anthony Pounds-Cornish
The paper describes research that has been carried out in "extrovert-Gadgets", a research project funded in the context of EU IST/FET proactive initiative "Disappearing Computer". It presents a set of architectures for the composition of ubiquitous computing applications. The proposed architectures are part of GAS (Gadgetware Architectural Style), a generic architectural style, which can be used to describe everyday environments populated with computational artifacts. The overall innovation of the GAS approach lies in viewing the process where people configure and use complex collections of interacting eGadgets, as having much in common with the process where system builders design software systems out of components. This approach regards the everyday environment as being populated with tens even hundreds of artifacts, which people (who are always in control) associate in ad-hoc and dynamic ways.
{"title":"An architecture that treats everyday objects as communicating tangible components","authors":"A. Kameas, S. Bellis, I. Mavrommati, K. Delaney, M. Colley, Anthony Pounds-Cornish","doi":"10.1109/PERCOM.2003.1192733","DOIUrl":"https://doi.org/10.1109/PERCOM.2003.1192733","url":null,"abstract":"The paper describes research that has been carried out in \"extrovert-Gadgets\", a research project funded in the context of EU IST/FET proactive initiative \"Disappearing Computer\". It presents a set of architectures for the composition of ubiquitous computing applications. The proposed architectures are part of GAS (Gadgetware Architectural Style), a generic architectural style, which can be used to describe everyday environments populated with computational artifacts. The overall innovation of the GAS approach lies in viewing the process where people configure and use complex collections of interacting eGadgets, as having much in common with the process where system builders design software systems out of components. This approach regards the everyday environment as being populated with tens even hundreds of artifacts, which people (who are always in control) associate in ad-hoc and dynamic ways.","PeriodicalId":230787,"journal":{"name":"Proceedings of the First IEEE International Conference on Pervasive Computing and Communications, 2003. (PerCom 2003).","volume":"415 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133511443","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 : 2003-03-23DOI: 10.1109/PERCOM.2003.1192746
Feng Zhu, M. Mutka, L. Ni
In pervasive computing environments, powerful handheld devices with wireless connections create opportunities for many new nomadic applications. We propose a new service discovery model, called Splendor, supporting nomadic users and services in public environments. Splendor emphasizes security and supports privacy. Location awareness is integrated for location dependent services discovery and is used to lessen service discovery network infrastructure requirements. We analyze the Splendor system performance and provide our experimental results.
{"title":"Splendor: A secure, private, and location-aware service discovery protocol supporting mobile services","authors":"Feng Zhu, M. Mutka, L. Ni","doi":"10.1109/PERCOM.2003.1192746","DOIUrl":"https://doi.org/10.1109/PERCOM.2003.1192746","url":null,"abstract":"In pervasive computing environments, powerful handheld devices with wireless connections create opportunities for many new nomadic applications. We propose a new service discovery model, called Splendor, supporting nomadic users and services in public environments. Splendor emphasizes security and supports privacy. Location awareness is integrated for location dependent services discovery and is used to lessen service discovery network infrastructure requirements. We analyze the Splendor system performance and provide our experimental results.","PeriodicalId":230787,"journal":{"name":"Proceedings of the First IEEE International Conference on Pervasive Computing and Communications, 2003. (PerCom 2003).","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130609765","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 : 2003-03-23DOI: 10.1109/PERCOM.2003.1192741
Yi Lu, Weichao Wang, Y. Zhong, B. Bhargava
We investigate the performance issues of destination-sequenced distance vector (DSDV) and ad-hoc on-demand distance vector (AODV) routing protocols for mobile ad hoc networks. Four performance metrics are measured by varying the maximum speed of mobile hosts, the number of connections, and the network size. The correlation between network topology change and mobility is investigated by using linear regression analysis. The simulation results indicate that AODV outperforms DSDV in less stressful situations, while DSDV is more scalable with respect to the network size. It is observed that network congestion is the dominant reason for packet drop for both protocols. We propose a new routing protocol, congestion-aware distance vector (CADV), to address the congestion issues. CADV outperforms AODV in delivery ratio by about 5%, while introduces less protocol load. The result demonstrates that integrating congestion avoidance mechanisms with proactive routing protocols is a promising way to improve performance.
{"title":"Study of distance vector routing protocols for mobile ad hoc networks","authors":"Yi Lu, Weichao Wang, Y. Zhong, B. Bhargava","doi":"10.1109/PERCOM.2003.1192741","DOIUrl":"https://doi.org/10.1109/PERCOM.2003.1192741","url":null,"abstract":"We investigate the performance issues of destination-sequenced distance vector (DSDV) and ad-hoc on-demand distance vector (AODV) routing protocols for mobile ad hoc networks. Four performance metrics are measured by varying the maximum speed of mobile hosts, the number of connections, and the network size. The correlation between network topology change and mobility is investigated by using linear regression analysis. The simulation results indicate that AODV outperforms DSDV in less stressful situations, while DSDV is more scalable with respect to the network size. It is observed that network congestion is the dominant reason for packet drop for both protocols. We propose a new routing protocol, congestion-aware distance vector (CADV), to address the congestion issues. CADV outperforms AODV in delivery ratio by about 5%, while introduces less protocol load. The result demonstrates that integrating congestion avoidance mechanisms with proactive routing protocols is a promising way to improve performance.","PeriodicalId":230787,"journal":{"name":"Proceedings of the First IEEE International Conference on Pervasive Computing and Communications, 2003. (PerCom 2003).","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131405948","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 : 2003-03-23DOI: 10.1109/PERCOM.2003.1192723
Yohei Iwasaki, Nobuo Kawaguchi, Y. Inagaki
The spread of short distance wireless communication technology is making it possible for various information appliances to communicate through a network. However, to connect and to use them, we must generally perform complicated setup operations such as setting addresses or names. In this paper, we propose a user-friendly connecting management framework called " Touch-and-Connect". With this method, we can connect any networked devices only by touching them. This system is designed so that it can work without a server and even if many individuals operate it independently, no incorrect connections occur. And we have exemplified the usefulness of this framework with subject experiments.
{"title":"Touch-and-connect: a connection request framework for ad-hoc networks and the pervasive computing environment","authors":"Yohei Iwasaki, Nobuo Kawaguchi, Y. Inagaki","doi":"10.1109/PERCOM.2003.1192723","DOIUrl":"https://doi.org/10.1109/PERCOM.2003.1192723","url":null,"abstract":"The spread of short distance wireless communication technology is making it possible for various information appliances to communicate through a network. However, to connect and to use them, we must generally perform complicated setup operations such as setting addresses or names. In this paper, we propose a user-friendly connecting management framework called \" Touch-and-Connect\". With this method, we can connect any networked devices only by touching them. This system is designed so that it can work without a server and even if many individuals operate it independently, no incorrect connections occur. And we have exemplified the usefulness of this framework with subject experiments.","PeriodicalId":230787,"journal":{"name":"Proceedings of the First IEEE International Conference on Pervasive Computing and Communications, 2003. (PerCom 2003).","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130967216","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 : 2003-03-23DOI: 10.1109/PERCOM.2003.1192747
Guanling Chen, D. Kotz
This paper presents the "Solar" system framework that allows resources to advertise context-sensitive names and for applications to make context-sensitive name queries. The heart of our framework is a small specification language that allows composition of "context-processing operators" to calculate the desired context. Resources use the framework to register names, and applications use the framework to look up context-sensitive name descriptions. The back-end system executes these operators and constantly updates the context values, adjusting advertised names and informing applications about changes. We report experimental results from a prototype, using a modified version of the intentional naming system (INS) as the core directory service.
{"title":"Context-sensitive resource discovery","authors":"Guanling Chen, D. Kotz","doi":"10.1109/PERCOM.2003.1192747","DOIUrl":"https://doi.org/10.1109/PERCOM.2003.1192747","url":null,"abstract":"This paper presents the \"Solar\" system framework that allows resources to advertise context-sensitive names and for applications to make context-sensitive name queries. The heart of our framework is a small specification language that allows composition of \"context-processing operators\" to calculate the desired context. Resources use the framework to register names, and applications use the framework to look up context-sensitive name descriptions. The back-end system executes these operators and constantly updates the context values, adjusting advertised names and informing applications about changes. We report experimental results from a prototype, using a modified version of the intentional naming system (INS) as the core directory service.","PeriodicalId":230787,"journal":{"name":"Proceedings of the First IEEE International Conference on Pervasive Computing and Communications, 2003. (PerCom 2003).","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133270536","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 : 2003-03-23DOI: 10.1109/PERCOM.2003.1192749
M. Brunato, R. Battiti
Mobile computing adds a mostly unexplored dimension to data mining: user's position is a relevant piece of information, and recommendation systems, selecting and ranking links of interest to the user, have the opportunity to take location into account. In this paper a mobility-aware recommendation system that considers the location of the user to filter recommended links is proposed. To avoid the potential problems and costs of insertion by hand, a new middleware layer, the location broker, maintains a historic database of locations and corresponding links used in the past and develops models relating resources to their spatial usage pattern. These models are used to calculate a preference metric when the current user is asking for resources of interest. Mobility scenarios are described and analyzed in terms of possible user requirements. The features of the PILGRIM mobile recommendation system are outlined together with a preliminary experimental evaluation of different metrics.
{"title":"PILGRIM: A location broker and mobility-aware recommendation system","authors":"M. Brunato, R. Battiti","doi":"10.1109/PERCOM.2003.1192749","DOIUrl":"https://doi.org/10.1109/PERCOM.2003.1192749","url":null,"abstract":"Mobile computing adds a mostly unexplored dimension to data mining: user's position is a relevant piece of information, and recommendation systems, selecting and ranking links of interest to the user, have the opportunity to take location into account. In this paper a mobility-aware recommendation system that considers the location of the user to filter recommended links is proposed. To avoid the potential problems and costs of insertion by hand, a new middleware layer, the location broker, maintains a historic database of locations and corresponding links used in the past and develops models relating resources to their spatial usage pattern. These models are used to calculate a preference metric when the current user is asking for resources of interest. Mobility scenarios are described and analyzed in terms of possible user requirements. The features of the PILGRIM mobile recommendation system are outlined together with a preliminary experimental evaluation of different metrics.","PeriodicalId":230787,"journal":{"name":"Proceedings of the First IEEE International Conference on Pervasive Computing and Communications, 2003. (PerCom 2003).","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132773956","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 : 2003-03-23DOI: 10.1109/PERCOM.2003.1192757
Sachiko Yoshihama, Paul B. Chou, Danny C. Wong
It has become increasingly important to support agile organizations with easily re-configurable work environments. This paper describes an on-going work on a platform for managing behavior of intelligent environments. The platform promotes the development of futuristic workspaces that support people's work practices in an unobtrusive, context-aware, and personalized manner. The platform accommodates individual preferences and organizational policies in a way that allows rapid and impromptu customizations. There are several advantages to this, in particular, the ability to represent users' preferences about their work environments separately from the actual configurations of the physical spaces they occupy at a given time, thus supporting emerging workplace needs such as hoteling and impromptu group settings.
{"title":"Managing behavior of intelligent environments","authors":"Sachiko Yoshihama, Paul B. Chou, Danny C. Wong","doi":"10.1109/PERCOM.2003.1192757","DOIUrl":"https://doi.org/10.1109/PERCOM.2003.1192757","url":null,"abstract":"It has become increasingly important to support agile organizations with easily re-configurable work environments. This paper describes an on-going work on a platform for managing behavior of intelligent environments. The platform promotes the development of futuristic workspaces that support people's work practices in an unobtrusive, context-aware, and personalized manner. The platform accommodates individual preferences and organizational policies in a way that allows rapid and impromptu customizations. There are several advantages to this, in particular, the ability to represent users' preferences about their work environments separately from the actual configurations of the physical spaces they occupy at a given time, thus supporting emerging workplace needs such as hoteling and impromptu group settings.","PeriodicalId":230787,"journal":{"name":"Proceedings of the First IEEE International Conference on Pervasive Computing and Communications, 2003. (PerCom 2003).","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132219139","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
扫码关注我们
求助内容：
应助结果提醒方式：