机会路由中一种候选节点数量估计方法

计算机科学 ›› 2016, Vol. 43 ›› Issue (10): 103-106.doi: 10.11896/j.issn.1002-137X.2016.10.019

机会路由中一种候选节点数量估计方法

姚金宝,张新有,邢焕来

西南交通大学信息科学与技术学院成都611756,西南交通大学信息科学与技术学院成都611756,西南交通大学信息科学与技术学院成都611756

出版日期:2018-12-01 发布日期:2018-12-01
基金资助:
本文受国家自然科学基金项目(61401374)资助

Estimation Method of Number of Candidate Nodes in Opportunistic Routing

YAO Jin-bao, ZHANG Xin-you and XING Huan-lai

Online:2018-12-01 Published:2018-12-01

摘要/Abstract

摘要： 针对机会路由中候选节点数量过多的问题,提出一种基于距离的候选节点数量估计方法(DBNCE)。该方法根据当前节点到目的节点的距离,结合网络密度、当前节点邻居节点的数量等因素,为参与数据包转发的每个节点设置相应数量的候选节点。仿真结果表明,在机会路由中应用该方法,能够在保证数据传输成功率的基础上,有效地减少网络中候选节点的数量,从而提升网络的性能。

关键词: 机会路由,期望传输次数,候选节点,平均候选节点数量

Abstract: Because the number of candidate nodes in opportunistic routing is too large,this paper proposed an estimation method of the number of candidate nodes based on distance (DBNCE).This method is used to set the number of candidate nodes for each node,which participates in forwarding data package according to the distance between the current node and the destination node,combining with network density and the number of neighbor nodes in current node.Simulation results show that using DBNCE in opportunistic routing will reduce the number of candidate nodes effectively while guarantee the success rate of data transmission,and improve the performance of the network.

Key words: Opportunistic routing,Expected number of transmissions,Candidate nodes,Mean number of candidate nodes

姚金宝,张新有,邢焕来. 机会路由中一种候选节点数量估计方法[J]. 计算机科学, 2016, 43(10): 103-106. https://doi.org/10.11896/j.issn.1002-137X.2016.10.019

YAO Jin-bao, ZHANG Xin-you and XING Huan-lai. Estimation Method of Number of Candidate Nodes in Opportunistic Routing[J]. Computer Science, 2016, 43(10): 103-106. https://doi.org/10.11896/j.issn.1002-137X.2016.10.019

参考文献

[1] Tian Ke,Zhang Bao-xian,Ma Jian,et al.Opportunistic Routing Protocols for Wireless Multihop Networks[J].Journal of Software,2010,1(10):2542-2553(in Chinese) 田克,张宝贤,马建,等.无线多跳网络中的机会路由[J].软件学报,2010,1(10):2542-2553
[2] Biswas S,Morris R.Opportunistic routing in multihop wireless networks[J].ACM SIGCOMM Computer Communication Review,2004,4(1):69-74
[3] Khan T F,Loyd B D,Jagadeesan D.A study on opportunistic routing in wireless mesh network[J].International Research Journal of Computer Science,2014,1(3):7-12
[4] Perkins C,Bhagwat P.Highly dynamic Destination SequencedDistance-Vector routing(DSDV)for mobile computers[C]∥Proceedings of ACM SIGCOMM.London:ACM Press,1994:234-244
[5] Perkins C E,Royer E M.Ad-hoc on-demand distance vector routing[C]∥Kristine K,ed.IEEE WorkShop on Mobile Computing Systems and Applications (WMCSA).1999:90-100
[6] Biswas S,Morris R.ExOR:Opportunistic Routing in Multi-hop Wireless Networks[C]∥Proceedings of the ACM SIGCOMM 2005.New York:ACM Press,2005:134-143
[7] Couto D D,Aguayo D,Bicket J,et al.A high-throughput path metric for multi-hop wireless routing[C]∥Proceedings of the ACM/IEEE MobiCom 2003 Washington:IEEE Computer Society Press.2003:134-146
[8] Dubois F H,Grossglauser M,Vetterli M.Least-cost opportunistic routing[R].Technical Report,LCAV-REPORT-2007-001,School of Computer and Communication Sciences,EPFL,2007
[9] Chachulski S,Jennings M,Katti S,et al.Trading structure for randomness in wireless opportunistic routing[C]∥Proceedings of the ACM SIGCOMM 2007.New York:ACM Press,2007:169-180
[10] Song Yuan,Yao Xiang-hua,Zhang Xin-man.On algorithm offor-warding candidate set for opportunistic routing protocol in Ad hoc networks[J].Computer Applications and Software,2012,9(12):18-20(in Chinese) 宋渊,姚向华,张新曼.Ad Hoc网络机会路由协议转发候选集算法的研究[J].计算机应用与软件,2012,9(12):18-20
[11] Li Yang-hui,Zeng Zhi-wen,Chen Zhi-gang,et al.Feedback Opportunistic Routing in Multihop Wireless Networks[J].Journal of Chinese Computer Systems,2010,1(5):900-903(in Chinese) 李阳辉,曾志文,陈志刚,等.多跳无线网络中反馈式机会路由研究[J].小型微型计算机系统,2010,1(5):900-903
[12] He Shi-ming,Zhang Da-fang,Xie Kun,et al.Opportunistic Routing for Multi-Flow in Wireless Mesh Networks[J].Acta Electronica Sinica,2014,2(5):1004-1008(in Chinese) 何施茗,张大方,谢鲲,等.多并发流无线网状网中的机会路由算法[J].电子学报,2014,2(5):1004-1008
[13] Darehshoorzadeh A,Almulla M,Boukerche A,et al.On theNumber of Candidates in Opportunistic Routing for Multi-hop Wireless Network[C]∥Proceedings of the 11th ACM International Symposium on Mobility Management and Wireless Access.New York:ACM Press,2013:9-16
[14] Darehshoorzadeh A,Boukerche A.An Efficient Heuristic Candidate Selection Algorithm for Opportunistic Routing in Wireless Multihop Networks[C]∥2014 IEEE Symposium on Computers and Communication(ISCC).2014:1-6

Metrics

Viewed

Full text

Abstract

Cited

Shared

Discussed