Intelligent Anti-Theft Finding Scheme Towards iTrust Establishment in Delay Tolerant Networks Using VANET
Keywords:
VANET, ITRUSTED, DTNSAbstract
Malicious and selfish behaviors represent a serious threat against routing in Delay/Disruption Tolerant Networks (DTNs). Due to the unique network characteristics, designing a misbehavior detection scheme in DTN is regarded as a great challenge. In this paper, we propose iTrust, a probabilistic misbehavior detection scheme, for secure DTN routing towards efficient trust establishment. The basic idea of iTrust is introducing a periodically available Trusted Authority (TA) to judge the node’s behavior based on the collected routing evidences and probabilistically checking. A new VANET-based smart parking scheme (SPARK) for large parking lots provide three convenient services for drivers: 1) real-time parking navigation; 2) intelligent anti-theft protection; and 3) friendly parking information dissemination. TA could ensure the security of DTN routing at a reduced cost. To further improve the efficiency of the proposed scheme, we correlate detection probability with a node’s reputation, which allows a dynamic detection probability determined by the trust of the users. The extensive analysis and simulation results show that the proposed scheme substantiates the effectiveness and efficiency of the proposed scheme.
References
R. Lu, X. Lin, H. Zhu, and X. Shen, “SPARK: A New VANET-based Smart Parking Scheme for Large Parking Lots”, IEEE INFOCOM’09, April 2009.
A. Lindgren, A. Doria, and O. Schelen, “Probabilistic routing in intermittently connected networks”,ACM SIGMOBILE CCR, vol. 7, no. 3, pp. 19–20, 2003.
E.Daly and M. Haahr, “Social network analysis for routing in disconnected delay-tolerant MANETs, ”Proc. MobiHoc, pp. 32–40, 2007.
J. J. Jaramillo and R. Srikant, “Darwin: Distributed and adaptive Reputation mechanism for wireless ad-hoc networks” , Proc. MobiCom, 2007.
H.Zhu, X.Lin, R.Lu, Y.Fan and X. Shen,“SMART:A Secure Multilayer Credit -Based Incentive Scheme for Delay-Tolerant Networks,” IEEE vol.58,no.8,pp.828-836,2009.
S.Reidt, M.Srivatsa, S.Balfe,“The Fable of the Bees: Incentivizing Robust Revocation Decision Making in Ad Hoc Networks” inCCS’09,2009.
E. Ayday, H. Lee and F. Fekri,“Trust Management and Adversary Detection for Delay Tolerant Networks,” inMilcom’10, 2010.
B.B.Chen, M.C.Chan,“Mobicent:a Credit-Based Incentive System for Disruption Tolerant Network” IEEE INFOCOM’2010.
A. Balasubramanian, B. N. Levine, and A. Venkataramani, “Dtn routing as a resource allocation problem,”Proc. ACM SIGCOMM, 2007.
M. Dawande, J. Kalagnanam, P. Keskinocak, R. Ravi, and F. Salman, “Approximation algorithms for the multiple knapsack problem with assignment restrictions,”Journal of Combinatorial Optimization,vol.4, pp. 171–186, 2000.
M. Granovetter, “The strength of weak ties,” The American Journal of Sociology, vol. 78, no. 6, 1973.
A. Mislove, M. Marcon, K. P. Gummadi, Druschel, and Bhattacharjee, “Measurement and analysis of online social networks,”Proc. IMC, 2007.
E. Gilbert and K. Karahalios, “Predicting tie strength with social media,”Proc. CHI, 2009.
P. Hui, J. Crowcroft, and E. Yoneki, “Bubble rap: social-based forwarding in delay tolerant networks,” Proc. MobiHoc, pp. 241–250, 2008.
V. Erramilli, A. Chaintreau, M. Crovella, and C. Diot, “Delegation Forwarding,”Proc. MobiHoc, 2008.
Downloads
Published
How to Cite
Issue
Section
License
This work is licensed under a Creative Commons Attribution 4.0 International License.
Authors contributing to this journal agree to publish their articles under the Creative Commons Attribution 4.0 International License, allowing third parties to share their work (copy, distribute, transmit) and to adapt it, under the condition that the authors are given credit and that in the event of reuse or distribution, the terms of this license are made clear.
