首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 93 毫秒
1.
针对移动Ad hoc网络传统重传机制存在的局限性,提出了一种新的重传控制算法(EX-TCGM),利用传输路径上的邻居节点传输丢失的数据包,使得路由上的任何节点都能够重传;并从理论上对该算法的有效性进行了分析。通过仿真,与按需距离矢量路由协议(AODV)、机会路由协议(ExOR)和基于分组移动的传输控制方法(TCGM)进行了性能对比和分析,EX-TCGM相对原协议在端到端平均时延和吞吐量上有所提高,数据包平均成功传输率相对其他协议显著增加。  相似文献   

2.
研究了在3G网络数据传输速率下路由协议AODV(AdHoc按需距离矢量路由)的性能。模拟结果分析了不同数据传输速率下报文丢失率、路由发现频率、端到端的时延,结果表明随着通信节点移动速率的增加此三项指标值都变大。模拟结果为移动自组网与3G网络的结合提供了参考。  相似文献   

3.
VANETs车载网是一种大型的复杂网络,具有节点高速移动、拓扑频繁变化等特性。多跳路由被广泛应用于VANETs,其通过广播请示消息REQ(Request)选取下一跳转发节点。然而,不断广播REQ降低了信道的可用性,增加了网络拥堵率。为此,提出基于RBNS(reception rate based node selection)路由方案。该RBNS在决策路由时无需广播REQ消息,源节点只需通过每个节点的reception rate信息,选择下一跳转发节点。同时,REQ仅向离目的节点近的节点方向传播,在节点的一跳通信范围仅传输一次,从而减少了路由跳数和REQ消息数量。仿真结果表明,RBNS在吞吐量、数据包丢失率和数据包碰撞率方面均得到有效的提升。  相似文献   

4.
本文提出了基于蚁群优化(ACO)算法的Ad Hoc网络生存时间和其他网络性能平衡路由协议(ABEAR)。协议按需发送人工蚂蚁进行路由发现,综合节点残留的信息素浓度、下一跳节点剩余能量、节点周围链路质量和拥塞情况选择下一跳节点来转发数据包,尽量避开信道使用频率较高的路径,减少了因信道冲突、数据包丢失和数据包重传所造成的能量损失,还缩短了网络传输时延,提高了网络吞吐量。协议还采用跨层机制根据MAC层通信活动情况,在保证网络连通性的前提下使部分空闲节点转入睡眠状态来节省能量消耗。仿真表明,与AODV协议相比,ABEAR协议在网络生存时间、数据包交付率和端到端平均时延方面均有较大改善。  相似文献   

5.
车载网络(VANETs)属于移动无线网络的特例,具有鲜明的特性。传统无线网络的路由协议难以直接应用于VANETs。节点的高速移动,引起网络拓扑动态变化,导致VANETs的通信链路频繁断裂。高动态网络的链路可靠性问题引起广泛的关注。为此,针对高速公路VANETs的路由可靠性进行分析,对演化图论进行扩展,建立扩展后的演化图论模型(EEGM),并利用EEGM获取VANETs拓扑的动态信息,从而预先获取可靠路由的信息。在此基础上,提出基于演化图论的可靠路由协议(EG-RAODV)。仿真结果表明,与同类的其他协议相比,提出的路由协议在分组传输率、端到端传输时延、路由请求消息率以及链路断裂数方面得到了提升。  相似文献   

6.
一种节点独立的MANET网络多径路由协议   总被引:9,自引:0,他引:9  
论文提出了一种基于AODV(adhocon-demanddistancevector)的节点独立多径路由协议NDM(NodeDisjointMultipath),NDM在路由发现过程中记录每跳信息,这样一方面能够发现节点独立的多径路由,别一方面也很简单地解决了路由环路的问题。论文还从理论上探讨了多径路由个数的问题,通过仿真表明NDM在节点移动速度较高时数据包投送率、端端平均时延、路由发现频率等方面都明显优于标准的AODV协议。  相似文献   

