基于位置的Ad hoc网络路由协议研究

基于位置的Ad hoc网络路由协议利用节点地理位置信息指导数据包的转发,具有可扩展性强,路由效率高等优点。分析了Ad hoc网络中基于位置的路由协议以及位置信息服务,对几种协议进行了分析比较,并指出了基于位置的路由协议的研究重点。     

无线自主网中位置扩散服务性能仿真比较

无线自主网中的位置信息辅助路由协议需要网络中的节点获得其它节点的位置信息.位置信息服务的选择会显著影响路由协议的性能.通过仿真对无线自主网中现有的位置扩散服务从位置平均误差、误差分布、分组开销和字节数开销等方面进行了比较.所比较的位置扩散服务种类是迄今为止最多的.仿真结果表明,SNLUS协议所消耗的分组开销最少,而PULS协议所带来的平均位置误差最小.比较结果不仅对于现有位置服务协议的选择具有参考价值,而且对于位置扩散服务的改进和新协议的提出也有重要意义.     

一种基于位置和能量感知的MANET单播路由协议

能量消耗问题是MANET网络中研究的热点问题之一.针对基于位置的路由协议没有考虑节点剩余能量的问题,提出了一种结合位置信息和剩余能量的路由协议.本协议是在AODV[1]协议的基础上,提出了两个新的算法:基于位置的算法LBA(Location-Based Alaorithm)和动态能量控制的算法(DPC),并用NS2仿真比较了这两种协议.仿真结果表明,尽管改进的协议平均的端到端的延时增加,但是其能够明显地减少网络的总的耗能,平均了网络节点的耗能,延长了整个网络的寿命.     

A location routing protocol based on smart antennas for ad hoc networks

Ad hoc networks are a type of mobile networks that function without any fixed infrastructure. One of the weaknesses of ad hoc networks is that route between a source and a destination is likely to break during communication. Location-based routing algorithms are promising in reducing routing overhead in ad hoc networks. Existing location-based routing algorithms employ the Global Positioning System (GPS) as their location information provider, and synchronize information network-wide. Nonetheless, these protocols have some limitations because the use of GPS is not realistic in certain circumstances. Since smart antenna is able to infer direction and ranging information between pairs of ad hoc node, the obtained local position information can be used to improve routing mechanism. This work proposes a novel Location-Enhanced On-Demand (LEOD) routing protocol which is based on smart antenna technique. The LEOD protocol utilizes local position instead of global position to discover routes and make routing decision for the ad hoc network. Theoretical computation and simulation results show that data packet loss rate decreased significantly compared to other methods well-documented in the literature. In addition, this protocol reduces the network control overheads and the power consumption. It also improves network average throughput.     

Location privacy: going beyond K-anonymity,cloaking and anonymizers

With many location-based services, it is implicitly assumed that the location server receives actual users locations to respond to their spatial queries. Consequently, information customized to their locations, such as nearest points of interest can be provided. However, there is a major privacy concern over sharing such sensitive information with potentially malicious servers, jeopardizing users’ private information. The anonymity- and cloaking-based approaches proposed to address this problem cannot provide stringent privacy guarantees without incurring costly computation and communication overhead. Furthermore, they require a trusted intermediate anonymizer to protect user locations during query processing. This paper proposes a fundamental approach based on private information retrieval to process range and K-nearest neighbor queries, the prevalent queries used in many location-based services, with stronger privacy guarantees compared to those of the cloaking and anonymity approaches. We performed extensive experiments on both real-world and synthetic datasets to confirm the effectiveness of our approaches.     

基于锚节点的车载网地理路由算法

车载网络存在节点移动速度快、拓扑结构变化迅速等特点,直接利用全球定位系统(GPS)进行定位存在误差大和路由连通率低等问题。因此现有的基于地理位置的路由算法包递率不高,无法提供可靠路由。提出一种基于锚节点的车载网地理路由算法(GRAN),利用城市路灯作为锚节点,车辆通过锚节点定位自身位置,结合道路网关及中心数据,建立分层次的路由结构。通过这种方式,GRAN去除了路由发现过程及全网广播,达到降低路由开销、提高路由效率和包递率的目的。利用NS-2软件,选取接近现实的城市场景仿真。实验结果证明,与典型的基于地理位置的路由协议如贪婪转发与周边转发相结合的无状态路由(GPSR)和图形源路由(GSR)协议相比,GRAN能以较低的负荷提供较低的平均时延、较高的包递率和吞吐量。     

