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...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.展开更多
This paper considers the convergence rate of an asymmetric Deffuant-Weisbuch model.The model is composed by finite n interacting agents.In this model,agent i’s opinion is updated at each time,by first selecting one r...This paper considers the convergence rate of an asymmetric Deffuant-Weisbuch model.The model is composed by finite n interacting agents.In this model,agent i’s opinion is updated at each time,by first selecting one randomly from n agents,and then combining the selected agent j’s opinion if the distance between j’s opinion and i’s opinion is not larger than the confidence radiusε0.This yields the endogenously changing inter-agent topologies.Based on the previous result that all agents opinions will converge almost surely for any initial states,the authors prove that the expected potential function of the convergence rate is upper bounded by a negative exponential function of time t when opinions reach consensus finally and is upper bounded by a negative power function of time t when opinions converge to several different limits.展开更多
基金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.
基金supported by the Young Scholars Development Fund of Southwest Petroleum University(SWPU)under Grant No.201499010050the Scientific Research Starting Project of SWPU under Grant No.2014QHZ032+1 种基金the National Natural Science Foundation of China under Grant No.61203141the National Key Basic Research Program of China(973 Program)under Grant No.2014CB845301/2/3
文摘This paper considers the convergence rate of an asymmetric Deffuant-Weisbuch model.The model is composed by finite n interacting agents.In this model,agent i’s opinion is updated at each time,by first selecting one randomly from n agents,and then combining the selected agent j’s opinion if the distance between j’s opinion and i’s opinion is not larger than the confidence radiusε0.This yields the endogenously changing inter-agent topologies.Based on the previous result that all agents opinions will converge almost surely for any initial states,the authors prove that the expected potential function of the convergence rate is upper bounded by a negative exponential function of time t when opinions reach consensus finally and is upper bounded by a negative power function of time t when opinions converge to several different limits.
