一种6LoWPAN无线传感器网络移动协议

提出了一种6LoWPAN无线传感器网络移动协议。此协议提出了6LoWPAN网络体系结构,以及6LoWPAN网络地址分层结构及地址配置算法。基于提出的6LoWPAN网络体系结构,提出了6LoWPAN网络内与网络之间的移动切换协议。在移动过程中,移动节点无须转交地址,即移动切换过程无须为移动节点配置转交地址,也无须进行转交地址注册,因此降低了移动切换代价和延迟。从理论和仿真两个角度对MIPv6、Inter-MARIO及本协议的移动切换代价、移动切换延迟、丢包率等性能参数进行了分析比较,分析结果表明本协议的移动切换代价更小、移动切换延迟更短、丢包率更低。     

6LoWPAN无线传感器网络移动管理方案

提出了一种跨层的6LoWPAN无线传感器网络移动管理方案。首先提出了6LoWPAN网络体系结构, 基于该体系结构, 提出了一种跨层的移动切换算法。在此算法中, 网络层移动切换与链路层移动切换同时进行, 在三层切换过程中, 移动节点无须转交地址配置, 也无须参与网络层的移动切换过程, 且无须参与移动切换过程, 在二层切换过程中, 移动节点无须扫描所有信道, 通过获取的信道信息直接进行二层切换, 因此降低了切换延迟、丢包率和切换代价。     

基于IPv6的城市车载网移动协议

提出了一种基于IPv6的城市车载网移动切换协议。本协议提出了城市车载网络体系结构, 车辆节点在移动过程中由家乡地址唯一标志, 无须转交地址, 因此节省了转交地址配置时间和代价, 从而缩短了移动切换时间, 降低了移动切换代价。车辆节点无须参与移动切换过程, 从而避免了由于车辆节点高速行驶引起丢包而增加移动切换代价和延迟的情况。仿真数据结果表明该方案的性能更好。     

下一代互联网中移动自组网的移动管理研究

提出了一种下一代互联网中移动自组网的移动管理方案。此方案提出了与IPv6网络体系结构充分融合的基于簇的MANET层次体系结构,并提出了簇的建立算法,实现了簇首节点数量最小化。基于所提的MA-NET层次体系结构,提出了MANET节点的IPv6地址分层结构以及相应的IPv6地址配置算法。基于所提的MA-NET层次体系结构以及IPv6地址分层结构,提出了移动自组网移动管理方案。分析结果验证了本方案有效减少了移动转交次数,降低了控制信息代价以及数据包丢失率。     

空间信息网络多层路由算法研究

在对数学模型研究的基础上,建立了单层和多层网络的数学模型,提出了一种适合多层空间信息网络应用的优化受限的层次路由算法。分析和仿真结果表明该算法具有较小的时延,降低了路径的切换概率,能够有效地提高空间信息网络的路由性能。     

基于IPv6的车载网络移动切换研究*

提出了一种基于IPv6的车载网络移动切换方案MHRD。MHRD提出了基于路域的车载网体系结构,与现有的车载网体系结构相比,路面移动节点的移动切换次数大幅度降低。MHRD中,路面移动节点通过其经过的一跳范围内的接入节点获取转交地址,无须进行重复地址检测即可确保转交地址的全球唯一性,降低了移动切换代价,缩短了移动切换延迟。从理论和仿真两个角度对MHRD的移动切换代价和移动切换延迟等性能参数进行了分析比较,分析结果表明MHRD的移动切换代价更小,数据包丢失率更低,移动切换延迟更短。     

园区WiFi网下软定义移动通信的设计与实现

当前WiFi园区网络存在移动通信范围有限、主机地址配置受限等问题.软定义移动组网的已有研究大多集中于实现无线接入点的可编程性,其在实际部署中需要使用专用的接入点设施.以单跳有设施网络为研究目标,提出了一种园区WiFi网下软定义移动通信方案,为移动主机访问本地资源提供免配置接入和移动通信支持.其中,网络设施选择OpenFlow网络,普通接入点直接连接OpenFlow交换机.控制器负责分发包含接入位置的流表项,为移动主机提供基于名称的路由转发,并主动调整通信流的返回路径.目前已经完成系统原型开发,进行了移动通信实验,测量和分析了不同配置下的网络可用带宽和切换时延.实验结果表明,该组网模式可以实现主机的移动通信,主机网络配置和OpenFlow交换机性能对切换时延影响较小.     

基于主动路由的无线mesh 网络区域移动管理方法

提出了一种无线mesh网络中基于主动路由的区域移动管理(active routing based intra-domain mobilitymanagement,简称ARMM)方法,将移动终端(mobile station,简称MS)的位置更新和mesh路由器(mesh route,简称MR)之间的动态路由相结合,让MR代替附着在它上面的MS进行位置管理,从而实现MR对MS的定位.给出了ARMM方法中的二层路由模型、路由算法及位置更新机制.性能分析结果表明,相对于现有的区域移动管理方法,ARMM方法具有较小的切换延时、位置更新开销和数据传输开销.     

