基于XOR选择重传ARQ的网络编码多播路由算法

针对XOR选择重传ARQ协议,提出了一种基于网络编码的多播路由算法,有效地恢复链路传输错误。该算法分为两种情况：一是信源发送正常的数据包,在信源节点与各接收节点之间建立多播路径族,并考虑不同路径族之间链路的共享;二是信源发送XOR数据包,搜索信源节点到各接收节点的最短路径,并考虑最短路径之间的链路共享。仿真结果表明,该算法有效地提高了网络吞吐量,在资源消耗方面较传统的多播路由算法有更好的表现,非常接近基于网络编码的最小费用多播算法。数学分析表明,该算法的复杂度远小于最小费用多播算法。     

一种基于P2P的流媒体数据调度算法

针对现有的采用拉式策略的算法在进行调度时数据块不能及时到达的情况,提出了一种自适应的数据调度算法。该算法可以根据节点间数据的传输速率以及P2P网络节点的动态性自动调整对数据服务节点的选择,并可以最小化在播放截止时间之前不能到达的数据块的数量。实验结果表明,新的算法可以一定程度缩短每个调度周期的数据到达延迟。     

基于OFDMA的无线协作多播网络资源分配算法

在传统的无线多播传输中,多播组的系统性能受限于多播组内的最差用户的信道质量。为了克服多播组的系统性能受限的问题,将协作传输引入到基于正交频分多址(orthogonal frequency division multiple access,OFDMA)的无线多播网络中,并提出了在总传输速率受限的情况下,最小化总传输功率的动态资源分配算法。为了减少计算复杂度和保障公平性,提出了协作公平子载波分配算法(cooperative fair, CF)和迭代注水功率分配算法。仿真结果显示,在多播组的用户中进行协作传输的系统性能,要远高于采用传统多播直接传输的性能,并且所提算法也在保证系统性能的同时,实现了多播组间良好的公平性。     

OFDM系统中的快速发射功率分配算法

针对在限定传输速率和误码率的情况下最小化OFDM系统发射功率问题,提出了一种基于灌水原理的次最优快速算法。算法利用灌水水平和系统传输速率之间的关系求出高效的灌水水平粗搜索方法,然后用二分法求解出所需的灌水水平。当信道发生变化时,该算法可以快速地确定出新灌水水平所处的区间,从而实现对时变信道进行快速跟踪。仿真结果表明该算法收敛速度较快,适合应用于信道随时间变化的OFDM通信系统中。     

无线自组网中多速率敏感单播路由

针对多速率环境下按需路由协议,提出了基于延迟转发路由请求包的多速率敏感单播路由协议BDRMAU.其基本思想是中间节点根据路由请求包的发送者和本节点之间链路的传输速率,优先调度来自高传输速率链路发出的路由请求包来执行转发动作,因此,候选路由尽可能多地包含高传输速率链路,通过充分利用物理层多速率能力来提高网络吞吐量.模拟实验表明,BDRMAU较传统的协议能够较大地提高了网络吞吐量.     

移动自组织网中基于贪婪蚁群算法的广播策略

广播是移动自组织网络(mobile ad hoc network, MANET)传递信息和建立路由的重要操作。为解决广播过程中的链路冗余和广播风暴问题,提出一种基于贪婪蚁群算法(greedy ant colony algorithm, GACA)的广播策略。首先,结合路由节点的数据包总传输距离、链路数目和链路质量建立目标函数。然后,通过GACA达到目标函数的最小值并规划出最优信息广播路由。最后,转发节点根据路径要求转发信息。仿真实验表明,该策略能够合理地利用网络资源、减少信息冗余以及避免广播风暴的发生。     

基于排序机制的全序广播算法分类与性能分析

已有的全序广播和多播算法多达近五十种,为了便于人们根据需要从众多算法中进行选择,需要对这些算法进行明确分类。但现有的分类方法都存在着完备性较差,且难以理解等问题。基于排序机制,从全序广播和多播算法的通信记录、优先权、动态序列器、静态序列器和目的方一致五个方面,给出了一种针对全序广播与多播算法的新系统分类方法。同时,还从定性、定量两个方面对分类的各类算法进行了规范、应用模型环境以及性能的分析与评测。使用新的分类方法以及测评结果,可以在现实应用中很方便地从现有算法集中根据需要选择合适的算法。     

基于冗余避免的高效网络编码广播重传方法

