基于免疫信息SV捎带的机会网络低开销路由算法

doi:10.3969/j.issn.1000-436x.2014.10.010

Abstract

Abstract:

A novel routing algorithm,LRPI (low-overhead routing with piggybacked immunity information) was proposed.LRPI contains the following four new mechanisms:piggybacking the immune information with SV(summary vectors),fast generation of the immune information through a cross-layer method,an improved exchange mechanism of SV,and adaptive compression of SV.Based on the above new mechanism,LRPI not only avoids using special data structure but also can achieve the same immune function more quickly.Theoretical analysis and simulation results show that LRPI outperforms the classical epidemic routing algorithm and a few of its improvements in terms of control overhead,the number of saved packets,and average end-to-end delay.

Key words: opportunistic networks, routing algorithms, immune mechanisms, overhead

Zhi REN,Cong CHEN,Ya-nan CAO,Chen PENG,Qian-bin CHEN. Low-overhead routing algorithm for opportunistic networks based on immunity information piggybacked by SV[J]. Journal on Communications, 2014, 35(10): 81-88.

Figures/Tables 12

References 11

[1]	熊永平, 孙利民, 牛建伟 ,等. 机会网络[J]. 软件学报, 2009,20(1): 124-137. XIONG Y P , SUN L M , NIU J W ,et al. Opportunistic networks[J]. Journal of Software, 2009,20(1): 124-137.
[2]	STAVROULAKI V , TSAGKARIS K , LOGOTHETIS M ,et al. Opportunistic networks[J]. IEEE Vehicular Technology Magazine, 2011,6(3): 52-59.
[3]	任智, 黄勇, 陈前斌 . 机会网络路由协议[J]. 计算机应用, 2010,30(3): 723-728. REN Z , HUANG Y , CHEN Q B . Routing protocols for opportunistic networks[J]. Journal of Computer Applications, 2010,30(3): 723-728.
[4]	VAHDAT A , BECKER D . Epidemic Routing for Partially Connected Ad Hoc Networks[R]. Technical Report CS-2000-06,Duke University,Durham, 2000
[5]	MATSUADA T , TAKINE T . (p,q)-Epidemic routing for sparsely populated mobile ad hoc networks[J]. IEEE Journal on Selected Areas in Communications, 2008,26(5): 783-793.
[6]	TOWER J P , LOTTLE T D C . A proposed scheme for epidemic routing with active curing for opportunistic networks[A]. The 22th International Conference on Advanced Information Networking and Applications Workshops[C]. 2008. 1696-1701.
[7]	JIN Z , ZHAO X , LUO Y ,et al. Adaptive priority routing with ACK_mechanism for DTN networks[A]. Proceedings of the 2009 IEEE International Conference on Wireless Communications and Signal Processing[C]. Nanjing,China, 2009. 1-5.
[8]	王汝言, 金勇, 吴大鹏 ,等. 面向机会网络的自适应冗余副本删除机制[J]. 重庆邮电大学学报:自然科学版, 2013,25(1): 59-63,74. WANG R Y , JIN Y , WU D P ,et al. Adaptive redundant message deletion mechanism for opportunistic networks[J]. Journal of Chongqing University of Posts and Telecommunications, 2013,25(1): 59-63,74.
[9]	任智, 黄勇, 曹建玲 ,等. 基于邻居信息交换的机会网络低时延路由算法[J]. 华中科技大学学报(自然科学版), 2011,39(2): 94-97. REN Z , HUANG Y , CAO J L ,et al. Low-delay routing algorithm for opportunistic networks by exchanting the neighborhood information[J]. Journal of Huazhong University of Science and Technology(Nature Science), 2011,39(2): 94-97.
[10]	赵广松, 陈鸣 . 自私性机会网络中激励感知的内容分发的研究[J]. 通信学报, 2013,34(2): 73-84. ZHAO G S , CHEN M . Research of incentine-aware data dissemination in selfish opportunistic networks[J]. Journal on Communications, 2013,34(2): 73-84.
[11]	WU F , CHEN T , ZHONG S . A game-theoretic approach to stimulate cooperation for probabilistic routing in opportunistic networks[J]. IEEE Transactions on Wireless Communications, 2013,12(4): 1573-1583.

