检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:韩最蛟
出 处:《国土资源科技管理》2015年第4期107-114,共8页Scientific and Technological Management of Land and Resources
摘 要:容延网络中基于历史的路由协议大多利用粗粒度相遇信息对消息进行转发决策。然而,这些粗粒度信息无法准确描述网络节点间的接触模式,转发决策的准确性不高。为此,提出一种基于细粒度接触表征的概率路由方法 FG-PRICN来实现信息统计,融合基于接触时间转发策略和基于定额的路由策略的优点,提出一种贪婪转发策略。FG-PRICN方法中的每个节点利用时隙滑动窗口机制来维护历史接触信息,历史接触信息能迅速合并新的接触信息同时删除过期接触信息。滑动窗口的尺寸可以控制历史数据的粒度,进而反映接触模式。设置全面的仿真实验评估了FG-PRICN的性能,结果表明,与当前方法相比,FG-PRICN可以显著提高报文投递率且通信开销很低。History-based routing protocols in delay tolerant networks use coarse-grained encounter information to make messages forwarding decisions.However,the coarse-grained information cant give precise expression of the contact patterns between nodes in the network,thereby leading to inaccurate forwarding decisions.To solve this problem,aprobabilistic routing scheme based on fine-grained contact characterization named FG-PRICN was presented to count information.A greedy forwarding scheme was designed by combining the advantages of contact duration-based forwarding and quota-based routing.Each node in FG-PRICN uses a slotted sliding window mechanism to maintain the information of historical contact,by which new contact information can be quickly incorporated and outdated history data can be easily removed.The granularity of collected history data can be controlled by adjusting the size of the sliding window,and thus reflects the contact patterns.The performance of FG-PRICN was evaluated through extensive simulations,and results show that,compared with existing schemes,FG-PRICN can significantly enhance message delivery rate with low communication overhead.
关 键 词:容延网络 机会路由消息转发 细粒度 时隙滑动窗口机制 贪婪转发
分 类 号:TP393[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.7