无线通信网络的移动性管理

未来无线通信网络的两个最重要的研究问题就是宽带和无缝漫游，而移动性管理是实现网络间无缝漫游的关键难题之一。本对移动性管理涉及的各个方面进行了简要的概述，首先介绍了移动性管理的分类和它对协议层次的影响，接着介绍了移动性管理的一般性框架和主要的协议特点，最后介绍了一些关键的研究问题和研究热点。     

On Increasing Service Accessibility and Efficiency in Wireless Ad-Hoc Networks with Group Mobility

Wireless ad-hoc networks consist of mobile nodes interconnected by multi-hopwireless paths. Unlike conventional wireless networks, ad-hoc networks haveno fixed network infrastructure or administrative support. Because of thedynamic nature of the network topology and limited bandwidth of wirelesschannels, Quality-of-Service (QoS) provisioning is an inherently complex anddifficult issue. In this paper, we propose a fully distributed and adaptivealgorithm to provide statistical QoS guarantees with respect toaccessibility of services in an ad-hoc network. In this algorithm,we focus on the optimization of a new QoS parameter of interest, serviceefficiency, while keeping protocol overheads to the minimum. To achievethis goal, we theoretically derive the lower and upper bounds of serviceefficiency based on a novel model for group mobility, followed by extensivesimulation results to verify the effectiveness of our algorithm.     

Mobility Management for Hierarchical Wireless Networks

In this paper, we consider the mobility management in large, hierarchically organized multihop wireless networks. The examples of such networks range from battlefield networks, emergency disaster relief and law enforcement etc. We present a novel network addressing architecture to accommodate mobility using a Home Agent concept akin to mobile IP. We distinguish between the physical routing hierarchy (dictated by geographical relationships between nodes) and logical hierarchy of subnets in which the members move as a group (e.g., company, brigade, battalion in the battlefield). The performance of the mobility management scheme is investigated through simulation.     

Integrated Routing and Storage for Messaging Applications in Mobile Ad Hoc Networks

This paper is motivated by the observation that traditional ad hoc routing protocols are not an adequate solution for messaging applications (e.g., e-mail) in mobile ad hoc networks. Routing in ad hoc mobile networks is challenging mainly because of node mobility – the more rapid the rate of movement, the greater the fraction of bad routes and undelivered messages. For applications that can tolerate delays beyond conventional forwarding delays, we advocate a relay-based approach to be used in conjunction with traditional ad hoc routing protocols. This approach takes advantage of node mobility to disseminate messages to mobile nodes. The result is the Mobile Relay Protocol (MRP), which integrates message routing and storage in the network; the basic idea is that if a route to a destination is unavailable, a node performs a controlled local broadcast (a relay) to its immediate neighbors. In a network with sufficient mobility – precisely the situation when conventional routes are likely to be non-existent or broken – it is quite likely that one of the relay nodes to which the packet has been relayed will encounter a node that has a valid, short (conventional) route to the eventual destination, thereby increasing the likelihood that the message will be successfully delivered. Our simulation results under a variety of node movement models demonstrate that this idea can work well for applications that prefer reliability over latency.     

Combinatorial Mobile IP: A New Efficient Mobility Management Using Minimized Paging and Local Registration in Mobile IP Environments

Combinatorial Mobile IP, a new mobility management scheme for Mobile IP, is proposed and analyzed. We present how to adopt mobility management schemes on cellular networks and adapt them in Mobile IP without disrupting the nature of the Internet. We apply widely used mobility management schemes such as hierarchical architecture and paging in cellular networks to Mobile IP. We restrict paging to the area that has to be paged using local registrations. In this way, we show that the total signaling costs of Combinatorial Mobile IP are reduced compared to other micro-mobility protocols such as Mobile IP Regional Registration and P-MIP. Random walk on a connected graph is used to analyze the performance of Combinatorial Mobile IP.     

