基于区分服务的层次环状结构应用层多播模型

为了提高应用层多播的传输效率,提出一种基于区分服务的层次环状结构的应用层多播模型HRM,该模型构建了一个多层的覆盖网络,每层节点构成环状结构,取消了层中控制节点,减小了控制开销;并在数据传输过程中,根据应用层多播业务实时性不同,采用Push或Pull传输策略,减小传输时延或提高带宽利用率.仿真结果表明,该模型具有较小时延和控制开销以及较低的链路压力,适用于大规模应用层多播环境.     

面向可重构基础网络的部分扇出组播交换阻塞率模型

传统网络采用调度前复制和扇出拷贝方式的多播交换模型不具备大规模可扩展能力。面向可重构基础网络,提出了一种部分扇出多播交换模型,该模型采用2×2布尔单元和布尔群组集线器建立基本交换结构,采用部分扇出拷贝方式和四状态分割编码实现自路由路径选择,进而推导了该模型在单多播混合业务源输入下的单播阻塞率、多播阻塞率和多播扇出率迭代过程。仿真实验表明:该模型在Bernoulli均匀业务源条件下,单播归一化负载强度为0.2时,多播阻塞率在10 10～10 2之间,多播时延总小于百纳秒量级上限,能够为到达业务提供时延上限保障。     

多源多目的模型中网络编码的时延性能分析

研究表明基于无线信道的广播特性,网络编码技术能够显著降低多播通信中的传输时延。多源多播模型中,在任一源节点已知其他源节点信息的条件下,现有传输方案能够确保系统时延最小化。本文在其他源节点信息未知时,对现有多源多目的单中继模型应用网络编码后的时延性能进行分析,并将该模型推广到多中继模型,提出了基于网络编码和机会中继选择策略的MR-OPP-NC方案,并在译码转发机制下,利用中断概率量化了应用网络编码前后的时延性能,仿真表明本文所提MR-OPP-NC方案与未使用网络编码的机会中继方案相比较,能获得显著的时延增益。      

多媒体通信的多播路由算法

在多媒体通信网的实际应用中,多播(multicasting)技术日显重要,在实际网络中,网络节点具备不同的多播能力,有些节点不具备多播能力,而具备多播能力的节点要限制其复制信息的数量,即节点多播能力受限,该文用节点的度约束来表示每个节点的多播能力;此外网络中的很多业务要求信息从源节点传送到目的节点的时延受限;因此该文研究带度约束和时延约束的多播路由问题,给出了一种Lagrange松弛法,能够较好地解决这类问题。     

基于身份的空间网络组密钥管理方案

针对现有组密钥管理方案无法适应空间网络的问题,提出了一种基于身份的空间网络组密钥管理方案.方案设置了一个由卫星节点组成的多播服务节点集合,协助多播群组完成公共参数的生成和广播,解决了组成员开销不平衡的问题;为同一群组提供服务的节点动态可变,避免了单点失效问题.与现有方案相比,本方案在满足安全要求的基础上,具有更小的计算、存储和通信开销.     

无线mesh网中最小编码代价低时延多播路由

提出了一种无线mesh网中最小网络编码代价低时延多播路由协议(MNCLDMR, minimal network coding and low delay multicast routing)。MNCLDMR的目标是选择合适的网络编码节点,最小化网络编码代价,降低网络时延。MNCLDMR主要思想是引入拓扑关键节点和网络编码关键节点的概念,以下一跳的节点是否是网络编码关键节点或拓扑关键节点作为路由判据,采用MNCLD算法构造多播树。仿真结果表明,MNCLDMR可以达到预定目标,合理形成网络编码机会,能实现最小网络编码代价低时延多播路由。     

基于时延约束的改进型实时QoS多播路由算法

多播技术是将特定数据选择性地传送至多个客户端的方法,因而其服务质量是评价其优劣的关键.结合FLSPT算法和贪婪法思想,提出一种基于时延约束的改进型实时QoS多播路由算法,它利用启发式策略,使得节点在多播树时能满足时延约束的条件下建立最小代价路径.测试结果表明,采用该算法可获得较小的端到端时延,能改善网络服务质量,适用于成员数目变化频繁的多播应用.     

