Mobility label based network: Mobility support in label switched networks with multi-protocol BGP

To support mobility the network control plane is required to detect changes in the mobile node’s location and distribute the new location information throughout the network thus enabling the forwarding plane to deliver traffic in an optimal manner. The network responsiveness to the mobile node movements can be generally thought of as the time elapsed between the moment the node’s location in the network has changed and the moment the reception of packets in the new location has resumed. This paper outlines an approach to handling the user mobility at the network layer in the context of multi-protocol label switched networks (MPLS). This new approach does not rely on the existing IP mobility management protocols such as Mobile IP and is instead based on the combination of multi-protocol BGP (MP-BGP) and MPLS. This paper proposes to introduce new protocol elements to MP-BGP to achieve mobility label distribution at the network control plane and the optimal packet delivery to the mobile node by the network forwarding plane using MPLS regardless of the IP protocol addressing and the associated logical network topology.     

Neighborhood tracking for mobile ad hoc networks

In mobile ad hoc networks (MANETs), node mobility causes network topologies to change dynamically over time, which complicates such important tasks as broadcasting and routing. In a typical efficient localized approach, each node makes forwarding decisions based on a neighborhood local view constructed simply by collecting received “Hello” messages. That kind of neighborhood local view can become outdated and inconsistent, which induces a low-coverage problem for efficient broadcasting tasks and a low-delivery ratio problem for efficient routing tasks. In this paper, we propose a neighborhood tracking scheme to guarantee the accuracy of forwarding decisions. Based on historical location information, nodes predict the positions of neighbors when making a forwarding decision, and then construct an updated and consistent neighborhood local view to help derive more precise forwarding decisions. The inaccuracy factors of our scheme are also discussed and an accessory method is provided for possible usage. Simulation results illustrate the accuracy of our proposed tracking scheme. To verify the effectiveness of our scheme, we apply it to existing efficient broadcast algorithms. Simulation results indicate that our neighborhood tracking scheme can improve the protocols coverage ratio greatly.     

Quorum and connected dominating sets based location service in wireless ad hoc, sensor and actuator networks

Location service provides position of mobile destination to source node to enable geo-routing. In existing quorum-based location service protocols, destination node registers its location along a ‘column’ while source node makes a query along a ‘row’. Grid and quorum-based location service is based on division of network into square grids, and selecting ‘leader’ location server node in each grid. Location updates, leader reelection and information transfer are performed whenever destination and leader nodes are moving to a different grid. We propose here to apply connected dominating sets (DS) as an alternative to grids. We also improved basic quorum, and applied on DS-quorum (DS based quorum) better criterion for triggering local information exchanges and global location updates, by meeting two criteria: certain distance movement and certain number of observed link changes with (DS) nodes. Backbones created by DS nodes (using 1-hop neighborhood information) are small size, do not have a parameter like grid size, and preserve network connectivity without the help of other nodes. Location updates and destination searches are restricted to backbone nodes. Both methods use ‘hello’ messages to learn neighbors. While this suffices to construct DS, grid leader (re)election requires additional messages. Simulation results show that using DS as backbone for quorum construction is superior to using grid as backbone or no backbone at all. The proposed DS-quorum location service can achieve higher (or similar) success rate with much less communication overhead than grid-based approaches.     

自组网中基于自适应波束天线的拓扑控制算法

定向天线自组网拓扑的构建问题比全向天线网络复杂.基于自适应波束定向天线模型提出一种分布式拓扑控制算法,通过调整节点发射功率,改变天线波束的朝向、宽度和增益来构建拓扑.网络中每个节点收集其邻居节点信息,采用功率控制调度策略选择最优相邻节点,并选取覆盖所有最优相邻节点的最小发射功率为此节点的发射功率.算法在保证网络连通性与无向性的同时,降低了节点的发射功率,减小了节点的平均度数,从而降低节点能耗,减少了节点间干扰,提高了网络吞吐量.仿真结果表明,算法显著提高了网络性能.     

一种车载自组织网络连通性维护方法