Integrated Mobility Management Methods for Mobile IP and SIP in IP based Wireless Data Networks

With developments in voice over IP (VoIP), IP-based wireless data networks and their application services have received increased attention. While multimedia applications of mobile nodes are served by Session Initiation Protocol (SIP) as a signaling protocol, the mobility of mobile nodes may be supported via Mobile IP protocol. For a mobile node that uses both Mobile IP and SIP, there is a severe redundant registration overhead because the mobile node has to make location registration separately to a home agent for Mobile IP and to a home registrar for SIP, respectively. Therefore, we propose two new schemes that integrate mobility management functionality in Mobile IP and SIP. We show performance comparisons among the previous method, which makes separate registration for Mobile IP and SIP without integration, and our two integrated methods. Numerical results show that the proposed methods efficiently reduce the amount of signaling messages and delay time related to the idle handoff and the active handoff.     

WRE‐OLSR,a new scheme for enhancing the lifetime within ad hoc and wireless sensor networks

Within ad hoc and wireless sensor networks, communications are accomplished in dynamic environments with a random movement of mobile devices. Thus, routing protocols over these networks are an important concern to offer efficient network scalability, manage topology information, and prolong the network lifetime. Optimized link state routing (OLSR) is one of those routing protocols implemented in ad hoc and wireless sensor networks. Because of its proactive technique, routes between two nodes are established in a very short time, but it can spend a lot of resources for selecting the multipoint relays (MPRs: nodes responsible for routing data) and exchanging topology control information. Thus, nodes playing for a long time a role of MPR within networks implementing such protocol can rapidly exhaust their batteries, which create route failures and affect the network lifetime. Our main approach relies on analyzing this concern by introducing a new criterion that implements a combination between the residual energy of a node and its reachability in order to determine the optimal number of MPRs and sustain the network lifetime. Simulations performed illustrate obviously that our approach is more significant compared with the basic heuristic used by original OLSR to compute the MPR set of a node.     

RPSF: A Routing Protocol with Selective Forwarding for Mobile Ad-Hoc Networks

Many existing reactive routing algorithms for mobile ad-hoc networks use a simple broadcasting mechanism for route discovery which can lead to a high redundancy of route-request messages, contention, and collision. Position-based routing algorithms address this problem but require every node to know the position and velocity of every other node at some point in time so that route requests can be propagated towards the destination without flooding the entire network. In a general ad-hoc network, each node maintaining the position information of every other node is expensive or impossible. In this paper, we propose a routing algorithm that addresses these drawbacks. Our algorithm, based on one-hop neighborhood information, allows each node to select a subset of its neighbors to forward route requests. This algorithm greatly reduces the number of route-request packets transmitted in the route-discovery process. We compare the performance of our algorithm with the well known Ad-hoc On-demand Distance Vector (AODV) routing algorithm. On average, our algorithm needs less than 12.6% of the routing-control packets needed by AODV. Simulation results also show that our algorithm has a higher packet-delivery ratio and lower average end-to-end delay than AODV.     

一体化网络下移动性管理的索引结构模型

 发展一般的移动性管理模型是一体化移动网络的重要需求.通过分析移动性的影响以及不同体系下的移动性支撑机制,本文提出了移动管理层作为移动性及其管理的概念解释.提出了一个描述移动性管理机制的索引结构模型.该模型构造了管理机制的基本单元(点和边),定义了基本操作(更新操作和查询操作).分析指出所提模型在单元和参数方面具有很大的灵活性,可以适用于很多场景.本文使用索引结构模型描述并分析了一体化网络的移动性管理方案,分析结果说明了在一体化网络中映射服务器的配置方案和其查询机制的设计将成为实现高效的移动性管理机制的关键.     

Integration of mobility and intrusion detection for wireless ad hoc networks