基于位置信息的自适应Ad Hoc路由协议

传统的基于位置信息的路由算法往往采用分布式预测机制,可靠性不高,特别当源节点不知道目的节点位置时只能采用洪泛策略,增大了通信开销。本文提出一种基于位置信息的自适应路由机制LAAR（Location-based A—daptive Ad hoc Routing）。LAAR采用分层的体系结构获得全网一致的拓扑视图,消除分布式预测带来的不确定性,通过路由前的位置查询避免洪泛。LAAR综合利用多种位置更新机制,在限制网络开销的同时保障位置信息的准确性。LAAR的自适应调节机制将节点的运动状态与路由发现过程结合,实现对目的节点的动态跟踪,提高路由性能。仿真结果表明,随着节点移动速度的增加,LAAR能够获得比LAR更小的控制开销;同时在节点密度较大情况下,LAAR能获得更高的分组投递率。     

分簇覆盖的移动自组织网中节点位置辅助路由算法

在大规模移动自组织网中,利用节点位置信息辅助建立路由被认为是一种有效提高无线网络路由可扩展性的方法.提出了一种可扩展与高效的、适用于移动自组织网络的路由算法——分簇覆盖的节点位置信息辅助路由算法(CLAR).CLAR使用如最小簇改变(LCC)算法,建立并保持的单跳分簇结构为拓扑.已有文献证明,LCC是更新成本最小的保持簇头节点密度均一的分簇算法.CLAR利用网络节点的位置信息提高无线网络路由的网络层性能,由目标节点的位置信息预测并构造一个较小的、形状为等腰三角形、矩形或圆形的区域.该区域需保证覆盖目标节点可能存在的位置,且根据源节点与目标节点间的相对位置决定该区域适宜的形状,从而限制源节点在一个较小的“请求域”内寻找可用路由,而不是在网络内盲目寻找.仿真实验结果表明,与其他路由算法相比较,CLAR路由算法在路由建立所需时长、路由代价、平均时延及数据包冲突等参数上表现优良.同时,算法保持了低平均时延、高数据包到达率、低控制开销及低路由寻找次数等优势.     

LAMR:移动Ad hoc网络位置匿名的多路径路由协议

为有效减少移动Ad hoc网络路由协议开销并且实现网络路由的鲁棒性,引入位置匿名性和LAR局部定向洪泛机制。对Ad hoc网络中的ARMR协议(anonymous routing protocol with multiple routes)进行改进,提出一种新的基于匿名位置的多路径路由协议LAMR(location-based anonymous route protocol),LAMR与ARMR的不同之处有两点:a)融入匿名性的位置可减少路由分组在网络的全局洪泛;b)定向洪泛思想可避免路由回路产生。仿真实验结果表明,LAMR能比ARMR有效地提高路径请求成功率和降低路由请求时延。     

Approximate and exact hybrid algorithms for private nearest-neighbor queries with database protection

Mobile devices with global positioning capabilities allow users to retrieve points of interest (POI) in their proximity. To protect user privacy, it is important not to disclose exact user coordinates to un-trusted entities that provide location-based services. Currently, there are two main approaches to protect the location privacy of users: (i) hiding locations inside cloaking regions (CRs) and (ii) encrypting location data using private information retrieval (PIR) protocols. Previous work focused on finding good trade-offs between privacy and performance of user protection techniques, but disregarded the important issue of protecting the POI dataset D. For instance, location cloaking requires large-sized CRs, leading to excessive disclosure of POIs (O(|D|) in the worst case). PIR, on the other hand, reduces this bound to \(O(\sqrt{|D|})\), but at the expense of high processing and communication overhead. We propose hybrid, two-step approaches for private location-based queries which provide protection for both the users and the database. In the first step, user locations are generalized to coarse-grained CRs which provide strong privacy. Next, a PIR protocol is applied with respect to the obtained query CR. To protect against excessive disclosure of POI locations, we devise two cryptographic protocols that privately evaluate whether a point is enclosed inside a rectangular region or a convex polygon. We also introduce algorithms to efficiently support PIR on dynamic POI sub-sets. We provide solutions for both approximate and exact NN queries. In the approximate case, our method discloses O(1) POI, orders of magnitude fewer than CR- or PIR-based techniques. For the exact case, we obtain optimal disclosure of a single POI, although with slightly higher computational overhead. Experimental results show that the hybrid approaches are scalable in practice, and outperform the pure-PIR approach in terms of computational and communication overhead.     

