期刊文献+

基于多路径路由的自组网节点合作方法

A hode cooperation scheme for mobile Ad hoc networks based on multipath routing
在线阅读 下载PDF
导出
摘要 为减小移动自组网中自私节点对网络性能的影响,提出了一种基于TORA协议的自组网节点合作方法TORA_CE。由于每个节点拥有多条通往目的节点的路径,在发现自私节点后,该方法能够快速切换路由,从而减小了数据传输过程中丢包的概率。TORA_CE具有更好的分布式特点,将自私节点引发的路由变化限制在自私节点附近较小的范围内,而且引入了共同邻居监听技术,并采用一跳信息计算节点的信誉值,提高了对自私节点的检测速度。使用NS2对TORA_CE进行了仿真,实验结果显示,与基于DSR协议的节点合作方法相比,TORA_CE能够明显提高网络的吞吐率。 To stimulate selfish nodes in mobile Ad hoc networks to participate in the network cooperation, this paper proposes the TORA CE scheme, a new node cooperation scheme for mobile ad hoc networks based on the temporally ordered routing algorithm (TORA) protocol. Because each node has a number of paths leading to the destination, after the discovery of selfish nodes, the scheme can quickly switch routes, reducing the probability of packet loss in the data transmission phase. With its distributed features, TORA CE can restrict the route changes caused by selfish nodes in a smaller range. The TORA _ CE can increase the selfish node detection rate because of its introduction of a common neigh- bor monitoring technology and the use of one-hop information for computing the node reputation. The NS2 was used to simulate TORA CE, and the experimental results show that the TORA _ CE can signifieantly improve the network throughput, compared with the cooperation scheme based on the dynamic source routing (DSR) protocol.
出处 《高技术通讯》 EI CAS CSCD 北大核心 2010年第7期702-708,共7页 Chinese High Technology Letters
基金 863计划(2006AA01A103 2008AA01A201) 国家自然科学基金(60503015)资助项目
关键词 移动自组网(MANET) 节点合作 信誉值 自私节点 mobile Ad hoe networks ,(MANET), node cooperation, reputation, selfish node
  • 相关文献

参考文献22

  • 1Basagni S,Conti M,Giordano S,et al.Mobile Ad Hoc Networking.New Jersey:Wiley-IEEE press,2004.
  • 2Johnson D B,Maltz D A,Hu Y C.The dynamic source routing protocol for mobile ad hoc networks (DSR).http://www.ietf.org/internet-drafts/draft-ietf-manet-dsr-10.txt,Internet Draft,IETF MANET Working Group,2004.
  • 3Perkins C E,Royer E M.Ad-hoc on-demand distance vector routing.In:Proceedings of the 2nd IEEE Workshop on Mobile Computing Systems and Applications.New Orleans:IEEE press,1999.90-100.
  • 4Park A D,Conson M S.A highly adaptive distributed routing algorithm for mobile wireless networks.In:Proceedings of the IEEE International Conference on Computer Communications.Kobe,Japan:IEEE Computer Society Press,1997.3.1405-1413.
  • 5刘强,匡镜明,王华.TORA路由协议详解及性能分析.见:2005年海峡两岸三地无线科技学术会论文集,2005,北京.499-503.
  • 6Feleqyhazi M,Hubaux J P,Buttyan L.Nash equilibria of packet forwarding strategies in wireless ad hoc networks.IEEE Transactions on Mobile Computing,2006,5(5):463-476.
  • 7Marti S,Giuli T,Lai K,et al.Mitigating routing misbehavior in mobile ad hoc networks.In:Proceedings of the 6th Annual International Conference on Mobile Computing and Networking,Boston:ACM press,2000.255-265.
  • 8Marias G F,Georgiadis P,Flitzanis D,et al.Cooperation enforcement schemes for MANETs:a survey.Wireless Communications and Mobile Computing,2006,6(3):319-332.
  • 9Yoo Y,Agrawal D P.Why does it pay to be selfish in a MANET?.IEEE Wireless Communications,2006,13(6):87-97.
  • 10Buchegger S,Mundinger J,Boudec J Y L.Reputation systems for self-organized networks.IEEE Technology and Society Magazine,2008,27(1):41-47.

二级参考文献44

  • 1Chlamtac I, Conti M, Liu J. Mobile Ad hoe networking: Imperatives and challenges. Ad Hoc Networks, 2003, 1 (1) 13-64.
  • 2Felegyhazi M, Hubaux J P, Buttyan L. Nash equilibria of packet forwarding strategies in wireless Ad hoc networks. IEEE Transactions on Mobile Computing, 2006, 5(5): 463- 476.
  • 3Marti S, Giuli T, Lai K, Baker M. Mitigating routing misbehavior in mobile Ad hoc networks//Proeeedings of the MOBICOM. Boston, 2000:255-265.
  • 4Srivastava V, Neel J. Using game theory to analyze wireless Ad hoc networks. IEEE Communications Surveys & Tutorials, 2005, 4(7): 46-56.
  • 5Andreu M C, Michael D W, Jerry R G. Mieroeconomie Theory. New York: Oxford University Press, 1995.
  • 6Nisan N, Roughgarden T, Tardos E, Vazirani V V. Algorithmic Game Theory. New York: Cambridge University Press, 2007.
  • 7Parkes D. Classic mechanism design. Chapter 2, Iterative combinatorial auctions : Achieving economic and computational efficiency[Ph. D. dissertation]. Univesity of Pennsylvania, Pennsylvania, 2001.
  • 8Anderegg L, Eidenbenz S. Ad-hoc-VCG: A truthful and cost efficient routing protocol for mobile ad-hoc networks with selfish agents//Proceedings of the 9th Annual International Conference on Mobile Computing and Networking. San Diego, CA, USA, 2003:245-259.
  • 9Wang Y W, Singhal M. On improving the efficiency of truthful routing in MANETs with selfish nodes. Pervasive and Mobile Computing, 2007, 3(5): 537-559.
  • 10Marias G F, Georgiadis P, Flitzanis D, Mandalas K. Cooperation enforcement schemes for MANETs: A survey. Wireless Communications & Mobile Computing, 2006, 6 (3) : 319-332.

共引文献6

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部