One of the main challenges in building intrusion detection systems (IDSs) for mobile ad hoc networks (MANETs) is to integrate mobility impacts and to adjust the behaviour of IDSs correspondingly. In this paper, we first introduce two different approaches, a Markov chain‐based approach and a Hotelling's T² test based approach, to construct local IDSs for MANETs. We then demonstrate that nodes' moving speed, a commonly used parameter in tuning IDS performances, is not an effective metric to tune IDS performances under different mobility models. To solve this problem, we further propose an adaptive scheme, in which suitable normal profiles and corresponding proper thresholds can be selected adaptively by each local IDS through periodically measuring its local link change rate, a proposed unified performance metric. We study the proposed adaptive mechanism at different mobility levels, using different mobility models such as random waypoint model, random drunken model, and obstacle mobility model. Simulation results show that our proposed adaptive scheme is less dependent on the underlying mobility models and can further reduce false positive ratio. Copyright © 2006 John Wiley & Sons, Ltd.     

无线Ad Hoc网络DSR与OLSR路由协议的性能比较

文中首先从理论出发,对Ad Hoc网络中的两种典型路由协议：DSR与OLSR进行了比较分析,然后利用OPNET网络仿真软件搭建仿真模型,在业务数据持续发送的环境下,对DSR和OLSR的性能进行了对比测试,最终我们发现OLSR在仿真环境中全面领先于DSR,其代价是更高的存储复杂度、更多的运算复杂度和更大的节点能量消耗。     

战术互联网中的OLSR路由协议研究

战术互联网是无线移动环境下的战术通信骨干网络,是实现战场前沿态势感知数据和指挥控制数据传输的主要通道.OLSR(Optimized Link State Routing Protocol)是一种适合在移动Ad Hoc网中使用的路由协议,它采用了MPR (MultiPoint Relay:多点中继)机制以减少控制开销.文中以战术互联网系统为背景,结合其应用要求,对OLSR路由协议进行了算法和仿真研究,得到了有用的结果.     

全IP通信网络中的移动性管理

文章描述了全IP网络各个层次上的移动性管理需求以及全IP网络目前的标准和规范，详细介绍了移动性管理中的宏移动性管理、微移动性管理、空中接口移动性管理。指出了全IP网络中移动管理的研究方向。     

蜂窝网络中环状搜索移动性管理策略

位置管理是移动通信领域的一个具有挑战性的问题,涉及到位置更新和位置查找操作.在现行蜂窝系统的位置管理策略(简称"基本策略")中,一旦移动台越区,就需要进行位置更新.由于移动台的越区具有局部性,基本策略会造成系统资源的极大浪费.因此,降低位置管理的费用成为移动通信领域的一个研究热点.该文给出不需要进行位置更新的环状搜索位置管理策略(简称"环状策略"),并推导出搜索位置区平均层数的一个公式,然后利用这一公式对基本策略、指针推进策略与环状策略的费用进行了对比研究,得出:在一定条件下,环状策略的费用要比基本策略及基本指针推进策略小.     

Associativity-Based Routing for Ad Hoc Mobile Networks

This paper presents a new, simple and bandwidth-efficient distributed routing protocol to support mobile computing in a conference size ad-hoc mobile network environment. Unlike the conventional approaches such as link-state and distance-vector distributed routing algorithms, our protocol does not attempt to consistently maintain routing information in every node. In an ad-hoc mobile network where mobile hosts (MHs) are acting as routers and where routes are made inconsistent by MHs' movement, we employ an associativity-based routing scheme where a route is selected based on nodes having associativity states that imply periods of stability. In this manner, the routes selected are likely to be long-lived and hence there is no need to restart frequently, resulting in higher attainable throughput. Route requests are broadcast on a per need basis. The association property also allows the integration of ad-hoc routing into a BS-oriented Wireless LAN (WLAN) environment, providing the fault tolerance in times of base stations (BSs) failures. To discover shorter routes and to shorten the route recovery time when the association property is violated, the localised-query and quick-abort mechanisms are respectively incorporated into the protocol. To further increase cell capacity and lower transmission power requirements, a dynamic cell size adjustment scheme is introduced. The protocol is free from loops, deadlock and packet duplicates and has scalable memory requirements. Simulation results obtained reveal that shorter and better routes can be discovered during route re-constructions.     

