ad hoc网络中一种基于信任模型的机会路由算法

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

摘要/Abstract

摘要：

由于ad hoc网络具有缺乏足够的物理保护、拓扑结构动态变化、采用分布式协作、节点的带宽和计算能力有限等特点，导致传统的路由安全机制不再适合ad hoc网络路由协议的设计。最近当前研究热点之一的机会路由能够在链路不可靠的情况下充分利用无线广播和空间多样性的特性提高网络的吞吐量。因此，考虑在机会路由中引入信任相似性概念设计信任机会路由，建立了基于节点信任度和最小成本的信任机会转发模型，提出了最小成本的机会路由算法MCOR，并对算法进行了理论上的分析和证明。最后采用仿真实验对该算法进行验证，又与经典机会路由协议ExOR以及其他经典的信任路由协议TAODV和Watchdog-DSR进行性能对比。仿真结果表明，MCOR 算法能够防范恶意节点的攻击，在吞吐量、端到端时延、期望转发次数(ETX)和成本开销等方面都比其他3种协议表现出性能上的优势。

关键词: 信任相似性, 信任模型, 信任度, 机会路由, 机会路由成本

Abstract:

Due to the absence of enough physical protection,dynamic topology,distributed collaboration,the limited bandwidth and computing ability in ad hoc network,traditional routing security mechanism cannot adapt to the design of routing protocols.Recently,opportunistic routing is of the research hotspots,which can cope with the unreliable transmissions to improve throughput of the whole network by exploiting the broadcast nature of the wireless medium and spatial diversity of multi-hop wireless network.The concept of trust-based similarity in opportunistic routing for ad hoc network was incorporated,and a novel trusted opportunistic forwarding model based on trust degree of node and least cost of opportunistic routing were also built.Then a trusted minimum cost routing algorithm (MCOR) was proposed and the correctness and effectiveness of this algorithm from theoretical ana ysis were proved.Finally,MCOR algorithm was verified by simulation and was compared with the classic protocols:ExOR,TAODV and Watchdog-DSR.The simulation results show that MCOR scheme can detect and mitigate node misbehaviors.Furthermore,MCOR scheme outperforms the other protocols in terms of throughput,delay,expected ETX and cost of routing.

Key words: trust-based similarity, trust model, degree of trust, opportunistic routing, cost of opportunistic routing

王博,陈训逊. ad hoc网络中一种基于信任模型的机会路由算法[J]. 通信学报, 2013, 34(9): 92-104.

Bo WANG,Xun-xun CHEN. Opportunistic routing algorithm based on trust model for ad hoc network[J]. Journal on Communications, 2013, 34(9): 92-104.

图/表 14

图1

图2

图3

图4

图5

图6

图7

图8

图9

表1

图10

图11

图12

图13

参考文献 38

