摘要
针对现有机会网络路由算法应用到社区中会产生缓存溢出,副本数量过多等问题,论文提出了一种有效的控制副本数量的方案。通过预先计算出每个节点在整个网络中能投放的副本数量最大值,再计算两个节点相遇的平均时间和信息从初始节点转发到目的节点的总时间以此来确定信息被转发的次数。节点转发的次数就是节点能产生的副本数。同时为了防止缓存溢出又采用退避机制来管理缓存中的信息。
In this paper,an effective scheme is proposed to control the number of replicas.In this paper,the number of nodes can be calculated in the whole network.In this paper,a scheme is proposed to control the number of replicas.The maximum number of copies.The number of times the information is forwarded can be determined by calculating the average time at which two nodes meet and the total time from which the information is forwarded from the initial node to the destination node.The number of times that the node is forwarded is the number of copies that the node can produce.At the same time the back-off mechanism is used in order to prevent the cache overflow and to manage the information in the cache.
作者
黄成兵
HUANG Chengbing(Computer Science Department,Aba Teachers College,Wenchuan 623002)
出处
《计算机与数字工程》
2018年第7期1396-1400,共5页
Computer & Digital Engineering
基金
四川省教育厅重点课题(编号:18ZA0003)
阿坝州应用技术研究与开发资金(编号:YYJS2017051)资助
关键词
节点相遇
转发次数
副本
退避机制
node encounter
forwarding number
copy
backoff mechanism