Goce Trajcevski, Besim Avci, Fan Zhou, R. Tamassia, P. Scheuermann, Lauren M. Miller, Adam Barber
{"title":"Motion Trends Detection in Wireless Sensor Networks","authors":"Goce Trajcevski, Besim Avci, Fan Zhou, R. Tamassia, P. Scheuermann, Lauren M. Miller, Adam Barber","doi":"10.1109/MDM.2012.38","DOIUrl":"https://doi.org/10.1109/MDM.2012.38","url":null,"abstract":"We address the problem of efficient detection of destination-related motion trends in Wireless Sensor Networks (WSN) where tracking is done in collaborative manner among the sensor nodes participating in location detection. In addition to determining a single location, applications may need to detect whether certain properties are true for the (portion of the) entire trajectories. Transmitting the sequence of (location, time) values to a dedicated sink and relying on the sink to detect the validity of the desired properties is a brute-force approach that generates a lot of communication overhead. We present an in-network distributed algorithm for efficient detecting of the Continuously Moving Towards predicate with respect to a given destination that is either a point or a region with polygonal boundary. Our experiments demonstrate that the proposed approaches yield substantial savings when compared to the brute-force one.","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":"127713949","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 Demonstration of Mining Significant Places from Cell ID Trajectories through a Geo-grid Based Approach","authors":"Tengfei Bao, Huanhuan Cao, Qiang Yang, Enhong Chen, Jilei Tian","doi":"10.1109/MDM.2012.70","DOIUrl":"https://doi.org/10.1109/MDM.2012.70","url":null,"abstract":"Mining the frequently visited places of single mobile users, i.e., significant places, is crucial for supporting personalized location-based services. Most of existing works for significance place mining have a need to take advantage the GPS trajectories of users. However, it is difficult to encourage mobile users to contribute GPS trajectories because of the high power consumption of GPS. In this demonstration, we propose a geo-grid based approach for mining significant places from cell ID trajectories. In our approach, the mined significant places are represented as sets of geo-grids which are much smaller than the coverage areas of cell-sites. To be specific, we firstly extract the stay areas where the mobile user used to stay and map them to many geogrids. Then we mine significant places from the geo-grids by considering their significance.","PeriodicalId":422293,"journal":{"name":"2012 IEEE 13th International Conference on Mobile Data Management","volume":"301 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123563049","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":"Mining Significant Places from Cell ID Trajectories: A Geo-grid Based Approach","authors":"Tengfei Bao, Huanhuan Cao, Qiang Yang, Enhong Chen, Jilei Tian","doi":"10.1109/MDM.2012.36","DOIUrl":"https://doi.org/10.1109/MDM.2012.36","url":null,"abstract":"Mining the frequently visited places of single mobile users, i.e., significant places, is crucial for supporting personalized location-based services. Most of existing works for significance place mining have a need to take advantage the GPS trajectories of users. However, it is difficult to encourage mobile users to contribute GPS trajectories because of the high power consumption of GPS. In this paper, we propose a geo-grid based approach for mining significant places from cell ID trajectories. In our approach, the mined significant places are represented as sets of geo-grids which are much smaller than the coverage areas of cell-sites. To be specific, we firstly extract the stay areas where the mobile user used to stay and map them to many geo-grids. Then we mine significant places from the geo-grids by considering their significance. We evaluate the approach on real word data sets and the experimental results clearly show that the proposed approach outperforms two baselines.","PeriodicalId":422293,"journal":{"name":"2012 IEEE 13th International Conference on Mobile Data Management","volume":"284 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124540313","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":"To Taxi or Not to Taxi? - Enabling Personalised and Real-Time Transportation Decisions for Mobile Users","authors":"Wei Wu, W. Ng, S. Krishnaswamy, Abhijat Sinha","doi":"10.1109/MDM.2012.55","DOIUrl":"https://doi.org/10.1109/MDM.2012.55","url":null,"abstract":"We demonstrate a system that monitors the taxi availability at taxi stands by mining real-time taxi trajectory data streams. The system includes a server-side trajectory data stream processing and mining program and a client-side mobile application for Android smart phones. The server program continuously monitors for each taxi stand the numbers of taxis queueing at the taxi stand, the numbers of taxis that will pass the taxi stand, as well as the traffic conditions in the area around the stand. It delivers real time taxi and traffic information to mobile users via Restful web services. The client-side location-based mobile application consumes these services to help mobile users make informed transportation choices. For example the availability of taxis might yet be a deterrent when traffic is congested. Real world taxi trajectory data from more than 14000 taxis are used in the demo.","PeriodicalId":422293,"journal":{"name":"2012 IEEE 13th International Conference on Mobile Data Management","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126545365","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":"PhonePark: Street Parking Using Mobile Phones","authors":"Leon Stenneth, O. Wolfson, Bo Xu, Philip S. Yu","doi":"10.1109/MDM.2012.76","DOIUrl":"https://doi.org/10.1109/MDM.2012.76","url":null,"abstract":"Real-time street parking availability information is important in urban areas, and if available could reduce congestion, pollution, and gas consumption. In this paper, an advanced street parking system called PhonePark is presented. Using the GPS, accelerometer, and Bluetooth sensors on a traveler's mobile phone, in conjunction with geospatial data, we can automatically detect when and where the traveler parked her car, and when she released a parking slot.","PeriodicalId":422293,"journal":{"name":"2012 IEEE 13th International Conference on Mobile Data Management","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125292756","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":"Secure Hierarchical Data Aggregation in Wireless Sensor Networks: Performance Evaluation and Analysis","authors":"Julia Albath, S. Madria","doi":"10.1109/WCNC.2009.4917960","DOIUrl":"https://doi.org/10.1109/WCNC.2009.4917960","url":null,"abstract":"Secure data aggregation in wireless sensor networks has two contrasting objectives, i) Efficiently collecting and aggregating data and ii) Aggregating the data securely. Many schemes do not take into account the possibility of corrupt aggregators and allow the aggregator to decrypt data in hop by hop algorithms. On the other hand using public key cryptography for providing end to end security is not energy efficient. In this paper we present and analyze the performance of the secure hierarchical data aggregation algorithm which uses an efficient public key cryptosystem (elliptic curve cryptography) to achieve end to end security. Unlike many other secure data aggregation algorithms which require separate phases for secure aggregation and integrity verification, the secure hierarchical data aggregation algorithm does not require an additional phase for verification. This saves energy by avoiding additional transmissions and computational overhead on the sensor nodes. We present and implement the secure data aggregation algorithm on Mica2 and TelosB sensor network platforms and measure the execution time and energy consumption of various cryptographic functions. We have also simulated our algorithms to analyze how an end to end scheme increases the network life time. We experimentally analyze our algorithms based on parameters like throughput, end to end delay and resilience to node failures.","PeriodicalId":422293,"journal":{"name":"2012 IEEE 13th International Conference on Mobile Data Management","volume":"88 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125095452","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":"Elastic Load-Balancing in a Distributed Spatial Cache Overlay","authors":"C. Lubbe, A. Reuter, B. Mitschang","doi":"10.1109/mdm.2012.26","DOIUrl":"https://doi.org/10.1109/mdm.2012.26","url":null,"abstract":"Location-based services (LBS) have gained enormous popularity, which imposes increasing query loads at the data tier of an LBS. Yet, the data access patterns of LBS typically possess high temporal and spatial locality. Therefore, a dedicated spatial cache which provides efficient access to the data currently needed may considerably reduce this load. To ensure high throughput, multiple cache nodes can collaborate in a distributed spatial cache overlay, which balances load among the nodes. However, load-balancing is a non-trivial task in this context, as load spreads unevenly in space and varies notably over time. This requires constant readjustment to shifting hot spots. We present an elastic load-balancing mechanism between cache nodes that is based on the physical model of a particle-spring system. Using spring contraction, nodes instantly form processing clusters in regions with high load and thus can easily work off accumulating queries. Our evaluation shows that our approach quickly adapts to rapidly changing hot spots and thereby ensures high throughput throughout the entire execution.","PeriodicalId":422293,"journal":{"name":"2012 IEEE 13th International Conference on Mobile Data Management","volume":"76 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124795768","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}