检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:汪洋[1] 林闯[1] 李泉林[2] 王竞奇[3] 姜欣[1]
机构地区:[1]清华大学计算机科学与技术系,北京100084 [2]清华大学工业工程系,北京100084 [3]美国西北大学凯洛格商学院
出 处:《计算机学报》2009年第1期54-68,共15页Chinese Journal of Computers
基 金:国家"九七三"重点基础研究发展规划项目基金(2006CB805901);国家自然科学基金(60673187;60803123;10671107;10871114;60736028)资助~~
摘 要:无线网络因其分布性、独立性、移动性等特点,网络性能容易受到自私节点的影响.文中综述了无线网络中因自私节点的存在而带来的一些关键问题,特别对含有自私节点的无线环境中基于非合作博弈理论的路由机制进行了分析和研究.为了解决网络中自私节点的问题,目前研究人员主要提出了两种机制:基于信任度的机制和基于非合作博弈的激励机制.文中对上述两类机制进行了总结和分析,特别地,针对无线自组织网络和无线网状网络中各种激励机制进行了详细的研究.网络编码作为一种有效的技术有助于提高无线网络的性能,文中探讨了基于网络编码的优化对含有自私节点的无线网络性能的影响.同时还分析了非合作无线网络中节点共谋的问题,最后提出了当前非合作无线网络研究中存在的理论挑战及潜在的热点方向.Since wireless networks are usually distributed, independent and mobile, their performance could be affected by selfish nodes. In this paper, the authors focus on the issues of self- ish nodes in wireless networks. Game based mechanisms are introduced to study the wireless network involving selfish nodes. In the literature, there are mainly two approaches to deal with the selfish nodes: credit based mechanisms and non-cooperative game and incentive based mechanisms. The authors summarize and analyze the typical routing mechanisms in these areas, and especially discuss the non-cooperative game and incentive based routing mechanisms for wireless adhoc networks and wireless mesh networks. Network coding as an efficient technology can help to improve network performance. They also study the optimization schemes based on network coding in wireless networks involving selfish nodes. Moreover, the authors discuss the collusion problem in non-cooperative wireless networks. Finally, they present the existing challenges and possible research directions in non-cooperative wireless networks.
分 类 号:TP393[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.12