Mobile computing leads to different usage situations for the same service due to the mobility of the user. Context aware services (CASs) try to exploit information about the current usage situation in order to better satisfy the user's needs. Especially on a large-scale, CASs face the problem of discovering appropriate context information services (CISs), which are capable of delivering a particular type of context information about a particular entity. The mapping between CISs and entities, however, is highly dynamic, especially when entities are mobile and CISs have only limited coverage areas. New mechanisms are needed for organizing CISs and their currently covered entities in a scalable, robust and decentralized way so that they can be discovered by (potentially mobile) CASs when required. As a possible solution we present the design of an entity-centric wide- area context discovery service based on distributed hashtables. It requires no dedicated infrastructure, and ontologies are used for achieving interoperability. The concept is evaluated by a prototype based on the OpenDHT infrastructure. Experimental results demonstrate the feasibility and performance of the approach.
{"title":"Towards Entity-Centric Wide-Area Context Discovery","authors":"Florian Fuchs, Dominik Berndl, G. Treu","doi":"10.1109/MDM.2007.83","DOIUrl":"https://doi.org/10.1109/MDM.2007.83","url":null,"abstract":"Mobile computing leads to different usage situations for the same service due to the mobility of the user. Context aware services (CASs) try to exploit information about the current usage situation in order to better satisfy the user's needs. Especially on a large-scale, CASs face the problem of discovering appropriate context information services (CISs), which are capable of delivering a particular type of context information about a particular entity. The mapping between CISs and entities, however, is highly dynamic, especially when entities are mobile and CISs have only limited coverage areas. New mechanisms are needed for organizing CISs and their currently covered entities in a scalable, robust and decentralized way so that they can be discovered by (potentially mobile) CASs when required. As a possible solution we present the design of an entity-centric wide- area context discovery service based on distributed hashtables. It requires no dedicated infrastructure, and ontologies are used for achieving interoperability. The concept is evaluated by a prototype based on the OpenDHT infrastructure. Experimental results demonstrate the feasibility and performance of the approach.","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":"114661111","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}
S. Khan, S. Khan, S. Ismaeel, Z. Ahmed, Muhammad Akbar
Achieving ubiquitous services across telecommunication networks have been an objective for most network and service providers. Several intelligent services are available due to the universal acceptance and implementation of the comprehensive GSM standard. However these services lack context which is the need of the modern times. With the development of computer-based location tracking systems and sensor systems a large amount of contextual information is easily available. This paper proposes the incorporation of context- aware services in the GSM networks. The architecture discussed in the paper explains gathering contextual information and facilitates the discovery, selection and execution of these services on a GSM-enabled mobile device.
{"title":"Metropolitan Active Space: Introducing Context-Aware Services in GSM Networks","authors":"S. Khan, S. Khan, S. Ismaeel, Z. Ahmed, Muhammad Akbar","doi":"10.1109/MDM.2007.65","DOIUrl":"https://doi.org/10.1109/MDM.2007.65","url":null,"abstract":"Achieving ubiquitous services across telecommunication networks have been an objective for most network and service providers. Several intelligent services are available due to the universal acceptance and implementation of the comprehensive GSM standard. However these services lack context which is the need of the modern times. With the development of computer-based location tracking systems and sensor systems a large amount of contextual information is easily available. This paper proposes the incorporation of context- aware services in the GSM networks. The architecture discussed in the paper explains gathering contextual information and facilitates the discovery, selection and execution of these services on a GSM-enabled mobile device.","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":"123785347","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}
This demonstration presents iPDA, a system to support privacy-preserving data access in location-based mobile services. The iPDA system consists of three main components: 1) a mobility-aware location cloaker that cloaks the user's location with a region and transforms a location- based query to a region-based query, 2) a progressive query processor that efficiently evaluates a result superset for the location-based query and, 3) a result refiner that refines the superset to generate the exact query result for the user. We discuss in detail the architecture and functionalities of our iPDA system. In addition, a tourist information system named iGuide, as an iPDA application, is prototyped for demonstration.
{"title":"iPDA: Supporting Privacy-Preserving Location-Based Mobile Services","authors":"Jingfu Du, Jianliang Xu, Xueyan Tang, Haibo Hu","doi":"10.1109/MDM.2007.39","DOIUrl":"https://doi.org/10.1109/MDM.2007.39","url":null,"abstract":"This demonstration presents iPDA, a system to support privacy-preserving data access in location-based mobile services. The iPDA system consists of three main components: 1) a mobility-aware location cloaker that cloaks the user's location with a region and transforms a location- based query to a region-based query, 2) a progressive query processor that efficiently evaluates a result superset for the location-based query and, 3) a result refiner that refines the superset to generate the exact query result for the user. We discuss in detail the architecture and functionalities of our iPDA system. In addition, a tourist information system named iGuide, as an iPDA application, is prototyped for demonstration.","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":"126648471","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}
Publish/subscribe systems have been extensively studied in the context of distributed information-based systems, and have proven scalable in information-dissemination for many distributed applications that have motivated the research. With the emergence of sensor-based applications and sensor networks, researchers have proposed novel publish/subscribe protocols that address the problem of distributed event dissemination for sensor network characteristics and constraints. In this paper, we focus on primitive events and the emerging class of publishers, and argue for "state-filters" as more useful and suitable means of filtering events (than content-based filtering) in sensor-based publish/subscribe systems. Using state-filters, we claim to achieve higher efficiency by means of filtering redundant and correlated event notifications, suppress event duplicates, and capture lasting conditions that had been previously not possible using content- based filters. We evaluate our proposed filtering mechanism using real-world sensor data, and highlight some assumptions and pitfalls that motivate our future work in this area.
{"title":"State-Filters for Enhanced Filtering in Sensor-Based Publish/Subscribe Systems","authors":"S. Taherian, J. Bacon","doi":"10.1109/MDM.2007.73","DOIUrl":"https://doi.org/10.1109/MDM.2007.73","url":null,"abstract":"Publish/subscribe systems have been extensively studied in the context of distributed information-based systems, and have proven scalable in information-dissemination for many distributed applications that have motivated the research. With the emergence of sensor-based applications and sensor networks, researchers have proposed novel publish/subscribe protocols that address the problem of distributed event dissemination for sensor network characteristics and constraints. In this paper, we focus on primitive events and the emerging class of publishers, and argue for \"state-filters\" as more useful and suitable means of filtering events (than content-based filtering) in sensor-based publish/subscribe systems. Using state-filters, we claim to achieve higher efficiency by means of filtering redundant and correlated event notifications, suppress event duplicates, and capture lasting conditions that had been previously not possible using content- based filters. We evaluate our proposed filtering mechanism using real-world sensor data, and highlight some assumptions and pitfalls that motivate our future work in this area.","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":"124118331","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}
A general consensus is that the proliferation of location- aware devices will result in a diffusion of location-based services. Privacy preservation is a challenging research issue for this kind of service. A possible solution consists of ensuring users' anonymity, i.e., ensuring that the user issuing a request is indistinguishable, among a group of users, by any attacker who has access to the service requests. In this paper we propose a formal framework to model the problem of guaranteeing anonymity when requiring location-based services. The proposed framework extends existing approaches by allowing to model different kinds of knowledge that may be available to the attacker. We show application examples of our framework, modeling both known scenarios and new ones. From a practical point of view, the framework makes it possible to define anonymity-preserving techniques that best suite the system assumptions as derived from the applicative context, and the level of privacy protection defined by the user.
{"title":"Anonymity in Location-Based Services: Towards a General Framework","authors":"C. Bettini, S. Mascetti, X. Wang, S. Jajodia","doi":"10.1109/MDM.2007.19","DOIUrl":"https://doi.org/10.1109/MDM.2007.19","url":null,"abstract":"A general consensus is that the proliferation of location- aware devices will result in a diffusion of location-based services. Privacy preservation is a challenging research issue for this kind of service. A possible solution consists of ensuring users' anonymity, i.e., ensuring that the user issuing a request is indistinguishable, among a group of users, by any attacker who has access to the service requests. In this paper we propose a formal framework to model the problem of guaranteeing anonymity when requiring location-based services. The proposed framework extends existing approaches by allowing to model different kinds of knowledge that may be available to the attacker. We show application examples of our framework, modeling both known scenarios and new ones. From a practical point of view, the framework makes it possible to define anonymity-preserving techniques that best suite the system assumptions as derived from the applicative context, and the level of privacy protection defined by the user.","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":"128039193","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}
FriendFinder as a location-based service collects location data from mobile users and distributes a particular user's location upon request. Privacy of users data especially location data needs to be guaranteed according to both user and legacy perspectives. W3C's privacy recommendation for internet platform P3P/Appel only considers the privacy relations between the users and the service providers. In this paper, we explain the shortcomings of P3P/Appel for providing privacy in FriendFinder and propose enhancements to the P3P/Appel policy languages.
{"title":"Extending P3P/Appel for Friend Finder","authors":"E. I. Tatli","doi":"10.1109/MDM.2007.51","DOIUrl":"https://doi.org/10.1109/MDM.2007.51","url":null,"abstract":"FriendFinder as a location-based service collects location data from mobile users and distributes a particular user's location upon request. Privacy of users data especially location data needs to be guaranteed according to both user and legacy perspectives. W3C's privacy recommendation for internet platform P3P/Appel only considers the privacy relations between the users and the service providers. In this paper, we explain the shortcomings of P3P/Appel for providing privacy in FriendFinder and propose enhancements to the P3P/Appel policy languages.","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":"134092847","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}
D. Zeinalipour-Yazti, P. Andreou, Panos K. Chrysanthis, G. Samaras, A. Pitsillides
In this paper we present MicroPulse, a novel framework for adapting the waking window of a sensing device S based on the data workload incurred by a query Q. Assuming a typical tree-based aggregation scenario, the waking window is defined as the time interval r during which S enables its transceiver in order to collect the results from its children. Minimizing the length of r enables S to conserve energy that can be used to prolong the longevity of the network and hence the quality of results. Our method is established on profiling recent data acquisition activity and on identifying the bottlenecks using an in-network execution of the Critical Path Method. We show through trace- driven experimentation with a real dataset that MicroPulse can reduce the energy cost of the waking window by three orders of magnitude.
{"title":"The MicroPulse Framework for Adaptive Waking Windows in Sensor Networks","authors":"D. Zeinalipour-Yazti, P. Andreou, Panos K. Chrysanthis, G. Samaras, A. Pitsillides","doi":"10.1109/MDM.2007.74","DOIUrl":"https://doi.org/10.1109/MDM.2007.74","url":null,"abstract":"In this paper we present MicroPulse, a novel framework for adapting the waking window of a sensing device S based on the data workload incurred by a query Q. Assuming a typical tree-based aggregation scenario, the waking window is defined as the time interval r during which S enables its transceiver in order to collect the results from its children. Minimizing the length of r enables S to conserve energy that can be used to prolong the longevity of the network and hence the quality of results. Our method is established on profiling recent data acquisition activity and on identifying the bottlenecks using an in-network execution of the Critical Path Method. We show through trace- driven experimentation with a real dataset that MicroPulse can reduce the energy cost of the waking window by three orders of magnitude.","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":"134172393","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}
We consider the problem of efficiently broadcasting incremental updates to multiple terminals that contain outdated (and possibly different) initial copies of the data. This situation occurs, for example, with the broadcast of Short Messaging Service [SMS] or Multimedia Messaging Service [MMS] cellphone messages to various clients whose phones are sometimes unavailable. We propose an efficient protocol for effecting such broadcast based on a novel combination of recent work on rate less coding and set reconciliation. Our approach is non-interactive, in that terminal nodes need not send any messages to the source, and stateless, in that the source need not know (or store) any information about the terminals. It also minimizes communication complexity and energy expenditure at the terminal nodes, at the expense of added computation. In support of our work, we provide several energy usage measurements on MICA2 sensor motes that clearly highlight the advantages of random linear decoding over wholesale data transfer.
{"title":"Near Optimal Update-Broadcast of Data Sets","authors":"S. Agarwal, A. Hagedorn, A. Trachtenberg","doi":"10.1109/MDM.2007.75","DOIUrl":"https://doi.org/10.1109/MDM.2007.75","url":null,"abstract":"We consider the problem of efficiently broadcasting incremental updates to multiple terminals that contain outdated (and possibly different) initial copies of the data. This situation occurs, for example, with the broadcast of Short Messaging Service [SMS] or Multimedia Messaging Service [MMS] cellphone messages to various clients whose phones are sometimes unavailable. We propose an efficient protocol for effecting such broadcast based on a novel combination of recent work on rate less coding and set reconciliation. Our approach is non-interactive, in that terminal nodes need not send any messages to the source, and stateless, in that the source need not know (or store) any information about the terminals. It also minimizes communication complexity and energy expenditure at the terminal nodes, at the expense of added computation. In support of our work, we provide several energy usage measurements on MICA2 sensor motes that clearly highlight the advantages of random linear decoding over wholesale data transfer.","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":"130995071","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}
We discuss the design of interaction ambients, which are ambients populated with fixed and mobile services, accessible through distributed interfaces. To make the interaction effective, activities and services should be designed as a function of the ambient, giving the user a coherent and clear context. A design approach is discussed, based on ontologies describing ambients, activities and services.
{"title":"An Ontology Based Approach to Interaction Ambient Design","authors":"A. Celentano, Andrea Okroglic, Fabio Pittarello","doi":"10.1109/MDM.2007.87","DOIUrl":"https://doi.org/10.1109/MDM.2007.87","url":null,"abstract":"We discuss the design of interaction ambients, which are ambients populated with fixed and mobile services, accessible through distributed interfaces. To make the interaction effective, activities and services should be designed as a function of the ambient, giving the user a coherent and clear context. A design approach is discussed, based on ontologies describing ambients, activities and services.","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":"124908095","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}
This paper examines the results of our European-wide study on the price of location privacy of individuals using mobile phones. There were 1200 active participants from five EU countries in our experiment. We used tools from experimental psychology and economics to assess the value that users attach to their location data. This paper extends the results that are provided in [D. Cvrcek et al., 2006]. Our main focus in this paper was the motivation of the participants to take part in the experiment and further investigation of their bids. This paper presents a more detailed view of the motivation and a correlations between the motivation and the bids.
{"title":"Location Privacy Pricing and Motivation","authors":"Vashek Matyás, Marek Kumpost","doi":"10.1109/MDM.2007.55","DOIUrl":"https://doi.org/10.1109/MDM.2007.55","url":null,"abstract":"This paper examines the results of our European-wide study on the price of location privacy of individuals using mobile phones. There were 1200 active participants from five EU countries in our experiment. We used tools from experimental psychology and economics to assess the value that users attach to their location data. This paper extends the results that are provided in [D. Cvrcek et al., 2006]. Our main focus in this paper was the motivation of the participants to take part in the experiment and further investigation of their bids. This paper presents a more detailed view of the motivation and a correlations between the motivation and the bids.","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":"131739782","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
扫码关注我们
求助内容：
应助结果提醒方式：