基于RTM模型的OBAMP和ODMRP路由协议仿真与分析

将RTM模型引入到多播路由研究中,文章选取具有代表性的Random Waypoint,Random Walk with Reflection和West Uni Place为移动场景,以多播路由协议ODMRP和覆盖多播路由协议OBAMP为仿真对象,在不同组成员个数和速度的条件下,分别对其使用NS2模拟仿真。仿真分析可知,在速度变化明显的移动模型中,选取随机路点(RW)模型作为网络中节点的移动模式较好;对数据转发率要求高的网络适宜选取OBAMP协议,对实时性要求较高的网络多采用ODMRP协议。为设计能满足不同应用需要的Ad Hoc网络多播路由、覆盖多播路由协议提供科学参考。     

动态QoS多播路由协议

本文主要研讨了具有QoS约束的动态多播路由问题.文中描述了一种适用于QoS多播路由的网络模型,提出了一种动态QoS多播路由协议(DQMRP),该协议能操作在单播路由协议的顶层,它只要求网络链路(或节点)的局部状态信息,不需要维护全局状态信息.DQMRP可有效地减少构造一棵多播树的开销,多播组成员可动态地加入／退出多播会晤.该协议可搜索多条可行树枝,并能选择一条最优(或近优)树枝将新成员连接到多播树.文中给出了DQMRP的正确性证明和复杂性分析,并通过仿真实验验证了该协议的可用性和有效性.     

CSM多播路由协议在移动环境中的改进

适用于视频会议与在线聊天室的CSM（Conference Steiner Multicast）协议，在支持移动主机时存在多播树切换频率过高，网络开销过大的问题。运用Range（服务范围）的概念，结合Mobile IP隧道技术，提出了一种改进的CSM协议－－RBCSM（Range Based CSM）协议。RBCSM协议在降低多播切换频率，节省网络带宽方面性能优越。同时由于运用了Mobile IP的隧道技术，还有进一步提高网络安全性的可能，最后，对CSM和RBCSM的多播树切换频率及多播树路径总长度两个性能指标进行了仿真模拟比较。     

基于OPNET的MAODV仿真技术分析

移动Ad Hoc网络是指由一组带有无线收发装置的移动节点组成的一个多跳的、不需要固定中心接入点或者基站支持的自治系统。对移动Ad Hoc网络多播路由中的MAODV协议进行理论分析,采用OPNET软件对该协议在AdHoc网络中的分组投递速率和延迟等关键参数进行仿真统计,并分析了节点移动速率对路由协议性能的影响。     

基于不同移动模型的移动自组网多播路由协议性能研究

为了研究移动自组网中多播路由协议在不同移动模型下的性能,选取随机路点移动模型、高斯马尔科夫移动模型和参考点组移动模型,将三种移动模型的移动场景加入到NS2中,对基于部分网络编码的实时多播协议PNCRM进行仿真.结果表明,PNCRM协议在随机路点移动模型和高斯马尔科夫移动模型中的数据包投递率明显高于参考点组移动模型,但是参考点组移动模型的总开销和端到端延时是最优的.这样我们就可以根据不同的性能指标要求选择合适的移动模型.     

BowCast：一种适应非对称链路延时网络的P2P多播路由协议

虽然IP多播的性能优势无可否认,但是它却面临着部署上的困难。近年来,P2P多播作为提供多播服务的另一可行途径正不断为人们所认可。研究非对称链路延时网络环境下P2P多播的路由问题,提出一个新的P2P多播路由协议：BowCast.该协议采用基于树（tree-based）的分布式路由策略,使多播组成员之间能自组织地构建一棵基于源的最小延时P2P多播树。BowCast主要利用范围受限的单向探测技术（BOW）来实现路由优化算法。BOW能提供端系统节点间的单向相对延时,无需全局的同步时钟。仿真实验表明,BowCast能很好地适应非对称链路延时环境。通过调节BOW的探测范围,BowCast能灵活地在路由性能和控制开销之间进行折中。     

WSN中基于身份的高效多播认证协议