Quality of Service and Mobility for the Wireless Internet

Our paper explores the issue of how to provide appropriate quality of service mechanisms closely integrated with flexible mobility management in wireless local area networks. We consider them as access networks of choice for the high performance Wireless Mobile Internet. We present a hierarchical QoS architecture that extends Differentiated Services (DiffServ) to mobile hosts in a wireless environment. Our approach is based on controlling several parameters of a wireless LAN cell: the limited geographical span to ensure the same high bit rate for all hosts, the constrained rate of traffic sources to limit the use of the channel in function of the required QoS and the limited number of active hosts to keep the load sufficiently low. The QoS management is coupled with mobility management at the IP level. We use a micro-mobility scheme implemented in the IPv6 layer with fast hand-offs between adjacent cells. Micro-mobility avoids address translation, traffic tunneling, and enables fast hand-offs. We give some details of experiments to show the quality of service differentiation over the 802.11b network.     

A Domain-Based Routing Protocol for SSM Source Mobility in Mobile IPv6 Networks

In Mobile IP, the signaling traffic overhead will be too high since the new Care-of-Address (CoA) of the mobile node (MN) is registered all the way with the home agent (HA) whenever the MN has moved into a new foreign network. To complement Mobile IP in better handling local movement, several IP micro protocols have been proposed. These protocols introduce a hierarchical mobility management scheme, which divides the mobility into micro mobility and macro mobility according to whether the host's movement is intra-domain or inter-domain. Thus, the requirements on performance and flexibility are achieved, especially for frequently moving hosts. This paper introduces a routing protocol for multicast source mobility on the basis of the hierarchical mobile management scheme, which provides a unified global architecture for both uni- and multicast routing in mobile networks. The implementation of multicast services adopts an improved SSM (Source Specific Multicast) model, which combines the advantages of the existing protocols in scalability and mobility transparency. Simulation results show that the proposed protocol has better performance than the existing routing protocols for SSM source mobility.     

一种新的移动IPv6移动性管理策略

在IETF制定的移动IPv6移动性管理策略中,当移动主机每次从一个子网移动到另一个子网时,都需要对家乡代理和相应的通信主机进行绑定更新,这就导致网络总的绑定和发送代价过高.本文提出了一种新的移动性管理策略,在利用现有网络结构的基础上,通过将移动主机的移动分为本地移动和家乡移动两种类型,来减少移动主机向家乡代理和相应的通信主机发送绑定更新消息,从而降低网络的绑定代价,使网络的性能得到改善.     

移动自组网电力及负荷感知的构造最小连通支配集算法

在移动自组网络MANET(Mobile Ad-hoc Networks)中,移动节点之间的通信是多跳(Multi-hop)的,即需要网络中其他节点的参与得以进行,因此,节点之间的通信路径会因为节点的电力耗竭或节点的移动而中断.本文提出了根据移动节点当前电力及通信负荷来选择支配节点的最小连通支配集CDS(Connected Dominating Set)构造算法,这种算法可以减小由移动节点电力耗竭所致的通信路径失效的概率,也可以减少数据包通过各移动节点的延误时间,对设计MANET的高效稳定的路由策略有着重要的应用价值.     

一种分层多跳无线网中的移动性管理策略

该文介绍一种分层多跳无线网与其他骨干网络互连情况下的网络层移动性管理方案。它使用了包含逻辑家乡代理的宏移动性管理和将位置管理与路由和寻呼机制结合起来的微移动性管理的思想,以提高网络在战场等特殊情况下使用的可靠性和抗毁性,减小位置管理的开销,节省无线信道的带宽。