共查询到20条相似文献,搜索用时 66 毫秒
1.
《电子技术与软件工程》2017,(24)
QoS组播路由技术作为网络多媒体信息传输的一种核心技术,下一代网络中的QoS组播路由的优化算法已经成为目前研究的一个热点。针对QoS组播的网络模型,提出一种适用于下一代网络的组播路由算法能够更好的满足下一代网络的QoS组播需求显得尤为重要。本文讨论了遗传算法优化的QoS组播路由算法,最后探讨了下一代网络QoS组播路由算法的研究方向。 相似文献
2.
3.
对具有带宽、延时、延时抖动约束的最小代价的QoS组播路由问题进行研究,提出了一种收敛速度快、全局性能好、不易陷入局部最优的智能迭代算法--量子粒子群算法来实现对该问题的求解.该算法采用整数编码方式,将路由优化问题转化成准连续优化,并采用惩罚函数处理约束条件.最后通过具体算例,对该算法进行了仿真验证,结果表明,在求解QoS组播路由问题时,量子粒子群算法要优于遗传算法、基本微粒群算法,从而验证了该算法的可行性和有效性. 相似文献
4.
5.
6.
7.
基于免疫机制和遗传进化的网络组播路由优化算法 总被引:1,自引:0,他引:1
高坚 《微电子学与计算机》2003,20(8):20-21,76
高速多媒体网络中的路由问题是有QoS约束的路由问题,满足一个或多个约束的组播路由问题是NP-完全问题。本文将免疫机制引入遗传进化,给出了一种基于免疫机制和遗传进化的网络组播路由优化算法。理论分析和仿真实验表明,该算法是一个非常有效的算法。 相似文献
8.
求解开销最小组播树在数学上归结为Steiner树问题,但由于寻找最优的Steiner树问题是NP-Complete问题,因此在组播应用中,采用启发式算法获得次优的组播树是常见的方法。该文提出了一种新的的启发式组播路由算法(Shared Path First Heuristic,SPFH)该算法在选择目的节点加入组播树时,既考虑到目的节点到树上的距离,又考虑到先加入的节点对后续加入节点的影响。算法从距离当前组播树近的目的节点中挑选节点加入组播树,选择的规则是,把能够减小其它目的节点加入组播树开销的节点先加入树。仿真结果表明,SPFH算法能找到开销接近于最优解的组播树。 相似文献
9.
10.
11.
本文提出一种组播选路算法,在组播连接路由树的代价函数中计入了移动成员的越区切换发生概率,使为移动成员服务的接入节点(AP)尽可能成为组播路由树的树叶节点。当移动成员发生越区切换以后,可减去原来为之服务的AP和相应的树枝通道链路,从而保证了网络资源得以有效地利用。数值模拟分析的结果表明,我们提出的算法达到了这一目的。 相似文献
12.
提出一种新的基于网络编码的负载均衡路由量度CRM-LB(coding-aware routing metric with load balancing),CRM-LB在CRM(coding-aware routing metric)的基础上增加了对路径p上所有节点通信密集程度与网络拥塞程度的考虑。进一步提出了基于CRM-LB的无线mesh网络多播路由CLR(coding and load-balancing routing)。该协议可以增加网络编码机会,同时考虑到网络中的负载均衡。通过性能分析和仿真实验表明,该协议在提高多播吞吐量的前提下,不仅能更好地支持网络编码,而且网络负载基本均衡。 相似文献
13.
Wireless ad hoc and sensor networks are emerging with advances in electronic device technology, wireless communications and mobile computing with flexible and adaptable features. Routing protocols act as an interface between the lower and higher layers of the network protocol stack. Depending on the size of target nodes, routing techniques are classified into unicast, multicast and broadcast protocols. In this article, we give analysis and performance evaluation of tree‐based multicast routing in wireless sensor networks with varying network metrics. Geographic multicast routing (GMR) and its variations are used extensively in sensor networks. Multicast routing protocols considered in the analytical model are GMR, distributed GMR, demand scalable GMR, hierarchical GMR, destination clustering GMR and sink‐initiated GMR. Simulations are given with comparative analysis based on varying network metrics such as multicast group size, number of sink nodes, average multicast latency, number of clusters, packet delivery ratio, energy cost ratio and link failure rate. Analytical results indicate that wireless sensor network multicast routing protocols operate on the node structure (such as hierarchical, clustered, distributed, dense and sparse networks) and application specific parameters. Simulations indicate that hierarchical GMR is used for generic multicast applications and that destination clustering GMR and demand scalable GMR are used for distributed multicast applications. Copyright © 2012 John Wiley & Sons, Ltd. 相似文献
14.
提出了一种无线mesh网中最小网络编码代价低时延多播路由协议(MNCLDMR, minimal network coding and low delay multicast routing)。MNCLDMR的目标是选择合适的网络编码节点,最小化网络编码代价,降低网络时延。MNCLDMR主要思想是引入拓扑关键节点和网络编码关键节点的概念,以下一跳的节点是否是网络编码关键节点或拓扑关键节点作为路由判据,采用MNCLD算法构造多播树。仿真结果表明,MNCLDMR可以达到预定目标,合理形成网络编码机会,能实现最小网络编码代价低时延多播路由。 相似文献
15.
分析了网络编码系统DCAR"编码+路由"发现过程存在的安全问题,提出了适用于编码感知安全路由协议的安全目标,设计了基于DCAR的编码感知安全路由协议DCASR,DCASR协议利用密码学机制保证可信路由建立和正确编码机会发现。为建模多跳无线网络特征和分析路由协议安全性,引入线程位置和线程位置相邻概念扩展安全系统逻辑LS2,提出了分析路由协议安全性的逻辑LS2-RP。LS2-RP用线程邻居集及邻居集的变化描述多跳无线网络的动态拓扑关系,用广播规则模型化多跳无线网络广播通信特征。最后,用LS2-RP协议编程语言描述了DCASR协议,用LS2-RP的谓词公式和模态公式描述DCASR协议的安全属性,用LS2-RP逻辑证明系统分析了DCASR协议的安全性,证明DCASR协议能够满足安全目标。 相似文献
16.
LI LI DONG Shu-song WEN Xiang-mingInstitute of Continuing Education School Beijing University of Posts Telecommunications Beijing China 《中国邮电高校学报(英文版)》2006,13(3):71-75
~~An energy efficient clustering routing algorithm for wireless sensor networks1. Mainwaring A, Polastre J, Szewczyk R, et al. Wireless sensor networks for habitat monitoring. Proceedings of the ACM International Workshop on Wireless Sensor Networks and A… 相似文献
17.
针对采用Epidemic机制的机会网络路由算法在数据分组传送阶段存在通信冗余的问题,提出了一种基于网络编码的高效路由算法--NCBER(network-coding-based epidemic routing)。NCBER在传送数据分组的过程中使用主动异或网络编码和多播,并取消了 Request(请求)控制分组,从而减少数据分组的转发次数和控制分组数量,降低网络开销,缩短分组传输时延。理论分析和仿真结果表明,NCBER 算法在网络开销和数据分组端到端时延性能方面优于经典的Epidemic路由算法及其改进算法MRRMR(message redundancy removal of multi-copy routing),并且使数据传送成功率保持在100%。 相似文献
18.
19.
Dhanasekaran Selvaraj Ramalingam Shanmugam Thamaraimanalan Thangarajan 《International Journal of Communication Systems》2024,37(3):e5663
Several input high-data-rate transmissions over broadband wireless channels are possible using multiple input multiple output (MIMO) systems paired with orthogonal frequency division multiplexing (OFDM) technology. Channel estimation is an essential technique and a necessary component of MIMO-OFDM systems. However, the noise will be there in MIMO-OFDM due to the environment. As a result, the wireless system performs degrades in terms of bit error rate (BER). The suggested method offers a better pilot pattern strategy for MIMO-OFDM and an efficient power allocation to address this issue. The binomial distribution-based grey wolf optimization (BDGWO) algorithm is proposed to identify the optimal pilot patterns. The power is then adaptively distributed to each transmit antenna to increase the spectral efficiency and maximum channel capacity through an adaptive neuro-fuzzy inference system with a sigmoid membership function (SMFANFIS). The best pilot patterns in PDGSIP (pilot design with generalized shift invariant property) were determined using the BDGWO algorithm based on the binomial distribution. According to the simulation results, the proposed BDGWO established pilot design with generalized shift invariant property (BDGWO-DGSIP) achieves higher performance compared other existing approaches such as PDGSIP, TPDGSIP, and LS in terms of NMSE, BER, and SER. Compared to the PDGSIP technique, the proposed PDGSIP-BDGWO system minimizes NMSE at 10%, BER at about 12%, and SER at 15%. 相似文献