无线蜂窝网中用于D2D多播簇的高效多播方案

在无线蜂窝网中使用设备到设备(Device-to-Device,D2D)通信技术,可以有效卸载基站的流量。文中研究基站到某个小区域(如一幢办公楼)内多个设备的基于D2D通信的高效数据多播,提出了一种基于D2D通信的包接收率(Packet Reception Ratio,PRR)和包平均转发次数(Average Packet Retransmission times,APRT)可控的多播方案,并分别以PRR下限约束下的APRT最小化(PRR constrained APRT minimization,APRT-M)和APRT上限约束下的PRR最大化(APRT constrained PRR maximization,PRR-M)为目标,最优化中继节点最大转发次数。相比于传统方案,所提方案可显著降低BS的多播负载。APRT-M方式以尽可能降低PRR(但不小于给定值)为代价来最小化APRT,而PRR-M方式以尽可能增大APRT(但不大于给定值)为代价来最大化PRR。     

基于最优能耗多播树构造的Ad hoc网络节点路由算法研究

针对Ad hoc网络中最小能耗多播树的生成和优化问题,提出了基于最优能耗多播树构造的Ad hoc网络节点路由算法。在该算法中,首先将最小能耗多播树生成问题转化为不同中继节点集合幂空间中的动态寻优问题,构建基于最优能耗多播树求解模型;然后利用改进的粒子群算法对不同维度空间上代表中继节点链路的粒子的权值进行映射和修正计算,再依据粒子适应度值对粒子的局部极值和全局极值进行更新;最后根据粒子位置和速度更新机制进行迭代计算,将最终的全局极值点和极值作为最优多播树的节点位置和能耗值。实验仿真证明,该算法具有较好的粒子多样性,全局搜索和局部搜索能力较好,并且优化能力较强。     

无线自组织网络中基于网络编码的可靠中继多播方案

无线自组织网络由于节点能量受限、无线链路可靠性较差等特性使得在设计数据可靠传输方案时必须考虑上述问题.提出了一个无线自组织中基于网络编码的可靠中继多播方案,本方案让一部分接收节点担当信源节点的发送任务,以中继的形式完成链路失效率较高的节点的传输.理论分析和数值分析结果表明,所提出的方案是可行的,在一定程度上提高了无线自...     

基于平衡树的应用层多播树构建算法

应用层多播协议通过生成树向其组成员发送数据包,一个节点失效则会引起生成树的分裂,并导致下游成员节点无法接收数据包,这正体现了应用层多播系统的脆弱性。为提高应用层多播的健壮性,提出一种基于K叉平衡树结构的应用层多播树构建的改进方案。     

基于干扰感知的无线自组网多播机制

在采用网络编码的无线自组网多播场景中,为了有效地克服节点密度较大时干扰对多播整体性能的影响,提出了一种衡量路径干扰情况的路由度量标准。基于该度量标准,对网络编码机会和节点间干扰避免进行了均衡处理,构建出一种基于部分网络编码的无线自组网干扰感知多播路由机制。仿真结果表明,该机制在能耗、延时和吞吐量等性能方面均优于基于传统网络编码的多播方案,因此特别适用于节点密度较大的场合。     

应用层多播中生成树的鲁棒性技术研究

应用层多播通过生成树将多播分组送至每一个组成员.树中的节点失效后其下游的节点将不能接收到分组,使得系统变得脆弱.本文使用在树中增加冗余虚拟链路的方法来减少不能接收到多播分组的节点数量.模拟试验表明,增加冗余虚拟链路可以大大降低节点失效带来的性能损失.     

一种基于概率可靠多播的MANET证书更新协议

完全自组织的密钥管理方案中证书库的更新策略只考虑了负载平衡,证书库更新效率不高。该文提出了一种基于概率可靠多播的证书更新协议。新协议包含两个阶段：更新信息传递和分布式更新服务。第1阶段在本地证书库中选取可靠并且在本地路由表中已具备路由信息的节点进行多播。第2阶段当未接收到更新信息的节点发送更新请求时,由目的节点的证书库中已经获得更新信息的节点来满足请求服务。它利用了现有的路由信息,降低了寻找路由带来的通信开销,通过将服务请求任务分散到网络中的多个节点上减少了证书颁发节点的负载,实现了负载平衡,同时可以预先概率分析其工作效率。     

工业5G的D2D多跳中继辅助传输方法及中断性能分析