基于最近社交圈的社交时延容忍网络路由策略

无稳定拓扑使时延容忍网络(delay tolerant networks,DTN)路由协议主要通过增加冗余数据包副本提高路由性能.社交网络是DTN的一种典型应用场景,但由于其网络规模相对较大,当网络负载高时,通常的DTN路由不能有效控制数据包副本的数量,从而产生大量丢包导致性能下降.借鉴MANET网络中利用分簇结构控制网络冗余路由数据包的思想,通过分析社交网络中节点的移动模型,定义了在社交关系的约束下,聚合移动规律相近的节点构成最近社交圈的节点簇组成策略.提出了一种基于该分簇结构的分为簇外喷射、簇间转发和簇内传染3个阶段的社交时延网络路由协议.实验证明,这种基于最近社交圈分簇结构的路由能有效地控制冗余数据包副本的产生,并在高网络负载的情况下仍然能够达到较好的性能.     

All-IP communication between wireless sensor networks and IPv6 networks based on location information

The paper proposes a scheme on achieving all-IP communication between wireless sensor networks and IPv6 networks based on sensor nodes' location information. The paper proposes the sensor node's IPv6 address structure based on location information, the IPv6-address configuration algorithm based on the proposed IPv6 address structure, the mobility handoff algorithm and the routing algorithm in the link layer. The location information of sensor nodes is utilized to achieve the IPv6-address configuration algorithm and the routing algorithm. In the mobility handoff algorithm, neither does a mobile sensor node need a care-of address during the mobility process, nor is involved in the mobility handoff process. Therefore, a mobile sensor node's power consumption is reduced and the life span is prolonged. The paper analyzes the performances of the proposed scheme and the existing schemes, and the analytical data show that the performance of the proposed scheme is better.     

Scalable Routing in Cyclic Mobile Networks

The nonexistence of an end-to-end path poses a challenge in adapting traditional routing algorithms to delay-tolerant networks (DTNs). Previous works have covered centralized routing approaches based on deterministic mobility, ferry-based routing with deterministic or semideterministic mobility, flooding-based approaches for networks with general mobility, and probability-based routing for semideterministic mobility models. Unfortunately, none of these methods can guarantee both scalability and delivery. In this paper, we extend the investigation of scalable deterministic routing in DTNs with repetitive mobility based on our previous works. Instead of routing with global contact knowledge, we propose a routing algorithm that routes on contact information compressed by three combined methods. We address the challenge of efficient information aggregation and compression in the time-space domain while maintaining critical information for efficient routing. Then, we extend it to handle a moderate level of uncertainty in contact prediction. Analytical studies and simulation results show that the performance of our proposed routing algorithm, DTN Hierarchical Routing (DHR), is comparable to that of the optimal time-space Dijkstra algorithm in terms of delay and hop count. At the same time, the per-node storage overhead is substantially reduced and becomes scalable.     

蚁群算法在时延约束选播路由问题中的应用

在分析选播通信服务的基础上,研究了蚁群算法在网络选播路由问题中的应用,提出了一种基于蚁群系统原理,用于解决有时延约束的选播路由问题。算法采用调整最优解路径上的信息素和算法重启策略,较好地解决了蚁群算法易于陷入局部最优的问题。仿真实验结果表明,该算法是有效且切实可行的,它可以在满足延时约束的条件下迅速找到最优解。     

一种基于标地分离的卫星网络移动切换管理技术

移动卫星网络因具有覆盖区域广、通信延时低等优势受到广泛关注,当前有大量研究旨在开发IP协议的组网技术,并将其与地面IP网络融合。融合网络的挑战之一,即为卫星移动性,用户在卫星网络中的接入点频繁切换导致移动管理问题,而现有的移动IP技术不能高效支持卫星网络移动切换。为了高效支持移动切换,在卫星网络中应用标地分离思想,在标地分离的架构下研究切换管理问题;用映射服务系统对终端进行位置管理,在移动切换中由新接入卫星网关和终端的标志为主要信息在原卫星中形成通告转发表。仿真结果表明,相对移动IP技术,该方法有明显优势。将其应用于卫星网络时可以降低切换延时,减少大量的绑定更新开销或是次优路由,提升系统的性能和可扩展性。     

基于预测时延的无线mesh网络组播路由算法

通过对无线mesh网络的特性分析及其对路由的影响,提出一种基于预测时延的路由选择的组播路由算法,该算法通过选择从源节点到目的节点传输时延最小的路径,通过路径合并,形成组播路由树。这种路由算法具有低时延QoS保障能力,并具有局部修复能力。基于NS2对算法进行仿真,结果证明了算法的有效性。     

A solution for transparent mobility with route optimization in the IP multimedia subsystem