Metrics

Recommended 0

No Suggested Reading articles found!

参数	数值
仿真场景	3 000 m×300 m
节点运动速度/(m·s^?1)	1～20
传输速率/(Mbit·s^?1)	54
节点个数	100
分组产生间隔/s	1
节点通信半径/m	10,25,50,75,100
仿真时间/s	4 000

[1]	Zhiguo SUN, Xinyue REN, Zengmao CHEN, Ming DIAO. Cooperative spectrum sensing method and performance analysis based on similarity between evidences [J]. Journal on Communications, 2020, 41(12): 139-147.
[2]	Jian-sheng YAO,Chun-guang MA,Qi YUAN. Utility-based barter trade incentive scheme in opportunistic network [J]. Journal on Communications, 2016, 37(9): 102-110.
[3]	Zhi REN,Yong-yin TAN,Ji-bi LI,Qian-bin CHEN. Reliable selfish node detection algorithm for opportunistic networks [J]. Journal on Communications, 2016, 37(3): 1-6.
[4]	Yi SUN,Lu-kun ZENG,Xin WU,Jun LU,Yue SUN. Timing synchronization algorithm based on clock skew estimation for WSN [J]. Journal on Communications, 2015, 36(9): 26-33.
[5]	Zhi REN,Jian-wei SUO,Wen-peng LIU,Hong-jiang LEI,Qian-bin CHEN. High-throughput and low-overhead probabilistic routing based on multi-player bargaining game for opportunistic networks [J]. Journal on Communications, 2015, 36(6): 41-48.
[6]	Da-peng WU,Peng-wen LOU,Qiao-shou LIU,Yu XIONG,Ru-yan WANG. Coding redundancy controlled data forwarding mechanism in opportunistic networks [J]. Journal on Communications, 2015, 36(3): 63-74.
[7]	. Low-overhead routing algorithm for opportunistic networks based on immunity information piggybacked by SV [J]. Journal on Communications, 2014, 35(10): 10-88.
[8]	. Period dividing opportunistic networks mobility model based on human realistic scenarios [J]. Journal on Communications, 2013, 34(Z1): 24-189.
[9]	Gang CHENG,Yun-yong ZHANG,Yong ZHANG,Mei SONG. Period dividing opportunistic networks mobility model based on human realistic scenarios [J]. Journal on Communications, 2013, 34(Z1): 182-189.
[10]	Zhi REN,Zhi-hu LIU,Yu-kun YAO,Qian-bin CHEN. Efficient routing algorithm for opportunistic networks based on network coding [J]. Journal on Communications, 2013, 34(9): 16-23.
[11]	Da-peng WU,Pu-ning ZHANG,Ru-yan WANG. Connection status aware cost efficient message transmission mechanism in opportunistic networks [J]. Journal on Communications, 2013, 34(3): 44-52.
[12]	Guo-qi XIE,Ren-fa LI,Fan YANG,Wei-hong HUANG. Multiple DAG off-line task scheduling for heterogeneous networked automobile electronic systems [J]. Journal on Communications, 2013, 34(12): 20-32.
[13]	Yu-bao WANG,Shao-yu ZHI. Study of FEC at edge node of optical code label switching network [J]. Journal on Communications, 2012, 33(5): 72-78.
[14]	Xi CHEN,Guang-song LI,You-liang TIAN,Jian-feng MA. On-demand key management based on social attribute for opportunistic networks [J]. Journal on Communications, 2012, 33(12): 93-99.
[15]	Lei HAN,Ji-qiang LIU,Zhen HAN,Xue-ye WEI. Pre-distribution asymmetric key management scheme for mobile ad hoc networks [J]. Journal on Communications, 2012, 33(10): 26-34.

Low-overhead routing algorithm for opportunistic networks based on immunity information piggybacked by SV

RichHTML

PDF

Knowledge

Cited

Abstract

Cite this article

share this article

Figures/Tables 12

References 11

Related Articles 15

Metrics

Recommended 0

节点通信半径/m		数据分组传送成功率/%
节点通信半径/m	Epidemic	APRA	Immunity	LRPI
10	100	100	100	100
25	100	100	100	100
50	100	100	100	100
75	100	100	100	100
100	100	100	100	100