{"title":"A Spatial Caching Framework for Map Operations in Geographical Information Systems","authors":"Marcos R. Vieira, P. Bakalov, E. Hoel, V. Tsotras","doi":"10.1109/MDM.2012.12","DOIUrl":"https://doi.org/10.1109/MDM.2012.12","url":null,"abstract":"Caching is a well-known approach to achieve good performance and scalability in mobile computing environments. Using this technique, the query response time and the overall system performance can be extremely improved by decreasing the volume of data transferred between the server and the mobile device. However, the effectiveness of caching techniques depend greatly on the nature of the data processed by the application and the data access patterns which are specific for this type of analysis. Cache management techniques for Geographical Information Systems (GIS) deviate substantially from existing methods used with relational data, since GIS map navigation operations (e.g. panning, zooming in/out) have their own unique access patterns that differ greatly from its relational equivalents. This paper presents a spatial caching framework that can efficiently handle spatial objects and it is tailored toward the typical map navigation operations seen in GIS systems. As a result, heavyweight map operations (e.g. labeling and editing) which require multiple round-trips to the data source can significantly benefit from the use of our proposed framework. The goal of this paper is to serve as a proof of concept and to demonstrate the efficiency and scalability of the proposed spatial caching framework and its applicability in a production commercial system (Esri's ArcGIS).","PeriodicalId":422293,"journal":{"name":"2012 IEEE 13th International Conference on Mobile Data Management","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131058966","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}
{"title":"Parking in Competitive Settings: A Gravitational Approach","authors":"D. Ayala, O. Wolfson, Bo Xu, B. Dasgupta, Jie Lin","doi":"10.1109/MDM.2012.44","DOIUrl":"https://doi.org/10.1109/MDM.2012.44","url":null,"abstract":"With the proliferation of location-based services, mobile devices, and embedded wireless sensors, more and more applications are being developed to improve the efficiency of the transportation system. In particular, new applications are arising to help vehicles locate open parking slots. Nevertheless, while engaged in driving, travelers are better suited being guided to an ideal parking slot, than looking at a map and choosing which slot to go to. Then the question of how an application should choose this ideal parking slot becomes relevant. Vehicular parking can be viewed as vehicles (players) competing for parking slots (resources with different costs). Based on this competition, we present a game-theoretic framework to analyze parking situations. We introduce and analyze parking slot assignment games and present algorithms that choose parking slots ideally in competitive parking simulations. We also present algorithms for incomplete information contexts and show how these algorithms outperform even algorithms with complete information in some cases.","PeriodicalId":422293,"journal":{"name":"2012 IEEE 13th International Conference on Mobile Data Management","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131144912","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}
{"title":"Calibrating Large Scale Vehicle Trajectory Data","authors":"Siyuan Liu, Ce Liu, Qiong Luo, L. Ni, R. Krishnan","doi":"10.1109/MDM.2012.15","DOIUrl":"https://doi.org/10.1109/MDM.2012.15","url":null,"abstract":"An accurate and sufficient vehicle trajectory data set is the basis to many trajectory-based data mining tasks and applications. However, vehicle trajectories sampled by GPS devices are usually at a relatively low sampling rate and contain notable location errors. To address these two problems in GPS trajectory data, we propose WI-matching, the first vehicle trajectory calibration framework to take advantage of road networks topology and geometry information and trajectory historical information in large scale. WI-matching consists of a Weighting-based map matching algorithm and a trajectory Interpolation-based matching algorithm. In our WI-matching framework, we first integrate the vehicle GPS data with digital road networks data, to identify the roads where a vehicle traveled and the vehicle locations along the roads. Then our weighting-based map matching algorithm considers (1) the geometric and topological information of the road networks and (2) the spatiotemporal trajectory information to efficiently and effectively calibrate the GPS data points. Finally, our interpolation algorithm identifies paths between consecutive GPS points, and adds points with estimated vehicle status (location and time stamp) along the paths to construct sufficient vehicle trajectories. We have evaluated our algorithms on a large-scale real life data set in comparison with the state of the art. Our extensive and empirical results indicate that our WI-matching achieves a high accuracy as well as a high efficiency on real-world data which beats the state of the art.","PeriodicalId":422293,"journal":{"name":"2012 IEEE 13th International Conference on Mobile Data Management","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130545994","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}
{"title":"Place Learning via Direct WiFi Fingerprint Clustering","authors":"Olivier Dousse, Julien Eberle, Matthias Mertens","doi":"10.1109/MDM.2012.46","DOIUrl":"https://doi.org/10.1109/MDM.2012.46","url":null,"abstract":"Most current mobile devices are able to determine their location, which has become part of the contextual information available to applications. However, in many cases, the exact position of the device in terms of longitude and latitude is not necessary. On the contrary, applications might benefit more from a discrete context variable that indicates the ``place'' in which the device currently is. To realize this, the continuous device's trajectory needs to be clustered into discrete locations. Besides, the device's location is often not measured directly, but rather inferred from other measurements, such as the list of available WiFi access points. Since similar WiFi measurements lead to similar estimates of the position, it appears that the conversion into geographical coordinates is an unnecessary step in the identification of places. In this paper, we describe a density-based clustering approach that allows to learn significant places directly from a set of raw WiFi measurements.","PeriodicalId":422293,"journal":{"name":"2012 IEEE 13th International Conference on Mobile Data Management","volume":"724 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121602431","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}
G. Manjunath, Revathi Muthanna, S. Thara, H. Dhanasekaran, Priyanka Tiwari, Prosenjit Das
{"title":"Delivering Mobile eGovernance on Low-End-Phones","authors":"G. Manjunath, Revathi Muthanna, S. Thara, H. Dhanasekaran, Priyanka Tiwari, Prosenjit Das","doi":"10.1109/MDM.2012.74","DOIUrl":"https://doi.org/10.1109/MDM.2012.74","url":null,"abstract":"While many public services are getting web-enabled, there are many hurdles in getting those services to a common man. A key problem is the low Internet penetration among this population. Despite the growth in mobile phone usage, mobile internet has not taken off. More than 50% of the handsets sold just support voice and text messaging. We therefore, propose a platform to deliver Internet-based services over these low-featured phones. Our approach enables rapid creation of SMS and voice interfaces for any IT service without any programming. In addition the platform enables rapid creation of mobile widgets for Android, Palm and Windows phones. Customized location aware applications can also be enabled for Android devices through the platform. A live pilot is currently ongoing in India for health and career related services.","PeriodicalId":422293,"journal":{"name":"2012 IEEE 13th International Conference on Mobile Data Management","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128478531","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}
{"title":"An Efficient, Robust, and Scalable Trust Management Scheme for Unattended Wireless Sensor Networks","authors":"Yi Ren, V. Zadorozhny, V. Oleshchuk, F. Li","doi":"10.1109/MDM.2012.13","DOIUrl":"https://doi.org/10.1109/MDM.2012.13","url":null,"abstract":"Unattended Wireless Sensor Networks (UWSNs) are characterized by long periods of disconnected operation and fixed or irregular intervals between visits by the sink. The absence of an online trusted third party, i.e., an on-site sink, makes existing trust management schemes used in legacy wireless sensor networks not applicable to UWSNs directly. In this paper, we propose a trust management scheme for UWSNs to provide efficient, robust and scalable trust data storage. For trust data storage, we employ geographic hash table to efficiently identify data storage nodes and to significantly reduce storage cost. We demonstrate, through detailed analyses and extensive simulations, that the proposed scheme is efficient, robust, and scalable.","PeriodicalId":422293,"journal":{"name":"2012 IEEE 13th International Conference on Mobile Data Management","volume":"131 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127375934","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}
L. M. Chidambaram, S. Madria, M. Linderman, T. Hara
{"title":"MELOC: Memory and Location Optimized Caching Model for Small Mobile Ad Hoc Networks","authors":"L. M. Chidambaram, S. Madria, M. Linderman, T. Hara","doi":"10.1109/MDM.2012.35","DOIUrl":"https://doi.org/10.1109/MDM.2012.35","url":null,"abstract":"Caching is a common technique to improve efficiency of data access in MANETs (Mobile Ad hoc Networks), where users communicate using small portable devices connected by resource constraint wireless networks. In some MANET applications, controlling/reducing the cache locations are desirable due to security issues, restricted shared memory and maintenance cost. However, reducing the number of caches should be done by finding optimized cache locations (at highly connected and centrally located nodes) so that it does not affect the performance efficacy of data access in terms of response time. Existing cooperative caching approaches are deficient in finding such optimized cache locations as they do not focus on reducing the number of copies by finding their optimized locations to be shared among nodes. In this paper, we design and evaluate such a caching scheme using a single broker based MANET architecture to improve data access latency. Our scheme reduces the number of caches by efficiently placing them at locations which brings distant data closer to the source. The performance comparison of our scheme with one such recent caching scheme showcases improvement in data access efficiency by 30% along with reduction in number of cache locations by 72%. We evaluated data access efficiency using average hops and average roundtrip delay.","PeriodicalId":422293,"journal":{"name":"2012 IEEE 13th International Conference on Mobile Data Management","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130995870","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}
Ya-Ting Hsu, Yi-Chin Pan, Ling-Yin Wei, Wen-Chih Peng, Wang-Chien Lee
{"title":"Key Formulation Schemes for Spatial Index in Cloud Data Managements","authors":"Ya-Ting Hsu, Yi-Chin Pan, Ling-Yin Wei, Wen-Chih Peng, Wang-Chien Lee","doi":"10.1109/MDM.2012.67","DOIUrl":"https://doi.org/10.1109/MDM.2012.67","url":null,"abstract":"Due to the flexibility and scalability in cloud computing, cloud computing nowadays plays an important role to handle a large-scale data analysis. For data processing operations, several cloud data managements (CDMs), such as HBase and Cassandra, are developed. Such CDMs usually provide key-value storages, where each key is used to access its corresponding value. Both HBase and Cassandra provide some basic operations (e.g., Get, Scan) to retrieve the values via keys specified by users. The exiting CDMs fully inherit the characteristics of cloud computing (i.e., high scalability and availability). With the aforementioned characteristics of cloud computing, CDMs are widely employed for Web data, especially for search engines. However, with the proliferation of smart phones and location-based services, data with spatial information, referring as spatial data, are dramatically increasing. Consequently, how to formulate keys for spatial data in the existing CDMs is a challenge issue. In this paper, we develop several key formulation schemes. In particular, we propose a novel Key formulation scheme based on R+-tree (abbreviated as KR+-index). With our design for keys of spatial data, the existing CDMs are able to efficiently retrieve spatial data. In light of KR+-tree, two spatial queries, k-NN query and range query, are designed. Moreover, we implement the proposed key formulation schemes on HBase and Cassandra, and import real spatial data for spatial queries. The experimental results demonstrate that KR+-tree outperforms other existing key formulations and MD-HBase.","PeriodicalId":422293,"journal":{"name":"2012 IEEE 13th International Conference on Mobile Data Management","volume":"266 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114439928","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}
Igo Ramalho Brilhante, M. Berlingerio, R. Trasarti, C. Renso, J. Macêdo, M. Casanova
{"title":"ComeTogether: Discovering Communities of Places in Mobility Data","authors":"Igo Ramalho Brilhante, M. Berlingerio, R. Trasarti, C. Renso, J. Macêdo, M. Casanova","doi":"10.1109/MDM.2012.17","DOIUrl":"https://doi.org/10.1109/MDM.2012.17","url":null,"abstract":"We analyze urban mobility and public places under a new perspective: how can we feature the places in a city based on how people move among them? To answer this question we need to combine places, like points of interest, with mobility information like the trajectories of individuals moving within a city. To accomplish this, we propose a methodology based on complex network analysis: we build a network of points of interests by connecting places by the individual trajectories passing through them. From such network we compute communities finding groups places highly connected by the mobility of the individuals. We present a case study on real trajectory dataset on the city of Milan, showing a complementary view on the urban mobility that is not covered by the state-of-the art techniques on mobility analysis.","PeriodicalId":422293,"journal":{"name":"2012 IEEE 13th International Conference on Mobile Data Management","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127016027","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}
Palanivel A. Kodeswaran, Vikrant Nandakumar, Shalini Kapoor, P. Kamaraju, A. Joshi, Sougata Mukherjea
{"title":"Securing Enterprise Data on Smartphones Using Run Time Information Flow Control","authors":"Palanivel A. Kodeswaran, Vikrant Nandakumar, Shalini Kapoor, P. Kamaraju, A. Joshi, Sougata Mukherjea","doi":"10.1109/MDM.2012.50","DOIUrl":"https://doi.org/10.1109/MDM.2012.50","url":null,"abstract":"There is an increasing penetration of smart phones within enterprises. Most smart phone users now run both enterprise as well as personal applications simultaneously on their phones. However, most of the personal apps that are downloaded from public market places are hardly tested for enterprise grade security, and there have been instances of malware appearing in public markets that steal sensitive user information. Smart phone platforms such as Android require users to explicitly provide permissions to applications at install time, yet lack run time monitoring of permission usage by applications. In this paper, we present a framework for the run time enforcement of privacy policies on smart phones, in particular, protecting the privacy of enterprise data on smart phones. Our privacy policies are defined in terms of permissible information flows on the phone during different contexts. This arms users with finer grained control over information access by different applications. In our policy framework, an information flow is defined based on the entities involved in the corresponding inter-process communication(IPC) viz, the caller, callee and the associated IPC data. The information flow policy specifies the conditions under which an IPC flow may be permitted (or denied). Our system tracks information flows at run time and enforces that only flows satisfying all the current policies are permitted on the phone. We describe the design and implementation of our policy based framework in Android, and present performance evaluation results measuring the overhead imposed by our framework.","PeriodicalId":422293,"journal":{"name":"2012 IEEE 13th International Conference on Mobile Data Management","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127705547","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}