面向工业5G网络的超可靠强实时传输要求,研究基于设备到设备通信（device-to-device,D2D）的多跳多中继辅助传输方法。基于随机几何理论,采用泊松点过程对工业现场设备进行建模,并划分中继选择区域。多跳中继过程中,每一跳中继选择信干噪比最大的节点进行解码转发,充分考虑层叠部署的多条D2D传输路径上的节点干扰以及随机噪声,推导出端到端中断概率的闭式表达式。仿真分析了中继节点部署密度、发射功率、路径距离等因素对端到端中断概率的影响。结果表明,采用多跳多中继辅助的D2D传输可以大幅降低工业5G网络的端到端中断概率,提高传输可靠性。     

能量捕获无线传感网的信道质量和能量感知高传递率多播方案

能量捕获无线传感器网络(EH-WSNs)由于可以无限期持续工作而具有非常广泛的应用前景。目前已有的EH-WSNs单跳多播方案存在以下问题:没考虑到链路质量会动态变化、节点储能易发生溢出而浪费能量等。提出了一种高传递率、高能效的EH-WSNs单跳多播方案。该方案采用纠删码,综合考虑节点当前储能、能量捕获速率以及当前信道质量等3方面因素,分析出当前待接收数据块的正确接收数据包数目期望值,只有当该期望值大于等于一定值时或者如果不接收该数据块则将发生储能溢出时才接收该数据块,有效地降低了信道质量差造成数据块接收失败和节点储能溢出的发生频率,高效利用极其有限的捕获能量。仿真结果表明,相比已有方案,本方案能显著提高EH-WSNs单跳多播的数据包成功传递率。     

一种适合2D-Mesh互连网络的树状多播算法

针对虫蚀寻径的2D－Mesh互连的多处理机网络，归纳了多播算法的要求，在分析比较路状多播和树状多播算法的基础上，提出一种结合两者优点的新型树状多播算法，该算法基于Hamilton寻径，即源节点到每一个目标节点的路径为最短路径，且具有无死锁的特性，同时，多播数据在源节点发送，途径节点转发所需计算的时间复杂度均为O（1），与多播目标节点集的大小和分布无关，数据模拟测试的结果表明，该算法的性能优越。     

基于组播网关的可靠组播体系结构

保证组播通信的可靠性是许多Internet上的组播应用的前提.针对IP组播在Internet中难以规模化部署的现状,提出了一种使用组播网关将IP组播岛与应用层组播(ALM)区域连接起来的可靠组播(RM)体系结构,对组标识、组播网关、组管理、差错控制和拥塞控制等关键问题给出了解决方案,并设计了组播网关竞争算法.该结构能够屏蔽底层组播技术差异,从而支持Internet上统一化的可靠组播服务部署.     

An improved MOEA/D algorithm for multi-objective multicast routing with network coding

Network coding enables higher network throughput, more balanced traffic, and securer data transmission. However, complicated mathematical operations incur when packets are combined at intermediate nodes, which, if not operated properly, lead to very high network resource consumption and unacceptable delay. Therefore, it is of vital importance to minimize various network resources and end-to-end delays while exploiting promising benefits of network coding.Multicast has been used in increasingly more applications, such as video conferencing and remote education. In this paper the multicast routing problem with network coding is formulated as a multi-objective optimization problem (MOP), where the total coding cost, the total link cost and the end-to-end delay are minimized simultaneously. We adapt the multi-objective evolutionary algorithm based on decomposition (MOEA/D) for this MOP by hybridizing it with a population-based incremental learning technique which makes use of the global and historical information collected to provide additional guidance to the evolutionary search. Three new schemes are devised to facilitate the performance improvement, including a probability-based initialization scheme, a problem-specific population updating rule, and a hybridized reproduction operator. Experimental results clearly demonstrate that the proposed algorithm outperforms a number of state-of-the-art MOEAs regarding the solution quality and computational time.     

A distributed multicast routing protocol for real-time multicast applications

Multicast routing is establishing a tree which is rooted from the source node and contains all the multicast destinations. A delay bounded routing tree is a tree in which the accumulated delay from the source node to any destination along the tree does not exceed a pre-specified bound. This paper presents a distributed routing protocol which constructs delay bounded routing trees for real-time multicast connections. A constructed routing tree has a near optimal network cost under the delay bound constraint. The proposed algorithm is fully distributed, efficient in terms of the number of messages required, and flexible in multicast membership changes. A large number of simulations have been done to show the network cost of the routing trees generated by our method is better than the other major existing algorithms.     

Transactions involving multicast

Multicast is concurrent data transmission to a well-defined and restricted set of destinations. Although this would seem to be a useful facility for many applications in distributed computing, very little use is made of it in practice. This is in spite of the fact that several multicast protocols exist which offer one or more multicast primitives to the applications programmer^1–5. This paper investigates the reasons for their limited acceptance, discussing the difficulties involved in using multicast, and where applicable, gives a review of approaches and solutions to be found in the literature.     

