Reducing energy consumption optimization selection of path transmission routing algorithm in opportunistic networks  

作　　者：吴嘉 Yi Xi Chen Zhigang 

机构地区：[1]School of Software,Central South University

出　　处：《High Technology Letters》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 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.

关 键 词：opportunistic networks routing algorithm deliver ratio energy consumption transmission delay cache time 

分 类 号：TN915.02[电子电信—通信与信息系统]