Pub Date : 2003-03-23DOI: 10.1109/PERCOM.2003.1192764
Patrick Peursum, S. Venkatesh, G. West, H. Bui
The paper presents a method for finding and classifying objects within real-world scenes by using the activity of humans interacting with these objects to infer the object's identity. Objects are labelled using evidence accumulated over time and multiple instances of human interactions. This approach is inspired by the problems and opportunities that exist in recognition tasks for intelligent homes, namely cluttered, wide-angle views coupled with significant and repeated human activity within the scene. The advantages of such an approach include the ability to detect salient objects in a cluttered scene, independent of the object's physical structure, adapt to changes in the scene and resolve conflicts in labels by weight of past evidence. This initial investigation seeks to label chairs and open floor spaces by recognising activities such as walking and silting. Findings show that the approach can locate objects with a reasonably high degree of accuracy, with occlusions of the human actor being a significant aid in reducing over-labelling.
{"title":"Object labelling from human action recognition","authors":"Patrick Peursum, S. Venkatesh, G. West, H. Bui","doi":"10.1109/PERCOM.2003.1192764","DOIUrl":"https://doi.org/10.1109/PERCOM.2003.1192764","url":null,"abstract":"The paper presents a method for finding and classifying objects within real-world scenes by using the activity of humans interacting with these objects to infer the object's identity. Objects are labelled using evidence accumulated over time and multiple instances of human interactions. This approach is inspired by the problems and opportunities that exist in recognition tasks for intelligent homes, namely cluttered, wide-angle views coupled with significant and repeated human activity within the scene. The advantages of such an approach include the ability to detect salient objects in a cluttered scene, independent of the object's physical structure, adapt to changes in the scene and resolve conflicts in labels by weight of past evidence. This initial investigation seeks to label chairs and open floor spaces by recognising activities such as walking and silting. Findings show that the approach can locate objects with a reasonably high degree of accuracy, with occlusions of the human actor being a significant aid in reducing over-labelling.","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":"129768315","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.1192769
C. Becker, Gregor Schiele, Holger Gubbels, K. Rothermel
Pervasive computing environments add a multitude of additional devices to our current computing landscapes. Specialized embedded systems provide sensor information about the real world or offer a distinct functionality, e.g. presentation on a "smart wall". Spontaneous networking leads to constantly changing availability of services. This requires middleware support to ease application development. Additionally, we argue that an extensible middleware platform covering small embedded systems to fill-fledged desktop computers is needed. Such a middleware should provide easy-to-use abstractions to access remote services and device-specific capabilities. We present a micro-broker-based approach which meets these requirements by allowing uniform access to device capabilities and services through proxies and the integration of different interoperability protocols. A minimum configuration of the middleware can be executed on embedded systems. Resource-rich execution environments are supported by the extensibility of the middleware.
{"title":"BASE - a micro-broker-based middleware for pervasive computing","authors":"C. Becker, Gregor Schiele, Holger Gubbels, K. Rothermel","doi":"10.1109/PERCOM.2003.1192769","DOIUrl":"https://doi.org/10.1109/PERCOM.2003.1192769","url":null,"abstract":"Pervasive computing environments add a multitude of additional devices to our current computing landscapes. Specialized embedded systems provide sensor information about the real world or offer a distinct functionality, e.g. presentation on a \"smart wall\". Spontaneous networking leads to constantly changing availability of services. This requires middleware support to ease application development. Additionally, we argue that an extensible middleware platform covering small embedded systems to fill-fledged desktop computers is needed. Such a middleware should provide easy-to-use abstractions to access remote services and device-specific capabilities. We present a micro-broker-based approach which meets these requirements by allowing uniform access to device capabilities and services through proxies and the integration of different interoperability protocols. A minimum configuration of the middleware can be executed on embedded systems. Resource-rich execution environments are supported by the extensibility of the middleware.","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":"122274249","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.1192722
S. Ponnekanti, Brad Johanson, Emre Kıcıman, A. Fox
The dynamism and heterogeneity in ubicomp environments on both short and long time scales implies that middleware platforms for these environments need to be designed ground up for portability, extensibility and robustness. In this paper, we describe how we met these requirements in iROS, a middleware platform for a class of ubicomp environments, through the use of three guiding principles - economy of mechanism, client simplicity and levels of indirection. Apart from theoretical arguments and experimental results, experience through several deployments with a variety of apps, in most cases not done by the original designers of the system, provides some validation in practice that the design decisions have in fact resulted in the intended portability, extensibility and robustness. A retrospective examination of the system leads the authors to the following lesson: A logically-centralized design and physically-centralized implementation enables the best behavior in terms of extensibility and portability along with ease of administration, and sufficient behavior in terms of scalability and robustness.
{"title":"Portability, extensibility and robustness in iROS","authors":"S. Ponnekanti, Brad Johanson, Emre Kıcıman, A. Fox","doi":"10.1109/PERCOM.2003.1192722","DOIUrl":"https://doi.org/10.1109/PERCOM.2003.1192722","url":null,"abstract":"The dynamism and heterogeneity in ubicomp environments on both short and long time scales implies that middleware platforms for these environments need to be designed ground up for portability, extensibility and robustness. In this paper, we describe how we met these requirements in iROS, a middleware platform for a class of ubicomp environments, through the use of three guiding principles - economy of mechanism, client simplicity and levels of indirection. Apart from theoretical arguments and experimental results, experience through several deployments with a variety of apps, in most cases not done by the original designers of the system, provides some validation in practice that the design decisions have in fact resulted in the intended portability, extensibility and robustness. A retrospective examination of the system leads the authors to the following lesson: A logically-centralized design and physically-centralized implementation enables the best behavior in terms of extensibility and portability along with ease of administration, and sufficient behavior in terms of scalability and robustness.","PeriodicalId":230787,"journal":{"name":"Proceedings of the First IEEE International Conference on Pervasive Computing and Communications, 2003. (PerCom 2003).","volume":"35 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":"134327743","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.1192756
Stephen Peters, H. Shrobe
When building intelligent spaces, the knowledge representation for encapsulating rooms, users, groups, roles, and other information is a fundamental design question. We present a semantic network as such a representation, and demonstrate its utility as a basis for ongoing work.
{"title":"Using semantic networks for knowledge representation in an intelligent environment","authors":"Stephen Peters, H. Shrobe","doi":"10.1109/PERCOM.2003.1192756","DOIUrl":"https://doi.org/10.1109/PERCOM.2003.1192756","url":null,"abstract":"When building intelligent spaces, the knowledge representation for encapsulating rooms, users, groups, roles, and other information is a fundamental design question. We present a semantic network as such a representation, and demonstrate its utility as a basis for ongoing work.","PeriodicalId":230787,"journal":{"name":"Proceedings of the First IEEE International Conference on Pervasive Computing and Communications, 2003. (PerCom 2003).","volume":"37 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":"115462460","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.1192781
G. Záruba, Vamsi Chaluvadi, Azeem M. Suleman
Wireless ad hoc networks are becoming increasingly important in today's world. The most challenging problem in conjunction with ad hoc networks is routing, i.e., the procedure in charge of determining the trajectory of packets traveling over the network. For large-scale ad hoc networks scalability of the routing approach is extremely important. One of the approaches to scale up ad hoc routing is geographical location based routing, which usually requires all nodes to be aware of their exact locations. In this paper, a new routing algorithm is proposed which requires only a subset of nodes to know their exact location forming location areas around these nodes. This paper outlines the LABAR (Location Area Based Ad Hoc Routing) routing protocol and provides simulation measurements on its average routing distance compared to the optimum shortest path.
{"title":"LABAR: location area based ad hoc routing for GPS-scarce wide-area ad hoc networks","authors":"G. Záruba, Vamsi Chaluvadi, Azeem M. Suleman","doi":"10.1109/PERCOM.2003.1192781","DOIUrl":"https://doi.org/10.1109/PERCOM.2003.1192781","url":null,"abstract":"Wireless ad hoc networks are becoming increasingly important in today's world. The most challenging problem in conjunction with ad hoc networks is routing, i.e., the procedure in charge of determining the trajectory of packets traveling over the network. For large-scale ad hoc networks scalability of the routing approach is extremely important. One of the approaches to scale up ad hoc routing is geographical location based routing, which usually requires all nodes to be aware of their exact locations. In this paper, a new routing algorithm is proposed which requires only a subset of nodes to know their exact location forming location areas around these nodes. This paper outlines the LABAR (Location Area Based Ad Hoc Routing) routing protocol and provides simulation measurements on its average routing distance compared to the optimum shortest path.","PeriodicalId":230787,"journal":{"name":"Proceedings of the First IEEE International Conference on Pervasive Computing and Communications, 2003. (PerCom 2003).","volume":"55 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":"123263564","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.1192729
Andrea Calvagna, G. Morabito, A. L. Corte
Seamless mobility is a requirement whose importance for Internet users nowadays is growing faster than ever Thus many solutions to manage wireless IP mobile access and inter-working with the fixed Internet are already available and more are currently being studied and improved In this paper we described an actual wireless mobility framework we designed and implemented in our university campus, which is spread over a wide metropolitan area. The aim is to let a mobile host, that is a user equipped i.e. with a PDA device, experience real wireless IP mobility while moving on a large spatial scale, by means of a middleware that leverages from three main wireless access technologies: Bluetooth, WiFi and GPRS. In our framework, these are managed as a hierarch), of spatially overlapping access domains. While the user is on the move, the client-side of the middleware running on our mobile PDA device triggers smart switchings between the currently best available and more appropriate wireless access path, based on locally collected information. On the other hand, the network-side part of the middleware manages mobile host location paging and routing-update functions inside the whole campus area with an approach which extends from the Cellular IP micromobility protocol. We call this approach WiFi bridge since it also adds mobile hosts with the capability to seamlessly travel between disjunct WiFi access domains inside the campus by means of a temporary relay onto the GPRS access domain. We implemented and tested the system in a real testbed using IPaq devices running Linux, obtaining encouraging experimental results.
{"title":"WiFi bridge: wireless mobility framework supporting session continuity","authors":"Andrea Calvagna, G. Morabito, A. L. Corte","doi":"10.1109/PERCOM.2003.1192729","DOIUrl":"https://doi.org/10.1109/PERCOM.2003.1192729","url":null,"abstract":"Seamless mobility is a requirement whose importance for Internet users nowadays is growing faster than ever Thus many solutions to manage wireless IP mobile access and inter-working with the fixed Internet are already available and more are currently being studied and improved In this paper we described an actual wireless mobility framework we designed and implemented in our university campus, which is spread over a wide metropolitan area. The aim is to let a mobile host, that is a user equipped i.e. with a PDA device, experience real wireless IP mobility while moving on a large spatial scale, by means of a middleware that leverages from three main wireless access technologies: Bluetooth, WiFi and GPRS. In our framework, these are managed as a hierarch), of spatially overlapping access domains. While the user is on the move, the client-side of the middleware running on our mobile PDA device triggers smart switchings between the currently best available and more appropriate wireless access path, based on locally collected information. On the other hand, the network-side part of the middleware manages mobile host location paging and routing-update functions inside the whole campus area with an approach which extends from the Cellular IP micromobility protocol. We call this approach WiFi bridge since it also adds mobile hosts with the capability to seamlessly travel between disjunct WiFi access domains inside the campus by means of a temporary relay onto the GPRS access domain. We implemented and tested the system in a real testbed using IPaq devices running Linux, obtaining encouraging experimental results.","PeriodicalId":230787,"journal":{"name":"Proceedings of the First IEEE International Conference on Pervasive Computing and Communications, 2003. (PerCom 2003).","volume":"55 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":"122976238","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.1192780
A. Acharya, Archan Misra, Sorav Bansal
This paper presents the initial design and performance study of MACA-P, a RTS/CTS based MAC protocol that enables simultaneous transmissions in multihop ad-hoc wireless networks. Providing such low-cost multihop and high performance wireless access networks is an important enabler of pervasive computing. MACA-P is a set of enhancements to the 802.11 DCF that allows parallel transmissions in many situations when two neighboring nodes are either both receivers or both transmitters, but a receiver and a transmitter are not neighbors. Like 802.11, MACA-P contains a contention-based reservation phase prior to data transmission. However, the data transmission is delayed by a control phase interval, which allows multiple sender-receiver pairs to synchronize their data transfers, thereby avoiding collisions and improving system throughput.
{"title":"MACA-P: a MAC for concurrent transmissions in multi-hop wireless networks","authors":"A. Acharya, Archan Misra, Sorav Bansal","doi":"10.1109/PERCOM.2003.1192780","DOIUrl":"https://doi.org/10.1109/PERCOM.2003.1192780","url":null,"abstract":"This paper presents the initial design and performance study of MACA-P, a RTS/CTS based MAC protocol that enables simultaneous transmissions in multihop ad-hoc wireless networks. Providing such low-cost multihop and high performance wireless access networks is an important enabler of pervasive computing. MACA-P is a set of enhancements to the 802.11 DCF that allows parallel transmissions in many situations when two neighboring nodes are either both receivers or both transmitters, but a receiver and a transmitter are not neighbors. Like 802.11, MACA-P contains a contention-based reservation phase prior to data transmission. However, the data transmission is delayed by a control phase interval, which allows multiple sender-receiver pairs to synchronize their data transfers, thereby avoiding collisions and improving system throughput.","PeriodicalId":230787,"journal":{"name":"Proceedings of the First IEEE International Conference on Pervasive Computing and Communications, 2003. (PerCom 2003).","volume":"43 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":"122226982","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.1192767
Wanghong Yuan, K. Nahrstedt
We present an advance reservation scheme for CPU and energy resources, called ReCalendar. The goal is to enable soft real-time applications on mobile devices to achieve desired performance and lifetime. ReCalendar achieves this goal via two distinctive phases, calendaring and scheduling. In the calendaring phase, a calendar is used to arrange applications and to request CPU and energy reservations for calendared applications. In the scheduling phase, the resource manager enforces admitted reservations via CPU frequency/voltage adaptation and frequency-aware soft real-time scheduling. We have implemented the ReCalendar prototype and experimentally shown that, compared with previous approaches that support only immediate reservation or CPU advance reservation, ReCalendar achieves longer battery lifetime and higher overall system utility.
{"title":"ReCalendar: calendaring and scheduling applications with CPU and energy resource guarantees for mobile devices","authors":"Wanghong Yuan, K. Nahrstedt","doi":"10.1109/PERCOM.2003.1192767","DOIUrl":"https://doi.org/10.1109/PERCOM.2003.1192767","url":null,"abstract":"We present an advance reservation scheme for CPU and energy resources, called ReCalendar. The goal is to enable soft real-time applications on mobile devices to achieve desired performance and lifetime. ReCalendar achieves this goal via two distinctive phases, calendaring and scheduling. In the calendaring phase, a calendar is used to arrange applications and to request CPU and energy reservations for calendared applications. In the scheduling phase, the resource manager enforces admitted reservations via CPU frequency/voltage adaptation and frequency-aware soft real-time scheduling. We have implemented the ReCalendar prototype and experimentally shown that, compared with previous approaches that support only immediate reservation or CPU advance reservation, ReCalendar achieves longer battery lifetime and higher overall system utility.","PeriodicalId":230787,"journal":{"name":"Proceedings of the First IEEE International Conference on Pervasive Computing and Communications, 2003. (PerCom 2003).","volume":"11231 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":"122603211","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.1192727
Yi Zou, K. Chakrabarty
Wireless distributed sensor networks (DSNs) are important for a number of strategic applications such as coordinated target detection, surveillance, and localization. Energy is a critical resource in wireless sensor networks and system lifetime needs to be prolonged through the use of energy-conscious sensing strategies during system operation. We propose an energy-aware target detection and localization strategy for cluster-based wireless sensor networks based on an a posteriori algorithm with a two-step communication protocol between the cluster head and the sensors within the cluster With a very limited amount of data from the sensor nodes, the cluster head executes a localization procedure to determine the subset of sensors that must be queried for detailed target information. This approach reduces both energy consumption and communication bandwidth requirements, and prolongs the lifetime of the wireless sensor network. Simulation results show that a large amount of energy is saved during target localization using this strategy.
{"title":"Energy-aware target localization in wireless sensor networks","authors":"Yi Zou, K. Chakrabarty","doi":"10.1109/PERCOM.2003.1192727","DOIUrl":"https://doi.org/10.1109/PERCOM.2003.1192727","url":null,"abstract":"Wireless distributed sensor networks (DSNs) are important for a number of strategic applications such as coordinated target detection, surveillance, and localization. Energy is a critical resource in wireless sensor networks and system lifetime needs to be prolonged through the use of energy-conscious sensing strategies during system operation. We propose an energy-aware target detection and localization strategy for cluster-based wireless sensor networks based on an a posteriori algorithm with a two-step communication protocol between the cluster head and the sensors within the cluster With a very limited amount of data from the sensor nodes, the cluster head executes a localization procedure to determine the subset of sensors that must be queried for detailed target information. This approach reduces both energy consumption and communication bandwidth requirements, and prolongs the lifetime of the wireless sensor network. Simulation results show that a large amount of energy is saved during target localization using this strategy.","PeriodicalId":230787,"journal":{"name":"Proceedings of the First IEEE International Conference on Pervasive Computing and Communications, 2003. (PerCom 2003).","volume":"12 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":"131829433","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.1192728
K. Takasugi, Motonori Nakamura, Satoshi Tanaka, M. Kubota
This paper proposes a seamless service platform for continuous service provision in dynamic network environments. In the future, many kinds of terminals will collectively form a pervasive computing environment that is available anywhere. The elements of a network of this type can dynamically change, merge, or separate, and users can migrate within and between networks. Such changes of environment generate several new requirements. We propose a network that acts and an overlay on the transport layer, thus concealing changes of many kinds. This overlay network realizes what we call a seamless-service platform This platform can easily accommodate existing applications and application protocols, because common functions are reused. Moreover, the platform is based on middleware over the transport layer (e.g., TCP/IP). The method's OS-independence makes it easy to simultaneously support terminal of various kinds. Experiments with a prototype implementation of our seamless-service platform demonstrated its effectiveness and feasibility.
{"title":"Seamless service platform for following a user's movement in a dynamic network environment","authors":"K. Takasugi, Motonori Nakamura, Satoshi Tanaka, M. Kubota","doi":"10.1109/PERCOM.2003.1192728","DOIUrl":"https://doi.org/10.1109/PERCOM.2003.1192728","url":null,"abstract":"This paper proposes a seamless service platform for continuous service provision in dynamic network environments. In the future, many kinds of terminals will collectively form a pervasive computing environment that is available anywhere. The elements of a network of this type can dynamically change, merge, or separate, and users can migrate within and between networks. Such changes of environment generate several new requirements. We propose a network that acts and an overlay on the transport layer, thus concealing changes of many kinds. This overlay network realizes what we call a seamless-service platform This platform can easily accommodate existing applications and application protocols, because common functions are reused. Moreover, the platform is based on middleware over the transport layer (e.g., TCP/IP). The method's OS-independence makes it easy to simultaneously support terminal of various kinds. Experiments with a prototype implementation of our seamless-service platform demonstrated its effectiveness and feasibility.","PeriodicalId":230787,"journal":{"name":"Proceedings of the First IEEE International Conference on Pervasive Computing and Communications, 2003. (PerCom 2003).","volume":"17 10","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132275533","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
扫码关注我们
求助内容：
应助结果提醒方式：