检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:宋蔓蔓[1] 张振宇[1] 杨文忠[1] 张珍[1]
机构地区:[1]新疆大学信息科学与工程学院,乌鲁木齐830046
出 处:《计算机工程与应用》2014年第16期86-89,108,共5页Computer Engineering and Applications
基 金:国家自然科学基金(No.61262089);新疆大学博士科研启动基金资助项目(No.BS110127)
摘 要:在资源受限的机会网络中,节点在转发过程中所表现出的自私行为将严重影响网络性能。针对这一问题,建立基于认错机制的"礼尚往来"策略的节点重复博弈模型。节点考虑到将来的利益,迫于对惩罚的恐惧而参与转发。通过该策略,节点协作可以使网络性能达到最优。仿真结果表明,节点间的相互协作增强,在自私节点较多时也能保证较好的网络性能。In opportunistic networks with limited resources, the performance of network is seriously affected by selfish behavior of the nodes during the packet forwarding. To solve this problem, the paper establishes a repeated-game model of node cooperation based on a admit mechanism of“Tit-For-Tat”strategy. The nodes consider the long-term interests and participate in forwarding forced by the fear of punishment. By using the strategy, cooperation of nodes in the network can make the network performance to achieve optimal. The simulation results show that the mutual cooperation of nodes is enhanced and the performance of the network can be guaranteed when more selfish nodes exist in network.
分 类 号:TP393[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.28