机会网络下基于信任机制的改进Epidemic算法

doi:10.11959/j.issn.2096-109x.2017.00187

Chinese Journal of Network and Information Security ›› 2017, Vol. 3 ›› Issue (8): 1-7.doi: 10.11959/j.issn.2096-109x.2017.00187

• Papers • Next Articles

Improved Epidemic algorithm based on trust mechanism in opportunistic networks

Guang-hua ZHANG^1,²(),Shao-bo PANG²,Yao-hong YANG²,Zhen-guo CHEN³

¹ State Key Laboratory of Integrated Services Networks,Xidian University,Xi’an 710071,China
² College of Information Science and Engineering,Hebei University of Science and Technology,Shijiazhuang 050000,China
³ Hebei Engineering Technology Research Center for IOT Data Acquisition ＆Processing,North China Institute of Science and Technology,Sanhe 065201,China

Revised:2017-07-02 Online:2017-08-01 Published:2017-12-26
Supported by:
The National Natural Science Foundation of China(61572255);The University Scientific Research Foundation of Hebei Province(YQ2014036);The University Scientific Research Foundation of Hebei Province(QN2017062);The Technology Research and Development Program of Hebei Province(15210338);The Technology Research and Development Program of Hebei Province(15210703)

Abstract

Abstract:

Aiming at the problem of routing reliability caused by Epidemic algorithm,an improved Epidemic algorithm based on trust mechanism was proposed.Through the establishment of trust mechanism between nodes,this mechanism can provide sufficient trusted nodes as the next hop node of message forwarding,and can promote that the Epidemic algorithm performs the limited scope of flooding under the constraint of trust mechanism.Simulation results and analysis show that the improved Epidemic algorithm can avoid the network congestion caused by flooding mechanism,and the reliability of routing and transmission performance are improved to some extent.

Key words: opportunistic network, network congestion, trust mechanism, Epidemic algorithm

CLC Number:

TP393

Guang-hua ZHANG,Shao-bo PANG,Yao-hong YANG,Zhen-guo CHEN. Improved Epidemic algorithm based on trust mechanism in opportunistic networks[J]. Chinese Journal of Network and Information Security, 2017, 3(8): 1-7.

Figures/Tables 7

References 16

[1]	PELUSI L , PASSARELLA A , CONTI M . Opportunistic networking:data forwarding in disconnected mobile ad hoc networks[J]. Communications Magazine, 2006,44(11): 134-141.
[2]	BOLDRINI C , LEE K , ?NEN M ,et al. Opportunistic networks[J]. Computer Communications, 2014,48(14): 1-4.
[3]	WU Q W , LIU Q Z , ZHANG L ,et al. A trusted routing protocol based on GeoDTN plus Nav in VANET[J]. China Communications, 2014,11(s2): 166-174.
[4]	XIONG Y P , SUN L M , NIU J W ,et al. Opportunistic networks[J]. Journal of Software, 2009,20(1): 124-137.
[5]	TEERAPONG C , WORRAWAT N , SUMET P . An efficient spreading epidemic routing for delay-tolerant network[C]// The 13th IEEE Annual Consumer Communications ＆ Networking Conference (CCNC). 2016: 473-476.
[6]	MA H D , YUAN P Y , ZHAO D . Research progress on routing problem in mobile opportunistic networks[J]. Journal of Software, 2015,26(3): 600-616.
[7]	CHEN Z S , CHEN C . Self-stopping epidemic routing in cooperative wireless mobile sensor networks[C]// The IEEE 12th International Conference on Wireless and Mobile Computing,Networking and Communications (WiMob). 2016: 1-7.
[8]	HEEJUNG B , JUNGMIN S . Node scheduling control inspired by epidemic theory for data dissemination in wireless sensor-actuator networks with delay constraints[J]. IEEE Transactions on Wireless Communications, 2016,15(3): 1794-1807.
[9]	AHMED E O , KHALID R , MOHAMED E K ,et al. Optimal content caching for epidemic routing in delay tolerant networks[C]// International Conference on Wireless Networks and Mobile Communications (WINCOM). 2016: 220-224.
[10]	SUN H F , SONG L L . Performance analysis of epidemic routing in 1-d linear sparse VANETs[J]. IEEE Communications Letters, 2016,20(10): 2087-2090.
[11]	ZHANG F , WANG X M , LIN Y G ,et al. Adaptive adjustments of n-Epidemic routing protocol for opportunistic networks[C]// 2015 IEEE International Conference on Progress in Informatics and Computing (PIC). 2015: 487-491.
[12]	BHED B B , . Improving energy consumption of epidemic routing in delay tolerant networks[C]// The 10th International Conference on Innovative Mobile and Internet Services in Ubiquitous Computing (IMIS). 2016: 278-283.
[13]	GUO D , CHENG G , ZHANG Y ,et al. Data distribution mechanism over opportunistic networks with limited epidemic[J]. China Communications, 2015,12(6): 154-163.
[14]	SOHEIL E , KHOUZANI M , SASWATI S ,et al. Optimal energy-aware epidemic routing in DTNs[J]. Transactions on Automatic Control, 2015,60(6): 1554-1569.
[15]	ZHANG Y X , HE J S , ZHAO B ,et al. A privacy protection model base on game theory[J]. Chinese Journal of Computers, 2016,39(3): 615-627.
[16]	TETSUYA O , DONALD E , EVJOLA S ,et al. A simulation system based on one and SUMO simulators:performance evaluation of direct delivery,epidemic and energy aware epidemic DTN protocols[C]// The 18th International Conference on Network-Based Information Systems. 2015: 418-423.

Metrics

Recommended 0

No Suggested Reading articles found!

节点类型		中间节点
节点类型	判定条件	获得转发机会	未获得转发机会
目的节点	是	V_in(n=1)	0
目的节点	否	V_in(n≠1)	0

参数名称	参数设置	参数名称	参数设置
模拟时间	24 h	节点移动速度	0.5～1.5 m/s
区域范围	4×3.5 km	传输速度	250 kB/s
传输方式	蓝牙	传输范围	10 m
缓存大小	10 MB	消息大小	0.5～1 MB
生存周期	2h	α	0.5
生成频度	30 s	β	10

Improved Epidemic algorithm based on trust mechanism in opportunistic networks

RichHTML

PDF下载

Knowledge

Abstract

Cite this article

share this article

Figures/Tables 7

References 16

Related Articles 1

Metrics

Recommended 0