This paper presents TRIM+, an architecture for transparent mobility management with route optimization in IMS based networks. The design of our architecture is based on a previous work referred to as TRIM. TRIM was originally devised to provide transparent mobility support in the IMS, although transparency came at the cost of using a suboptimal data path between communicating end points. TRIM+ maintains transparency as a design criterium, and thus end-user applications, running at the mobile node and its correspondent communication peers, are unaware of mobility management procedures. Additionally, the proposed design defines a set of route optimization procedures, allowing compliant devices to use the optimal data path for media communications. Furthermore, TRIM+ addresses packet loss management in scenarios where the media path cannot be maintained during the handover of the MN. To this end, our architecture enables the MN to request buffering capacity in its home network to temporarily store incoming media traffic during the handover, which would otherwise be dropped. This mechanism, as well as route optimization procedures, are executed transparently to the end-user applications running at the communicating end points. As a proof-of-concept, we have implemented a software prototype of the TRIM+ architecture, deploying it over a real IMS testbed. By means of a set of experiments, we have validated the mechanisms proposed in this paper, considering both UDP and TCP user traffic.     

Fuzzy based multi-criteria vertical handover decision modeling in heterogeneous wireless networks

Vertical handover gain significant importance due to the enhancements in mobility models by the Fourth Generation (4G) technologies. However, these enhancements are limited to specific scenarios and hence do not provide support for generic mobility. Similarly, various schemes are proposed based on these mobility models but most of them are suffered from the high packet loss, frequent handovers, too early and late handovers, inappropriate network selection, etc. To address these challenges, a generic vertical handover management scheme for heterogeneous wireless networks is proposed in this article. The proposed scheme works in three phases. In the first phase, a handover triggering approach is designed to identify the appropriate place for initiating handover based on the estimated coverage area of a WLAN access point or cellular base station. In the second phase, fuzzy rule based system is designed to eliminate the inappropriate networks before deciding an optimal network for handover. In the third phase, a network selection scheme is developed based on the Technique for Order of Preference by Similarity to Ideal Solution (TOPSIS) decision mechanism. Various parameters such as delay, jitter, Bit Error Rate (BER), packet loss, communication cost, response time, and network load are considered for selecting an optimal network. The proposed scheme is tested in a mobility scenario with different speeds of a mobile node ranging from very low to very high. The simulation results are compared with the existing decision models used for network selection and handover triggering approaches. The proposed scheme outperforms these schemes in terms of energy consumption, handover delay and time, packet loss, good put, etc.     

基于SDN分级分域架构的QoS约束路由算法

传统分布式的网络架构制约路由算法的创新,软件定义网络的出现为路由算法的优化提供了新思路。已有研究中,启发式算法广泛应用于服务质量路由,但由于计算复杂度高而无法在大型网络中应用。而其他算法均存在不同程度的问题,要么复杂度较高,要么算法性能较差,如最短路径算法。基于 SDN 分级分域架构,提出了 LC-LD 路由算法,综合时延条件和代价度量约束并在计算复杂度和算法性能之间保持平衡。仿真分析表明,LC-LD路由算法在有较低的计算复杂度的同时还有较高的服务质量路由选路性能。     

基于稳定路径的MAODV协议改进

移动Ad Hoc网络组播路由协议MAODV中,组播树在节点移动速度较快的情况下会频繁重构,使得路由开销、传输时延显著增大。针对基于邻居节点变化率的稳定路径选择方法,提出一种新的节点邻居变化率的检测机制,不需要周期性地发送Hello消息,并在此基础上设计和仿真实现了基于稳定路径的MAODV协议SP-MAODV,新协议选择的路径稳定性好且跳数小。最后从数据分组传输成功率、路由开销、平均端到端时延和时延抖动四个方面对两个协议进行了仿真比较,结果表明SP-MAODV协议减少了路径中断概率,提高了协议性能。     

基于主机标识协议的增强型分布式移动管理

将宏观移动性管理的主机标识协议(HIP)应用于分布式移动性管理(DMM)构架,并将聚合服务器(RVS)与DMM中的移动性接入路由MAR功能集成于分布式接入网关(D-GW)。采用扩展HIP协议数据包头的参数,在注册D-GW的HIP BEX消息中携带切换前D-GW的主机标识符的二元组（HIT,IP地址）,新D-GW根据此二元组信息向前一个D-GW注册并建立的隧道,将缓存在前D-GW中的数据转给新D-GW。这一切换机制可有效地保证数据完整性,仿真结果表明该方法能有效减少总的信令开销,同时基于HIP的移动性管理使节点的安全性得到了保证。     

基于免疫遗传算法的多约束QoS组播路由选择方法

以具有精英保留的免疫遗传算法（IGAE）为基础,提出了一种新的用来求解带宽、时延、时延抖动受限,费用最小的QoS组播路由选择问题的方法。首先采用预处理机制,将网络结构中不满足带宽约束的链路去掉,利用Dijkstra第k最短路径算法建立编码空间的备选路径集;然后采用基于路径的树结构编码来随机产生初始群体,使种群中的每个个体都代表组播路由问题的一个候选解;最后利用IGAE算法对种群进行优化,最终求得满足QoS要求的组播路由。仿真实验结果表明,该算法具有较好的性能,能以较快的速度搜索到满足QoS要求的费用最小的组播树。