Location-Based Data Dissemination for Spatial Queries in Wireless Broadcast Environments

Most current research on Location-Based Services(LBSs,for short) assumes point-to-point wireless communication, where the server processes a query and returns the query result to the user via a point-to-point wireless channel. However,LBSs via point-to-point wireless channel suffer from a tremendous amount of traffic and service requests from the user and thereby result in poor performance.In this paper,we present broadcast-based spatial query processing algorithms designed to support k-NN(k-Nearest Neig...     

Preventing Location-Based Identity Inference in Anonymous Spatial Queries

The increasing trend of embedding positioning capabilities (for example, GPS) in mobile devices facilitates the widespread use of location-based services. For such applications to succeed, privacy and confidentiality are essential. Existing privacy-enhancing techniques rely on encryption to safeguard communication channels, and on pseudonyms to protect user identities. Nevertheless, the query contents may disclose the physical location of the user. In this paper, we present a framework for preventing location-based identity inference of users who issue spatial queries to location-based services. We propose transformations based on the well-established K-anonymity concept to compute exact answers for range and nearest neighbor search, without revealing the query source. Our methods optimize the entire process of anonymizing the requests and processing the transformed spatial queries. Extensive experimental studies suggest that the proposed techniques are applicable to real-life scenarios with numerous mobile users.     

Handling High-Level Queries in Location-Based Services for User Groups

In this paper we deal with the high level management of data involved in Location-Based Services in order to accommodate corresponding queries. A series of techniques are employed on major components of an LBS, namely mobile users, application environment and selected services. First, a grouping technique generalizes the spatio-temporal data describing the mobile users' movement. The environment is represented under a combined spatial and content hierarchy according to the application at hand. Finally, in the service component, relational operators are formed to support relative spatio-temporal queries, while lifeline data types are constructed to extract and compare behavioral trend patterns among the formed user groups. We show how all proposed techniques communicate under a common database schema. Answers to characteristic queries demonstrate the applicability of this work.     

Nearest Neighbor Queries in Shared-Nothing Environments

In this paper, we propose an efficient solution to the problem of nearest neighbor query processing in declustered spatial databases. Recently a branch-and-bound nearest neighbor finding (BB-NNF) algorithm has been designed to process nearest neighbor queries in R-trees. However, this algorithm is strictly serial (branch-and-bound oriented) and its performance degrades, during processing of a nearest neighbor query, if applied to a parallel environment, since it does not exploit any kind of parallelization. We develop an efficient query processing strategy for parallel nearest neighbor finding (P-NNF), assuming a shared nothing multi-processor architecture, where the processors communicate via a network. In our method, the relevant sites are activated simultaneously. In order to achieve this goal, statistical information is used. The efficiency measure is the response time of a given query. Experimental results, based on real-life and synthetic datasets, show that the proposed method outperforms the branch-and-bound method by factors.     

地理位置相关移动感知系统任务分配问题研究

随着智能手机应用的普及,移动感知技术已被认为是一种高效且成本低廉的环境数据收集方式.移动感知系统中地理位置相关的最优任务分配问题是一个NP难问题.为了解决该问题,提出了一种多项式时间的近似最优的任务分配算法.该算法首先引入了单位圆盘模型中移动划分的思想,将整个监测地理空间划分为若干个子区间,并使得子区间内的最优分配方案的集合是划分前最优解的〖SX(〗1〖〗1+ε〖SX)〗,这表明所设计的近似算法是一个多项式时间近似机制.随后,证明了最优任务分配问题在每个子区间内是多项式时间可解的,并设计了枚举算法求出该问题的最优解.最后,仿真实验结果表明所设计的近似最优任务分配算法的实际性能与理论分析相吻合.     

数据广播环境下基于数据共享的位置相关skyline查询

数据广播环境下位置相关skyline查询是同时涉及空间位置属性和非空间多维属性的一类新的skyline查询类型,可广泛地应用于地理信息系统、城市规划、智能交通等领域。与传统环境下的位置相关skyline查询相比,数据广播环境下位置skyline查询面临一些新的问题,如广播信道的线性特性、移动设备资源受限性等。针对这些问题,本文提出了基于数据共享的位置相关查询算法,该方法通过共享邻近移动设备缓存的查询结果来改进查询算法的性能。广泛的实验结果显示,在移动设备密度较大的对等网络中,本文提出的算法具有较明显的优势,能显著地提升查询性能。     

Efficient Distributed Skyline Queries for Mobile Applications

In this paper, we consider skyline queries in a mobile and distributed environment, where data objects are distributed in some sites (database servers) which are interconnected through a high-speed wired network, and queries are issued by mobile units (laptop, cell phone, etc.) which access the data objects of database servers by wireless channels. The inherent properties of mobile computing environment such as mobility, limited wireless bandwidth, frequent disconnection, make skyline queries more complicated. We show how to efficiently perform distributed skyline queries in a mobile environment and propose a skyline query processing approach, called efficient distributed skyline based on mobile computing (EDS-MC). In EDS-MC, a distributed skyline query is decomposed into five processing phases and each phase is elaborately designed in order to reduce the network communication, network delay and query response time. We conduct extensive experiments in a simulated mobile database system, and the experimental results demonstrate the superiority of EDS-MC over other skyline query processing techniques on mobile computing.     

Effcient Distributed Skyline Queries for Mobile Applications

In this paper, we consider skyline queries in a mobile and distributed environment, where data objects are distributed in some sites (database servers) which are interconnected through a high-speed wired network, and queries are issued by mobile units (laptop, cell phone, etc.) which access the data objects of database servers by wireless channels. The inherent properties of mobile computing environment such as mobility, limited wireless bandwidth, frequent disconnection, make skyline queries more complicat...     

手机客户端食品添加剂查询系统初探

“民以食为天”,近年来食品安全问题在我国得到了巨大的关注,接连不断发生的恶性食品安全事故促使我们必须采取有效措施有效遏制在食品生产经营中滥用食品添加剂行为。本文对通过手机客户端食品添加刺查询系统的建设原则、建设目标及平台设计等方面进行了初步探讨。     

移动环境下缓存弱一致性的研究

在移动环境下,客户缓存为提高客户一服务器数据库系统的整体性能提供了有效途径。缓存与服务方数据的同步策略是缓存研究的重要内容。移动环境下,考虑到网络的带宽、开销和可靠性等因素,客户有可能允许缓存维护弱一致性,即允许缓存与服务方数据存在偏差。本文针对基于语义的缓存,给出客户限定偏差范围的方法,并且提出基于有效期的缓存同步算法。     

Collaborative Multimedia Presentations in Mobile Environments

Distributed multimedia documents systems, distributed video servers are examples of multimedia presentations involving collaboration among multiple information sources. In such applications, objects have to be retrieved from their sources and presented to users according to specified temporal relationships. Objects retrieval in these collaborative applications is influenced by their presentation times, durations, and network throughput available to their sources. Replication of objects amongst the set of collaborating systems gives a choice for object retrieval. Client going through a multimedia presentation can be in a mobile environment. Here, object retrievals from collaborating servers are carried out by base stations to which the client is attached. Mobile client then downloads objects from the base station.In this paper, we present a graph-search based algorithm for computing and negotiating throughput requirements of collaborating multimedia presentations with replicated objects in a mobile environment. This algorithm maximizes the number of cached objects (that have already been played) for handling operations such as reverse presentation.     

Cost Estimation for Queries Experiencing Multiple Contention States in Dynamic Multidatabase Environments

Accurate query cost estimation is crucial to query optimization in a multidatabase system. Several estimation techniques for a static environment have been suggested in the literature. To develop a cost model for a dynamic environment, we recently introduced a multistate query-sampling method. It has been shown that this technique is promising in estimating the cost ofa query run in any given contention state for a dynamic environment. In this paper, we study a new problem on how to estimate the cost of a large query that may experience multiple contention states. Following the discussion of limitations for two simple approaches, i.e., single state analysis and average cost analysis, we propose two novel techniques to tackle this challenge. The first one, called fractional analysis, is suitable for a gradually and smoothly changing environment, while the second one, called the probabilistic approach, is developed for a rapidly and randomly changing environment. The former estimates a query cost by analyzing its fractions, and the latter estimates a query cost based on Markov chain theory. The related issues including cost formula development, error analysis, and comparison among different approaches are discussed. Experiments demonstrate that the proposed techniques are quite promising in solving the new problem. Received 5 January 2001 / Revised 6 June 2001 / Accepted in revised form 9 July 2001 Correspondence and offprint requests to: Qiang Zhu, Department of Computer and Information Science, The University of Michigan – Dearborn, Dearborn, MI 48128, USA. Email: qzhu@umich.eduau     

移动计算环境中基于移动代理的数据管理体系结构

在研究、分析移动计算环境特殊性的基础上,提出了一种基于移动代理的数据管理体系结构,简称DMABMA。该体系结构能把移动计算环境分成两大部分：固定网络部分和无线网络部分,充分利用固定网络部分的高带宽和高可靠性来弥补无线网络部分的断接性、有限带宽和弱可靠性,最终使两者有机结合,形成一个适合移动计算环境需要的体系结构。     

移动计算中基于Mobile Agent的数据库访问技术

本文针对传统基于应用程序方式的数据库机制在移动计算环境中所存在的不足，分别提出了移动计算环境中基于Mobile Agent的集中式数据库和分布式异种数据库访问技术，并利用IBM开发的Aglets在一个宽带无线IP网络上进行了原理实验，实验结果表明这种技术在移动计算环境中明显提高了数据库访问的性能。     

在移动计算环境中基于移动代理的缓存失效方案

1 引言缓存技术是分布式计算环境中的重要技术,它可以改善系统的整体性能(如查询响应时间、吞吐量等),而移动计算的网络环境是一种特殊的分布式环境,与传统的分布式系统相比,它具有鲜明的特点:移动性、断接性、带宽多样性、可伸缩性、弱可靠性、网络通信的非对称性、电源能力局限性等等。这些特点使得缓存技术在移动计算环境中尤为重要。因为缓存能有效减少带宽需求,并能节省移动计算机的能耗。     

Data Consistency for Cooperative Caching in Mobile Environments

The trend toward wireless communications and advances in mobile technologies are increasing consumer demand for ubiquitous access to Internet-based information and services. A 3D framework provides a basis for designing, analyzing, and evaluating strategies to address data consistency issues in mobile wireless environments. A proposed relay-peer-based cache consistency protocol offers a generic and flexible method for carrying out cache invalidation     

移动环境中的一种缓存失效报告策略

针对传统的缓存失效报告策略对带宽利用率低、客户端电能消耗大的缺陷,提出了动态划分失效报告的广播策略.通过考虑数据项的查询率、更新率及数据大小,对更新数据项采用不同的失效方式进行广播,分析证明此策略的带宽利用率、电能消耗、查询延迟优于传统的失效报告策略.     

Location-Based Services

Today, location information is in the hands of the masses. The success of location in pervasive computing has exposed new challenges and opportunities for researchers including making location sensing more robust, accurate, deployable, secure, and developer-friendly. This special issue showcases papers that describe recent research that addresses these challenges.     

移动环境下的QoS保证技术

1 引言各种Internet业务在全世界范围内的广泛应用推动了Internet技术的发展,IP协议原有的“尽力发送“机制已经不能很好地适应业务的需求,因此,IETF提出了资源预留协议和实时传输协议等来保证传输业务流的服务质量。同时,越来越多的移动用户要求能够连续无缝地接入Internet,为此I-ETF设计了移动IP协议以满足移动用户的需求。但是,由于移动环境中通信链路质量经常变化,可用的系统资源较少,通信过程中的多次切换可能导致连接中断,因此在移动环境下提供QoS保证需要新的机制。本文第2部分简述了基于固定网络的QoS保证机制,探讨了移动性对QoS的影响,第3部分介绍了几种在移动环境下提供QoS保证的技术,着重介绍了移动资源预留协议,并给出了移动QoS保证技术的研究方向,第4部分提出了一个新的移动QoS框架,最后给出了下一步要做的主要工作。