为了提高无线网络中基于网络编码的广播重传方法的编码效率,从而有效地减少重传次数和数据包传输时延,提出一种主动避免编码冗余的高效网络编码广播重传方法(network coding broadcasting retransmission approach based on redundancy avoiding,NCRA)。NCRA编码时主动避免不能解码的编码组合被重复编码重传,同时优先编码重传对接收节点已缓存的未解码编码包的解码贡献较大的丢失数据包以充分利用编码机会,在对解码贡献相同的条件下优先编码较早丢失的数据包以减小数据包传输时延。理论分析和仿真结果表明,NCRA算法相比于现有算法能有效减小重传次数和降低数据包传输时延,减少网络开销,进一步提高了编码重传的效率。     

基于非正交多址技术的协作中继传输方案

针对星地频谱共享网络中深衰落认知用户传输速率低的问题,提出了一种基于非正交多址接入(non-orthogonal multiple access,NOMA)的协作中继传输方案。该方案的源节点采用NOMA技术广播信息并根据信道特性自适应地调节功率分配因子,中继节点通过中继-源节点功率比参数合理设置其传输功率并进行译码转发,在功率受限情况下最大化认知用户的传输速率。数值分析结果表明,功率比在一定范围内时,与正交多址接入的协作中继方案相比,该方案的传输速率提高了13.7%左右;当两种方案传输速率相同时,该方案的功率节约30%左右。     

应用于稠密传感网的高效广播算法研究

广播在传感网协议中有着广泛应用,广播风暴问题在节点稠密的传感网中尤为严重。在不应用精确节点位置信息的前提下,提出了一种可应用于稠密传感网的高效广播算法,简称为ripple算法。ripple算法结合了邻节点通信连接关系比较法与重复报文计数法减少冗余广播报文。该算法主要有两个步骤:第一步,利用信息源节点广播的拓扑评估报文选择再广播节点;第二步,当网络中执行信息分发服务时,被选中的再广播节点首先随机等待一段时间,统计收到的重复报文数量。只有收到的重复报文数量低于设定阈值的节点进行再广播。仿真表明,ripple算法在保证广播到达率的基础上,减少了冗余再广播报文数量,降低了广播引起的冲突,缩短了广播完成时间。     

Distributed QoS multicast routing in networks with imprecise state information

1.INTRODUCTION WiththerapiddevelopmentofInternet,mobilenet worksandhigh performancenetworkingtechnology,itbringsoutextensiveinterestsofpeopleinproviding multimediaandreal timeservicessuchasvideoconfer ence,distanceeducation,entertainmentandsoon.Theseservicesrequirecertainquality of service(QoS)fromthenetworks.Thatis,thereshouldbe guaranteesastobandwidth,delay,delay jitter,ratio ofpacket lossandlowcostduringthedatatransmis sion.Meanwhile,multicastserviceshavebeenused invariousmultimediaap…     

基于遗传算法与模糊选择的多播路由优化

遗传算法在优化计算特别是在多播路由问题中得到了广泛应用,但在进行大规模优化时,遗传算法存在着爬山能力差以及不成熟收敛等缺点。为此,提出基于启发式遗传算法和模糊选择机制的新型多播树计算方法,本算法采用树型结构编码和高效的遗传操作,同时优化时延、丢包率和带宽利用率等多个参数。仿真实验表明,这种算法用于多播路由多目标优化问题时,可以克服采用遗传算法进行多目标优化的缺陷。     

一个时延约束的动态组播路由算法

分析了时延约束的动态最小代价组播路由问题，然后基于贪婪思想设计了一个动态组播树生成算法DCDG（Delay—Constrained Dynamic Greedy Algorithm），用于在动态环境下构造时延约束的低代价组播树。该算法通过节点动态贪婪地选择满足时延约束的最短路径加入组播树来降低代价；若时延不满足要求，则通过合并DDSP（Destination-Driven Shortest Path Algorithm）最小时延路径来产生一个满足时延约束的低代价组播树。仿真实验表明：DCDG算法动态生成的组播树代价较低、性能稳定，而计算复杂度仅为O（n）；在严格的时延约束下会话成功率高。     

Optimizing on multiple constrained QoS multicast routing algorithms based on GA

