期刊文献+
共找到5篇文章
< 1 >
每页显示 20 50 100
MANET中基于链路稳定性路由的跨层传输控制协议 被引量:5
1
作者 孙杰 郭伟 《软件学报》 EI CSCD 北大核心 2011年第5期1041-1052,共12页
在MANET中,通信节点的移动会造成端到端通信路由的时常中断.传统TCP协议只有拥塞控制机制,对由于节点移动造成的数据包传输丢失和超时也作为拥塞处理,使得端到端传输性能低下.为解决这一问题,采用跨层设计思想,将传输控制与链路稳定性... 在MANET中,通信节点的移动会造成端到端通信路由的时常中断.传统TCP协议只有拥塞控制机制,对由于节点移动造成的数据包传输丢失和超时也作为拥塞处理,使得端到端传输性能低下.为解决这一问题,采用跨层设计思想,将传输控制与链路稳定性路由结合,提出了一种基于链路生存时间概率的传输控制协议(transmissioncontrol protocol based on probability of link residual lifetime,简称TCP-PLRT).该协议通过在路由稳定时跨层收集路由层链路生存时间概率信息来实现对端到端连接稳定性的认知,并针对路由不稳定、路由中断、路由恢复,分别制定了路由切换、数据存储转发、ACK再确认三大机制.这使得TCP-PLRT协议具有对由移动造成的路由中断进行提前预判和有效处理的能力.仿真结果表明,TCP-PLRT协议能够极大地减小由节点移动带来的端到端传输性能的下降,减少分组重传,提高端到端的吞吐量. 展开更多
关键词 传输控制协议 跨层 路由中断 链路稳定性路由 链路生存时间概率
下载PDF
适用于分段运动模式的基于链路维持概率的跨层路由协议 被引量:2
2
作者 孙杰 郭伟 《通信学报》 EI CSCD 北大核心 2010年第10期48-57,共10页
MANET中节点移动造成路由中断带来端到端传输性能下降,为解决这一问题提出了一种适用于分段运动模式的链路稳定概率计算方法,并在此算法的基础上设计了一种适用于分段运动模式的基于链路维持概率的跨层路由协议(LPCP)。LPCP跨层结合路... MANET中节点移动造成路由中断带来端到端传输性能下降,为解决这一问题提出了一种适用于分段运动模式的链路稳定概率计算方法,并在此算法的基础上设计了一种适用于分段运动模式的基于链路维持概率的跨层路由协议(LPCP)。LPCP跨层结合路由层和传输层,能够兼顾端到端连接的稳定性和最小跳数。制定了"路由切换"、"数据存储转发"、"ACK再确认"等机制尽可能减少路由中断的发生及其带来的端到端传输性能下降。仿真结果表明LPCP能够有效减小路由中断带来的丢包,提高端到端传输吞吐量。 展开更多
关键词 移动自组织网络 链路稳定性路由 链路维持概率 路由中断 跨层 移动预测
下载PDF
一种高效可靠的MANET网络路由算法
3
作者 贺冰琰 刘年生 《集美大学学报(自然科学版)》 CAS 2014年第6期477-480,共4页
移动Ad-hoc网络AODV路由协议在路由断掉时,源节点会重新发起路由建立的过程,而在建立新的路由之前,分组会被丢失和通信被中止,针对这问题提出了一种高效可靠的移动Ad-hoc网络路由算法——AODV-RBA(Ad-hoc On-Demand Distance-Vector wit... 移动Ad-hoc网络AODV路由协议在路由断掉时,源节点会重新发起路由建立的过程,而在建立新的路由之前,分组会被丢失和通信被中止,针对这问题提出了一种高效可靠的移动Ad-hoc网络路由算法——AODV-RBA(Ad-hoc On-Demand Distance-Vector with Route Break Avoidance).新算法基于AODV,提出了新的路由维护机制:一条活动的路由上的每个中间节点都能检测到通往上行节点的链接中断危险,并在路由中断之前重新建立新的路由,可避免路由中断.NS2仿真结果表明,与AODV相比,AODV-RBA算法在网络时延、丢包率等方面有较大改善,具有较强的鲁棒性和容错性. 展开更多
关键词 移动自组网络 AODV 路由中断
下载PDF
Congestion aware routing algorithm for delay-disruption tolerance networks 被引量:4
4
作者 陶勇 龚正虎 +1 位作者 林亚平 周四望 《Journal of Central South University》 SCIE EI CAS 2011年第1期133-139,共7页
There were many contradictory evaluation criteria to select next-hop in the delay-disruption tolerance networks(DTN).To solve this problem,an attribute hierarchical model was proposed,in which the predefined criteria ... There were many contradictory evaluation criteria to select next-hop in the delay-disruption tolerance networks(DTN).To solve this problem,an attribute hierarchical model was proposed,in which the predefined criteria were summarized as static identity attributes,forwarding desire attributes and delivery capability attributes(IDC).Based on this model,a novel multi-attributes congestion aware routing(MACAR) scheme with uncertain information for next-hop selection was presented,by adopting an decision theory to aggregate attributes with belief structure and computing partial ordering relations.The simulation results show that MACAR presents higher successful delivery rate,lower average delay and effectively alleviate congestion. 展开更多
关键词 delay-disruption tolerant network congestion control routing algorithm custody transfer
下载PDF
Reasonable routing in delay/disruption tolerant networks
5
作者 Haizheng YU Jianfeng MA Hong BIAN 《Frontiers of Materials Science》 SCIE CSCD 2011年第3期327-334,共8页
Delay/disruption tolerant networking (DTN) is an approach to networking where intermittent connectivity exists: it is often afforded by a store and forward technique. Depending on the capability of intermediary nod... Delay/disruption tolerant networking (DTN) is an approach to networking where intermittent connectivity exists: it is often afforded by a store and forward technique. Depending on the capability of intermediary nodes to carry and forward messages, messages can be eventually delivered to their destination by mobile nodes with an appropriate routing protocol. To have achieved a successful delivery, most DTN routing protocols use message duplication methods. Although messages are rapidly transferred to the destination, the redundancy in the number of message copies increases rapidly. This paper presents a new routing scheme based on a stochastic process for epidemic routing. Message redundancy is efficiently reduced and the number of message copies is controlled reasonably. During the contact process of nodes in the network, the number of message copies changes, and according to the variability in the number of copies, we construct a special Markov chain, birth and death process, on the number of message copies then calculate and obtain a stationary distribution of the birth and death process. Comparing the theoretical model with the simulation we have performed we see similar results. Our method improves on time-to-live (TTL) and antipacket methods, in both redundancy and delivery success efficiency. 展开更多
关键词 delay/disruption tolerant networks (DTN) routing algorithm Markov chain message redundancy
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部