The Ninth International Conference on Mobile Data Management (mdm 2008)最新文献_第3页

A Profile Anonymization Model for Privacy in a Personalized Location Based Service Environment 一种基于个性化位置的服务环境中的隐私匿名化模型

The Ninth International Conference on Mobile Data Management (mdm 2008) Pub Date : 2008-04-27 DOI: 10.1109/MDM.2008.33

Heechang Shin, V. Atluri, Jaideep Vaidya

{"title":"A Profile Anonymization Model for Privacy in a Personalized Location Based Service Environment","authors":"Heechang Shin, V. Atluri, Jaideep Vaidya","doi":"10.1109/MDM.2008.33","DOIUrl":"https://doi.org/10.1109/MDM.2008.33","url":null,"abstract":"Location based services (LBS) aim at delivering point of need information. Personalization and customization of such services, based on the profiles of mobile users, would significantly increase the value of these services. Since profiles may include sensitive information of mobile users and moreover can help identify a person, customization is allowed only when the security and privacy policies dictated by them are respected. While LBS are often presumed as untrusted entities, the location services that capture and maintain mobile users' location to enable communication are considered trusted, and therefore can capture and manage the profile information. In this paper, we address the problem of privacy preservation via anonymization. Prior research in this area attempts to ensure k-anonymity by generalizing the location. However, a person may still be identified based on his/her profile if the profiles of all k people are not the same. We extend the notion of k-anonymity by proposing a profile based k-anonymization model that guarantees anonymity even when profiles of mobile users are known to untrusted entities. Specifically, our proposed approaches generalize both location and profiles to the extent specified by the user. We support three types of queries - mobile users requesting stationary resources, stationary users requesting mobile resources, and mobile users requesting mobile resources. We propose a novel unified index structure, called the (PTPR- tree), which organizes both the locations of mobile users as well as their profiles using a single index, and as a result, offers significant performance gain during anonymization as well as query processing.","PeriodicalId":365750,"journal":{"name":"The Ninth International Conference on Mobile Data Management (mdm 2008)","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-04-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120959510","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}

引用次数: 44

A Lattice-Based Semantic Location Model for Indoor Navigation 基于网格的室内导航语义定位模型

The Ninth International Conference on Mobile Data Management (mdm 2008) Pub Date : 2008-04-27 DOI: 10.1109/MDM.2008.11

Dandan Li, Lee

引用次数: 54

Location-Dependent Skyline Query 位置相关的天际线查询

The Ninth International Conference on Mobile Data Management (mdm 2008) Pub Date : 2008-04-27 DOI: 10.1109/MDM.2008.14

Baihua Zheng, Ken C. K. Lee, Wang-Chien Lee

引用次数: 51

Grid-Based Access Scheduling for Mobile Data Intensive Sensor Networks 基于网格的移动数据密集型传感器网络访问调度

The Ninth International Conference on Mobile Data Management (mdm 2008) Pub Date : 2008-04-27 DOI: 10.1109/MDM.2008.36

Chih-kuang Lin, V. Zadorozhny, P. Krishnamurthy

引用次数: 8

CarWeb: A Traffic Data Collection Platform CarWeb:一个交通数据收集平台

The Ninth International Conference on Mobile Data Management (mdm 2008) Pub Date : 2008-04-27 DOI: 10.1109/MDM.2008.26

Chia-Hao Lo, Wen-Chih Peng, Chien-Wen Chen, Ting-Yu Lin, Chun-Shuo Lin

引用次数: 68

Safe-Time: Distributed Real-Time Monitoring of cKNN in Mobile Peer-to-Peer Networks 安全时间:移动对等网络中cKNN的分布式实时监控

The Ninth International Conference on Mobile Data Management (mdm 2008) Pub Date : 2008-04-27 DOI: 10.1109/MDM.2008.18

Kihwan Kim, Ying Cai, Wallapak Tavanapong

{"title":"Safe-Time: Distributed Real-Time Monitoring of cKNN in Mobile Peer-to-Peer Networks","authors":"Kihwan Kim, Ying Cai, Wallapak Tavanapong","doi":"10.1109/MDM.2008.18","DOIUrl":"https://doi.org/10.1109/MDM.2008.18","url":null,"abstract":"A continuous k nearest neighbor (cKNN) query is a query that continuously returns a set of k nearest moving objects (mobile hosts) to a given query point. For example, report three nearest moving sensors to a given location continuously. Most existing research efforts focus on centralized solutions. In a mobile peer-to-peer network (M-P2P), a centralized approach incurs expensive communication cost. In this paper, we propose Safe-Time - a distributed solution for cKNN given a stationary query point for M-P2P. The two key features are as follows. 1) Actual execution of a cKNN query is not needed during a safe-time period since the query result is guaranteed to remain the same during this period. 2) Once the safe-time expires, execution of a cKNN query involves only objects in a circular band of width equal to the estimated distance between the kth and the k + 1th nearest neighbors. To further reduce communication cost for dense queries, we introduce Unite-Safe-Time that executes one virtual query derived from nearby queries instead of executing each of them separately. Our simulation result shows that the proposed distributed solutions outperform a centralized solution under a range of conditions. Safe-Time incurs up to 2/3 less communication cost compared to a centralized solution. Unite-Safe-Time shows up to 1/3 less communication cost than Safe-Time in our study.","PeriodicalId":365750,"journal":{"name":"The Ninth International Conference on Mobile Data Management (mdm 2008)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-04-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127923420","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}

引用次数: 12

Workload-Aware Query Routing Trees in Wireless Sensor Networks 无线传感器网络中工作负载感知的查询路由树

The Ninth International Conference on Mobile Data Management (mdm 2008) Pub Date : 2008-04-27 DOI: 10.1109/MDM.2008.13

P. Andreou, D. Zeinalipour-Yazti, Panos K. Chrysanthis, G. Samaras

{"title":"Workload-Aware Query Routing Trees in Wireless Sensor Networks","authors":"P. Andreou, D. Zeinalipour-Yazti, Panos K. Chrysanthis, G. Samaras","doi":"10.1109/MDM.2008.13","DOIUrl":"https://doi.org/10.1109/MDM.2008.13","url":null,"abstract":"Continuous queries in wireless sensor networks are established on the premise of a routing tree that provides each sensor with a path over which answers can be transmitted to the query processor. We found that these structures are sub- optimality constructed in predominant data acquisition systems leading to an enormous waste of energy. In this paper we present MicroPulse1, a workload-aware optimization algorithm for query routing trees in wireless sensor networks. Our algorithm is established on profiling recent data acquisition activity and on identifying the bottlenecks using an in-network execution of the critical path method. A node S utilizes this information in order to locally derive the time instance during which it should wake up, the interval during which it should deliver its workload and the workload increase tolerance of its parent node. We additionally provide an elaborate description of energy-conscious algorithms for disseminating and maintaining the critical path cost in a distributed manner. Our trace-driven experimentation with real sensor traces from Intel Research Berkeley shows that MicroPulse can reduce the data acquisition costs by many orders.","PeriodicalId":365750,"journal":{"name":"The Ninth International Conference on Mobile Data Management (mdm 2008)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-04-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130805212","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}

引用次数: 12

Modeling and Managing Mobile Commerce Spaces Using RESTful Data Services 使用RESTful数据服务建模和管理移动商务空间

The Ninth International Conference on Mobile Data Management (mdm 2008) Pub Date : 2008-04-27 DOI: 10.1109/MDM.2008.38

S. McFaddin, D. Coffman, J. Han, H. Jang, J. Kim, J. K. Lee, M. C. Lee, Y. Moon, C. Narayanaswami, Y. S. Paik, J. Park, D. Soroker

引用次数: 23

LAOF: A New Framework to Efficiently Process Business Objects on Resource Constrained Mobile Phones LAOF:一个在资源受限的移动电话上有效处理业务对象的新框架

The Ninth International Conference on Mobile Data Management (mdm 2008) Pub Date : 2008-04-27 DOI: 10.1109/MDM.2008.15

Huaigu Wu, Josh Borts, Yi Zheng, Yuri Natchetoi

{"title":"LAOF: A New Framework to Efficiently Process Business Objects on Resource Constrained Mobile Phones","authors":"Huaigu Wu, Josh Borts, Yi Zheng, Yuri Natchetoi","doi":"10.1109/MDM.2008.15","DOIUrl":"https://doi.org/10.1109/MDM.2008.15","url":null,"abstract":"The increase in the number of mobile device users has led to an increased demand for mobile business applications. One of the main challenges in developing mobile business applications is to efficiently process business data in the resource constrained environment of mobile phones. Current approaches are seriously limited by the non-guaranteed quality of network connections or the restricted processing capabilities of mobile phones. We propose a lightweight asynchronous online framework (LAOF) that merges the benefits of both online and offline models. In our approach, business data is partially and lazily replicated to mobile phones. The mobile application executes read-only operations locally and tentatively simulates local responses to write operations before asynchronously executing on the remote server. The LAOF improves the traditional lazy replication approach by 1) efficiently compressing business data for mobile applications, 2) separating the consistency requirements for responses and business data, and 3) providing an approach that guarantees causal dependency for the asynchronous execution of write operations on the server side. In addition, we also demonstrate a sample application based on this approach and use it to evaluate the framework.","PeriodicalId":365750,"journal":{"name":"The Ninth International Conference on Mobile Data Management (mdm 2008)","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-04-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124579869","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}

引用次数: 4

Querying Imprecise Data in Sensor Databases 查询传感器数据库中的不精确数据

The Ninth International Conference on Mobile Data Management (mdm 2008) Pub Date : 2008-04-27 DOI: 10.1109/MDM.2008.9

Z. Ma, Li Yan

引用次数: 2