检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:王斌[1] 张振宇[1,2] 杨文忠[2] 吴晓红[2]
机构地区:[1]新疆大学软件学院,新疆乌鲁木齐830008 [2]新疆大学信息科学与工程学院,新疆乌鲁木齐830046
出 处:《计算机工程与设计》2016年第5期1176-1180,共5页Computer Engineering and Design
基 金:国家自然科学基金项目(61262089;61262087);新疆教育厅高校教师科研计划重点基金项目(XJEDU2012I09)
摘 要:针对机会网络中基于转发的路由算法使部分节点发生拥塞导致消息被丢弃问题,提出一种基于社会感知的拥塞控制算法。在选择下一跳节点时,通过计算节点间的直接关系、间接关系以及节点的接收能力作为转发效用值,将消息转发到效用值高的节点。当接收节点拥塞时,通过比较自身消息的效用值,将消息效用值最低的消息丢弃。仿真结果表明,该算法能够有效降低消息的丢弃率,提高消息交付效率。In opportunistic networks,forwarding based protocols lead to a large amount of data flowing to the highly connected nodes and unfairness of the nodes' traffic load,which makes the highly connected nodes suffer from congestion and results in discarding messages.To solve this problem,a congestion control algorithm based on social awareness was put forward.When choosing the next hop,the direct social relationship,indirect social relationship and the receiving capability were considered as the transfer utility,and the message was transferred to the node where the transfer utility was high.Besides,the message with lowest utility value was dropped by comparing the utility value of its own messages when the receiving node congestion occurred.Experimental results show that the proposed approach can reduce the dropping ratio of the message and improve the efficiency of data delivery.
关 键 词:机会网络 拥塞控制 临时关系 数据转发 缓存管理
分 类 号:TP393[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:3.137.159.67