|
|
Malicious Node Tolerant Packet Forwarding Mechanism for Intermittently Connected Wireless Network |
Wu Da-peng Feng Yu Wang Ru-yan Liu Qiao-shou |
(Broadband Ubiquitous Network Research Laboratory, Chongqing University of Posts and Telecommunications, Chongqing 400065, China) |
|
|
Abstract Packets in ICWN (Intermittently Connected Wireless Network) are delivered in a cooperation manner between nodes, which means the existence of malicious nodes will degrade the network performance. A malicious node tolerant message forwarding mechanism is proposed in this paper. By exploiting the historical node behavior information, directly observed information is combined with the recommendation information from neighbor nodes to perceive malicious node behavior according to the dynamical reputation threshold. Consequently, evidence theory is utilized to quantify the node relation to detect malicious nodes, and then the optimal relay nodes selecting can be achieved. Results show that, under the attack of collaborating malicious nodes, malicious nodes can be accurately identified by the proposed mechanism, which leads to the notably improving packet delivery ratio and average delay.
|
Received: 15 September 2014
Published: 02 June 2015
|
|
Corresponding Authors:
Wu Da-peng
E-mail: wudapengphd@gmail.com
|
|
|
|
[1] |
熊永平, 孙利民, 牛建伟, 等. 机会网络[J]. 软件学报, 2009, 20(1): 124-137.
|
|
Xiong Yong-ping, Sun Li-min, Niu Jian-wei, et al.. The opportunity networks[J]. Journal of Software, 2009, 20(1): 124-137.
|
[2] |
Mota V, Cunha F, Macedo D, et al.. Protocols, mobility models and tools in opportunistic networks: a survey[J]. Computer Communications, 2014, 48(15): 5-19.
|
[3] |
Li Y, Su G, and Wang Z. Evaluating the effects of node cooperation on DTN routing[J]. Journal of Electronics and Communications, 2012, 66(1): 62-67.
|
[4] |
Govindan K and Mohapatra P. Trust computations and trust dynamics in mobile ad hoc networks: a survey[J]. IEEE Communications Surveys & Tutorials, 2012, 14(2): 279-298.
|
[5] |
Lu R, Lin X, Zhu H, et al.. Pi: a practical incentive protocol for delay tolerant networks[J]. IEEE Transactions on Wireless Communications, 2010, 9(4): 1483-1493.
|
[6] |
Buttyán L and Hubaux J P. Enforcing service availability in mobile Ad-hoc WANs[C]. Proceedings of the 1st ACM International Symposium on Mobile ad Hoc Networking & Computing, Boston, MA, USA, 2000: 87-96.
|
[7] |
Zhong S, Chen J, and Yang Y R. Sprite: a simple, cheat-proof, credit-based system for mobile Ad-hoc networks[C]. INFOCOM 2003 Twenty-Second Annual Joint Conference of the IEEE Computer and Communications, San Francisco, CA, USA, 2003, 3: 1987-1997.
|
[8] |
Rius J, Cores F, and Solsona F. A new credit-based incentive mechanism for P2P scheduling with user modeling[C]. First International Conference on Advances in P2P Systems, Sliema, Malta, 2009: 85-91.
|
[9] |
Felegyhazi M, Hubaux J P, and Buttyan L. Nash equilibria of packet forwarding strategies in wireless ad hoc networks[J]. IEEE Transactions on Mobile Computing, 2006, 5(5): 463-476.
|
[10] |
Altman E, Kherani A A, Michiardi P, et al.. Non-cooperative Forwarding in Ad-hoc Networks[M]. Springer Berlin Heidelberg, 2005: 486-498.
|
[11] |
Wang C, Chen L, Chen H, et al.. Incentive mechanism based on game theory in P2P networks[C]. Second International Conference on Information Technology and Computer Science (ITCS), Kiev, Ukraine, 2010: 190-193.
|
[12] |
Dini G and Lo Duca A. Towards a reputation-based routing protocol to contrast black holes in a delay tolerant network[J]. Ad Hoc Networks, 2012, 10(7): 1167-1178.
|
[13] |
Djamaludin C, Foo E, and Corke P. Establishing initial trust in autonomous Delay Tolerant Networks without centralised PKI[J]. Computers & Security, 2013, 39(4): 299-314.
|
[14] |
田春岐, 邹仕洪, 田慧蓉, 等. 一种基于信誉和风险评价的分布式P2P信任模型[J]. 电子与信息学报, 2007, 29(7): 1628-1632.
|
|
Tian Chun-qi, Zou Shi-hong, Tian Hui-rong, et al.. A new trust model based on reputation and risk evaluation for P2P networks[J]. Journal of Electronics & Information Technology, 2007, 29(7): 1628-1632.
|
[15] |
Govindan K and Mohapatra P. Trust computations and trust dynamics in mobile adhoc networks: a survey[J]. IEEE Communications Surveys & Tutorials, 2012, 14(2): 279-298.
|
[16] |
Denko M K, Sun T, and Woungang I. Trust management in ubiquitous computing: a Bayesian approach[J]. Computer Communications, 2011, 34(3): 398-406.
|
[17] |
Iltaf N, Ghafoor A, and Zia U. A mechanism for detecting dishonest recommendation in indirect trust computation[J]. EURASIP Journal on Wireless Communications and Networking, 2013(1): 1-13.
|
[18] |
Wang X, Liu L, and Su J. Rlm: a general model for trust representation and aggregation[J]. IEEE Transactions on Services Computing, 2012, 5(1): 131-143.
|
[19] |
Ferraz L, Velloso P, and Duarte O. An accurate and precise malicious node exclusion mechanism for Ad hoc networks[J]. Ad Hoc Networks, 2014, 19(3): 142-155.
|
|
|
|