Intrusion-aware trust model for vehicular ad hoc networks

Shaikh, Riaz Ahmed and Alzahrani, Ahmed Saeed (2014) Intrusion-aware trust model for vehicular ad hoc networks. Security and Communication Networks, 7 (11). pp. 1652-1669. ISSN 1939-0114

Full text not available from this repository. (Request a copy)

Abstract

In vehicular ad hoc networks, peers make decisions on the basis of the information provided by the other peers. If the received information is fake, then the result could be catastrophic, such as road accidents. Therefore, many researchers use the concept of trust to evaluate the trustworthiness of the received data. However, existing trust management schemes (proposed so far for the vehicular networks) are suffered from various limitations. For example, some schemes measure trust on the basis of the history of interactions, which is infeasible for vehicular networks due to its ephemeral nature. Also, none of the existing schemes operate in an identity anonymous environment. In order to overcome these limitations, we propose a novel trust management scheme for identity anonymous vehicular ad hoc networks. The proposed method is simple and completely decentralized that makes it easy to implement in the vehicular networks. Also, we prove that the proposed method is not only robust, but it also detects false location and time information. Furthermore, it introduces linear time complexity, which makes it suitable to use in real time.

Item Type: Article
Additional Information: Publisher Copyright: © 2013 John Wiley & Sons, Ltd.
Uncontrolled Keywords: ad hoc networks,privacy,trust management,vehicular networks,information systems,computer networks and communications ,/dk/atira/pure/subjectarea/asjc/1700/1710
Faculty \ School: Faculty of Science > School of Computing Sciences
Related URLs:
Depositing User: LivePure Connector
Date Deposited: 16 Aug 2022 15:31
Last Modified: 24 Sep 2022 07:03
URI: https://ueaeprints.uea.ac.uk/id/eprint/87330
DOI: 10.1002/sec.862

Actions (login required)

View Item View Item