计算机应用

• 网络与通信 • 上一篇    下一篇

自私无线Ad Hoc网络中一个低开销的诚实能效路由协议

袁新辉 陈松乔 蒋新华   

  1. 中南大学 中南大学 中南大学
  • 收稿日期:2008-03-03 修回日期:2008-03-30 发布日期:2008-08-01 出版日期:2008-08-01
  • 通讯作者: 袁新辉

Low-overhead truthful energy-efficient routing protocol in selfish wireless Ad hoc networks

<a href="http://www.joca.cn/EN/article/advancedSearchResult.do?searchSQL=((([Author]) AND 1[Journal]) AND year[Order])" target="_blank"></a>X<a href="http://www.joca.cn/EN/article/advancedSearchResult.do?searchSQL=((([Author]) AND 1[Journal]) AND year[Order])" target="_blank"></a>i<a href="http://www.joca.cn/EN/article/advancedSearchResult.do?searchSQL=((([Author]) AND 1[Journal]) AND year[Order])" target="_blank"></a>n<a href="http://www.joca.cn/EN/article/advancedSearchResult.do?searchSQL=((([Author]) AND 1[Journal]) AND year[Order])" target="_blank"></a>-<a href="http://www.joca.cn/EN/article/advancedSearchResult.do?searchSQL=((([Author]) AND 1[Journal]) AND year[Order])" target="_blank"></a>H<a href="http://www.joca.cn/EN/article/advancedSearchResult.do?searchSQL=((([Author]) AND 1[Journal]) AND year[Order])" target="_blank"></a>u<a href="http://www.joca.cn/EN/article/advancedSearchResult.do?searchSQL=((([Author]) AND 1[Journal]) AND year[Order])" target="_blank"></a>i<a href="http://www.joca.cn/EN/article/advancedSearchResult.do?searchSQL=((([Author]) AND 1[Journal]) AND year[Order])" target="_blank"></a> <a href="http://www.joca.cn/EN/article/advancedSearchResult.do?searchSQL=((([Author]) AND 1[Journal]) AND year[Order])" target="_blank"></a>Y<a href="http://www.joca.cn/EN/article/advancedSearchResult.do?searchSQL=((([Author]) AND 1[Journal]) AND year[Order])" target="_blank"></a>U<a href="http://www.joca.cn/EN/article/advancedSearchResult.do?searchSQL=((([Author]) AND 1[Journal]) AND year[Order])" target="_blank"></a>A<a href="http://www.joca.cn/EN/article/advancedSearchResult.do?searchSQL=((([Author]) AND 1[Journal]) AND year[Order])" target="_blank"></a>N<a href="http://www.joca.cn/EN/article/advancedSearchResult.do?searchSQL=((([Author]) AND 1[Journal]) AND year[Order])" target="_blank"></a> <a href="http://www.joca.cn/EN/article/advancedSearchResult.do?searchSQL=((([Author]) AND 1[Journal]) AND year[Order])" target="_blank"></a> <a href="http://www.joca.cn/EN/article/advancedSearchResult.do?searchSQL=((([Author]) AND 1[Journal]) AND year[Order])" target="_blank"></a>X<a href="http://www.joca.cn/EN/article/advancedSearchResult.do?searchSQL=((([Author]) AND 1[Journal]) AND year[Order])" target="_blank"></a>i<a href="http://www.joca.cn/EN/article/advancedSearchResult.do?searchSQL=((([Author]) AND 1[Journal]) AND year[Order])" target="_blank"></a>n<a href="http://www.joca.cn/EN/article/advancedSearchResult.do?searchSQL=((([Author]) AND 1[Journal]) AND year[Order])" target="_blank"></a>-<a href="http://www.joca.cn/EN/article/advancedSearchResult.do?searchSQL=((([Author]) AND 1[Journal]) AND year[Order])" target="_blank"></a>H<a href="http://www.joca.cn/EN/article/advancedSearchResult.do?searchSQL=((([Author]) AND 1[Journal]) AND year[Order])" target="_blank"></a>u<a href="http://www.joca.cn/EN/article/advancedSearchResult.do?searchSQL=((([Author]) AND 1[Journal]) AND year[Order])" target="_blank"></a>a<a href="http://www.joca.cn/EN/article/advancedSearchResult.do?searchSQL=((([Author]) AND 1[Journal]) AND year[Order])" target="_blank"></a> <a href="http://www.joca.cn/EN/article/advancedSearchResult.do?searchSQL=((([Author]) AND 1[Journal]) AND year[Order])" target="_blank"></a>J<a href="http://www.joca.cn/EN/article/advancedSearchResult.do?searchSQL=((([Author]) AND 1[Journal]) AND year[Order])" target="_blank"></a>I<a href="http://www.joca.cn/EN/article/advancedSearchResult.do?searchSQL=((([Author]) AND 1[Journal]) AND year[Order])" target="_blank"></a>A<a href="http://www.joca.cn/EN/article/advancedSearchResult.do?searchSQL=((([Author]) AND 1[Journal]) AND year[Order])" target="_blank"></a>N<a href="http://www.joca.cn/EN/article/advancedSearchResult.do?searchSQL=((([Author]) AND 1[Journal]) AND year[Order])" target="_blank"></a>G<a href="http://www.joca.cn/EN/article/advancedSearchResult.do?searchSQL=((([Author]) AND 1[Journal]) AND year[Order])" target="_blank"></a>   

  • Received:2008-03-03 Revised:2008-03-30 Online:2008-08-01 Published:2008-08-01
  • Contact: Xin-Hui YUAN

摘要: 一种激励自私无线Ad Hoc网络中节点合作的方法,向提供报文传输服务的节点提供不低于其传输成本的报酬。低开销诚实路由协议LOTER引入了VCG机制,节点在路由发现阶段收集邻居节点的信息,目标节点选择多条RREP路径,位于RREP路径上的节点将邻居节点信息沿RREP路径报告给源节点,源节点完成LCP路由选择和VCG报酬的计算。LOTER协议以低的报文开销收集网络拓扑信息,有效实现了自私无线Ad Hoc网络中的诚实能效路由。仿真结果表明,与现有协议比较,该协议具有更好的性能。

关键词: VCG机制, 诚实能效路由, 无线ad hoc网络

Abstract: A feasible way to stimulate cooperation in selfish Ad Hoc networks is to reimburse the forwarding service providers for their cost. We proposed a low overhead truthful energyefficient protocol called LOTER, which introduced the VCG mechanism into the selfish wireless Ad Hoc networks. In LOTER, the node collected its neighbors' information. The destination node selected several RREP paths. If it was on the RREP path, the node sent its collected information to the source node. Based on such information, the source node found the least cost path to the destination and calculated the VCG payment to the nodes on the chosen least cost path. LOTER can realize truthful and energyefficient routing in the selfish Ad Hoc networks. Furthermore, it is skillful at collecting topologic information with low overhead. Stimulation results show that LOTER provides better performance than other existing protocols.

Key words: VCG mechanism, truthful energy-efficient routing, wireless ad hoc networks