{"title":"Low Energy and Sufficiently Accurate Localization for Non-smartphones","authors":"Kuldeep Yadav, Vinayak Naik, Amarjeet Singh, Pushpendra Singh, Umesh Chandra","doi":"10.1109/MDM.2012.32","DOIUrl":"https://doi.org/10.1109/MDM.2012.32","url":null,"abstract":"Location-aware mobile applications are steadily gaining popularity across the world. However, lack of Global Positioning System (GPS) and absence of Wi-Fi infrastructure prevent users with non-Smart phones (majority of population in developing countries) from using location-aware applications as their phones do not have access to their current location. Existing GSM based approaches such as Cell ID-based works on non-Smart phones but they require access to a comprehensive database of Cell IDs. Such a database either does not exist or is very limited in developing countries. In this paper, we propose a novel GSM-based approach of using Cell Broadcast Service (CBS) messages for getting current location on the phone. Proposed approach does not depend on a comprehensive database and can run on programmable low end phones. We demonstrate the effectiveness of our approach on data collected in New Delhi, India across two different operators and propose two space-time history based algorithms to improve upon the localization accuracy of our baseline CBS approach. The proposed algorithms provide up to 35% improvement in accuracy over the baseline method. Further, we compare accuracy of our CBS-based approach with that of Cell ID-based approach and also, present a multimodal approach that uses combination of both CBS and Cell ID (wherever available) to improve the localization accuracy.","PeriodicalId":422293,"journal":{"name":"2012 IEEE 13th International Conference on Mobile Data Management","volume":"17 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":"128143065","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":"BP-growth: Searching Strategies for Efficient Behavior Pattern Mining","authors":"Xueying Li, Huanhuan Cao, Enhong Chen, Hui Xiong, Jilei Tian","doi":"10.1109/MDM.2012.14","DOIUrl":"https://doi.org/10.1109/MDM.2012.14","url":null,"abstract":"User habit mining plays an important role in user understanding, which is critical for improving a wide range of personalized intelligence services. Recently, some researchers proposed to mine user behavior patterns which characterize the habits of mobile users and account for the associations between user interactions and context captured by mobile devices. However, the existing approaches for mining these behavior patterns are not practical in mobile environments due to limited computing resources on mobile devices. To fulfill this crucial void, we investigate optimizing strategies which can be used for improving the efficiency of behavior pattern mining in terms of computing and memory needs. Specifically, we examine typical optimizing strategies for association rule mining and study the feasibility of applying them to behavior pattern mining, since these two problems are similar in many aspects. Moreover, we develop an efficient algorithm, named BP-Growth, for behavior pattern mining by combining two promising strategies. Finally, experimental results show that BP-Growth outperforms benchmark methods with a significant margin in terms of both computing and memory cost.","PeriodicalId":422293,"journal":{"name":"2012 IEEE 13th International Conference on Mobile Data Management","volume":"52 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":"127566095","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}
W. Sherchan, P. Jayaraman, S. Krishnaswamy, A. Zaslavsky, S. Loke, Abhijat Sinha
{"title":"Using On-the-Move Mining for Mobile Crowdsensing","authors":"W. Sherchan, P. Jayaraman, S. Krishnaswamy, A. Zaslavsky, S. Loke, Abhijat Sinha","doi":"10.1109/MDM.2012.58","DOIUrl":"https://doi.org/10.1109/MDM.2012.58","url":null,"abstract":"In this paper, we propose and develop a platform to support data collection for mobile crowdsensing from mobile device sensors that is under-pinned by real-time mobile data stream mining. We experimentally show that mobile data mining provides an efficient and scalable approach for data collection for mobile crowdsensing. Our approach results in reducing the amount of data sent, as well as the energy usage on the mobile phone, while providing comparable levels of accuracy to traditional models of intermittent/continuous sensing and sending. We have implemented our Context-Aware Real-time Open Mobile Miner (CAROMM) to facilitate data collection from mobile users for crowdsensing applications. CAROMM also collects and correlates this real-time sensory information with social media data from both Twitter and Facebook. CAROMM supports delivering real-time information to mobile users for queries that pertain to specific locations of interest. We have evaluated our framework by collecting real-time data over a period of days from mobile users and experimentally demonstrated that mobile data mining is an effective and efficient strategy for mobile crowdsensing.","PeriodicalId":422293,"journal":{"name":"2012 IEEE 13th International Conference on Mobile Data Management","volume":"41 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":"122747517","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":"Mobile Data Stream Mining: From Algorithms to Applications","authors":"S. Krishnaswamy, João Gama, M. Gaber","doi":"10.1109/MDM.2012.37","DOIUrl":"https://doi.org/10.1109/MDM.2012.37","url":null,"abstract":"This paper presents an overview of the current state-of-the-art in mobile data stream mining. This area of mobile data stream mining is significant for a number of new application domains such as mobile crowd sensing and mobile activity recognition. The paper presents the strategies and techniques for adaptation that are essential in order to perform real-time, continuous data mining on mobile devices. We present an overview of the algorithms research in this area. Finally, we discuss the key toolkits, systems and applications of mobile data stream mining.","PeriodicalId":422293,"journal":{"name":"2012 IEEE 13th International Conference on Mobile Data Management","volume":"10 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":"126501368","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":"Optimizing Multiple Data Acquisition Queries in Sparse Mobile Sensor Networks","authors":"Shili Xiang, Wei Wu, K. Tan","doi":"10.1109/MDM.2012.42","DOIUrl":"https://doi.org/10.1109/MDM.2012.42","url":null,"abstract":"In mobile sensor networks (MSNs), it is common for the base station to issue {em data acquisition} queries requesting for data to be sensed from specific regions of the data space. Such kind of queries are especially important in MSNs for reconnaissance and disaster rescue applications. In this paper, we investigate how multiple data acquisition queries can be answered quickly in sparse mobile sensor networks. Because of the sparseness and mobility, the number of sensors is limited, the connection is intermittent and the topology is unpredictable. To effectively handle the above challenges, we design distributed schemes where mobile sensors strategically relocate themselves to proper locations to collaboratively facilitate efficient query processing and enable sharing over space and time. We first propose a novel scheme, {em Dynamic}, that enables queries to share resources at runtime while sensors are greedily relocated to benefit the processing of each query. We also design another scheme, {em aMST}, that optimizes a batch of queries as a whole and utilizes a Minimum Steiner Tree to guide the execution of all queries in the batch. In addition, a parameter is defined to guide the selection of the most appropriate scheme to adapt to the environment. Our extensive performance study shows the effectiveness of our proposed schemes.","PeriodicalId":422293,"journal":{"name":"2012 IEEE 13th International Conference on Mobile Data Management","volume":"13 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":"133658987","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":"DATEM: Towards QoS Aware Event Notification Framework for Delay Tolerant Networks","authors":"Phani Rohit Mullangi, Lakshmish Ramaswamy, Raga Sowmya Tummalapenta","doi":"10.1109/MDM.2012.22","DOIUrl":"https://doi.org/10.1109/MDM.2012.22","url":null,"abstract":"Delay tolerant networks (DTNs), which are wireless networks prone to long delays and frequent disruptions are increasingly becoming common. We are exploring the challenges involved in designing effective event notification framework on DTNs. This paper presents the design and evaluation of a delay-tolerant event notification framework called DATEM based on the philosophy that failures and delays are too common to be effectively masked from applications. DATEM represents a comprehensive redesign of traditional event routing mechanisms and system management techniques. First, the framework exposes the delay- and failure-prone nature of the underlying network to the applications via an enhanced set of API and let them handle these parameters in an application specific manner. Second, it incorporates a novel event routing protocol that enables the nodes of the delay tolerant network to collaboratively achieve QoS requested by the applications. Third, a utility-aware event prioritization scheme is designed to prioritize event-packets that have the largest impact on the performance of DATEM framework. Our experimental study shows that DATEM provides significant performance benefits when compared with traditional event notification schemes.","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":"130073319","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}
C. Silvestri, Emre Yigitoglu, M. Damiani, Osman Abul
{"title":"SAWLnet: Sensitivity Aware Location Cloaking on Road-NETworks","authors":"C. Silvestri, Emre Yigitoglu, M. Damiani, Osman Abul","doi":"10.1109/MDM.2012.72","DOIUrl":"https://doi.org/10.1109/MDM.2012.72","url":null,"abstract":"Location based queries are increasingly common in mobile applications, and the associated privacy issues have become a hot research topic in the last years. Most of the current approaches, however, do not account for the location of potentially sensitive places and for constraints on the movement of users, such as speed limits or network contraints. In this demo we present different deployment scenarios of a privacy-preserving framework for the protection of sensitive positions in real time trajectories. We assume that the sensitivity of users' positions depends on the spatial context, while the users' movement is confined to road networks and places. Further, the users are non-anonymous, as in the case of geo-social network members who agree to share their exact position whenever it does not fall within a sensitive place, e.g. a hospital. We will show that our proposal is suitable for different classes of devices and can be integrated in different kind of location based applications.","PeriodicalId":422293,"journal":{"name":"2012 IEEE 13th International Conference on Mobile Data Management","volume":"32 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":"133790214","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}
Theofilos Kakantousis, Ioannis Boutsis, V. Kalogeraki, D. Gunopulos, Giorgos Gasparis, A. Dou
{"title":"Misco: A System for Data Analysis Applications on Networks of Smartphones Using MapReduce","authors":"Theofilos Kakantousis, Ioannis Boutsis, V. Kalogeraki, D. Gunopulos, Giorgos Gasparis, A. Dou","doi":"10.1109/MDM.2012.75","DOIUrl":"https://doi.org/10.1109/MDM.2012.75","url":null,"abstract":"The recent years have seen a proliferation of community sensing or participatory sensing paradigms, where individuals rely on the use of smart and powerful mobile devices to collect, store and analyze data from everyday life. Due to this massive collection of the data, a key challenge to all such developments, is to provide a simple but efficient way to facilitate the programming of distributed applications on the embedded devices. We will demonstrate a novel system that provides a principled approach to developing distributed data clustering applications on networks of smartphones and other mobile devices. The system comprises three components: (a) a distributed framework, implemented on mobile phones that eases the programmability and deployment of applications on the devices using simple programming primitives, (b) a data gathering component that tracks the movement of wireless device users and collects sensor data (i.e., GPS and accelerometer sensor data), and (c) a distributed data clustering algorithm that allows users to combine their individual data, that is distributed and energy efficient. Using a road traffic monitoring application we demonstrate how MISCO can efficiently identify anomalies in the road surface conditions and illustrate that our system is practical and has low energy and resource overhead.","PeriodicalId":422293,"journal":{"name":"2012 IEEE 13th International Conference on Mobile Data Management","volume":"6 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":"128778361","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":"Crowdsourcing: Dynamic Data Management in Mobile P2P Networks","authors":"S. Madria, Anirban Mondal","doi":"10.1109/MDM.2012.21","DOIUrl":"https://doi.org/10.1109/MDM.2012.21","url":null,"abstract":"For realizing such crowdsourcing-related M-P2P applications, dynamic data management becomes a necessity to improve data availability, given the mobility and fragile wireless connections that connect resource-constrained mobile devices. Moreover, unlike in the case of traditional environments such as clusters, free-riding is a major issue for M-P2P environments, thereby implying that economic models may play a better role in incentivizing peers to collaborate for data discovery and management. Furthermore, traditional methods of data management in mobile environments generally consider only single-hop client-server communication. On the other hand,in M-P2P networks, the network communication is multihop and mobile devices can collect real-time data. Finally, privacy issues need to be addressed effectively to prevent location-based service providers from misusing users' location information.","PeriodicalId":422293,"journal":{"name":"2012 IEEE 13th International Conference on Mobile Data Management","volume":"23 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":"128801460","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":"Online Identification of Dwell Regions for Moving Objects","authors":"R. Uddin, C. Ravishankar, V. Tsotras","doi":"10.1109/MDM.2012.41","DOIUrl":"https://doi.org/10.1109/MDM.2012.41","url":null,"abstract":"A region R is a dwell region for a moving object O if, given a threshold distance d and duration t, every point of R remains within distance d of O for at least time t. Clearly, points within R are likely to be of interest to O, so identification of O and R has applications in areas such as monitoring and surveillance, as well as to trajectory simplification. We propose an online algorithm to solve this problem, which can handle dynamic addition and deletion of data in logarithmic time. We assume an incoming stream of object positions, and maintain the upper and lower bounds for the radius of the smallest circle enclosing these positions, as points are added and deleted. These bounds allow us to greatly reduce the number of trajectory points we need to consider in the query, as well as to defer query evaluation. Our method can approximate the radius of the smallest circle enclosing a given sub trajectory within an arbitrarily small user defined factor. Our experiments show that the proposed method can scale up to hundreds of thousands of trajectories.","PeriodicalId":422293,"journal":{"name":"2012 IEEE 13th International Conference on Mobile Data Management","volume":"172 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":"117331181","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}