CFP last date
20 May 2024
Reseach Article

Reputation and Plausibility Verification based System for Providing Secure Vehicular Networks

by V.S. Saranya, R. Saminathan
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 128 - Number 3
Year of Publication: 2015
Authors: V.S. Saranya, R. Saminathan
10.5120/ijca2015906500

V.S. Saranya, R. Saminathan . Reputation and Plausibility Verification based System for Providing Secure Vehicular Networks. International Journal of Computer Applications. 128, 3 ( October 2015), 47-51. DOI=10.5120/ijca2015906500

@article{ 10.5120/ijca2015906500,
author = { V.S. Saranya, R. Saminathan },
title = { Reputation and Plausibility Verification based System for Providing Secure Vehicular Networks },
journal = { International Journal of Computer Applications },
issue_date = { October 2015 },
volume = { 128 },
number = { 3 },
month = { October },
year = { 2015 },
issn = { 0975-8887 },
pages = { 47-51 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume128/number3/22857-2015906500/ },
doi = { 10.5120/ijca2015906500 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T23:20:30.673211+05:30
%A V.S. Saranya
%A R. Saminathan
%T Reputation and Plausibility Verification based System for Providing Secure Vehicular Networks
%J International Journal of Computer Applications
%@ 0975-8887
%V 128
%N 3
%P 47-51
%D 2015
%I Foundation of Computer Science (FCS), NY, USA
Abstract

In a Vehicular Ad Hoc Network (VANET), node cooperation in packet forwarding is required for the network to function properly. However, since nodes in this networks usually have limited resources, some selfish nodes might intend not to forward packets to save resources for their own use. To discourage such behaviour, we propose a reputation and plausibility verification based system to detect selfish nodes and isolate them. The trustworthiness of the messages are decided upon using sensors, decision making phase and the previous trust value of the node. In the proposed work, depending upon the kind of reputation information a source is attributed with a sender-based reputation level. Only if the event is thought to be prevalent, the trust opinion generator announces this event to the applications. First a node checks whether the event is in its own detection range. If not the decision is made on either the rule of majority or on the trust levels already assigned to the nodes. In case the event is not prevalent, the proposed algorithm also sends a malicious intent information packet in order to inform the neighbour nodes about the detection of a malicious activity. It is likely to be susceptible to more sophisticated attacks, such as collision attacks, because the situation-oriented reputation level allows long-lasting groups of attackers to manipulate a node’s reputation database. The proposed algorithm is better equipped to handle such attacks. It can detect at least such attacks if the node is itself in the detection range. It eliminates attacks pertaining to false event generation completely by utilizing the plausibility of data collected through sensors as well as the trust value of the sending nodes. Reputation value based on mobility is contributed. If the neighbour is having high stability its reputation value is increased..

References
  1. M. Raya and J. P. Hubaux, “Securing vehicular ad hoc networks,” J, Comput. Security, vol. 15, no. 1, pp. 39–68, 2007
  2. P. Papadimitrators, L. Buttyan, T. Holczer, E. Schoch, J. Freudiger, M. Raya, Z. Ma, F. Kargl, A. Kung, and J.-P. Hubaux, “Secure vehicular communications systems: Design and architecture,” IEEE Commun. Mag., vol. 46, no. 11, pp. 100–109, Nov. 2008.
  3. C. Harsch, A. Festag, and P. Papadimitratos, “Secure position-based routing for VANETs,” in Proc. Veh. Technol. Conf., 2007, pp. 26–30.
  4. F. Dotzer, L. Fischer, and P. Magiera, “VARS: A vehicle ad-hoc network reputation system,” in Proc. 6th IEEE Int. Symp. World Wireless Mobile Multimedia Netw., Jun. 2005, pp. 454–456.
  5. Rafael Marin-Perez, Pedro M. Ruiz, “SBGR: A Simple Self-Protected Beaconless Geographic Routing for Wireless Sensor Networks”
  6. A. A. Wagan, B. M. Mughal, and H. Hasbullah, “VANET security framework for trusted grouping using TPM hardware,” in Proc. 2nd Int. Conf. Commun. Softw. Netw., Feb. 2010, pp. 309–312.
  7. G. Calandriello, P. Papadimitratos, A. Lioy, and J. P. Hubaux, “Efficient and robust pseudonymous authentication in VANET,” in Proc. ACM Mobicom, Montreal, QC, Canada, Sep. 2007, pp. 19–28
  8. TeerawatIssariyakul, EkramHossain, “Introduction to Network Simulator NS2” Springer,2009.
  9. G. Philippe, G. Dan, and S. Jessica, “Detecting and correcting malicious data in VANETs,” in Proc. 1st ACM Int. Workshop Veh. Ad Hoc Netw., 2004, pp. 29–37.
  10. R. Lu, X. Lin, H. Zhu, P. H. Ho, and X. Shen, “ECPP : Efficient condition privacy preservation protocol for secure vehicular communication,” in Proc. IEEE 27th Conf. Comput. Commun., Apr. 2008, pp. 1229–1237.
  11. G. Samara, W. A. H. Al-Salihy, and R. Sures, “Security issues and challenges of vehicular Ad Hoc networks (VANET),” in Proc. 4th Int. Conf. New Trends Inf. Sci. Service Sci., May 2010, pp. 393–398.
  12. Y. Gongjun, B. B. Bista, D. B. Rawat, and E. F. Shaner, “General active position detectors protect VANET security,” in Proc. Int. Conf. Broadband Wireless Comput., Commun. Appl., Oct. 26–28, 2011, pp. 11–17.
  13. L. Buttyan, T. Holczer, and I. Vajda, “On the effectiveness of changing pseudonyms to provide location privacy in VANETs,” in Proc. 3rd Eur. Workshop. Security Privacy Ad Hoc Sens. Netw., vol. 4572. Jul. 2007, pp. 129–141.
  14. A. Wasef, L. Rongxing, L. Xiaodong, and S. Xuemin, “Complementing public key infrastructure to secure vehicular ad hoc networks [security and privacy in emerging wireless networks],” IEEE Wireless Commun., vol. 17, no. 5, pp. 22–28, Oct. 2010.
Index Terms

Computer Science
Information Sciences

Keywords

VANET selfish nodes plausibility verification reputation.