共查询到20条相似文献，搜索用时 31 毫秒
1.
无线ad hoc网络最小均方负载均衡路由算法 总被引：1，自引：0，他引：1
Routing algorithm is a challenge for a mobile ad hoc network (MANET), but current routing protocols for MANETsconsider the path with minimum number of hops as the optimal path to a given destination. This strategy does not balancethe traffic load over a MANET, and may result in some disadvantages such as creating congested area, depleting power fasterand enlarging time delay in the nodes with heavy duties. In this paper, we propose a routing scheme that balances the loadover the network by selecting a path based on its mean load-square, the proposed routing metric can reflect not only the loadof the path, but also the load distribution along the path. Simulation results show effectiveness of this routing scheme onbalancing the load over all nodes in the network. 相似文献
2.
INTRODUCTION Some new emerging applications involve in- formation transmission in a network. Different from traditional single-cast applications, these new arising applications are called multicast as they contain a single sender and multiple receivers. In general, it is needed to construct a multicast routing tree to deliver information along the tree branches. Because links in the tree are shared by paths to different receivers, just one information copy is needed in the middle node. Th… 相似文献
3.
探讨了波分多路网络 (WDM)中基于流量的多播路由问题 ,并建立了该问题与实际网络极其相近的模型 ,将该模型转化为最快路问题 ,利用最快路算法可在多项式时间内求解该问题 . 相似文献
4.
Multicasting is a communication service that allows an application to efficiently transmit copies of data packets to a set of destination nodes. The problem of finding a minimum cost multicast tree can be formulated as a minimum Steiner tree problem in networks, which is NP-completeness. MPH (minimum path cost heuristic) algorithm is a famous solution to this problem. In this paper,we present a novel solution TPMPH (two phase minimum path cost heuristic) to improve the MPH by generating the nodes and the edges of multicast tree separately. The cost of multicast tree generated by the proposed algorithm with the same time as MPH is no more than that of MPH in the worst case. Extensive simulation results show that TPMPH can effectively improve the performance on MPH, and performs better in large-scale networks and wireless networks. 相似文献
5.
In this paper we introduce a novel energy-aware routing protocol REPU （reliable, efficient with path update）, which provides reliability and energy efficiency in data delivery. REPU utilizes the residual energy available in the nodes and the received signal strength of the nodes to identify the best possible route to the destination. Reliability is achieved by selecting a number of intermediate nodes as waypoints and the route is divided into smaller segments by the way-points. One distinct advantage of this model is that when a node on the route moves out or fails, instead of discarding the whole original route, only the two way-point nodes of the broken segment are used to find a new path. REPU outperforms traditional schemes by establishing an energy-efficient path and also takes care of efficient route maintenance. Simulation results show that this routing scheme achieves much higher performance than the classical routing protocols, even in the presence of high node density, and overcomes simultaneous packet forwarding. 相似文献
6.
李婧晖 《四川教育学院学报》2010,26(3):114-116
设计一个新的建树算法,该算法适用于应用层多播。考虑到应用层上两点间代价的不对称性和实时性要求,设计出一种基于源端的多播树建立方法,以保证组内每个成员都能及时收到组内其它任何一个成员发送的报文。多播组的成员通过测量应用层的点到点的瓶颈带宽和往返时延获得链路代价,并分别以自己为根节点建立多播树,以便在报文转发时确定最优路径。 相似文献
7.
A load-balanced minimum energy routing algorithm for Wireless Ad Hoc Sensor Networks 总被引：3，自引：0，他引：3
CAI Wen-yu JIN Xin-yu ZHANG Yu CHEN Kang-sheng 《浙江大学学报(A卷英文版)》2006,7(4):502-506
INTRODUCTION Wireless Sensor Network is one special type of wireless ad hoc networks without fixed infrastructure consisting of a collection of sensor nodes, and oper- ating on limited amount of battery energy consumed mostly in transmission and reception. In the WSNs described in Fig.1, every sensor node can sense, process data and communicate to base station (BS). WSNs have attracted much attention during the recent two years and some commercial implementations such as environmental … 相似文献
8.
互联网络RCP(Ringed Crossed cube Petersen)拓扑结构被提出后并没有给出组播算法.本文利用RCP(n)网络的正则性、良好的可扩展性,以及比Qn,HP(n),RHP(n)网络直径更短和构造开销更小这些特性,按照构造组播树的方法,给出了RCP(n)网络的组播路由算法,并对该算法作了性能分析. 相似文献
9.
通过对当前的Ad Hoc网络多播协议进行研究,文章给出了当前Ad Hoc网络多播协议的三个重要特征:以按需路由发现为主要的路由确定方式,网格多播比树形多播更加实用,以及对路由之外的其他因素考虑很少.文章对当前Ad Hoc网络多播协议中尚未很好解决的问题也进行了总结和分析,并给出了部分问题的解决对策. 相似文献
10.
11.
陈红 《鞍山师范学院学报》2008,10(2):73-75
Ad hoc网络是由彼此对等的、自主的无线节点组成的自组织多跳网络.由于Ad hoc网络的特点,路由协议的设计显得尤为重要.本文提出一种Ad hoc组播路由协议MDMRP,MDMRP通过使用FG节点选择机制来建立网格,实现在节能方面优于其它现有协议.仿真结果表明,该协议是有效的. 相似文献
12.
Algorithm for Delay-Constrained Minimal Cost Group Multicasting 总被引：1，自引：0，他引：1
Group multicast routing algorithms satisfying quality of service requirements of real-time applications are essential for high-speed networks. A heuristic algorithm was presented for group multicast routing with bandwidth and delay constrained. A new metric was designed as a function of available bandwidth and delay of link, And source-specific routing trees for each member were generated in the algorithm by using the metric, which satisfy member＇s bandwidth and end-to-end delay requirements. Simulations over random network were carried out to compare the performance of the proposed algorithm with that from literature. Experimental results show that the algorithm performs better in terms of network cost and ability in constructing feasible multicast trees for group members. Moreover,the algorithm can avoid link blocking and enhance the network behavior efficiently. 相似文献
13.
在量子通信过程中,通信质量主要受到量子噪声、通信节点数、纠缠粒子数等因素影响,为得到更适合实际应用的通信路由,对相位阻尼信道进行研究。在以最小等效阻尼系数为度量的最佳中继路由算法基础上进行改进,给出一种综合性路由度量的最佳路由选择方案。该方案充分考虑了对通信路由影响较大的几个因子,并采用路径先验方案以避免路径失效后网络进行通信请求。理论分析与仿真对比结果表明,该路由协议使路径节点中的最小纠缠粒子对数得到明显提高,从而提高了网络稳定性。 相似文献
14.
MAODV路由协议是应用于移动Ad Hoc网络的一个组播路由协议,协议中的组长选取具有较大的随机性。本文分析了协议中组长的位置选取的相关特征,并在此基础上提出了基于自由树的中心的MAODV改进,改进算法避免了MAODV路由协议中组长处于组播共享树叶子结点的位置,减少了数据分组的传输次数,降低了网络传输的延迟。 相似文献
15.
本文主要研究Internet区分服务体系提供服务质量保证问题,分析了端到端服务质量体系结构、纽播技术,以及区分服务中存在着一些问题,以此,结合网络编码技术,本文提了基于网络编码的最大流单源组播路由算法。 相似文献
16.
无线传感器网络中节点的位置信息非常重要,目前通用的定位算法不适合恶劣环境;路由算法的设计直接影响到系统的能量消耗。在此提出一种基于测距的节点定位方案,并构建基于睡眠机制、最小成本路径的节能路由算法,通过理论分析和仿真实验,证明该算法具有较高的节能性,能提高网络的整体性能。 相似文献
17.
王竞 《重庆大学学报(英文版)》2005,4(2):96-101
1 Introduction 1 Multiparty applications based on group communication such as video conference, remote education and so on are expected to become widespread in the Internet in the future. Now, the network transmission mode is unicast with a single receiver. If there are multiple receivers, the sender has to transmit multiple copies of the same data. Obviously, the unicast is inefficient for increasing one-to-many and many-to-many network applications. Multicast (RFC1112) is one of the effect… 相似文献
18.
保证服务质量的QoS路由（Quality of Service Routing）是网络中解决QoS问题的一项关键技术。QoS路由的主要目标是为接入的业务选择满足服务质量要求的传输路径,同时保证整个网络资源的有效利用。度量参数选择问题、寻路问题和路由信息不准确问题是QoS路由中的几个主要研究内容。多约束QoS路由算法通常是NPC问题,本文先对QoS路由中的问题进行分娄,再对当前研究的一些多约束QoS路由算法进行了归纳与分析。这些算法对于在Internet中实现QoS有着重要的指导意义。 相似文献
19.
提出了一种无线传感器网络中基于蚁群算法的单向链路路由算法,该算法采用单向链路和双向链路相结合的方法,寻找源节点到目的节点的最优路径。仿真结果表明,该算法能够选择参数性能好的路径,最优路径上的总时延远远小于只支持双向链路的传统蚁群算法,而且最优路径的收敛速度明显加快,由此节省了无线传感器网络中的能耗。 相似文献
20.
针对机会网络的路由算法基本上是考虑完全合作情况下进行设计的.本文对节点的合作性进行了分析,在机会网络环境ONE平台上,通过不同的转发概率对传染路由算法Epidemic的合作性进行了测试和分析.仿真结果表明,节点之间的合作性对路由算法的性能有着不同程度的影响. 相似文献