基于HMIPv6的改进的切换协议

提出了一种基于层次型移动IPv6移动管理（HMIPv6）的改进方法,以及一种新的网络模型,推导出MIPv6、FMIPv6、[F+H]MIPv6、HMIPv6和NPMAP-HMIPv6等不同策略各自的注册代价、数据包隧道代价、数据包发送代价、总代价和切换延时,并对各个策略进行了分析。试验和分析表明,该方法在发送代价方面和HMIPv6相近,但比其他的方法性能更好;在切换延迟方面和[F+H]MIPv6相近,但比其他的方法性能更占优。     

乒乓切换在移动IPv6扩展协议中的性能分析

 综合评价了多种移动IPv6扩展协议在基于端到端的TCP协议L3层的切换性能,模拟仿真了乒乓切换在MIPv6、FMIPv6、HMIPv6和FHMIPv6中的时延、吞吐量和丢包现象,提出了一种优化的FHMIPv6方案.该方案通过定义新的Hop-by－Hop 选项报头TM、 PCoA表和双向隧道表,实现MN的快速、平滑切换,比FHMIPv6进一步减少了时延,提高了吞吐量,降低了丢包率.     

移动IPv6切换技术

基本的移动IPv6切换时延太大,无法满足实时业务的要求。文章在分析了现有移动IPv6网络切换技术的基础上,提出了一种基于分层移动IPv6网络模型的快速切换方案F-HMIPv6。该方案实现了移动节点在不同移动锚点域移动的快速切换操作。从理论分析得出结论,该方案可以弥补现有移动IPv6网络切换技术中的一些缺陷。     

快速层次移动IPv6的乒乓切换研究

针对现有的预测式FMIPv6(快速移动IPv6)没有提供域内乒乓切换机制,因而可能导致大量远程注册开销和系统通信开销的问题,在FMIPv6的基础上引入HMIPv6(分层移动IPv6)层次结构,提出了一种基于FHMIPv6(快速层次移动IPv6)的乒乓切换优化方案。分析结果表明,与FHMIPv6相比,所提方案在乒乓切换模式下能够有效减少时延和丢包率,进一步提高吞吐量。     

一种基于移动IPv6协议的软切换实现方案

移动IPv6协议解决了IPv6网络中移动节点的位置更新和路由可达问题,使移动节点能够在不同IPv6子网间进行切换而不中断当前连接。但是这种切换的时延较长,影响移动IPv6网络的性能。为了减少切换时延,文章在移动IPv6协议中引入软切换技术,提出一种采用绑定更新计时器和路由优先级变换机制的软切换工程实现方案,实验结果表明,该软切换方案可以有效提高移动IPv6网络的性能。     

基于移动IPv6的平滑切换算法研究

切换时延和数据包丢失一直是制约移动IPv6发展的关键因素.文章针对现有切换算法及存在的问题进行了分析,然后在现有算法的基础上提出了一种改进算法.仿真实验结果表明,该算法能有效地抑制因移动节点的网络切换而导致的通信节点拥塞控制机制的启动,提高了移动网络数据流的正确率和吞吐量,进而提高了移动网络的通信质量.     

移动IPv6切换时延优化新方法

移动IPv6中,移动节点(MN)在不同子网间移动时,既不中断与通信对端(CN)的通信,也不用改变其本身的IP地址.但是当MN与其家乡代理(HA)之间相距较远时,移动IPv6切换时延较大,对于实时性要求较高的业务无法适用.本文分析比较了目前移动IPv6常用的切换时延优化方法,提出了一种自适应快速层次移动IPv6切换时延优化方法,减小了移动IPv6切换时延,提高了网络的性能.     

移动IPv6概述

文章分析了IPV6支持移动性的优势，概述了移动IPv6协议，并对一些热点问题，如快速切换、平滑切换、移动管理、AAA和服务质量等进行了探讨。     

移动IPv6分层式路由管理模型的分析与研究

分层移动IPV6协议减少了注册延迟，但仍具有路由不够优化等问题。通过分析HMIPv6．提出一种基于分层机制的移动IPv6路由管理模型。该模型支持路由优化，能在域内、域间移动时实现快速切换以减少延迟．提高网络资源利用率。仿真分析结果验证模型的有效性．     

