Notification:
We are currently experiencing intermittent issues impacting performance. We apologize for the inconvenience.
By Topic

Mobile Data Management, 2008. MDM '08. 9th International Conference on

Date 27-30 April 2008

Filter Results

Displaying Results 1 - 25 of 50
  • [Front cover]

    Publication Year: 2008
    Save to Project icon | Request Permissions | PDF file iconPDF (143 KB)  
    Freely Available from IEEE
  • [Title page i]

    Publication Year: 2008 , Page(s): i
    Save to Project icon | Request Permissions | PDF file iconPDF (20 KB)  
    Freely Available from IEEE
  • [Title page iii]

    Publication Year: 2008 , Page(s): iii
    Save to Project icon | Request Permissions | PDF file iconPDF (76 KB)  
    Freely Available from IEEE
  • [Copyright notice]

    Publication Year: 2008 , Page(s): iv
    Save to Project icon | Request Permissions | PDF file iconPDF (45 KB)  
    Freely Available from IEEE
  • Table of contents

    Publication Year: 2008 , Page(s): v - viii
    Save to Project icon | Request Permissions | PDF file iconPDF (211 KB)  
    Freely Available from IEEE
  • Messages from the Conference Chairs

    Publication Year: 2008 , Page(s): ix
    Save to Project icon | Request Permissions | PDF file iconPDF (172 KB) |  | HTML iconHTML  
    Freely Available from IEEE
  • Messages from the Program Chairs

    Publication Year: 2008 , Page(s): x
    Save to Project icon | Request Permissions | PDF file iconPDF (176 KB) |  | HTML iconHTML  
    Freely Available from IEEE
  • Organization

    Publication Year: 2008 , Page(s): xi - xiii
    Save to Project icon | Request Permissions | PDF file iconPDF (179 KB)  
    Freely Available from IEEE
  • External reviewers

    Publication Year: 2008
    Save to Project icon | Request Permissions | PDF file iconPDF (146 KB)  
    Freely Available from IEEE
  • Institutions

    Publication Year: 2008 , Page(s): xv
    Save to Project icon | Request Permissions | PDF file iconPDF (162 KB)  
    Freely Available from IEEE
  • Keynote 1 - Strong Programming Model for Strong Weak Mobility: The ProActive Parallel Suite

    Publication Year: 2008 , Page(s): xvi
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (129 KB) |  | HTML iconHTML  

    ProActive is a Java library (Source code under GPL license) for parallel, distributed, and concurrent computing, also featuring mobility and security in a uniform framework. ProActive aimed at simplifying the programming of applications that are distributed on Local Area Network (LAN), on cluster of workstations, or large scale Grids. ProActive promotes a strong NoC approach, Network On Ship, to cope seamlessly with both distributed and shared-memory multi-core machines. A theoretical foundation ensures constant behavior, whatever the environment.ProActive features location tracking of moving objects, together with a strong programming model that makes it very suitable for global computinginfrastructure.Interactive and graphical GUI of the ProActive Parallel Suite will also be presented during the talk. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Keynote 2 - Unleashing Shared-Experience Communications in a Mobile World

    Publication Year: 2008 , Page(s): xvii
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (151 KB) |  | HTML iconHTML  

    Provides an abstract of the keynote presentation and a brief professional biography of the presenter. The complete presentation was not made available for publication as part of the conference proceedings. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Flexible Spatio-Temporal Indexing Scheme for Large-Scale GPS Track Retrieval

    Publication Year: 2008 , Page(s): 1 - 8
    Cited by:  Papers (4)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (409 KB) |  | HTML iconHTML  

    The increasing popularity of GPS device has boosted many Web applications where people can upload, browse and exchange their GPS tracks. In these applications, spatial or temporal search function could provide an effective way for users to retrieve specific GPS tracks they are interested in. However, existing spatial-temporal index for trajectory data has not exploited the characteristic of user behavior in these online GPS track sharing applications. In most cases, when sharing a GPS track, people are more likely to upload GPS data of the near past than the distant past. Thus, the interval between the end time of a GPS track and the time it is uploaded, if viewed as a random variable, has a skewed distribution. In this paper, we first propose a probabilistic model to simulate user behavior of uploading GPS tracks onto an online sharing application. Then we propose a flexible spatio-temporal index scheme, referred to as Compressed Start-End Tree (CSE-tree), for large-scale GPS track retrieval. The CSE-tree combines the advantages of B+ Tree and dynamic array, and maintains different index structure for data with different update frequency. Experiments using synthetic data show that CSE-tree outperforms other schemes in requiring less index size and less update cost while keeping satisfactory retrieval performance. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient Cost-Based Tracking of Scheduled Vehicle Journeys

    Publication Year: 2008 , Page(s): 9 - 16
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (266 KB) |  | HTML iconHTML  

    Applications in areas such as logistics, cargo delivery, and collective transport involve the management of fleets of vehicles that are expected to travel along known routes according to schedules. There is a fundamental need by the infrastructure surrounding the vehicles to know the actual status of the vehicles. Since the vehicles deviate from their schedules due to road construction, accidents, and other unexpected conditions, it is necessary for the vehicles to communicate with the infrastructure. Frequent updates introduce high communication costs, and server-side updates easily become a bottleneck. This paper presents techniques that enable the tracking of vehicle positions and arrival times at scheduled stops with little communication, while still offering the desired accuracy to the infrastructure of the status of the vehicles. Experimental results with real GPS data from buses show that the proposed techniques are capable of reducing the number of updates significantly compared to a state-of-the art approach where vehicles issue updates at pre-defined positions along their routes. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Lattice-Based Semantic Location Model for Indoor Navigation

    Publication Year: 2008 , Page(s): 17 - 24
    Cited by:  Papers (3)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (454 KB) |  | HTML iconHTML  

    Location models play an important role in location- based services (LBSs), because LBSs require a well-defined representation of location knowledge to support location browsing, navigation and query processing. Current location models can be divided into two categories: symbolic and geometric. Symbolic models try to represent the semantic relationships between entities, and geometric models are based on geometric coordinates and Euclidean distance. In this paper, we propose a lattice-based semantic location model (LSLM) for the indoor environment. LSLM is based on the exit-location model and the theory of "formal concept analysis." The model can provide an explicit representation of the basic relationships between two entities such as containment and overlap. The nearest neighbor relationship on the concept lattice is used to define the optimal distance between two entities. Furthermore, the dual (location/exit) property of the model can cater for different navigation needs. We provide examples to show the effectiveness of our model. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Monitoring Moving Objects Using Low Frequency Snapshots in Sensor Networks

    Publication Year: 2008 , Page(s): 25 - 32
    Cited by:  Papers (3)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (1975 KB) |  | HTML iconHTML  

    Monitoring moving objects is one of the key application domains for sensor networks. In the absence of cooperative objects and devices attached to these objects, target tracking algorithms have to be used for monitoring. In this paper, we present that many of the applications of moving object monitoring systems could be addressed with low-frequency snapshot-based queries. With the realization of this query type, we show that existing target tracking algorithms may not be the least expensive solutions. We introduce an approach that uses two alternating strategies. We maintain a cheap low-quality knowledge of moving objects' location between snapshots and trigger expensive sensor readings only when a snapshot period has elapsed. With extensive experiments we show that our approach is significantly more energy efficient than established methods. It is also more effective than existing data-and-query centric in-network query processing schemes as it can maintain object identities between snapshots. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • UTR-Tree: An Index Structure for the Full Uncertain Trajectories of Network-Constrained Moving Objects

    Publication Year: 2008 , Page(s): 33 - 40
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (555 KB) |  | HTML iconHTML  

    The uncertainty management problem for moving objects databases has been well studied recently, with many models and algorithms proposed. However, very limited work has dealt with the index of uncertain trajectories for a running moving objects database. In this paper, we propose an index framework, the UTR- Tree, for indexing the full uncertain trajectories of network constrained moving objects. Through a dynamic index maintenance technique which is associated with location updates, the UTR-Tree can deal with the full uncertain trajectories, which include not only the historical locations of moving objects, but also their current and near future location information with uncertainty considered, so that the queries on the whole life span of the moving objects can be efficiently supported. The experimental results show that the UTR-Tree outperforms previously proposed network- based moving object index methods in dealing with full uncertain trajectories. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Preprocessing Position Data of Mobile Objects

    Publication Year: 2008 , Page(s): 41 - 48
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (499 KB) |  | HTML iconHTML  

    We present the design and implementation of a component for the preprocessing of position data taken from moving objects. The movement of mobile objects is represented by piece wise functions over time that approximate the real object movement and significantly reduce the initial data volume such that efficient storage and analysis of object trajectories can be achieved. The maximal acceptable deviation - an input parameter of our algorithms - of the approximations also includes the uncertainty of the position sensor measurements. We analyze and compare five different lossy preprocessing methods. Our results clearly indicate that even with simple approaches, a more than sufficient overall performance can be achieved. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Road Network Based Adaptive Query Evaluation in VANET

    Publication Year: 2008 , Page(s): 49 - 56
    Cited by:  Papers (3)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (262 KB) |  | HTML iconHTML  

    In the Vehicle Ad-hoc NETwork (VANET), moving vehicles organize into a mobile wireless Ad-hoc network to share online traffic information. Each vehicle can issue a declarative query for aggregating the traffic information from others in order to facilitate the navigation and avoid traffic jam. Existing query methods suffer from high latency, incomplete results, and large messages due to the movement of the vehicles in VANET. In this paper, we propose an adaptive query evaluation method based on the road network. In order to overcome the problems incurred by the movement, a relative static query evaluation plan is constructed based on the road network, and each vehicle can participate in the query evaluation plan autonomously. We also introduce control messages to notify the changed location of the query originator to other vehicles involved in the evaluation plan. In addition, we propose an one time message transferring based results collecting method to reduce the message cost. The optimization over the multiple queries is also discussed to reduce the messages further. We evaluate the performance of our method by extensive simulations. Experimental results show that our method can provide complete results within a short response time and small traffic overhead. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Secure Data Sharing in Mobile Environments

    Publication Year: 2008 , Page(s): 57 - 64
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (370 KB) |  | HTML iconHTML  

    This paper proposes an approach for secure data sharing on mobile terminals with members of a particular group. To avoid the data being compromised due to loss or theft, this approach prevents data leakage, while allowing the correct members to recover the data to a new mobile terminal thanks to cooperation between a mobile terminal and a network server. The fundamental concept used to achieve data security involves applying data encryption and secret sharing of the encryption key. In addition, this approach newly introduces a key encapsulation mechanism (KEM) and threshold cryptography. The approach also combines the use of a data protection approach, based on a secret sharing scheme, in order to achieve an efficient data reading process. Once one of the members reads the data, he/she need not use threshold cryptography to reconstruct the encrypted key, but instead uses a secret sharing scheme. This paper confirms the potential of this approach via the prototype implementation onto a mobile phone. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Privacy Preservation in the Publication of Trajectories

    Publication Year: 2008 , Page(s): 65 - 72
    Cited by:  Papers (23)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (374 KB) |  | HTML iconHTML  

    We study the problem of protecting privacy in the publication of location sequences. Consider a database of trajectories, corresponding to movements of people, captured by their transactions when they use credit or RFID debit cards. We show that, if such trajectories are published exactly (by only hiding the identities of persons that followed them), there is a high risk of privacy breach by adversaries who hold partial information about them (e.g., shop owners). In particular, we show that one can use partial trajectory knowledge as a quasi-identifier for the remaining locations in the sequence. We device a data suppression technique, which prevents this type of breach, while keeping the posted data as accurate as possible. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Profile Anonymization Model for Privacy in a Personalized Location Based Service Environment

    Publication Year: 2008 , Page(s): 73 - 80
    Cited by:  Papers (7)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (421 KB) |  | HTML iconHTML  

    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. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Modeling and Managing Mobile Commerce Spaces Using RESTful Data Services

    Publication Year: 2008 , Page(s): 81 - 89
    Cited by:  Papers (1)  |  Patents (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (651 KB) |  | HTML iconHTML  

    This paper advocates the use of RESTful data services in mobile commerce information spaces. REST is a restriction of web services to a simple protocol centered on a limited set of access operations against data resources. This paper analyzes how REST may be used as a general design principle for mobile commerce spaces. This analysis is threefold. First, it provides an abstract component model that contains a minimal embodiment of the REST functionality needed to support mobile commerce. Second, it describes and analyzes the operation of a mobile commerce space, resulting in a reference REST-based data decomposition that may be reused across a variety of domains. Third, it provides and analyzes a set of usage cases in the mobile commerce domain, which can form the basis of future REST-oriented programming models and tools. This analysis is based on a substantial mobile commerce framework we have implemented, called Celadon. This framework is currently being used to demonstrate several ambitious mobile commerce applications. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Next Generation Operator Environment to Turn Context-Aware Services into a Commercial Reality

    Publication Year: 2008 , Page(s): 90 - 97
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (777 KB) |  | HTML iconHTML  

    Network operators can play an essential role in turning widely investigated context-aware services into a commercial reality. The Nokia Siemens Networks NEON project aims to develop a virtual network operator environment that can leverage the opportunities offered by packet-based multi-access networks, increasingly more powerful mobile devices, and service provider business practices to enhance the end user experience with value-added services. This paper primarily focuses on the support provided by the NEON network to fully accomplish context-aware services. We present the design and implementation of the NEON network currently in use in Nokia Siemens Networks premises with a special focus on the context services it provides. We assessed the performance of such services in terms of latency and power consumption on smart phones and we used them to implement the communication dispatcher, a prototype application that enables efficient context-aware user-to-user multi-terminal communication. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Mobile User Profile Acquisition through Network Observables and Explicit User Queries

    Publication Year: 2008 , Page(s): 98 - 107
    Cited by:  Papers (3)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (569 KB) |  | HTML iconHTML  

    This paper describes a novel approach for gathering profile information about mobile phone users. The focus is on information that can be used to enhance targeting of advertisements. (The ads might be delivered into the mobile phones, or to other devices such as the user's IPTV.) Unlike previous approaches, we use a two-tiered approach for learning end-user habits and preferences. In this approach the first tier involves statistical learning from network observable data (in the current paper, primarily logs of cell towers visited), and the second tier involves explicit queries to the user (in the current paper, to ask, e.g., what kinds of activities the user does in a given region that he frequents). The user might be willing to answer occasional queries of this sort through offers of service discounts, or to be able to receive more relevant ads. The paper focuses on two key aspects of our approach, which correspond to how the two tiers are instantiated in the current version of the prototype system that we have developed at Bell Labs. The first concerns the statistical techniques used to determine information about regions visited, along with the frequency of visits, typical durations, and typical visit times. These techniques were developed based on a training set consisting of logs of 6 users with mobile devices over a period of several months. The techniques address issues that arise when a given small region is serviced by multiple cell towers (in which case oscillations between cell towers can be confused with movement between regions). The second key aspect concerns optimizing the order in which queries are presented to users, in a context where different query answers have different value for the advertising process. (The values of answers might be influenced by the mix of advertising campaigns from which ads are to be matched against users.) Optimization is NP-complete in a relatively general context. We develop a polynomial time algorithm which yields opt- imal sequences for the case where the family of queries to be asked satisfies a tree-based property. This is extended to create a heuristic polynomial time algorithm for the general case. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.