车载自组织网络（VANET）中的高速移动性节点和动态的网络拓扑结构使得车辆间通信链路存在传输时延长、连接时间短的问题。通过引入双簇头选择算法,提出一种改进的AODV路由协议（AODV-CMIRP）,用于VANET的连通性维护。利用分簇技术降低全局网络拓扑的动态性,通过引入节点的相对移动度和相对速度作为簇头选择指标,并选取辅助簇头节点以延长车载自组织网络整体生存时间。仿真结果表明,在保证网络连通性和稳定性的前提下,相比CBDRP和AODV协议,AODV-CMIRP协议具有较低的平均端到端时延和较高的分组投递率,能够有效延长簇头生存时间并提高网络的稳定性。     

移动无线传感器网络中的两跳信标交换协议

在地理位置路由协议中,周期性信标交换协议(Hello协议)被广泛地用于构建和维护邻居节点表。然而在高度动态的网络环境中,邻居表中会存在很多过期节点,这将导致大量的重传,严重影响路由协议性能。为提高邻居表的准确性,提出一种两跳信标交换协议(T-Hello协议),通过掌握两跳范围内的节点位置信息,节点可以显式地感知邻居节点是否已移出通信范围,以便及时将过期节点从邻居表中删除,而不必等到超时。通过分析各种网络条件(节点密度、交换周期、节点移动速度、通信半径等)对新协议性能的影响,表明对于GPSR协议, T-Hello协议能够缩短过期节点50%左右的存在时间,从而有效地改善了路由效果。     

基于双向令牌的可扩展及可靠的群组成员管理

面向有线因特网的群组通信已研究多年,目前仍是研究热点之一,尤其是将现有研究成果扩展到移动与无线网络环境方面.研究了移动群组通信,该问题涉及群组成员关系动态性(成员加入及退出)、成员位置动态性(移动主机的移动性)和网络动态性(结点或链路出错).提出了适合于移动群组通信的基于双向令牌的层次环模型(也称为层次环结构)以解决该问题.该模型是逻辑环与逻辑树的结合模型,它利用了逻辑环的简单性和逻辑树的可扩展性.更为重要的是,这样的结合使得基于层次环结构的群组通信协议比现有的基于树结构的协议更可靠.理论分析和模拟研究表明:(1)当群组规模增大时,该协议的可扩展性很好;(2)该协议具有很高的可靠性.该协议特别适合于服务提供者和网络运营商将其计算设备分层次部署的情况,这时就要求每台计算设备都能局部化地维护其兄弟和父亲设备的信息.     

Analysis of k-Neigh topology control protocol for mobile wireless networks

k-Neigh is a basic neighbor-based topology control protocol based on the construction of k-neighbor graph as logical communication graph. Several topological aspects of the constructed topology which are crucial to the performance of the protocol are not yet analytically investigated. Moreover, the problem of determining the maximum “Hello” interval preserving the connectivity with high probability has not been extensively addressed yet. Since execution of the protocol is a resource consuming task, this problem is of great importance on the performance of the protocol in sense of power consumption and topology control overhead. In this paper, first, several topological properties of the constructed topology for a static network, e.g. average logical degree and average final transmission range, are investigated analytically. Then, temporal properties of the dynamic topology in presence of mobility are studied based on two phenomena, one concerning a connectivity phase transition with time which is reported for the first time and the other one concerning the average degree of the logical communication graph at the time of starting the phase transition defined as disconnection degree. Using the obtained results one may tune the protocol in sense of “Hello” interval, maximum transmission power, or number of neighbors (k). Although the present work considers k-Neigh protocol, many interesting quantities are derived which may have application beyond the specific problem considered in this paper, e.g. the cdf, mean, and variance of the distance to the ith neighbor.     

面向服务传输的SDN移动网络脆弱性评估模型

针对现有的脆弱性评估算法无法直接应用于软件定义网络（Software Defined Network, SDN）,以及评估技术普遍偏向于网络连通,无法针对服务与传输性能对SDN进行脆弱性分析等问题,提出一种面向服务传输的SDN移动网络脆弱性评估模型与算法,设计基于SDN的移动网络脆弱性评估框架。提出一种对基于SDN的移动网络服务器节点与网络设备进行安全脆弱性分析的方法,将静态配置信息和动态运行信息融合评估节点设备的脆弱性,使评估更加全面准确;针对SDN移动网络的服务与传输特性,从传输拓扑和SDN节点活跃度2个方面,计算面向服务与传输的基于SDN的移动网络节点重要度;最后融合节点设备的安全脆弱性和重要度来对基于SDN的移动网络进行脆弱性评估,得到评估结果。通过实例和仿真实验验证了所提算法的有效性,相比同类算法可达到更高的评估准确性。     