WiMAX网络快速切换技术研究

如何快速切换，降低切换时延和丢包率一直是移动WiMAX网络大规模部署所面临的关键问题。本文在研究802．16e标准的MAC切换机制和移动IPV6基础上提出了一种新的基于F—HMIPv6（快速分级移动IPv6）的WiMAx网络快速切换方案，它具有时延低、链路开销小等特点。     

基于IPv6的快速切换改进方案

在移动IP网络中,当前的移动性管理方案由于其基本协议的切换时延较大、丢包率较高而不能适应实时业务和移动通信的要求,所以需要改善移动性管理策略的切换性能,尽量实现无缝切换和零丢包率。提出了一种基于移动IPv6的快速切换的改进方案,采用一种新的地址分配方式使得移动节点能够在移动至新的网络后迅速获取新的转交地址,有效地减少了切换所产生的时延和丢包率,具有较好的切换性能。     

A hybrid beaconless geographic routing for different packets in WSN

The localized operation and stateless features of geographic routing make it become an attractive routing scheme for wireless sensor network (WSN). In this paper, we proposed a novel routing protocol, hybrid beaconless geographic routing (HBGR), which provides different mechanisms for different packets. Based on the requirement of application on latency, we divide the packets of WSN into delay sensitive packets and normal packets. HBGR uses two kinds of Request-To-Send/Clear-To-Send handshaking mechanisms for delay sensitive packets and normal packets, and assigns them different priority to obtain the channel. The simplified analysis is given, which proves that delay sensitive packets have lower latency and higher priority to obtain the channel than normal packets. Moreover, forwarding area division scheme is proposed to optimize the forwarder selection. Simulation results show that HBGR achieves higher packet delivery ratio, lower End-to-End latency and lower energy consumption than existing protocols under different packet generation rates in stationary and mobility scenario. Besides, compared with normal packets, delay sensitive packets have at least 10 % (9 %) improvement in terms of End-to-End latency. The improvement increases with the increasing of packet generation rate, and achieves 58 % (73 %) when the packet generation rate is 24 packets per second in stationary (mobility) scenario.     

Multilayer Hierarchical Model for Mobility Management in IPv6: A Mathematical Exploration

The mobility solution provided by Mobile IPv6 (MIPv6) imposes too much signaling load to the network and enforces large handoff latency to end user. Hierarchical MIPv6 (HMIPv6) on the other hand, is designed by organizing MIPv6 in layered architecture and performs better than MIPv6 in terms of handoff latency and signaling load. Observation shows that, there is still possibility to shrink the handoff latency and the signaling load by further extending HMIPv6 into multiple layers. To explore this possibility of enhanced performance through layered architecture, this paper aimed at mathematical exploration of an N-layered MIPv6 network architecture in order to figure out the optimal levels of hierarchy for mobility management. A widespread analysis is carried out on various parameters such as location update frequency and cost, handoff latency and packet delivery cost. Influence of queuing delay on handoff latency is examined by modeling M/M/1/K queue in the architecture and user mobility is modeled using Markov chain. Analytical investigation reveals that three levels of hierarchy in MIPv6 architecture provide an optimal solution for mobility management.     

New nodal design for high throughput data vortex optical interconnection network

This paper proposes a new three input nodal structure within the data vortex packet switched interconnection network. With additional optical switches, the modified architecture allows for two input packets in addition to a buffered packet to be processed simultaneously within a routing node. A much higher degree of parallel processing is allowed in comparison to previously proposed enhanced buffer node with two input processing or the original network node with single input processing. Unlike the previous contention prevention mechanism, the new network operates by introducing the packet blocking within the node if no exit path is available. This eliminates the traffic control signaling and the strict timing alignment associated with the routing paths which simplifies the overall network implementation. This study shows that both data throughput and the latency performance are improved significantly within the new network. The study compares the three input node with the two input node as well as the original single input data vortex node. Due to additional switch count and nodal cost, networks that support the same I/O ports and of the same cost are compared for a fair comparison. The limitation introduced by the blocking rate is also addressed. The study has shown that under reasonable traffic and network condition, the blocking rate can be kept very low without introducing complex controls and management for dropped packets. As previous architectures require operation under saturation point, the proposed architecture should also operate at reasonable level of network redundancy to avoid excessive packet drop. This study provides guidance and criteria on the proposed three input network design and operation for feasible applications. The proposed network provides an attractive alternative to the previous architectures for higher throughput and lower latency performance.     