With the rapid development of Internet, mobile networks and high-performance networking technology,multiple constrained QoS multicast routing optimization in networks with uncertain parameters has become a very important research issue in the areas of networks and distributed systems. It is also a challenging and hard problem to the next generation Internet and high-performance networks, and has attracted the interests of many people. This paper discusses the multiple constrained QoS multicast routing problem, which may deal with the delay, delay jitter,bandwidth and packet loss metrics, and describes a network model for researching the routing problem. The paper mainly presents multiple constrained QoS multicast routing algorithm (MCQMRA), a QoS multicast routing policy for Internet,mobile network or other high-performance networks, which is based on the genetic algorithm (GA) and can provide QoS-sensitive paths in a scalable and flexible wayin the network environment with uncertain parameters. The MCQMRA can also optimize the network resources such as bandwidth, delay, packet loss metrics and can converge to the optimal or near-optimal solution within few iterations, even for the network environment with uncertain parameters. Simulation results show that MCQMRA is an available approach to QoS multicast routing decision.     

QoS multicast routing algorithm based on GA

1 .INTRODUCTIONTheprovisionofquality of service (QoS) guaranteesisofutmostimportanceforthedevelopmentofthemulticastservices .Multicastroutinghascontinuedtobeaveryimportantresearchissueintheareasofnet worksanddistributedsystems.Ithasattractedtheinterestsof…     

Distributed QoS multicast routing protocol in ad hoc networks

1 .INTRODUCTIONMobile ad hoc networks ( MANET) , also calledthe infrastructureless mobile network or self-or-ganized network,consists of a collection of mobilenodes sharing a wireless channel without any cen-tralized control or established communication back-bone .ad hoc networks have no fixed routers ;allnodes are capable of movement and can be connect-ed dynamically in an arbitrary manner . Usually ,these nodes act as both end systems and routers atthe same ti me . Nodes of these netwo…     

基于决策图贝叶斯的多目标QoS组播路由算法

随着实时组播通信需求的不断增长，要求网络能够提供更加严格高效的QoS(Quality of Service)路由保证，需要设计一个能够同时满足不同QoS约束的高效组播路由算法。此问题可归结为图论中的NP(Non-Polymenital)问题，一般方法是把多个QoS参数加权合并为一单目标函数进行优化。提出了一种基于决策图贝叶斯的多目标QoS组播路由算法，算法在不需做预处理的情况下可对多个不同的QoS参数同时进行优化。仿真结果表明，所提出的算法能够快速收敛于一组满足不同QoS约束的非支配解。     

Multicast routing algorithm of multiple QoS based on widest-bandwidth

1 .INTRODUCTIONA mobile Ad hoc network refers to a temporal multi-hop autonomy system,whichis constituted by a groupof mobile nodes containing wireless send-receive equip-ments[1].It possesses manycharacteristics-fast-deploy-able,self-organized,acentric , movable and of multi-hop.It can be wildly applied to many fields ,such asnational defense,emergency and disaster ,scientificin-vestigation and exploration etc .,and uponthat ,it hasgreat prospects[1 ,3 6]. With the wide spread of mo-bile…     

Resource allocation with minimum transmit power in multicast OFDM systems

To minimize the total transmit power for multicast service in an orthogonal frequency division multiplexing (OFDM) downlink system, resource allocation algorithms that adaptively allocate subcarriers and bits are proposed. The proposed algorithms select users with good channel conditions for each subcarrier to reduce the transmit power, while guaranteeing each user’s instantaneous minimum rate requirement. The resource allocation problem is first formulated as an integer programming (IP) problem, and then, a full search algorithm that achieves an optimal solution is presented. To reduce the computation load, a suboptimal algorithm is proposed. This suboptimal algorithm decouples the joint resource allocation problem by separating subcarrier and bit allocation. Greedy-like algorithms are employed in both procedures. Simulation results illustrate that the proposed algorithms can significantly reduce the transmit power compared with the conventional multicast approach and the performance of the suboptimal algorithm is close to the optimum.     

A Heuristic Algorithm for QoS Multicast Routing

In recent years, QoS multicast routing has continued to be a very important research topic in the areas of networks. This paper presents a heuristic algorithm for the QoS multicast routing (HAQMR). This heuristic algorithm deals with delay and bandwidth constraints and has low cost. The HAQMR attempts to significantly reduce the overhead for constructing a multicast tree, the proof for correctness of the HAQMR is given, and the performance of the HAQMR is evaluated by simulations. The study shows that HAQMR provides an available approach to QoS multicast routing.