Andreas Konstantinidis, George Nikolaides, Georgios Chatzimilioudis, Giannis Evagorou, D. Zeinalipour-Yazti, Panos K. Chrysanthis
{"title":"Radio Map Prefetching for Indoor Navigation in Intermittently Connected Wi-Fi Networks","authors":"Andreas Konstantinidis, George Nikolaides, Georgios Chatzimilioudis, Giannis Evagorou, D. Zeinalipour-Yazti, Panos K. Chrysanthis","doi":"10.1109/MDM.2015.45","DOIUrl":"https://doi.org/10.1109/MDM.2015.45","url":null,"abstract":"Wi-Fi (or WLAN) based indoor navigation applications for mobiles rely on cloud-based services (s) that take care of a user's (u) localization task using structures called Radio Maps (RMs). It is imperative for u to have a stable WiFi connection in order to either continuously receive location updates from s or to download RMs a priori for offline navigation. Wi-Fi networks however, suffer from intermittent connectivity due to poor network planning that results in sparse deployment of access points and effectively areas where Wi-Fi coverage cannot be guaranteed. This inherently affects the localization accuracy and therefore the navigation experience of users. In this paper, we propose an innovative framework for accurate and fast indoor localization over an intermittently connected WiFi network, coined Prefetching Localization (PreLoc). In Preloc, we prioritize the download of RM records based on knowledge acquired from historic traces of other users inside the same building. Instead of downloading the complete RM from s to u, we propose a Probabilistic Group Selection (PGS) strategy, which identifies RM records that have a higher probability of being necessary to a user moving inside a target area. We have evaluated our framework using a real prototype developed in Android, as well as realistic Wi-Fi traces we collected at the University of Cyprus. Our experimental study reveals that PreLoc using PGS and conventional fingerprint-based indoor positioning algorithms can yield accuracy that is as good as using the same algorithms with a complete RM, even under scenarios of weak Wi-Fi coverage.","PeriodicalId":187331,"journal":{"name":"2015 16th IEEE International Conference on Mobile Data Management","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128885439","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":"SHAREK: A Scalable Dynamic Ride Sharing System","authors":"Bin Cao, Louai Alarabi, M. Mokbel, Anas Basalamah","doi":"10.1109/MDM.2015.12","DOIUrl":"https://doi.org/10.1109/MDM.2015.12","url":null,"abstract":"Due to its significant economic and environmental impact, sharing the ride among a number of drivers (i.e., Car pooling) has recently gained significant interest from industry and academia. Hence, a number of ride sharing services have appeared along with various algorithms on how to match a rider request to a driver who can provide the ride sharing service. However, existing techniques have several limitations that affect the quality of the ride sharing service, and hence hinder its wide applicability. This paper proposes SHAREK, a scalable and efficient ride sharing service that overcomes the limitations of existing approaches. SHAREK allows riders requesting the ride sharing service to indicate the maximum price they are willing to pay for the service and the maximum waiting time before being picked up. In the mean time, SHAREK computes the price of the service based on the distance of the rider trip and the detour that the driver will make to offer the service. Then, SHAREK returns a set of drivers that can make it to the rider within its price and temporal constraints. Since there could be many of such drivers, SHAREK internally prunes those drivers that are dominated by others, i.e., They provide higher price and higher waiting time than other drivers. To realize its efficiency and scalability, SHAREK employs a set of early pruning techniques that minimize the need for any actual shortest path computations.","PeriodicalId":187331,"journal":{"name":"2015 16th IEEE International Conference on Mobile Data Management","volume":"19 3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132127617","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}
Khaled Ammar, Abdullah Elsayed, Mohamed M. Sabri, Michael A. Terry
{"title":"BusMate: Understanding Mobility Behavior for Trajectory-Based Advertising","authors":"Khaled Ammar, Abdullah Elsayed, Mohamed M. Sabri, Michael A. Terry","doi":"10.1109/MDM.2015.71","DOIUrl":"https://doi.org/10.1109/MDM.2015.71","url":null,"abstract":"Mobile advertising is a rapidly growing form of advertising, carrying with it the promise of more finely tuned, targeted advertisements. In this paper, we study mobile advertising in the use of public transportation (specifically, buses). Through a qualitative study, we identify a number of factors that can influence the effectiveness of mobile advertising for bus passengers. We then use these findings to inform a prototype advertising system for bus passengers, called Bus Mate. Collectively, our research suggests that the bus passenger's trip timeline (i.e., How long they will be on the bus, and where they are on the trip) is one of the most important factors in defining the users' attention level. We propose an attention graph and validate it using our experimental mobile application. Finally, we propose some design recommendations, based on our findings, for platforms aiming at targeting mobile ads to bus passengers.","PeriodicalId":187331,"journal":{"name":"2015 16th IEEE International Conference on Mobile Data Management","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129586530","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":"Location and Time Optimizations for Traveling Clients","authors":"John Tegtmeyer, S. Madria","doi":"10.1109/MDM.2015.37","DOIUrl":"https://doi.org/10.1109/MDM.2015.37","url":null,"abstract":"Given a set of users with unique locations, and a closed region defined as a set of points, the optimal location algorithm determines the best location to meet between the users and their current trajectories. The algorithm is designed to find the location between the users that can be reached by a certain time taking into account traffic conditions, while making travel times and distances between users as fair as possible. The user's locations are periodically updated to ensure that their current path and velocity are consistent to what is expected while they are on route. Thus, the algorithm can adjust meeting locations based on developing traffic conditions.","PeriodicalId":187331,"journal":{"name":"2015 16th IEEE International Conference on Mobile Data Management","volume":"68 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128817993","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":"Socialite: A Flexible Framework for Social Internet of Things","authors":"Ji Eun Kim, A. Maron, D. Mossé","doi":"10.1109/MDM.2015.50","DOIUrl":"https://doi.org/10.1109/MDM.2015.50","url":null,"abstract":"The Social Internet of Things is a new paradigm that merges the Internet of Things with Social Networks. We propose a paradigm for how to model interactions between devices and humans, and among devices themselves to support sharable value-added applications throughout the device life cycle (e.g., Configuration, operation, preventive diagnosis), as well as to achieve common goals and recommendations. To realize this paradigm we propose a novel architecture and implementation to enable new Internet of Things applications based on emerging types of social relationships. We develop the semantic models for the Social Internet of Things including device types and their capabilities, users and their relationships, and rules leveraging such models. We demonstrate our concept by building a real system called Socialite that integrates various devices from different manufacturers with different functional interfaces and explicitly represents the relationships among active participants (devices as well as users) in our system.","PeriodicalId":187331,"journal":{"name":"2015 16th IEEE International Conference on Mobile Data Management","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125438752","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":"A Platform for Travel Planning by Using Google Maps","authors":"Chu Chung-Hua, Huang Chenyang","doi":"10.1109/MDM.2015.13","DOIUrl":"https://doi.org/10.1109/MDM.2015.13","url":null,"abstract":"People who have self-planning of itineraries are increasing. However, current travel websites only provide simple travel information and regular set itineraries and they cannot assist with users' self-planning of itineraries and increase participation intention. This study develops a travel planning platform by Google Maps and through Tra News, data sources constructed by users and users' positive system experience, it enhances users' travel experience and intention and helps users arrange itineraries.","PeriodicalId":187331,"journal":{"name":"2015 16th IEEE International Conference on Mobile Data Management","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121509463","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":"A Logic-Based Security Framework for Mobile Perimeter","authors":"M. Maddumala, Vijay Kumar","doi":"10.1109/MDM.2015.53","DOIUrl":"https://doi.org/10.1109/MDM.2015.53","url":null,"abstract":"Mobile communication has become an essential information exchange platform for today's enterprise and government organizations. Their employees extensively use mobile devices to support their job activities while they are on the move. Organizations need to secure mobile devices as they secure wired devices. Organizations while securing mobile devices, also have to secure themselves from mobile devices as these devices are easily prone to attacks. We introduce the idea of \"location-attack protection\" where traffic from high cyber-crime locations (country, state, city, etc.) can be completely blocked. The main objective of this paper is to build a Flexible Perimeter Protection Framework (FPPF) that provides perimeter protection policies that react to dynamic changes, which is quite frequent in mobile setups and respect organizational objectives such as preferential treatment, yet enforce overall security objectives of organizations.","PeriodicalId":187331,"journal":{"name":"2015 16th IEEE International Conference on Mobile Data Management","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116407925","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":"A Model of Relevant Common Author and Citation Authority Propagation for Citation Recommendation","authors":"Bo-Yu Hsiao, Chih-Heng Chung, Bi-Ru Dai","doi":"10.1109/MDM.2015.46","DOIUrl":"https://doi.org/10.1109/MDM.2015.46","url":null,"abstract":"In academia, as more and more papers are published, it is difficult to search needed papers quickly. Therefore, scholarly search engines and many assessment methods have begun to appear. We propose Related Paper with Common Author method which can effectively filter search results to provide potential recommendation papers without the full text, and a citation network method Citation Authority Propagation method which is a recommending method that uses authority author propagation. The experiment results demonstrate the effectiveness of the proposed system.","PeriodicalId":187331,"journal":{"name":"2015 16th IEEE International Conference on Mobile Data Management","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127630898","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}
Wisam Eltarjaman, Prasad Annadata, Rinku Dewri, R. Thurimella
{"title":"Leveraging Smartphone Advances for Continuous Location Privacy","authors":"Wisam Eltarjaman, Prasad Annadata, Rinku Dewri, R. Thurimella","doi":"10.1109/MDM.2015.36","DOIUrl":"https://doi.org/10.1109/MDM.2015.36","url":null,"abstract":"Location privacy preservation algorithms for nearby points-of-interest (POI) search have evolved in the recent years. However, a majority of the proposals assume that points of interests are ranked only by distance, and demand extensive architectural changes. As a result, a significant gap remains between academic proposals and the industry standard of implementing location based services. Recent advances in mobile device capabilities, more specifically in their computational power and energy efficiency, have opened the possibility of engaging the client hardware more actively in the execution of a privacy algorithm, thereby relaxing strong dependencies on trusted third parties or the service provider. With this motivation, we propose a novel privacy algorithm for use in POI search that achieves much of the desired location privacy by restricting the usage of precise location data to the client device.","PeriodicalId":187331,"journal":{"name":"2015 16th IEEE International Conference on Mobile Data Management","volume":"58 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126565644","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":"PPTM: Privacy-Aware Participatory Traffic Monitoring Using Mobile Secure Probes","authors":"Dai Hai Ton That, I. S. Popa, K. Zeitouni","doi":"10.1109/MDM.2015.19","DOIUrl":"https://doi.org/10.1109/MDM.2015.19","url":null,"abstract":"Privacy became one of the main concerns in location-based services in general and in community-based traffic monitoring in particular. This demonstration presents a new approach for privacy preserving online traffic monitoring using mobile probes. It combines hardware and software solutions, and a secure protocol to collect, aggregate and share the traffic information.","PeriodicalId":187331,"journal":{"name":"2015 16th IEEE International Conference on Mobile Data Management","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131615613","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}