[1]	田克, 张宝贤, 马建 ,等. 无线多跳网络中的机会路由[J]. 软件学报, 2010,21(10): 2542-2553. TIAN K , ZHANG BX , MA J ,et al. Opportunistic routing protocols for wireless multihop networks[J]. Journal of Software, 2010,21(10): 2542-2553.
[2]	BISWAS S , MORRIS R . ExOR:opportunistic multi-hop routing for wireless networks[A]. Proceedings of ACM SIGCOMM[C]. Pennsylvania,USA, 2005. 133-144.
[3]	LU M M , WU J . Opportunistic routing algebra and its applications[A]. Proceedings of INFOCOM[C]. Riode Janeiro,Brazil, 2009. 2374-2382.
[4]	DUBOIS-FERRIERE H , GROSSGLAUSER M , VETTERLI M . Leastcost opportunistic routing[A]. Proceedings of 2007 Allerton Conference on Communication,Control,and Computing[C]. Monticello,USA, 2007. 1-8.
[5]	ZENG K , LUO W , ZHAI H . On end-to-end throughput of opportunistic routing in multirate and multihop wireless networks[A]. Proceedings of IEEE INFOCOM’08 Conference[C]. Phoenix,USA, 2008. 1490-1498.
[6]	ZHONG Z , NELAKUDITI S . On the efficacy of opportunistic routing[A]. Proceedings of SECON ’07[C]. San Diego,USA, 2007. 18-21.
[7]	LU M , LI F , WU J . Efficient opportunistic routing in utility-based ad hoc networks[J]. IEEE Trans Reliability, 2009,58(3): 485-495.
[8]	ZENG K , LOU W , ZHANG Y . Multi-rate geographic opportunistic routing in wireless ad hoc networks[A]. IEEE Milcom[C]. Orlando,USA, 2007. 1-7.
[9]	YANG Z Y , ZENG K , LOU W J . FSA:a fast coordination scheme for opportunistic routing[A]. Proceedings IEEE ICC 2009[C]. Dresden,Germany, 2009. 1-5.
[10]	CHACHULSKI S , JENNINGS M , KATTI S ,et al. Trading structure for randomness in wireless opportunistic routing[A]. Proceedings of ACM SIGCOMM[C]. Kyoto,Japan, 2007. 169-180.
[11]	CUI T , CHEN L , HO T ,et al. Opportunistic source coding for data gathering in wireless sensor networks[A]. Proceedings of MASS[C]. Pisa,Italy, 2007. 1-10.
[12]	ZUBOW A , KURTH M , REDLICH J P . Multi-channel opportunistic routing[A]. Proceedings of IEEE European Wireless[C]. Paris,France, 2007. 1-7.
[13]	LI Y H , CHEN W , ZHANG Z L . Optimal forwarder list selection in opportunistic routing[A]. Proceedings of MASS[C]. Pisa,Italy, 2007. 670-675.
[14]	ZHANG C , ZHOU M C , YU M . ad hoc network security:a review[J]. Int J Commun Syst, 2007,20(8): 909-925.
[15]	LI X Q , LYU M R . A trust model based routing protocol for secure ad hoc networks[A]. Proc of IEEE Aerospace Conference[C]. Big Sky,Montana,USA, 2004. 1266-1295.
[16]	MARTI S , GIULI T , LAI K ,et al. Mitigating routing misbehavior in mobile ad hoc networks[A]. Proc of MobiCom’00[C]. New York:ACM,USA, 2000. 255-265.
[17]	COUTO D D , AGUAYO D , BICKET J ,et al. A high-throughput path metric for multi-hop wireless routing[A]. Proc of IEEE/ACM MOBICOM[C]. San Diego,USA, 2003. 134-146.
[18]	LUO J H , LIU X , FAN M Y . A trust model based on fuzzy recommendation for mobile ad-hoc networks[J]. Computer Networks, 2009,53(14): 2396-2407.
[19]	LUO J,LIU X , ZHANG Y , et a l . Fuzzy trust recommendation based on collaborative filtering for mobile ad-hoc networks[A]. Proc of the 33rd IEEE Conference on Local Computer Networks (LCN 2008)[C]. Montreal,Canada, 2008. 305-311.
[20]	GONG W , YOU Z Y , CHEN D N ,et al. Trust based routing for misbehavior detection in ad hoc networks[J]. Journal of Networks, 2010,5(5): 551-558.
[21]	DAI H J , JIA Z P , QIN Z W . Trust evaluation and dynamic routing decision based on fuzzy theory for MANETs[J]. Journal f Software, 2009,4(10): 1091-1101.
[22]	LI J , LI R , KATO J . Future trust management framework for mobile ad hoc networks[J]. IEEE Communications Magazine, 2008,46(4): 108-114.
[23]	OMAR M , CHALLAL Y , BOUABDALLAH A . Reliable and fully distributed trust model for mobile ad hoc networks[J]. Computer Security, 2009,28(3): 199-214.
[24]	MILLAN G L , PEREZ M G , PEREZ G M ,et al. PKI-based trust management in inter-domain scenarios[J]. Computer Security, 2010,29(2): 278-290.
[25]	LI F , WU J . Uncertainty modeling and reduction in MANETs[J]. IEEE Transaction on Mobile Computing, 2010,9(7): 1035-1048.
[26]	陈深龙, 张玉清 . 增强ad hoc网络可生存性的健壮多维信任模型[J]. 通信学报, 2010,31(5): 1-9. CHEN S L , ZHANG Y Q . Robust multi-dimensional trust model for improving the survivability of ad hoc networks[J]. Journal on Communications, 2010,31(5): 1-9.
[27]	PENG S C , JIA W J , WANG G J ,et al. Trusted routing based on dynamic trust mechanism in mobile ad-hoc networks[J]. IEICE Trans on Information and Systems, 2010,E93-D(3): 510-517.
[28]	ESCH J . A survey of trust and reputation management systems in wireless communications[A]. Proceedings of the IEEE[C]. 2010.98(10): 1755-1772.
[29]	RAZA I , HUSSAIN S A . Identification of malicious nodes in an AODV pure ad hoc network through guard nodes[J]. Computer Communications, 2008,31(9): 1796-1802.
[30]	LI X , JIA Z , ZHANG P ,et al. Trust-based on-demand multipath routing in mobile ad hoc networks[J]. IET Information Security, 2010,41(4): 212-232.
[31]	WANG F , WANG F R , HUANG B X ,et al. COSR:a reputation-based secure route protocol in MANET[J]. EURASIP Journal on reless Communications and Networking, 2010,2010: 1-10.
[32]	PIRZADA A A , MCDONALD C , DATTA A . Performance comparison of trust-based reactive routing protocols[J]. IEEE Transactions on Mobile Computing, 2006,5(6): 695-710.
[33]	LETOR N , CLEYN P D , BLONDIA C . Enabling cross layer de:adding the mad Wi-Fi extensions to nsclick[A]. Proc the First International Workshop on Network Simulation Tools 2007[C]. Nantes,France, 2007. 1-10.
[34]	KOHLER E,MORRIS R , CHEN B , et a l . The click modular router[J]. ACM Trans on Computer Systems, 2000,18(3): 263-297.
[35]	The network simulator-ns-2[EB/OL]. , 2012.
[36]	WAXMAN BERNARD M . Routing of multipoint connections[J]. IEEE Journal on Selected Areas in Communications, 1988,6(9): 1617-1622.
[37]	WANG B , CHEN X X . An efficient trust-based opportunistic routing for ad hoc networks[A]. Proc of WCSP 2012,IEEE Communications Society[C]. Huangshan,China, 2012. 1-7.
[38]	WANG B , HUANG C H . Trust-based minimum cost opportunistic routing for ad hoc networks[J]. Journal of Systems and Software, 2011,84(12): 2107-2122.

参数	表示的意义	取值
Area	网络拓扑区域	1 000 m_×1 000 m
N	网络中的节点个数	50
r	节点的传输半径	250 m
S	节点的最大移动速度	20 m/s
P	数据负载大小	512 byte/packet
a	T^d(i,j)的权重因子	0.6
β	T^r(i,j)的权重因子	0.4
△t	信任更新周期	0.2 s
T	仿真时间	500 s
M	恶意节点个数	1~20
T_threshold	网络中的信任度阈值	0.6
RF	成功交互的奖励比例	0.8
PF	失败交互的惩罚比例	0.2