Data forwarding in intermittently connected wireless networks requires multiple nodes to complete in a collaborative manner. However, malicious nodes can spread false recommendation information, which is able to seriously affect the choice of relay nodes. To address this issue, this paper proposes a data forwarding mechanism that can detect the forged data produced by malicious recommendation nodes by using the consistency of interactive list. Furthermore, to aim at differences of the recommendation information, this paper filters the error recommendation information to accurately evaluate the trust relationship between two nodes by the outlier detection method. Meanwhile, this paper also achieves the efficient data forwarding by selecting the relay nodes accurately based on similarities between a meeting node and a destination node. At last, the simulation contrastive analysis shows that the proposed mechanism can resist the malicious recommendation information effectively and improve the data delivery rate compared with other typical algorithms.
YANG Peng，JING Shangqi，YAN Junjie，YANG Zhigang
. Defending Bad Mouthing Attack Data Forwarding Mechanism for
Intermittently Connected Wireless Networks[J]. Journal of Shanghai Jiaotong University, 2018
, 52(7)
: 808
-815
.
DOI: 10.16183/j.cnki.jsjtu.2018.07.008
［1］WU D P, ZHANG P N, WANG H G, et al. Node service ability aware packet forwarding mechanism in intermittently connected wireless networks［J］. IEEE Transactions on Wireless Communications, 2016, 15(12): 8169-8181.
［2］WU D P, WANG Y Y, WANG H G, et al. Dynamic coding control in social intermittent connectivity wireless networks［J］. IEEE Transaction on Vehicular Technology, 2016, 65(9): 7634-7646.
［3］LI Q, CAO G. Mitigating routing misbehavior in disruption tolerant networks［J］. IEEE Transaction on Information Forensics & Security, 2012, 7(2): 664-675.
［4］LI N, DAS S K. A trust-based framework for data forwarding in opportunistic networks［J］. Ad Hoc Networks, 2013, 11(4): 1497-1509.
［5］CHEN I R, BAO F, CHANG M J, et al. Dynamic trust management for delay tolerant networks and its application to secure routing［J］. IEEE Transaction on Parallel & Distributed Systems, 2014, 25(5): 1200-1210.
［6］YAO L, MAN Y, HUANG Z, et al. Secure routing based on social similarity in opportunistic networks［J］. IEEE Transaction on Wireless Communications, 2016, 15(1): 594-605.
［7］AYDAY E, FEKRI F. An iterative algorithm for trust management and adversary detection for delay-tolerant networks［J］. IEEE Transaction on Mobile Computing, 2012, 11(9): 1514-1531.
［8］SHABUT A M, DAHAL K P, BISTA S K, et al. Recommendation based trust model with an effective defence scheme for MANETs［J］. IEEE Transaction on Mobile Computing, 2015, 14(10): 2101-2115.
［9］ZHANG L, QIN Y Y, ZHANG J L. Study of polynomial curve fitting algorithm for outlier elimination［C］∥International Conference on Computer Science and Service System. Nanjing, China: IEEE, 2011: 760-762.
［10］CHEN X, SHANG C, WONG B, et al. Efficient multicast algorithms in opportunistic mobile social networks using community and social features［J］. Computer Networks, 2016, 11: 71-81.
［11］LI Q H, ZHU S C, CAO G H. Routing in socially selfish delay tolerant networks［C］∥2010 Proceedings IEEE INFOCOM. San Diego, USA: IEEE, 2010: 857-865.
［12］ZHU H, DU S, GAO Z, et al. A probabilistic misbehavior detection scheme toward efficient trust establishment in delay-tolerant networks［J］. IEEE Transaction on Parallel & Distributed Systems, 2014, 25(1): 22-32.