光网络中的一种基于虚拟源的动态多播保护算法

随着各种多播业务的不断出现,如何在网络的光层实现多播业务的可靠性传输已成为光网络研究中的一个热点问题,而多播保护算法是这一问题的核心.目前多播保护算法的研究都是在假设网络所有节点具有多播功能的条件下进行的,然而由于成本的限制,实际光网络往往是一个稀疏多播光网络,即网络中只有部分节点具有多播功能.针对这一问题,提出了一种基于虚拟源的动态多播保护算法.仿真结果表明:该算法不仅能在稀疏多播光网络中满足多播业务可靠传输的要求,还具有较高的网络资源的利用率和较低的时间复杂度.     

网络多播路由的改进编码软件设计与实现

传统网络多播路由编码方法采用多播分布树进行编码,但链路容量遭遇瓶颈,致使编码节点较多,导致浪费带宽资源的问题。在此提出基于Koetter指数时间的网络多播路由改进编码算法对编码软件进行设计,分析多播路由的总体设计,通过数据包编码转发模块在多播拓扑不相交路径上进行编码和转发多播数据包,利用输入模块实现网络多播路由和上游节点的信息交换,通过开关仲裁模块判断能够向特定输出端口传输信息的输入端口,利用死锁控制模块对出现死锁现象的路由节点进行检测,一段时间后使多播路由恢复正常的数据交换,通过输出模块对数据的输出进行管理。以降低带宽资源为目的,采用Koetter指数时间算法实现网络多播路由编码,并给出编码的详细代码。实验结果表明,所提方法不仅节省网络资源,而且显著降低多播路由时延,增强网络吞吐量。     

基于邻居覆盖信息和节点移动速度的无线自组网多播方案

针对无线自组网节点的移动导致多播可靠性降低、开销和时延增加的问题,提出基于邻居覆盖信息的多播方案。该方案通过少量的Hello报文收集一跳内的邻居信息,并据此实时计算节点的密度系数、邻居节点未覆盖率等参数,利用所获参数动态调整节点的多播数据转发时延与转发概率。为进一步降低时延,提出一种基于节点移动速度的数据分发方案,它允许部分快速移动节点采用更高的概率转发多播数据。将其扩展至多播方案中,形成基于邻居覆盖信息和节点移动速度的多播方案。NS2的仿真结果表明,与现有方案相比,该方案将分组投递率提高27%,控制开销减少33.2%,并将端到端平均时延降低45%。     

Efficient solutions to multicast routing in communication networks

An important problem in both wireless and wired communication networks is to be able to efficiently multicst information to a group of network sites. Multicasting reduces the transmission overhead of both wireless and wired networks and the time it takes for all the nodes in the subset to receive the information. Since transmission bandwidth is a scarce commodity especially in wireless networks, efficient and near minimum-cost multicast algorithms are particularly useful in the wireless context. In this paper, we discuss methods of establishing efficient and near minimum-cost multicast routing in communication networks. In particular, we discuss an efficient implementation of a widely used multicast routing method which can construct a multicast tree with a cost no greater than twice the cost of an optimal tree. We also present two efficient multicast tree constructions for a general version of the multicast routing problem in which a network consists of different classes of nodes, where each class can have one or more nodes of the same characteristic which is different from the characteristics of nodes from other classes. Because of their efficient running times, these multicast routing methods are particularly useful in the mobile communication environments where topology changes will imply recomputation of the multicast trees. Furthermore, the proposed efficient and near minimum-cost multicast routing methods are particularly suited to the wireless communication environments, where transmission bandwidth is more scarce than wired communication environments.Partially supported by NSF/LaSER under grant number EHR-9108765, by LEQSF grant number 94-RD-A-39, by NASA under grant number NAG 5-2842.     

Improved Shuffled Frog-Leaping Algorithm Based QoS Constrained Multicast Routing for Vanets