Hydra: Efficient multicast routing in MANETs using sender-initiated multicast meshes

We present Hydra, the first multicast routing protocol for MANETs that establishes a multicast routing structure approximating the set of source-rooted shortest-path trees from multicast sources to receivers, without requiring the dissemination of control packets from each source of a multicast group. Hydra accomplishes this by dynamically electing a core for the mesh of a multicast group among the sources of the group, and aggregating multicast routing state in the nodes participating in multicast meshes, so that only control packets from the core are disseminated towards the receivers of a group. We prove that Hydra establishes correct routes from senders to receivers of a multicast group when multicast state information is aggregated. We also present simulation results illustrating that Hydra attains comparable or higher delivery ratios than the On-Demand Multicast Routing Protocol (ODMRP), but with considerably lower end-to-end delays and far less communication overhead. Results are shown for scenarios using 802.11 DCF and TDMA as the MAC layer protocols and using random waypoint and group mobility as mobility models.     

Generalized multicast congestion control

Efficient multicast congestion control (MCC) is one of the critical components required to enable the IP multicast deployment over the Internet. Previously proposed MCC schemes can be categorized in two: single-rate or multi-rate. Single-rate schemes make all recipients get data at a common rate allowed by the slowest receiver, but are relatively simple. Multi-rate schemes allow of heterogeneous receive rates and thus provide better scalability, but rely heavily on frequent updates to group membership state in the routers. A recent work by Kwon and Byers, combined these two methods and provided a multi-rate scheme by means of single-rate schemes with relatively low complexity.In this paper, we propose a new scheme called generalized multicast congestion control (GMCC). GMCC provides multi-rate features at low complexity by using a set of independent single-rate sub-sessions (a.k.a layers) as building blocks. The scheme is named GMCC because single-rate MCC is just one of its special cases. Unlike the earlier work by Kwon and Byers, GMCC does not have the drawback of static configuration of the source which may not match with the dynamic network situations. GMCC is fully adaptive in that (i) it does not statically set a particular range for the sending rates of layers, and (ii) it eliminates redundant layers when they are not needed. Receivers can subscribe to different subsets of the available layers and hence can always obtain different throughput. While no redundant layers are used, GMCC allows receivers to activate a new layer in case existing layers do not accommodate the needs of the actual receivers.     

改进的聚合组播算法

针对组播状态可扩展性问题进行研究, 提出了一种改进的聚合组播算法。该算法在动态在线聚合组播算法的基础上, 确定匹配时可行的聚合树范围, 以减少匹配和计算次数, 降低时间复杂度; 改进最优匹配聚合树的选择算法, 并对网络中聚合树进行定期调整, 以优化聚合树结构, 去掉不必要的中间节点, 提高聚合度, 降低节点转发状态。仿真实验表明, 与同类算法相比, 该算法能够以较低的时间复杂度, 取得较高的聚合度和转发状态降低率, 在并发组播组数目较高和组密度较高时效果更加明显。     

组播技术应用

组播技术指的是单个发送者对应多个接收者的一种网络通信方式.该组播技术中,通过向多个接收方传送单播信息流方式,可以减少具有多个接收方同时收听或查看相同资源情况下的网络通信流量.对于n方视频会议,可以减少使用a（n-1）倍的带宽长度.“组播”中较为典型的是采用组播地址的IP组播.组播技术基于“组”这样一个概念,属于接收方专有组,主要接收相同数据流.该接收方组可以分配在英特网的任意地方.本文以监控系统介绍IP组播技术中的应用.     

Mutual anonymous overlay multicast

Multicast services are demanded by a variety of applications. Many applications require anonymity during their communication. However, there has been very little work on anonymous multicasting and such services are not available yet. Due to the fundamental differences between multicast and unicast, the solutions proposed for anonymity in unicast communications cannot be directly applied to multicast applications. In this paper we define the anonymous multicast system, and propose a mutual anonymous multicast (MAM) protocol including the design of a unicast mutual anonymity protocol and construction and optimization of an anonymous multicast tree. MAM is self-organizing and completely distributed. We define the attack model in an anonymous multicast system and analyze the anonymity degree. We also evaluate the performance of MAM by comprehensive simulations.     

受时延约束的组播路由算法

提出了一种新的受时延约束的组播路由算法。算法借鉴了MPH算法的思想,最初的组播树只包含源结点,然后每次将到达组播树的代价最小且满足时延约束的结点及其相应的路径加入到组播树,直到所有的成员加入为止。谊算法能够快速地得到一棵满足时延约束的组播树,并且组播树的代价也很小。实验表明：该算法简单,复杂度低,性能良好,易于在分布式环境中实现,可应用于实际的应用系统中。