共查询到19条相似文献,搜索用时 187 毫秒
1.
2.
一种基于地理位置信息的无线传感器网最小能耗路由算法 总被引:3,自引:0,他引:3
提高能量有效性是无线传感器网络(WSN)设计的主要目标之一,采用能量有效路由协议是提高WSN能量有效性的一种重要手段。该文提出了一种面向无线传感器网络的最小能耗(MEC)路由算法GLB-DMECR。该算法采用了新颖的MEC路由思想,即利用理想的最小能耗路径来引导路由选择过程,从而发现实际的MEC路径;该算法采用分布式、基于局部网络状态信息的路由决策机制,具有良好的稳定性和可扩展性;该算法充分挖掘了节点地理位置信息在路由中的效用,利用地理位置信息实现路由而不需要网络付出过多的额外代价。该算法具有较低的实现复杂度。仿真结果说明, 其最小能耗性能在非常广的网络环境下要优于或等同于现有典型同类算法。 相似文献
3.
我们将模糊理论引入QoS路由领域中,提出了模糊QoS路由算法,在只增加相对较少的计算开销的基础上,有效地提高了QoS路由在离网络负载下的路由成功率和对链路信息滞后性的适应性。 相似文献
4.
移动Ad Hoe网络(MANET)中的路由算法应尽量使网络负载均衡,不均衡不仅导致正在通信的路由由于过度拥塞而引起数据包延时过大、吞吐量下降,而且会使拥塞节点的能量提前耗尽,从而加剧网络拓扑结构的变化及节点之间的不公平性。本文对目前提出的一些负载均衡路由算法进行了简要比较和分析,在此基础上,指出了目前负载均衡路由算法中存在的一些问题,并提出了一个实现负载均衡路由算法的一般模型。基于该模型,文中提出了一种简单的负载均衡路由算法。仿真结果表明,负载均衡路由算法比未考虑负载均衡的路由算法具有更高的数据包投递率和更低的数据包传输延时。 相似文献
5.
6.
7.
基于地理信息的路由算法由于其高效、低路由开销和良好的可扩展性等特点,在无线传感器网络中得到比较广泛的应用.许多采用贪婪策略作为其基本数据转发机制的地理路由算法都不可避免会遇到路由空洞现象.针对这个问题,本文提出了一种基于掌握两跳邻居节点位置信息的贪婪地理路由算法——Greedy-2算法.该算法能够使节点提前意识到路由空洞的存在,从而尽可能使数据包及时绕开空洞边界节点,减少路由空洞发生的概率,提高分组到达率.对于Greedy-2算法仍然遭遇路由空洞现象的情况,文章提出了一种基于两跳邻居信息的平面化算法PATN,该算法不需要增加额外的平面化开销,即可将网络平面化以采取边缘恢复机制,在UDG网络中保证数据可靠传输.仿真结果表明,与基于一跳邻居节点位置信息的贪婪算法相比,Greedy-2算法可以明显减少路由空洞现象发生的次数,在分组到达率和数据传送的路由跳数方面都有着更好的性能.Greedy-2算法与PATN规则结合后的GPSR-2算法也比GPSR算法有着更优化的路由跳数. 相似文献
8.
传统的TCP/IP路由以IP地址为中心,信息传输效率低下,难以满足网络用户需求。信息中心网络(Information-Centric Network,ICN)开始成为研究热点,ICN以内容为中心,可以高效传输信息。为了利用软件定义网络(Software Defined Network,SDN)和分段路由技术的优势,提高SDN控制器效率,减少网络传输时延,提出了一种可以应用于ICN的集中式架构。为进一步利用无标度网络对ICN进行建模,提出了一种基于数控分离的自适应概率路由算法。该算法通过迭代的方法调节数据包在节点发送的概率,使网络获取更佳性能。仿真结果表明,与最短路径算法和效率路由算法相比,该算法可以提升网络容量,有效降低平均路径长度。 相似文献
9.
文章将MPLS网络中传统的路由集中计算与具有分布式特点的蚂蚁路由计算结合起来,并引入了关键链路的概念和提出了关键度的计算方法,定义了状态转移规则、信息素浓度局部刷新规则和信息素浓度全局刷新规则。在此基础上提出了MPLS网络中基于关键度的蚂蚁路由算法,并进行了NS2仿真。仿真结果表明:本算法具有较高的路由成功率(接受率),在网络处于拥塞的情况下,路由的成功率以及网络资源的利用率方面相对于普通的SWP算法优势更为明显。 相似文献
10.
11.
Although routing schemes based on global knowledge make most optimal routing decisions, they will occupy many resources to keep the state information of the network up-to-date. In this work, we describe a fuzzy least-congested path (FLCP) routing algorithm based on hierarchical information. Simulation shows that the blocking probability using FLCP is very near to the blocking probability using the least-congested path routing (LCP) algorithm based on global information. Under heavy traffic load, the FLCP algorithm is superior to the exhaustive algorithm (EA) and the LCP algorithm with unit information cost. The FLCP algorithm provides better routing, even with incomplete information. Thus, the algorithm requires less information of the network, particularly under heavy traffic load. In addition, an improved remote-path routing approach is provided to reduce the blocking probability of connection requests to a node that is many hops away from the source node. 相似文献
12.
非精确网络状态信息下基于Bellman-Ford的QoS路由算法 总被引:1,自引:0,他引:1
及时传输有服务质量(QoS,Quality of Service)要求的多媒体信息对于集成服务的宽带网络发展提出了新的挑战。QoS路由算法的优劣直接影响网络服务质量,而由于链路信息的不及时更新必将造成网络链路信息的非精确性。本文提出了一种在非精确网络状态信息下基于改进的Bellman—Ford算法的随机QoS路由算法Random_link_SONO,该算法采用随机策略来平衡网络负载和改善网络性能。通过网络模拟器的测试,该算法具有良好的性能指标,同时减少了处理和协议的额外开销。 相似文献
13.
14.
15.
无线网络中基于位置的能量高效协作路由算法 总被引:2,自引:0,他引:2
为了降低无线网络中路由的整体发射功率,该文提出了一种基于位置的能量高效协作路由(LBCR)算法。首先分析了协作链路在一定中断概率要求下的发射功率性能,理论分析表明,合适的协作节点可以降低协作链路的发射功率。在自适应转发分群路由(AFCR)算法的基础上,LBCR算法利用节点位置信息为每跳选择合适的中继节点,然后结合多跳协作策略,建立从源节点到目的节点的协作路由。仿真结果表明,与无协作的AFCR算法和基于一跳协作的MPCR算法相比,LBCR算法可以明显改善路由的整体发射功率。 相似文献
16.
We present two dynamic routing algorithms based on path and neighborhood link congestion in all-optical networks. In such networks, a connection request encounters higher blocking probability than in circuit-switched networks because of the wavelength-continuity constraint. Much research has focused on the shortest-path routing and alternate shortest-path routing. We consider fixed-paths least-congestion (FPLC) routing in which the shortest path may not be preferred to use. We then extend the algorithm to develop a new routing method: dynamic routing using neighborhood information. It is shown by using both analysis and simulation methods that FPLC routing with the first-fit wavelength-assignment method performs much better than the alternate routing method in mesh-torus networks (regular topology) and in the NSFnet T1 backbone network (irregular topology). Routing using neighborhood information also achieves good performance when compared to alternate shortest-path routing 相似文献
17.
18.
Zhiguo Liu Jie Zhu Jiangmei Zhang Qingli Liu 《International Journal of Satellite Communications and Networking》2020,38(1):1-15
In view of the problems of low routing efficiency, complex control process, and difficult network management in big data environment in the traditional integrated space‐terrestrial network, in the paper, we propose a satellite network architecture called software‐defined information centric satellite networking (SDICSN) based on software‐defined networking (SDN) and information‐centric networking (ICN), and we design a virtual node matrix routing algorithm (VNMR) under the SDICSN architecture. The SDICSN architecture realizes the flexibility of network management and business deployment through the features of the separation of forwarding and controlling by the SDN architecture and improves the response speed of requests in the network by the centric of “content” as the ICN idea. According to the periodicity and predictability of the satellite network, the VNMR algorithm obtains the routing matrix through the relative orientation of the source and destination nodes, thus reducing the spatial complexity of the input matrix of the Dijkstra algorithm and then reducing the time complexity of the routing algorithm. For forwarding information base (FIB), the mechanism of combination of event driven and polling can be quickly updated in real time. Finally, the advantages of the SDICSN architecture in routing efficiency, request delay, and request aggregation are verified by simulation. 相似文献
19.
Information‐Centric Networking (ICN) has been accepted to overcome some weaknesses of the current Internet architecture, showing that “what is being exchanged” is more important than “who are exchanging information.” Given the inadequate considerations on Quality of Service (QoS) and energy saving in ICN routing, we propose in this paper a routing algorithm to enhance the two aspects. At first, on one hand, Cauchy distribution is used as a fuzzy model to evaluate users' QoS requirements, such as bandwidth, delay, and error rate; on the other hand, we formulate energy saving problem to evaluate the green quality of routing algorithm. Then, we design a link selection approach by considering QoS and energy saving, which belongs to a multi‐objective decision problem resolved by intelligent drops algorithm. Finally, we implement the proposed algorithm and compare it with the famous adaptive forwarding mechanism in terms of some significant metrics, and the experimental results reveal that the proposed algorithm is more efficient. 相似文献