MDCE路由算法的分析与改进

延迟容忍网络中基于位置的地理路由算法使用节点自我采集的GPS信息进行下一跳中继结点的选择,而节点的移动性会导致节点的实际位置在时刻改变,相对位置节点的移动方向信息比地理位置信息具有更好的稳定性。文献[1]提出的MDCE路由算法网络负载率和丢包率很高,且由于DTN网络的特殊性,难以拥有多个相邻节点。对MDCE路由算法进行分析与改进,降低中继节点数、规避消息副本向来的方向传输。仿真结果表明,改进后的MDCE路由算法的网络负载率和丢包率明显降低,实用性更强。     

Layered Diffusion-based Coverage Control in Wireless Sensor Networks

Coverage is an important performance metric for many applications, such as surveillance in wireless sensor networks. Coverage control is used to select as few active nodes as possible from all deployed sensor nodes, such that sufficient coverage of the monitored area can be guaranteed while reducing the energy consumption of each individual sensor node to prolong the network lifetime. This paper classifies three types of coverage control protocols based on the available information about nodes’ distances or locations, and reviews several representative protocols for each type. We also propose a new distributed and localized coverage control protocol, called Layered Diffusion-based Coverage Control (LDCC). The LDCC protocol does not require information about the node location coordinates when selecting active nodes. Instead, it exploits hop count information, which is easily obtained in a WSN, to select active sensor nodes. Furthermore, the LDCC protocol is very simple and does not require any sophisticated computation such as distance or covered area computation. Our simulation results show that the LDCC protocol achieves a high coverage ratio while incurring very low message overhead compared with other existing protocols. Furthermore, simulation results suggest that in a large-scale sensor network with medium to large localization errors, LDCC performs even better than location-based coverage control protocols.     

基于扩展环的Ad Hoc网络路由发现算法

针对传统的AODV路由协议采用全网络广播进行路由发现带来的路由开销较大问题,提出一种自适应的L跳扩展环路由搜索算法,并推导出L值的计算公式,节点在路由请求过程中能够根据以前搜索中获得的“先验”知识动态地调整搜索参数,进而计算下一步路由过程的最优跳数L,使搜索总是向着路由开销最小的方向进行。仿真结果表明,改进后的AODV协议能够降低路由开销,缩短路由发现过程的延时。     

一种支持Top-k空间关键词检索的高效压缩索引

基于位置的服务可以指引用户找到在特定位置或区域内能够提供所需要服务的对象(比如找某个高校附近(经纬度标识)的咖啡店).向这类服务提交一个查询位置和多个关键词,该类服务返回k个最相关的对象,对象和查询的相关性同时考虑空间相近性和文本相似性.为了支持高效的top-k空间关键词查询,出现了多种混合索引,然而现有的这些索引为了提供实时响应均耗费大量存储空间.提出一种基于压缩技术的索引CSTI,该索引显著减少了存储开销(至少减少80%甚至到两个数据量级),同时保持高效的查询性能.大量基于真实和仿真数据集的实验结果表明,CSTI在空间开销和响应时间上均优于已有方法.     

On the Design of Link-State Routing Protocol for Connection-Oriented Networks

Link-state routing protocols are being increasingly used in modern communications networks. A salient feature of this class of routing protocols is that network connectivity and state information of all links are available to nodes for making routing decision. Two main components of a link-state routing protocol are an update mechanism and a routing algorithm. These components must be properly designed for efficient routing. Various alternatives are possible for each of these components leading to different scenarios for routing protocol. In this paper, we quantitatively examine the impact of these alternatives on network performance using call-by-call simulations. Our design objective is to reduce call blocking ratio without significantly increasing routing overhead. We also present a new signaling scheme that can be used in conjunction with link-state protocols. We show that, if properly designed, this scheme can enhance the network performance.     