移动自组网中一种面向群组移动性的位置服务协议

基于位置信息的路由协议被广泛认为是一种可扩展的移动自组网路由解决方案.大多数此类协议假定可通过位置服务协议获取结点的位置信息.研究人员现已提出多种位置服务协议.但是,它们在大规模网络环境中的可扩展性不好,或者在高动态网络环境中可靠性不高.本文提出了一种适用于大规模移动自组网的面向群组移动性的可扩展及可靠的位置服务协议.模拟结果表明此协议比SLURP协议更适合于具有群组移动性的大规模移动自组网.     

A network infrastructure for IP mobility support in metropolitan areas

The original design of the Internet and its underlying protocols did not anticipate users to be mobile. With the growing interest in supporting mobile users and mobile computing, a great deal of work is taking place to solve this problem. For a solution to be practical, it has to integrate easily with existing Internet infrastructure and protocols, and offer an adequate migration path toward what might represent the ultimate solution. In that respect, the solution has to be incrementally scalable to handle a large number of mobile users and wide geographical scopes, and well performing so as to support all application requirements including voice and video communications and a wide range of mobility speeds. In this paper, we present a survey of the state-of-the-art and propose a scalable infrastructure to support mobility in Internet protocol networks. In that respect, we exploit local area network (LAN) technologies to create the network infrastructure necessary to offer connectivity to mobile users across any geographical area (building, campus and metropolis). The intrinsic properties of LAN technologies and their underlying protocols, namely flat address space, transparent learning and low complexity renders this solution particularly cost effective for supporting user mobility. In particular, we propose a network topology and a set of protocols that render the infrastructure scalable to a large geographical area and many users.     

一种分区MANET路由协议

MANET是一种无基础设施支持的动态、自组织、多跳无线移动网络,为之设计适当的路由协议是一大挑战。该文在分析MANET特性及应用需求的基础上,提出了一种的分区MANET路由协议,该协议基于到最小ID节点的距离形成分区并维护简化的全局网络拓扑,通过巧妙地利用节点的邻接点信息使得路由请求的时间和通讯复杂度均降为O（2R）。仿真结果表明,该协议具有路由请求时延低,控制开销少的特点。     

基于簇头选择的移动传感网拓扑控制算法研究

针对移动传感网节点的移动性、能量有限性、动态变化性特点,提出了一种移动传感网分簇拓扑控制算法NACA.NACA算法吸收最小ID算法简便的优点,将其改进,提出新概念响应率,同时考虑了能量有限、移动速度和邻居节点数目等因素.通过实例分析,将NACA算法和WCA算法、HD算法进行比较,分析表明该算法初次收敛快,能够使得移动传...     

基于移动Agent的无线传感器网络拓扑发现机制

对监测区域中部署的传感器节点的拓扑发现是传感器网络应用的前提,它反映了传感器网络的监测能力。考虑目前拓扑发现算法中能量消耗过多、网络连通性不强等问题,文中结合移动Agent的特点,提出了一种基于移动Agent的无线传感器网络拓扑发现机制,通过建立数学模型,利用相关邻近图（relative neighborhood graph）理论生成网络拓扑。实验结果表明,基于移动Agent的拓扑发现机制相对于当前存在的拓扑发现算法具有很好的稳定性和良好的节能效果,该算法可以解决节点拓扑请求信息讨多导致过多能量消耗的问颢．     

基于活动区域的移动无线传感器网络路由协议

为了解决移动无线传感器网络中能量效率问题,提出了一种基于活动区域的移动无线传感器网络（WSN）路由协议。本方法使用源和sink节点相对位置来形成路由的活动区域,网络中的移动节点使用睡眠唤醒模式来节约能源。移动向量信息（如当前位置、方向和速度）以及节点的剩余能量,用于选择能够提供最大连接保留时间的邻居,移动向量信息也被用来唤醒活动区域中的移动节点。实验表明,与其他路由协议进行比较,该方法在分组传输过程中具有更高的可靠性。     