7.
移动Ad Hoc网络是一种自组织、无基础设施的网络。而节点的自由移动促使链路频繁的断裂。为此,提出基于链路连通时间预测路由LDPR(Link Duration-Prediction-based Routing)。LDPR路由先通过节点运动信息,预测链路的连通时间。然后,再依据链路的连通时间计算路由生成时间,并选择两条路由生成时间长的路由协同传输数据,一条路由作为主路由,另一条路由作为备用路由。通过双路由机制,提高数据包的传输效率。实验数据表明,相比于传统的按需距离矢量AODV(Ad Hoc On-demand Distance Vector)路由,LDPR路由在吞吐量和端到端传输时延方面的性能得到有效改善。  相似文献   

8.
Ad hoc网络中节点移动,网络拓扑不稳定,特别是对于节点高速移动的Adhoc网络来说网络性能下降问题更为突出.为此,设计了一种基于路径稳定率的按需路由的协议,新协议选择源目节点间稳定性高且跳数少的路径进行数据分组的转发.以经典的按需路由协议AODV为原型,并在此基础上进行改进,扩展为PS-AODV(Path Stability AODV).性能分析的结果表明.在节点高速运动的重负载Adhoc网络中,该协议显著减少了中断路由的修复时间,提高了端到端分组投递率,在端到端传输时延相近的情况下显著改善端到端时延抖动,对于那些时延敏感的应用有重要的参考价值.  相似文献   

9.
《电子技术应用》2015,(12):72-75
车辆的高速移动以及城市场景中的障碍物使得车辆间的通信链路变得异常脆弱。而现有的多数地理信息并没有考虑链路的稳定、可靠性,产生了高的数据包丢失率和高的数据包传输时延,降低了网络性能。为此,提出了一种优化的地理信息路由协议IGR(Improved geographical)。IGR协议在数据包转发过程中,考虑了源车辆离候选车辆间的相对移动方向、候选车辆离目的车辆的距离以及beacon接收率,尊重车辆间无线链路的不稳定性事实。IGR协议择优选择具有稳定链路的车辆作为下一跳数据包转发节点。最后,评估了提出的IGR协议,并与现有的地理信息路由进行比较分析。结果表明,提出的IGR协议在数据包传输时延、数据包传输率性能优于GPCR和RBVT-R协议。  相似文献   

10.
避免路由断裂的优化AODV路由协议   总被引:1,自引:0,他引:1  
移动自组网(MANET)中,节点的移动容易引起链路失效,传统的按需距离矢量(AODV)路由算法的本地修复机制局限于在链路断裂后进行,如果修复失败或者过慢,可能导致缓存的数据包丢失。针对这一问题,提出一种避免路由断裂的优化AODV路由算法ARB-AODV,该算法首先对即将断裂的链路进行预测,然后计算有关节点的相对稳定度,将稳定性较高的节点插入即将断裂的链路中,以消除节点的边缘效应来避免路由断裂。在NS-2平台下采用随机路点移动模型(RWM)和恒定比特率(CBR)数据源进行实验,在节点的移动速度大于10m/s时,ARB-AODV算法的分组投递率保持在80%以上,其平均端到端时延比AODV算法降低了40%,归一化路由开销比AODV算法降低了15%。仿真结果表明,ARB-AODV优于AODV,能有效提高网络性能。  相似文献   

11.
《计算机科学》2007,34(4):148-148
Recent years have seen rapid advances in various grid-related technologies, middleware, and applications. The GCC conference has become one of the largest scientific events worldwide in grid and cooperative computing. The 6th international conference on grid and cooperative computing (GCC2007) Sponsored by China Computer Federation (CCF),Institute of Computing Technology, Chinese Academy of Sciences (ICT) and Xinjiang University ,and in Cooperation with IEEE Computer Soceity ,is to be held from August 16 to 18, 2007 in Urumchi, Xinjiang, China.  相似文献   