移动位置服务的应用发展研究

移动位置服务是移动运营商和服务提供商联合推出的基于地理位置信息服务,用户通过移动终端获取位置信息及产品服务。中国的移动位置服务开展较早,但相比于美国等发达国家,并没有获得用户的广泛接受。本文通过研究移动位置服务的发展现状和用户行为,提出发展对策。     

The Hopfield-Tank neural network applied to the mobile agent planning problem

Mobile agent planning (MAP) is increasingly viewed as an important technique of information retrieval systems to provide location aware services of minimum cost in mobile computing environment. Although Hopfield-Tank neural network has been proposed for solving the traveling salesperson problem, little attention has been paid to the time constraints on resource validity for optimizing the cost of the mobile agent. Consequently, we modify Hopfield-Tank neural network and design a new energy function to not only cope with the dynamic temporal features of the computing environment, in particular the server performance and network latency when scheduling mobile agents, but also satisfy the location-based constraints such as the starting and end node of the routing sequence must be the home site of the traveling mobile agent. In addition, the energy function is reformulated into a Lyapunov function to guarantee the convergent stable state and existence of the valid solution. Moreover, the objective function is derived to estimate the completion time of the valid solutions and predict the optimal routing path. Simulations study was conducted to evaluate the proposed model and algorithm for different time variables and various coefficient values of the energy function. The experimental results quantitatively demonstrate the computational power and speed of the proposed model by producing solutions that are very close to the minimum costs of the location-based and time-constrained distributed MAP problem rapidly. The spatio-temporal technique proposed in this work is an innovative approach in providing knowledge applicable to improving the effectiveness of solving optimization problems.     

Spatial cloaking for anonymous location-based services in mobile peer-to-peer environments

This paper tackles a privacy breach in current location-based services (LBS) where mobile users have to report their exact location information to an LBS provider in order to obtain their desired services. For example, a user who wants to issue a query asking about her nearest gas station has to report her exact location to an LBS provider. However, many recent research efforts have indicated that revealing private location information to potentially untrusted LBS providers may lead to major privacy breaches. To preserve user location privacy, spatial cloaking is the most commonly used privacy-enhancing technique in LBS. The basic idea of the spatial cloaking technique is to blur a user’s exact location into a cloaked area that satisfies the user specified privacy requirements. Unfortunately, existing spatial cloaking algorithms designed for LBS rely on fixed communication infrastructure, e.g., base stations, and centralized/distributed servers. Thus, these algorithms cannot be applied to a mobile peer-to-peer (P2P) environment where mobile users can only communicate with other peers through P2P multi-hop routing without any support of fixed communication infrastructure or servers. In this paper, we propose a spatial cloaking algorithm for mobile P2P environments. As mobile P2P environments have many unique limitations, e.g., user mobility, limited transmission range, multi-hop communication, scarce communication resources, and network partitions, we propose three key features to enhance our algorithm: (1) An information sharing scheme enables mobile users to share their gathered peer location information to reduce communication overhead; (2) A historical location scheme allows mobile users to utilize stale peer location information to overcome the network partition problem; and (3) A cloaked area adjustment scheme guarantees that our spatial cloaking algorithm is free from a “center-of-cloaked-area” privacy attack. Experimental results show that our P2P spatial cloaking algorithm is scalable while guaranteeing the user’s location privacy protection.     

基于车辆协作的混淆路径轨迹隐私保护机制

在车联网中,车辆通过和第三方共享位置信息获得基于位置的服务,这可能会导致车辆轨迹隐私泄露。针对该问题,提出基于车辆协作的混淆路径轨迹保护机制。首先,车辆轨迹熵达到自定义的轨迹保护阈值后,减少车辆混淆,解决了路径混淆开销大的问题。然后,设计路径混淆算法来增加车辆在路口路径混淆的机会,提高了车辆轨迹保护程度。最后,仿真实验从轨迹熵和轨迹跟踪成功率验证了该方法的有效性和高效性。