分析了无线传感器网络中已有多播认证协议的不足,给出了基于PKC的WSN安全协议研究进展,并提出一种基于身份的高效多播认证协议.该协议具有消息恢复功能,可有效缩短签名长度,减少协议的通信和计算开销,克服公钥密码体制开销大的缺点.在随机预言模型下证明了协议在适应性选择消息攻击和身份攻击下是存在性不可伪造的.最后,基于MICA2DOT无线传感器网络节点对协议的能量消耗进行了定量分析,结果表明,本协议的性能优于HESS、Zhang和BLS等协议,能更好地适用于资源受限的WSN环境.     

移动IP作为多播接收端技术分析

移动IP与IP多播技术都是当前通信领域的热点。首先简述了固定IP作为多播接收端的技术,接着分析移动IP作为多播接收端所带来的问题,最后重点 比较和探讨了移动IP作为多播接收端的三种解决方案。     

移动IP中的多播实现机制

本首先介绍了移动IP技术的基本原理，并在此基础上给出了移动IP中实现多播机制的四种网络模型，并分别分析了其工作原理及优缺点。最后指出了移动IP中实现多播存在的问题并对其研究前景阐述了自己的观点。     

支持延时约束的覆盖多播路由协议的研究

研究有度和延时约束的覆盖多播路由问题,提出了一个新的覆盖多播路由协议-延时受限的树协议(DBTP)。该协议采用分布式和树优先的策略,使多播组成员之间能自组织地构建一棵基于源的覆盖多播树。DBTP协议采用了一种新的启发式局部优化算法,通过调节启发因子,能灵活地在延时和代价之间进行折衷。仿真实验表明,无论在静态还是动态节点模型下,选择适当的启发参数,DBTP都能获得较高的节点接纳率。     

基于THMLD的移动多点发送方法的性能分析

Mobile multicast is important for the emerging applications such as mobile video or audio conference and mobile IPTV. Some mobile multicast schemes have been proposed in the past few years, but most of them study the reconstruction ofmulticast delivery tree, and few consider the group membership management for mobile subscribers. In this paper, we propose a new mobile multicast method based on the Two-Hop Multicast Listener Discovery （THMLD） protocol which provides the mobile multicast membership management function by forwarding the traditional MLD messages to its neighboring subnets. To evaluate its performance, we analyze the THMLD and set up the simulation platform to compare it with the several traditional mobile multicast methods. The results show that THMLD can reduce the multicast join time, and the THMLD-based mobile multicast method can reduce the multicast join delay at a cost of increasing additional multicast maintenance cost.     

一种适用于动态/移动环境的新的组播协议

组播协议由于能够有效的利用网络带宽并降低服务器的负担因而受到广泛的关注.其中的共享树组播协议由于具有良好的扩展性而得到更多的支持,然而目前的共享树组播协议在动态移动环境中的性能很差,一些改进协议(单核移动协议)虽然可以很好的提高原有协议的性能但是所需要的额外开销很大.针对这种情况,本文提出了一种新的共享树组播协议-动态多核协议,该协议能够根据组播成员的分布动态的渐进的调整组播树的形状,从而能够在低开销的情况下为移动用户提供良好的性能.计算机仿真和数学分析都表明动态多核协议要明显优于共享树组播协议和单核移动协议.     

An efficient multicast protocol for PCS networks

In a Personal Communication Services (PCS) network, mobile hosts communicate with other mobile hosts through base stations on a wired (static) network. The mobile hosts connect to different base stations through wireless links and the base stations to which mobile hosts are connected change depending on the current location of the mobile hosts. In this environment, the problem of efficiently delivering a multicast message from one mobile host to a group of other mobile hosts becomes challenging. In this paper, we present a multicast protocol that delivers multicast messages from a mobile host to a group of other mobile hosts without flooding the wired network. The multicast protocol is built on top of a user location strategy that should follow one of the three models of user location described in the paper. The basic multicast protocol proposed guarantees exactlyonce message delivery to all mobile hosts in the multicast group and also ensures that multicast messages are delivered in FIFO order from the point of view of the base station that originates the multicast message (referred to as BSFIFO). More importantly, an extension of the basic protocol is provided that, unlike earlier work, delivers multicast messages in FIFO order from the point of view of the mobile host that initiates the multicast message (referred to as MHFIFO). The modifications to be made to the multicast protocol to accommodate each of the three models of user location is also described.     

