Ubiquitous computing promises to both assist us in everyday tasks and enhance our capabilities. Key elements towards fulfilling this goal are exploiting the physical and logical context in which computation occurs, in order to scope the interaction between users and applications. In this paper we describe an RFID-based platform allowing mobile entities to transparently associate with ubiquitous applications running within complex physical spaces. Entity- application associations occur only for applications within a physical space whose services are within predefined sets specified by an entity for that space type. Mobile entities in our platform are uniquely identified by a temporary ID, and further characterized by a set of attributes describing the above-mentioned set of services. Computation is mediated through the exchange of protocol messages guarded by such attributes. Furthermore, relevant application state is distributed on each mobile entity through a set of messaging boards, enabling a targeted form of communication and cooperation among ubiquitous applications. In this paper we report on our experience experimenting with this platform. Our initial results indicate that this platform is suitable for current RFID technology and exhibits low-cost, scalability and privacy.
{"title":"An RFID-Based Platform Supporting Context-Aware Computing in Complex Spaces","authors":"A. Ziotopoulos, M. Jacome, G. Veciana","doi":"10.1109/MDM.2007.62","DOIUrl":"https://doi.org/10.1109/MDM.2007.62","url":null,"abstract":"Ubiquitous computing promises to both assist us in everyday tasks and enhance our capabilities. Key elements towards fulfilling this goal are exploiting the physical and logical context in which computation occurs, in order to scope the interaction between users and applications. In this paper we describe an RFID-based platform allowing mobile entities to transparently associate with ubiquitous applications running within complex physical spaces. Entity- application associations occur only for applications within a physical space whose services are within predefined sets specified by an entity for that space type. Mobile entities in our platform are uniquely identified by a temporary ID, and further characterized by a set of attributes describing the above-mentioned set of services. Computation is mediated through the exchange of protocol messages guarded by such attributes. Furthermore, relevant application state is distributed on each mobile entity through a set of messaging boards, enabling a targeted form of communication and cooperation among ubiquitous applications. In this paper we report on our experience experimenting with this platform. Our initial results indicate that this platform is suitable for current RFID technology and exhibits low-cost, scalability and privacy.","PeriodicalId":393767,"journal":{"name":"2007 International Conference on Mobile Data Management","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2007-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116096940","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}
Battery lifetime tends to become the limiting factor for query processing in sensor networks; this calls for energy-saving implementations of query-algebra operators. As the join operator is important for data acquisition in sensor networks, e.g., to explore correlations in the data, recent research has brought up a number of in-network strategies for join processing. But it is still unclear in which cases such strategies can be applied. In some scenarios it might even be optimal to process a join query using a centralized implementation. This paper presents our work in progress on analyzing how join queries can be optimally handled in sensor networks. In particular, we provide theoretical bounds on the energy-savings that can be achieved by distinct in- network strategies as opposed to a simple centralized join. An important aspect is that devising an optimal join strategy requires knowledge, e.g. of the join selectivity. Gathering this knowledge reduces the potential energy savings. Our major contribution is to show in which cases different in-network approaches are theoretically applicable and when the superior strategy is to perform the join at the base station. This is a first step towards devising practical join strategies.
{"title":"Optimal Locations for Join Processing in Sensor Networks","authors":"M. Stern","doi":"10.1109/MDM.2007.71","DOIUrl":"https://doi.org/10.1109/MDM.2007.71","url":null,"abstract":"Battery lifetime tends to become the limiting factor for query processing in sensor networks; this calls for energy-saving implementations of query-algebra operators. As the join operator is important for data acquisition in sensor networks, e.g., to explore correlations in the data, recent research has brought up a number of in-network strategies for join processing. But it is still unclear in which cases such strategies can be applied. In some scenarios it might even be optimal to process a join query using a centralized implementation. This paper presents our work in progress on analyzing how join queries can be optimally handled in sensor networks. In particular, we provide theoretical bounds on the energy-savings that can be achieved by distinct in- network strategies as opposed to a simple centralized join. An important aspect is that devising an optimal join strategy requires knowledge, e.g. of the join selectivity. Gathering this knowledge reduces the potential energy savings. Our major contribution is to show in which cases different in-network approaches are theoretically applicable and when the superior strategy is to perform the join at the base station. This is a first step towards devising practical join strategies.","PeriodicalId":393767,"journal":{"name":"2007 International Conference on Mobile Data Management","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2007-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120916595","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
In this paper, we propose a context life cycle management scheme for consistent service provision in ubiquitous computing environments. We take the different temporal characteristics of contexts into account for managing contexts. We use the ontology- based context modeling and reasoning mechanism to utilize the high-level inference capability that enables a context management system to derive a user's intention in an effective manner. Existing context management scheme, however, does not consider the temporal characteristics of contexts that represent user's intention. Therefore, it causes the context-aware service for a user to be frequently fluctuated between running and interrupted state. This phenomenon not only causes a significant overhead in the overall context management system, but also degrades user's satisfaction. To handle this problem, we apply a new life cycle scheme into our context management system. As a result, we can provide a consistent service for a user and the system does not become much affected by frequent changes of environmental contexts.
{"title":"Context Life Cycle Management Scheme in Ubiquitous Computing Environments","authors":"Hyun-Seob Chang, Seokkyoo Shin, C. Chung","doi":"10.1109/MDM.2007.66","DOIUrl":"https://doi.org/10.1109/MDM.2007.66","url":null,"abstract":"In this paper, we propose a context life cycle management scheme for consistent service provision in ubiquitous computing environments. We take the different temporal characteristics of contexts into account for managing contexts. We use the ontology- based context modeling and reasoning mechanism to utilize the high-level inference capability that enables a context management system to derive a user's intention in an effective manner. Existing context management scheme, however, does not consider the temporal characteristics of contexts that represent user's intention. Therefore, it causes the context-aware service for a user to be frequently fluctuated between running and interrupted state. This phenomenon not only causes a significant overhead in the overall context management system, but also degrades user's satisfaction. To handle this problem, we apply a new life cycle scheme into our context management system. As a result, we can provide a consistent service for a user and the system does not become much affected by frequent changes of environmental contexts.","PeriodicalId":393767,"journal":{"name":"2007 International Conference on Mobile Data Management","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2007-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124534860","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
With the price of wireless sensor technologies diminishing rapidly we can expect large numbers of autonomous sensor networks being deployed in the near future. These sensor networks will typically not remain isolated but the need of interconnecting them on the network level to enable integrated data processing will arise, thus realizing the vision of a global "sensor Internet." This requires a flexible middleware layer which abstracts from the underlying, heterogeneous sensor network technologies and supports fast and simple deployment and addition of new platforms, facilitates efficient distributed query processing and combination of sensor data, provides support for sensor mobility, and enables the dynamic adaption of the system configuration during runtime with minimal (zero-programming) effort. This paper describes the global sensor networks (GSN) middleware which addresses these goals. We present GSN's conceptual model, abstractions, and architecture, and demonstrate the efficiency of the implementation through experiments with typical high-load application profiles. The GSN implementation is available from http://gsn.sourceforge.net/.
{"title":"Infrastructure for Data Processing in Large-Scale Interconnected Sensor Networks","authors":"K. Aberer, M. Hauswirth, Ali Salehi","doi":"10.1109/MDM.2007.36","DOIUrl":"https://doi.org/10.1109/MDM.2007.36","url":null,"abstract":"With the price of wireless sensor technologies diminishing rapidly we can expect large numbers of autonomous sensor networks being deployed in the near future. These sensor networks will typically not remain isolated but the need of interconnecting them on the network level to enable integrated data processing will arise, thus realizing the vision of a global \"sensor Internet.\" This requires a flexible middleware layer which abstracts from the underlying, heterogeneous sensor network technologies and supports fast and simple deployment and addition of new platforms, facilitates efficient distributed query processing and combination of sensor data, provides support for sensor mobility, and enables the dynamic adaption of the system configuration during runtime with minimal (zero-programming) effort. This paper describes the global sensor networks (GSN) middleware which addresses these goals. We present GSN's conceptual model, abstractions, and architecture, and demonstrate the efficiency of the implementation through experiments with typical high-load application profiles. The GSN implementation is available from http://gsn.sourceforge.net/.","PeriodicalId":393767,"journal":{"name":"2007 International Conference on Mobile Data Management","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2007-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115621511","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}
M. Albano, S. Chessa, Francesco Nidito, S. Pelagatti
Storage of sensed data in wireless sensor networks is essential when the sink node is unavailable due to failure and/or disconnections, but it can also provide efficient access to sensed data to multiple sink nodes. Recent approaches to data storage rely on Geographic Hash Tables for efficient data storage and retrieval. These approaches however do not support different QoS levels for different classes of data as the programmer has no control on the level of redundancy of data. They result in a great unbalance in the storage usage in each sensor, even when sensors are uniformly distributed. This may cause serious data losses, waste energy and shorten the overall lifetime of the sensornet. In this paper, we propose a novel protocol, Q- NiGHT, which (1) provides a direct control on the level of QoS in the data dependability, and (2) uses a strategy similar to the rejection method to build a hash function which scatters data approximately with the same distribution of sensors. The benefits of Q-NiGHT are assessed through a detailed simulation experiment, also discussed in the paper. Results show its good performance on different sensors distributions on terms of both protocol costs and load balance between sensors.
{"title":"Q-NiGHT: Adding QoS to Data Centric Storage in Non-Uniform Sensor Networks","authors":"M. Albano, S. Chessa, Francesco Nidito, S. Pelagatti","doi":"10.1109/MDM.2007.32","DOIUrl":"https://doi.org/10.1109/MDM.2007.32","url":null,"abstract":"Storage of sensed data in wireless sensor networks is essential when the sink node is unavailable due to failure and/or disconnections, but it can also provide efficient access to sensed data to multiple sink nodes. Recent approaches to data storage rely on Geographic Hash Tables for efficient data storage and retrieval. These approaches however do not support different QoS levels for different classes of data as the programmer has no control on the level of redundancy of data. They result in a great unbalance in the storage usage in each sensor, even when sensors are uniformly distributed. This may cause serious data losses, waste energy and shorten the overall lifetime of the sensornet. In this paper, we propose a novel protocol, Q- NiGHT, which (1) provides a direct control on the level of QoS in the data dependability, and (2) uses a strategy similar to the rejection method to build a hash function which scatters data approximately with the same distribution of sensors. The benefits of Q-NiGHT are assessed through a detailed simulation experiment, also discussed in the paper. Results show its good performance on different sensors distributions on terms of both protocol costs and load balance between sensors.","PeriodicalId":393767,"journal":{"name":"2007 International Conference on Mobile Data Management","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2007-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122641149","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
In this paper we present Moppy - an application for mobile object position prediction. Moppy is an easy to use, intuitive application with interactive graphical user interface and result visualization. The main purpose of Moppy is to predict an unknown position of a mobile object based on frequent trajectories discovered from historical movement data. In this paper we present an overview of Moppy's features, including input data formats, mining algorithms employed by Moppy, and visualization of prediction results. Some research issues pertaining to the development of Moppy are also briefly discussed in this paper.
{"title":"Moppy-Mobile Object Position Prediction Application","authors":"Lukasz Rosikiewicz, Mikolaj Morzy","doi":"10.1109/MDM.2007.40","DOIUrl":"https://doi.org/10.1109/MDM.2007.40","url":null,"abstract":"In this paper we present Moppy - an application for mobile object position prediction. Moppy is an easy to use, intuitive application with interactive graphical user interface and result visualization. The main purpose of Moppy is to predict an unknown position of a mobile object based on frequent trajectories discovered from historical movement data. In this paper we present an overview of Moppy's features, including input data formats, mining algorithms employed by Moppy, and visualization of prediction results. Some research issues pertaining to the development of Moppy are also briefly discussed in this paper.","PeriodicalId":393767,"journal":{"name":"2007 International Conference on Mobile Data Management","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2007-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123311638","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}
RFID can be used for identifying, locating, tracking and monitoring physical objects without line of sight, and thus can be used in a wide range of pervasive computing applications. To achieve these goals, RFID data have to be collected, transformed and expressively modeled as their counterparts in the virtual world. To this end, in this paper, we propose a general framework for modeling RFID data. We first explore the fundamental characteristics of RFID applications and classify applications into a set of basic scenarios based on these characteristics. We then develop constructs for modeling each basic scenario, which can be integrated to model complex RFID applications in real world as demonstrated in our case study.
{"title":"Integrated Data Modeling for Querying Physical Objects in RFID-Enabled Pervasive Computing","authors":"Shaorong Liu, Fusheng Wang, Peiya Liu","doi":"10.1109/MDM.2007.28","DOIUrl":"https://doi.org/10.1109/MDM.2007.28","url":null,"abstract":"RFID can be used for identifying, locating, tracking and monitoring physical objects without line of sight, and thus can be used in a wide range of pervasive computing applications. To achieve these goals, RFID data have to be collected, transformed and expressively modeled as their counterparts in the virtual world. To this end, in this paper, we propose a general framework for modeling RFID data. We first explore the fundamental characteristics of RFID applications and classify applications into a set of basic scenarios based on these characteristics. We then develop constructs for modeling each basic scenario, which can be integrated to model complex RFID applications in real world as demonstrated in our case study.","PeriodicalId":393767,"journal":{"name":"2007 International Conference on Mobile Data Management","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2007-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130682334","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}
The execution of the client side of a mobile service is a task greatly conditioned by the limited resources available to perform computation and communication. Moving these operations to other computing elements reduces the energy spent by the device in the actual computing of the final result. This allows for a more efficient management of the device's energy, increasing its autonomy. In this paper, we use put to use the features of the MOB programming language to efficiently develop mobile device specific applications, namely the ability to remotely launch mobile agents, strong mobility and a service-oriented resource discovery model.
{"title":"Mobile Service Development and Deployment with Remotely Launched Service-Oriented Mobile Agents","authors":"Hervé Paulino","doi":"10.1109/MDM.2007.88","DOIUrl":"https://doi.org/10.1109/MDM.2007.88","url":null,"abstract":"The execution of the client side of a mobile service is a task greatly conditioned by the limited resources available to perform computation and communication. Moving these operations to other computing elements reduces the energy spent by the device in the actual computing of the final result. This allows for a more efficient management of the device's energy, increasing its autonomy. In this paper, we use put to use the features of the MOB programming language to efficiently develop mobile device specific applications, namely the ability to remotely launch mobile agents, strong mobility and a service-oriented resource discovery model.","PeriodicalId":393767,"journal":{"name":"2007 International Conference on Mobile Data Management","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2007-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126832444","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
In mobile ad hoc networks, a mobile host holding data items frequently accessed by other hosts needs to transmit them many times and consumes more power than other hosts. In this paper, we propose replica allocation methods for not only improving data availability but also balancing the power consumption among mobile hosts. In these methods, each mobile host replicates data items taking into account their access frequencies, the numbers of their replicas, and the host's remaining battery power. We present simulation results to evaluate the performance of our proposed methods.
{"title":"Data Replication Considering Power Consumption in Ad Hoc Networks","authors":"M. Shinohara, T. Hara, S. Nishio","doi":"10.1109/MDM.2007.25","DOIUrl":"https://doi.org/10.1109/MDM.2007.25","url":null,"abstract":"In mobile ad hoc networks, a mobile host holding data items frequently accessed by other hosts needs to transmit them many times and consumes more power than other hosts. In this paper, we propose replica allocation methods for not only improving data availability but also balancing the power consumption among mobile hosts. In these methods, each mobile host replicates data items taking into account their access frequencies, the numbers of their replicas, and the host's remaining battery power. We present simulation results to evaluate the performance of our proposed methods.","PeriodicalId":393767,"journal":{"name":"2007 International Conference on Mobile Data Management","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2007-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116929162","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}
Peer-to-peer data dissemination in a mobile ad-hoc environment is characterized by three resource constraints, including energy, communication bandwidth, and storage. Most of the existing studies deal with these constraints separately. In this paper we propose an algorithm called RANk-based dissemination (RANDI), which provides an integral treatment to the three constraints. The contribution is in determining how to prioritize the reports in terms of their relevance, when to transmit the reports, and how many to transmit. We experimentally compare RANDI with IDS and PeopleNet, two mobile peer-to-peer dissemination algorithms. The results show that RANDI significantly outperforms both algorithms.
{"title":"Mobile Peer-to-Peer Data Dissemination with Resource Constraints","authors":"O. Wolfson, Bo Xu, R. M. Tanner","doi":"10.1109/MDM.2007.12","DOIUrl":"https://doi.org/10.1109/MDM.2007.12","url":null,"abstract":"Peer-to-peer data dissemination in a mobile ad-hoc environment is characterized by three resource constraints, including energy, communication bandwidth, and storage. Most of the existing studies deal with these constraints separately. In this paper we propose an algorithm called RANk-based dissemination (RANDI), which provides an integral treatment to the three constraints. The contribution is in determining how to prioritize the reports in terms of their relevance, when to transmit the reports, and how many to transmit. We experimentally compare RANDI with IDS and PeopleNet, two mobile peer-to-peer dissemination algorithms. The results show that RANDI significantly outperforms both algorithms.","PeriodicalId":393767,"journal":{"name":"2007 International Conference on Mobile Data Management","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2007-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116971262","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
扫码关注我们
求助内容：
应助结果提醒方式：