12.
为了设计一种具有低成本、低功耗、易操作、功能强且可靠性高的煤矿井下安全分站,针对煤矿安全生产实际,文章提出了采用MCS-51系列单片机为核心、具有CAN总线通信接口的煤矿井下安全监控分站的设计方案;首先给出煤矿井下安全监控分站的整体构架设计,然后着重阐述模拟量输入信号处理系统的设计过程,最后说明单片机最小系统及其键盘、显示、报警、通信等各个组成部分的设计;为验证设计方案的可行性与有效性,使用Proteus软件对设计内容进行仿真验证,设计的煤矿井下安全监控分站具有瓦斯、温度等模拟量参数超标报警功能和电机开停、风门开闭等开关量指示功能;仿真结果表明:设计的煤矿井下安全监控分站具有一定的实际应用价值.  相似文献   

13.
本文分析了法律数据库的结构和特点,介绍了采用面向对象设计方法和超文本数据库技术开发和实现法律信息库系统将作为重要网络资源之一为不同用户进行法律咨询服务。  相似文献   

14.
In modern service-oriented architectures, database access is done by a special type of services, the so-called data access services (DAS). Though, particularly in data-intensive applications, using and developing DAS are very common today, the link between the DAS and their implementation, e.g. a layer of data access objects (DAOs) encapsulating the database queries, still is not sufficiently elaborated, yet. As a result, as the number of DAS grows, finding the desired DAS for reuse and/or associated documentation can become an impossible task. In this paper we focus on bridging this gap between the DAS and their implementation by presenting a view-based, model-driven data access architecture (VMDA) managing models of the DAS, DAOs and database queries in a queryable manner. Our models support tailored views of different stakeholders and are scalable with all types of DAS implementations. In this paper we show that our view-based and model driven architecture approach can enhance software development productivity and maintainability by improving DAS documentation. Moreover, our VMDA opens a wide range of applications such as evaluating DAS usage for DAS performance optimization. Furthermore, we provide tool support and illustrate the applicability of our VMDA in a large-scale case study. Finally, we quantitatively prove that our approach performs with acceptable response times.  相似文献   

15.
16.
17.
正SCIENCE CHINA Information Sciences(Sci China Inf Sci),cosponsored by the Chinese Academy of Sciences and the National Natural Science Foundation of China,and published by Science China Press,is committed to publishing highquality,original results of both basic and applied research in all areas of information sciences,including computer science and technology;systems science,control science and engineering(published in Issues with odd numbers);information and communication engineering;electronic science and technology(published in Issues with even numbers).Sci China Inf Sci is published monthly in both print and electronic forms.It is indexed by Academic OneFile,Astrophysics Data System(ADS),CSA,Cabells,Current Contents/Engineering,Computing and Technology,DBLP,Digital Mathematics Registry,Earthquake Engineering Abstracts,Engineering Index,Engineered Materials Abstracts,Gale,Google,INSPEC,Journal Citation Reports/Science Edition,Mathematical Reviews,OCLC,ProQuest,SCOPUS,Science Citation Index Expanded,Summon by Serial Solutions,VINITI,Zentralblatt MATH.  相似文献   

18.
正Erratum to:J Zhejiang Univ-Sci C(ComputElectron)2014 15(7):551-563doi:10.1631/jzus.C1300320The original version of this article unfortunately contained mistakes.Algorithm 6 should be as follows:Algorithm 6 FGKFCM-F clustering Input:(1)X={x_1,x_2,…,x_N},,x_iR~d,i=1,2,…,N,the dataset;(2)C,1C≤N,the number of clusters;(3)ε0,the stopping criterion;  相似文献   

19.
20.
《Information & Management》2016,53(6):787-802
Discrepant technological events or situations that entail a problem, a misunderstanding or a difficulty with the Information Technology (IT) being employed, are common in the workplace, and can lead to frustration and avoidance behaviors. Little is known, however, about how individuals cope with these events. This paper examines these events by using a multi-method pragmatic approach informed by coping theory. The results of two studies – a critical incident study and an experiment – serve to build and test, respectively, a theoretical model that posits that individuals use a variety of strategies when dealing with these events: they experience negative emotions, make external attributions, and adopt engagement coping strategies directed at solving the event, eventually switching to a disengagement coping strategy when they feel they have no control over the situation. Furthermore, users’ efforts may result in ‘accidental’ learning as they try to overcome the discrepant IT events through engagement coping. The paper ends with a discussion of the results in light of existing literature, future opportunities for research, and implications for practice.  相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号