基于IPv4的可靠移动组播技术

移动组播技术是近几年来无线互联网领域的一个研究热点,其相当一部分应用要求移动环境下也能提供相当于有线链路的可靠性。但是移动环境下的突出特点就是链路差错率高,组播成员位置动态变化,这给移动组播尤其是可靠移动组播提出了很大的挑战。基于IPv4的可靠移动组播算法具有两种不同的设计思想,其中一部分算法是针对现有的移动组播算法存在的问题,进行可靠性方面的改进,另一部分算法是专门用于实现可靠移动组播的,它们大都引入了新的功能实体来保证可靠性。     

An Efficient Multicast Routing Protocol in Wireless Mobile Networks

Providing multicast service to mobile hosts in wireless mobile networking environments is difficult due to frequent changes of mobile host location and group membership. If a conventional multicast routing protocol is used in wireless mobile networks, several problems may be experienced since existing multicast routing protocols assume static hosts when they construct the multicast delivery tree. To overcome the problems, several multicast routing protocols for mobile hosts have been proposed. Although the protocols solve several problems inherent in multicast routing proposals for static hosts, they still have problems such as non-optimal delivery path, datagram duplication, overheads resulting from frequent reconstruction of a multicast tree, etc. In this paper, we summarize these problems of multicast routing protocols and propose an efficient multicast routing protocol based on IEFT mobile IP in wireless mobile networks. The proposed protocol introduces a multicast agent, where a mobile host receives a tunneled multicast datagram from a multicast agent located in a network close to it or directly from the multicast router in the current network. While receiving a tunneled multicast datagram from a remote multicast agent, the local multicast agent may start multicast join process, which makes the multicast delivery route optimal. The proposed protocol reduces data delivery path length and decreases the amount of duplicate copies of multicast datagrams. We examined and compared the performance of the proposed protocol and existing protocols by simulation under various environments and we got an improved performance over the existing proposals.     

A protocol for causally ordered message delivery in mobile computing systems

There is a growing trend in developing applications for mobile computing systems in which mobile host computers retain their network connections while in transit. This paper proposes an algorithm that enforces a useful property, namely, causal ordering, that delivers messages among mobile hosts. This property ensures that causally related messages directed to the same destination will be delivered in an order consistent with their causality, which is important in applications that involve human interaction such as mobile email and mobile teleconferencing. Such applications are envisioned by the proponents of Personal Communications Services (PCS). Without this property, users may receive and read original messages and the corresponding replies out of order. Our algorithm, when compared with previous proposals, provides an alternative with a low handoff cost, medium message overhead, and low probability of unnecessary inhibition in delivering messages.     

Dynamic region‐based mobile multicast

Traditional mobile multicast schemes have higher multicast tree reconfiguration cost or multicast packet delivery cost. Two costs are very critical because the former affects the service disruption time during handoff while the latter affects the packet delivery delay. Although the range‐based mobile multicast (RBMoM) scheme and its similar schemes offer the trade‐off between two costs to some extent, most of them do not determine the size of service region, which is critical to the network performance. Hence, we propose a dynamic region‐based mobile multicast (DRBMoM) to dynamically determine the optimal service region for reducing the multicast tree reconfiguration and multicast packet delivery costs. DRBMoM provides two versions: (i) the per‐user version, named DRBMoM‐U, and (ii) the aggregate‐users version, named DRBMoM‐A. Two versions have different applicability, which are the complementary technologies for pursuing efficient mobile multicast. Though having different data information and operations, two versions have the same method for finding the optimal service region. To that aim, DRBMoM models the users' mobility with arbitrary movement directional probabilities in 2‐D mesh network using Markov Chain, and predicts the behaviors of foreign agents' (FAs') joining in a multicast group. DRBMoM derives a cost function to formulate the average multicast tree reconfiguration cost and the average multicast packet delivery cost, which is a function of service region. DRBMoM finds the optimal service region that can minimize the cost function. The simulation tests some key parameters of DRBMoM. In addition, the simulation and numerical analyses show the cost in DRBMoM is about 22∼50% of that in RBMoM. At last, the applicability and computational complexity of DRBMoM and its similar scheme are analyzed. Copyright © 2010 John Wiley & Sons, Ltd.