一种蓝牙分散网拓扑形成算法的设计与实现

针对现有的蓝牙分散网拓扑形成算法的动态性和自愈性较差的问题，提出了一种新算法.该算法综合考虑了对分散网互连有显著影响的微微网的个数、负载均衡和结点移动性等因素，使最终得到的分散网拓扑是一个异构的、局部互连网状的结构，该结构具有较强自愈和容错能力.利用BlueHoc蓝牙扩展模块在NS-2仿真器上对算法进行了模拟.结果显示，提出的算法可以有效地用于蓝牙分散网拓扑结构的创建.     

一种新的拓扑无关的按需分配多信道自组网MAC协议

本文针对节点具有多个可用信通的自组网,提出了一种与拓扑无关的多信道MAC接入协议,协议采用按需预约的方式进行动态的信道分配,通过携带在信道预约消息中的节点邻居状态信息实现节点信道状态的更新。该协议所需信道数与网络的拓扑和度无关,克服了拓朴相关的多信道MAC协议不适用于节点密集的应用场合的问题。在协议开销增加很小的情况下,每个节点只需要一部半双工收发信机就能够实现在多个信道上高效的数据收发,不需要节点间的时钟同步,极大地降低了对网络节点设备的硬件要求,具有良好的应用前景。仿真结果表明,协议在网络总吞吐量、端到端时延等方面具有优良的性能。     

Distributed topology control algorithm based on one- and two-hop neighbors’ information for ad hoc networks

In this paper, we present a topology control algorithm for ad hoc networks. By considering the weight of the links, each node orders its one-hop neighbors in an ordered list and then the ordered lists are exchanged between the neighbors. This information enables the nodes to compute their transmission radius on the basis of its one- and two-hop neighbors’ information. We demonstrate that compared to the best known algorithms, the degree and transmission radius of the nodes in the topology produced by the proposed algorithm are smaller. In addition to Euclidean graphs, the algorithm works correctly on general weighted graphs. Also an extension of our algorithm is proposed which adapts its topology to network changes. Finally, we use the four metrics, node degree, transmission radius, the power stretch factor and, packet loss ratio to measure the performance improvements of the presented algorithms through simulations.     

基于OLSR协议的无人机自组网多径路由策略

针对现有文献在研究路由协议时选择的路由度量未能结合无人机自组织网络当时的性能水平进而造成路由决策不合理的问题,提出了一种具有负载感知和网络拓扑变动感知能力的多指标多径优化链路状态路由协议（optimized link state routing protocol based on multi-indicator and multi-path,MIMP-OLSR）。该协议首先考虑了无人机场景的节点移动特性和网络的生存时间,并定义了三个用于进行路由选择的指标,即节点的MAC层阻塞度、节点的邻居变化率和节点的多点中继选择节点（multi-point relay selector,MPR_S）邻居数目;其次,结合HELLO和TC两种控制消息提出了一种指标通告机制,用于将指标信息洪泛给全网节点;最后,根据指标信息提出了一种多径路由方案。仿真结果表明,与OLSR、SETT_MPOLSR和UAV-OLSR协议相比,所提协议MIMP-OLSR在成功率、端到端时延和吞吐量性能上均有明显提高,进而证明所提多径路由方案的合理性。     

移动Ad Hoc网络路由协议的性能分析与比较

移动Ad Hoe网络是由一组无线移动主机组成的一个没有任何建立好的基础设施或集中管理设备的临时网络.网络拓扑易变、带宽、能源有限是移动Ad Hoe网络的主要特点.分析表驱动路由协议DSDV和按需路由协议DSR、AODV和TO-RA,并利用NS2软件进行了仿真实验,通过改变节点的暂停时间和移动速度这两个参数来比较这两个参数对这四种协议性能的影响.仿真结果表明,按需路由协议在分组投递率、端到端的平均时延、路由开销方面都表现出较好的性能.但同时结合表驱动路由协议的特点,为进一步在综合考虑以上两类路由协议特点的基础上研究新的路由协议提供很好的参考.