Prompt and reliable communication between vehicular nodes are essential as its limited coverage and dynamic mobility rate introduces frequent change of network topology. The key feature of vehicular communication that establishes direct connectivity or Road Side Unit-based data transfer among vehicular nodes is responsible for sharing emergency information during critical situations. Multicast routing data dissemination among vehicular nodes is considered to be the potential method of parallel data transfer as they facilitate the option of determining an optimal multicast tree from feasible number of multicast trees established between the source and destinations. This estimation of optimal multicast tree using meta-heuristic techniques is confirmed to improve the throughput and reliability of the network when QoS-based constraints are imposed during multicast routing. An Improved Shuffled Frog-Leaping Algorithm-Based QoS Constrained Multicast Routing (ISFLABMR) is proposed for estimating an optimal multicast tree that confirms effective multi-constrained applied multicast routing between vehicular nodes. ISFLABMR minimizes the cost of transmission to 22% by reducing the number of multicast clusters formed during multicasting through the utilization of local and global-based optimizations. The simulation results of ISFLABMR proveits predominant reduction rate of 24% and 21% in average packet latency and energy consumptions incurred under multicast routing.     

WSN中同构模型下动态组密钥管理方案

研究了同构网络模型的组密钥管理问题,首次给出了一个明确的、更完整的动态组密钥管理模型,并提出了一种基于多个对称多项式的动态组密钥管理方案。该方案能够为任意多于2个且不大于节点总数的节点组成的动态多播组提供密钥管理功能,解决了多播组建立、节点加入、退出等所引发的与组密钥相关的问题。该方案支持节点移动,具有可扩展性,并很好地解决了密钥更新过程中多播通信的不可靠性。组成员节点通过计算获得组密钥,只需要少量的无线通信开销,大大降低了协商组密钥的代价。分析比较认为,方案在存储、计算和通信开销方面具有很好的性能,更适用于资源受限的无线传感器网络。     

A ring-based multicast routing topology with QoS support in wireless mesh networks

Wireless mesh networking (WMN) is an emerging technology for future broadband wireless access. The proliferation of the mobile computing devices that are equipped with cameras and ad hoc communication mode creates the possibility of exchanging real-time data between mobile users in wireless mesh networks. In this paper, we argue for a ring-based multicast routing topology with support from infrastructure nodes for group communications in WMNs. We study the performance of multicast communication over a ring routing topology when 802.11 with RTS/CTS scheme is used at the MAC layer to enable reliable multicast services in WMNs. We propose an algorithm to enhance the IP multicast routing on the ring topology. We show that when mesh routers on a ring topology support group communications by employing our proposed algorithms, a significant performance enhancement is realized. We analytically compute the end-to-end delay on a ring multicast routing topology. Our results show that the end-to-end delay is reduced about 33 %, and the capacity of multicast network (i.e., maximum group size that the ring can serve with QoS guarantees) is increased about 50 % as compared to conventional schemes. We also use our analytical results to develop heuristic algorithms for constructing an efficient ring-based multicast routing topology with QoS guarantees. The proposed algorithms take into account all possible traffic interference when constructing the multicast ring topology. Thus, the constructed ring topology provides QoS guarantees for the multicast traffic and minimizes the cost of group communications in WMNs.     

Design and implementation of multicasting for multi-channel multi-interface wireless mesh networks

Multicasting is a useful communication method in wireless mesh networks (WMNs). Many applications in WMNs require efficient and reliable multicast communications, i.e., high delivery ratio with low overhead among a group of recipients. In spite of its significance, little work has been done on providing such multicast service in multi-channel WMNs. Traditional multicast protocols for wireless and multi-hop networks tend to assume that all nodes, each of which is equipped with a single interface, collaborate on the same channel. This single-channel assumption is not always true, as WMNs often provide nodes with multiple interfaces to enhance performance. In multi-channel and multi-interface (MCMI) WMNs, the same multicast data must be sent multiple times by a sender node if its neighboring nodes operate on different channels. In this paper, we try to tackle the challenging issue of how to design a multicast protocol more suitable for MCMI WMNs. Our multicast protocol builds multicast paths while inviting multicast members, and tries to allocate the same channel to neighboring members in a bottom-up manner. By unifying fixed channels of one-hop multicast neighbors, the proposed algorithm can improve the performance such as reducing multicast data transmission overhead and delay, while managing a successful delivery ratio. In order to prove such expectation on the performance, we have implemented and evaluated the proposed solution on the real testbed having the maximum 24 nodes, each of which is equipped with two IEEE 802.11a Atheros WLAN cards.     

