期刊文献+

Reducing energy consumption optimization selection of path transmission routing algorithm in opportunistic networks 被引量:2

Reducing energy consumption optimization selection of path transmission routing algorithm in opportunistic networks
下载PDF
导出
摘要 Opportunistic networks are random networks and do not communicate with each other among respective communication areas.This situation leads to great difficulty in message transfer.This paper proposes a reducing energy consumption optimal selection of path transmission(OSPT) routing algorithm in opportunistic networks.This algorithm designs a dynamic random network topology,creates a dynamic link,and realizes an optimized selected path.This algorithm solves a problem that nodes are unable to deliver messages for a long time in opportunistic networks.According to the simulation experiment,OSPT improves deliver ratio,and reduces energy consumption,cache time and transmission delay compared with the Epidemic Algorithm and Spray and Wait Algorithm in opportunistic networks. Opportunistic networks are random networks and do not communicate with each other among re- spective communication areas. This situation leads to great difficulty in message transfer. This paper proposes a reducing energy consumption optimal selection of path transmission (OSPT) routing algo- rithm in opportunistic networks. This algorithm designs a dynamic random network topology, creates a dynamic link, and realizes an optimized selected path. This algorithm solves a problem that nodes are unable to deliver messages for a long time in opportunistic networks. According to the simulation experiment, OSPT improves deliver ratio, and reduces energy consumption, cache time and trans- mission delay compared with the Epidemic Algorithm and Spray and Wait Algorithm in opportunistic networks.
机构地区 School of Software
出处 《High Technology Letters》 EI CAS 2015年第3期321-327,共7页 高技术通讯(英文版)
基金 Supported by the National Natural Science Foundation of China(No.61379057,61073186,61309001,61379110,61103202) Doctoral Fund of Ministry of Education of China(No.20120162130008) the National Basic Research Program of China(973 Program)(No.2014CB046305)
关键词 最优路径选择 随机网络 路由算法 信息传输 优化选择 能耗 网络拓扑结构 网络优化 opportunistic networks, routing algorithm, deliver ratio, energy consumption,transmission delay, cache time
  • 相关文献

参考文献9

  • 1Conti M, Giordano S, May M, . et al. From opportunistic networks to opportunistic computing. Communications Magazine, IEEE, 2010,48(9) : 126-139.
  • 2Jacquet P, Mans B, Rodolakis G. Infonnation propagation speed in mobile and delay tolerant networks. Information Theory, IEEE Transactions on, 2010, 56( 10) : 5001-5015.
  • 3Dvir A, Vasilakos A V. Backpressure- based routing proto?col for DTNs. ACM SIGCOMM Computer Communication Review, 2010, 40( 4) : 405-406.
  • 4Grossglauser M, Tse DNC. Mobility increases the capacity of ad hoc wireless networks. IEEE/ ACM Transactions on Networking, 2002, 10 ( 4) : 477 -486.
  • 5Wang G, Wang B, Gao Y. Dynamic spray and wait routing algorithm with quality of node in delay tolerant network . In: Proceedings of the International Conference on Commu?nications and Mobile Computing (CMC), Shenzhen, Chi?na, 2010, 3: 452-456.
  • 6Burgess J, Gallagher B, Jensen D, et al. MaxProp: Rou?ting for vehicle-based disruption-tolerant networks. In: Proceedings of the 25th IEEE International Conference on Computer Communications infocom , Barcelona, Spain, 2006, 6: 1-11.
  • 7Leguay J, Friedman T, Conan V, Evaluating MohySpace?based routing strategies in delay-tolerant networks, Wireless communications and mobile computing, 2007, 7 ( 10 ) : 1171-1182.
  • 8Bums B, Brock 0, Levine B N. MORA routing and capac?ity building in disruption-tolerant networks. Ad hoc net?works, 2008, 6 ( 4) : 600-620.
  • 9Keranen A, Ott J, Karkkainen T. The ONE simulator for DTN protocol evaluation. In: Proceedings of the 2nd Inter?national Conference on Simulation Tools and Techniques, New York, USA, 2009.

同被引文献13

引证文献2

二级引证文献2

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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