Analysis and enhancement of multi‐channel MAC protocol for ad hoc networks

In this paper, an analytical model is proposed to calculate the network throughput of dedicated control channel protocols that are designed to schedule multiple packets to be transmitted on different data channels simultaneously. Based on the analytical model, a scheme by tuning the initial contention window size is proposed to maximize the network throughput. We also present a novel multi‐channel MAC protocol for single‐hop scenario. Simulation results show that the proposed model is capable of modeling the behaviors of dedicated control channel protocols accurately. Furthermore, the proposed scheme can reduce the cost of collisions and enhance the network throughput up to 22% for 1 kB packet size and 80 nodes. Compared with other dedicated control channel protocols, the proposed protocol can schedule more control packets and use multiple channels more efficiently. Copyright © 2010 John Wiley & Sons, Ltd.     

Contention-based MAC protocols with erasure coding for wireless data networks

Contention-based medium access control (MAC) protocol is a key component for the success of wireless data networks. Conventional random access protocols like ALOHA and Carrier Sense Multiple Access (CSMA) suffer from packet collision which leads to low throughput. Aimed at improving the throughput performance, we propose to integrate erasure coding with contention-based MAC protocols for recovering collided packets. To demonstrate the effectiveness of this approach, we focus on combining erasure coding with slotted ALOHA and slotted non-persistent CSMA in this paper. The performances of the resulting protocols are evaluated by both analytical model and simulation. Simulation results match very well with analytical results and show that the system throughput is increased for low to medium traffic loading. Packet loss ratio is also improved considerably with our scheme when the maximum number of packet retransmission times is limited. However, the delay for our scheme is higher due to the longer waiting time in our scheme for recovering collided packets. It is also shown that delay can be significantly reduced if we choose appropriate coding parameters though throughput will be sacrificed.     

Enhancing QoS of Mobile Devices by a New Handover Process in PMIPv6 Networks

The handover processes in present IP mobility management protocols incur significant latency, thus aggravating QoS of consumer devices. In this paper, we introduce an enhanced handover process for the Proxy Mobile IPv6 (PMIPv6) protocol, which is a recently developed IP mobility management protocol aiming at providing network-based mobility support. The proposed handover process further improves handover performance of PMIPv6 by allowing a new access network obtains handover context before a consumer??s mobile node (MN) moves to the new access network. Data packets destined for the MN are buffered to prevent packet loss and immediately delivered to the MN as the MN moves to the new access network. We evaluate the handover latency and data packet loss of the proposed handover process compared to the basic one of PMIPv6. The conducted analysis results confirm that the proposed handover process yields the reduced handover latency compared to that of the basic PMIPv6 and also prevents data packet loss. We moreover evaluate the buffering cost of the proposed handover process.     

A Comprehensive Framework for Evaluating IPv6 Based Mobility Management Protocols

Seamless mobility in future generation networks, which are envisioned to be heterogeneous in nature, is an important issue. While Internet Engineering Task Force (IETF) work groups have standardized various mobility management protocols, such as Mobile IPv6 and Proxy Mobile IPv6, a comprehensive study of these protocols in terms of various performance characteristics is a challenging issue. Moreover, this study also considers the recent proposals from IETF in distributed mobility management (DMM) protocols. In this paper, a novel analytical model is developed for comparison of various mobility management protocols in terms of handover latency, as well as packet density, and packet arrival rate during the handover time by applying transport engineering principles in the field of telecommunication. The signaling cost analysis using signaling overhead incurred during protocol operations is given for each of these protocols. The number of packets that can be lost during the handover operation is also obtained using this model. Moreover, it presents a unified framework using which one can assess the performance characteristics of both host based and network based mobile IP protocols. One can also assess the performance of centralized and DMM approaches. The correctness of the proposed model is established by the fact that it leads to results similar to those obtained by applying some of the existing models. At the same time, the model allows one to obtain additional results showing the effect of packet density and packet arrival rate on the handover latency.