Reliable concurrent multicast from bursty sources

This paper presents a protocol and design for concurrent and reliable group multicast (many-to-many) from bursty data sources in general networks. In a group multicast, any node can be a multicast source and multiple nodes may start to multicast simultaneously, i.e., an asynchronous access to the network. The reliable multicast protocol presented is window based with a combined sender and receiver initiation of the recovery protocol. In reliable multicasting the necessary requirement is to ensure that data is received correctly by all the active members of the multicast group. The approach taken is to combine the multicast operation with the internal flow control. As a result, it is possible to provide: (1) congestion-free multicast routing with a single and immediate acknowledgment message to the sender. Furthermore, in every multicast, (2) a node can access all the capacity allocated to its group with no delay, however, if several nodes are active in the same group, then the capacity will be shared fairly. In addition, (3) each sender in the multicast group uses a single timer, and (4) a node can become active or inactive in a transparent fashion, i.e., there is no need to explicitly notify the members of the group. A multiple criteria optimization study of the bandwidth allocation to each multicast group is presented. The optimization problem has two min-max objective functions: (1) for delay, which is caused by the number of links needed to connect the group, and (2) for congestion, which is caused by sharing a link among multiple multicast groups. The bandwidth allocation among multicast groups sharing the same link are further optimized using the max-min fairness criterion     

LNT: A logical neighbor tree secure group communication scheme for wireless sensor networks

Secure group communication is a paradigm that primarily designates one-to-many communication security. The proposed works relevant to secure group communication have predominantly considered the whole network as being a single group managed by a central powerful node capable of supporting heavy communication, computation and storage cost. However, a typical Wireless Sensor Network (WSN) may contain several groups, and each one is maintained by a sensor node (the group controller) with constrained resources. Moreover, the previously proposed schemes require a multicast routing support to deliver the rekeying messages. Nevertheless, multicast routing can incur heavy storage and communication overheads in the case of a wireless sensor network. Due to these two major limitations, we have reckoned it necessary to propose a new secure group communication with a lightweight rekeying process. Our proposal overcomes the two limitations mentioned above, and can be applied to a homogeneous WSN with resource-constrained nodes with no need for a multicast routing support. Actually, the analysis and simulation results have clearly demonstrated that our scheme outperforms the previous well-known solutions.     

雷达组网中的IP实时可靠多播

随着Internet的发展,要求一对多或多对多通信形式的网络应用迅速增长,IP多播服务为该类网络应用提供了一种有效的通信手段。但是基于IP的多播是一种无连接的数据传输方式(UDP),UDP数据传输是一种“尽力而为”的方式,因此在传输过程中存在丢包和乱序现象。对于某些应用,该传输的不可靠性是不允许的,因此出现了可靠多播技术。可靠多播协议的应用针对性很强,不同的应用场合对可靠多播的要求以及实现方法也大不相同。文中分析了雷达组网对多播及其实时性和可靠性的需求,参考现有的解决可靠多播主要问题的方法,初步提出了一种适合于小批量数据分发的实时可靠多播通信协议的设计方案。     

链路可靠的无线传感器网络组播路由协议

在无线传感器网络实际应用中,组播正在发挥着越来越重要的作用.但由于能量等多方面的因素,使得为无线传感器网络设计一个有效的组播路由是非常困难的.针对无线传感器网络中节点的能量限制,通过寻求节点间最短路径,提出一种能量有效的链路可靠组播路由协议(RLMR).该协议充分考虑到网络中节点的能耗因素和两节点间的链路可靠性等,通过对这两个因素的综合考虑,让能量较多并且以发送节点更靠近的节点承担更多传输任务的方式,为数据流优化路由选择,均衡无线传感器网络节点的能量消耗,以延长网络的生存时间.仿真结果证明了RLMR的有效性和可靠性.