The Experts below are selected from a list of 4071 Experts worldwide ranked by ideXlab platform

Said Talbi - One of the best experts on this subject based on the ideXlab platform.

  • secure and stable vehicular ad hoc network clustering algorithm based on hybrid mobility similarities and trust management scheme
    Vehicular Communications, 2018
    Co-Authors: Sarah Oubabas, Rachida Aoudjit, Joel J P C Rodrigues, Said Talbi
    Abstract:

    Abstract Clustering is currently receiving great attention due to the emergence of Vehicular Ad-Hoc Network (VANET) technology. It is a challenging issue due to the high mobility of vehicles which leads to frequent disconnections and quality of service (QoS) degradation. In the literature, many clustering algorithms have been proposed and most of them attempt to achieve cluster stability and assume that all Nodes are trusted. However, due to the important role of cluster heads, the election of a malicious or Compromised Node as a cluster head has dire consequences that may severely compromise the security and reliability of the network. In this paper, we propose a new approach that elects trustworthy cluster heads based on hybrid approach combining stability and trust factors. Unlike prior researches, in trust management we consider both communication capabilities and trust of data that vehicles exchange to improve security and reliability. We propose also a new adaptive trust function to assess the data trust between Nodes according to the reported event's requirement in terms of trust severity unlike other schemes which use a static trust function. Moreover, we introduce a timer that reduces the control traffic during a clustering process by eliminating the competition of Nodes to become cluster-head. Simulation results show that the proposed approach improves significantly the cluster stability while ensuring better vehicles cooperation and reliable data sharing compared to the latest clustering protocols proposed in VANET.

Don Torrieri - One of the best experts on this subject based on the ideXlab platform.

  • Direction Finding of a Compromised Node in a Wireless Network
    IEEE Transactions on Mobile Computing, 2014
    Co-Authors: Don Torrieri
    Abstract:

    When a spread-spectrum receiver in a network discovers that it is processing a jamming signal transmitted by a Compromised Node, its first response is to attempt to identify the Compromised Node. In this paper, an adaptive array is used to find the direction to the jamming source despite the presence of interference signals transmitted by both legitimate network Nodes and external sources. Unlike other direction-finding algorithms, the desired-signal classification (DESIC) algorithm requires no information or special assumptions about the interference signals to effectively cancel them and find the desired direction. Simulation experiments show that the DESIC algorithm provides an excellent performance in many scenarios, even when the received signals cannot be resolved by the widely used MUSIC algorithm.

  • direction finding of a Compromised Node in a spread spectrum network
    Military Communications Conference, 2012
    Co-Authors: Don Torrieri
    Abstract:

    When a spread-spectrum receiver in a network discovers that it is processing a jamming signal transmitted by a Compromised Node, its first response is to attempt to identify the Compromised Node. In this paper, an adaptive array is used to find the direction to the jamming source despite the presence of interference signals transmitted by both legitimate network Nodes and external sources. Unlike other direction-finding algorithms, the desired-signal classification (DESIC) algorithm requires no information or special assumptions about the interference signals to effectively cancel them and find the desired direction. Simulation experiments show that the DESIC algorithm provides an excellent performance in many scenarios, even when the received signals cannot be resolved by the widely used MUSIC algorithm.

  • MILCOM - Direction finding of a Compromised Node in a spread-spectrum network
    MILCOM 2012 - 2012 IEEE Military Communications Conference, 2012
    Co-Authors: Don Torrieri
    Abstract:

    When a spread-spectrum receiver in a network discovers that it is processing a jamming signal transmitted by a Compromised Node, its first response is to attempt to identify the Compromised Node. In this paper, an adaptive array is used to find the direction to the jamming source despite the presence of interference signals transmitted by both legitimate network Nodes and external sources. Unlike other direction-finding algorithms, the desired-signal classification (DESIC) algorithm requires no information or special assumptions about the interference signals to effectively cancel them and find the desired direction. Simulation experiments show that the DESIC algorithm provides an excellent performance in many scenarios, even when the received signals cannot be resolved by the widely used MUSIC algorithm.

Sarah Oubabas - One of the best experts on this subject based on the ideXlab platform.

  • secure and stable vehicular ad hoc network clustering algorithm based on hybrid mobility similarities and trust management scheme
    Vehicular Communications, 2018
    Co-Authors: Sarah Oubabas, Rachida Aoudjit, Joel J P C Rodrigues, Said Talbi
    Abstract:

    Abstract Clustering is currently receiving great attention due to the emergence of Vehicular Ad-Hoc Network (VANET) technology. It is a challenging issue due to the high mobility of vehicles which leads to frequent disconnections and quality of service (QoS) degradation. In the literature, many clustering algorithms have been proposed and most of them attempt to achieve cluster stability and assume that all Nodes are trusted. However, due to the important role of cluster heads, the election of a malicious or Compromised Node as a cluster head has dire consequences that may severely compromise the security and reliability of the network. In this paper, we propose a new approach that elects trustworthy cluster heads based on hybrid approach combining stability and trust factors. Unlike prior researches, in trust management we consider both communication capabilities and trust of data that vehicles exchange to improve security and reliability. We propose also a new adaptive trust function to assess the data trust between Nodes according to the reported event's requirement in terms of trust severity unlike other schemes which use a static trust function. Moreover, we introduce a timer that reduces the control traffic during a clustering process by eliminating the competition of Nodes to become cluster-head. Simulation results show that the proposed approach improves significantly the cluster stability while ensuring better vehicles cooperation and reliable data sharing compared to the latest clustering protocols proposed in VANET.

Xuemin Shen - One of the best experts on this subject based on the ideXlab platform.

  • asrpake an anonymous secure routing protocol with authenticated key exchange for wireless ad hoc networks
    International Conference on Communications, 2007
    Co-Authors: Rongxing Lu, Pinhan Ho, Xuemin Shen
    Abstract:

    In this paper, we present a novel anonymous secure routing protocol for mobile ad hoc networks (MANETs). The proposed protocol not only provides anonymity from all the intermediate Nodes, but also integrates the authenticated key exchange mechanisms into the routing algorithm design. Furthermore, a new attack on anonymous services, called snare attack, is introduced, where a Compromised Node lures a very important Node (VIN) into communicating with him and traces back to the VIN by following the route path. An adversary can then snare the VIN and launch decapitation strike on the VIN. Finally, we present a novel DECOY mechanism as a countermeasure to enhance anonymity of VINs and defeat snare attack.

  • GLOBECOM - NIS01-5: A Novel Voting Mechanism for Compromised Node Revocation in Wireless Ad Hoc Networks
    IEEE Globecom 2006, 2006
    Co-Authors: Xiaodong Lin, Haojin Zhu, Bin Lin, Xuemin Shen
    Abstract:

    Due to the nature of wireless ad hoc networks such as dynamic infrastructure and non-centralized management, the routing process has a huge exposure to malicious hacking and intrusions. This fact results in a likelihood of Node compromise, leading to a disruption of the legitimate network functions/services. Most reported studies in coping with the problem have focused on the effort of protection on route discovery and data transmission against various attacks. In this paper, we solve the problem from a different perspective by targeting the Node compromise revocation, i.e., isolating and breaking off the misbehaving Nodes. To mitigate the security breaches from internal Compromised Nodes and eventually eliminate Compromised Nodes from the wireless ad hoc networks, we propose an energy efficient malicious Node removal mechanism. Further, a new attack on routing service called entrap attack is introduced, where an innocent Node is incriminated as a malicious Node.

  • nis01 5 a novel voting mechanism for Compromised Node revocation in wireless ad hoc networks
    Global Communications Conference, 2006
    Co-Authors: Xiaodong Lin, Haojin Zhu, Bin Lin, Xuemin Shen
    Abstract:

    Due to the nature of wireless ad hoc networks such as dynamic infrastructure and non-centralized management, the routing process has a huge exposure to malicious hacking and intrusions. This fact results in a likelihood of Node compromise, leading to a disruption of the legitimate network functions/services. Most reported studies in coping with the problem have focused on the effort of protection on route discovery and data transmission against various attacks. In this paper, we solve the problem from a different perspective by targeting the Node compromise revocation, i.e., isolating and breaking off the misbehaving Nodes. To mitigate the security breaches from internal Compromised Nodes and eventually eliminate Compromised Nodes from the wireless ad hoc networks, we propose an energy efficient malicious Node removal mechanism. Further, a new attack on routing service called entrap attack is introduced, where an innocent Node is incriminated as a malicious Node.

Xiaodong Lin - One of the best experts on this subject based on the ideXlab platform.

  • an efficient Compromised Node revocation scheme in fog assisted vehicular crowdsensing
    Global Communications Conference, 2017
    Co-Authors: Sultan Basudan, Xiaodong Lin, Karthik Sankaranarayanan
    Abstract:

    In this paper, we propose an efficient Compromised Node revocation scheme for enhancing security in road surface condition monitoring system (RSCMS) using fog computing. On the basis of certificateless aggregate signcryption scheme (CLASC), a data transmission protocol for monitoring road surface conditions is designed with security properties including reports confidentiality, integrity, mutual authenticity, privacy, revocation functionality and key escrow resilience. Extensive simulations are conducted to validate the proposed protocol. It is demonstrated that the proposed protocol outperfroms counterparts in terms of scalability, user revocation and signature verification efficiency.

  • GLOBECOM - An Efficient Compromised Node Revocation Scheme in Fog-Assisted Vehicular Crowdsensing
    GLOBECOM 2017 - 2017 IEEE Global Communications Conference, 2017
    Co-Authors: Basudan, Xiaodong Lin, Karthik Sankaranarayanan
    Abstract:

    In this paper, we propose an efficient Compromised Node revocation scheme for enhancing security in road surface condition monitoring system (RSCMS) using fog computing. On the basis of certificateless aggregate signcryption scheme (CLASC), a data transmission protocol for monitoring road surface conditions is designed with security properties including reports confidentiality, integrity, mutual authenticity, privacy, revocation functionality and key escrow resilience. Extensive simulations are conducted to validate the proposed protocol. It is demonstrated that the proposed protocol outperfroms counterparts in terms of scalability, user revocation and signature verification efficiency.

  • GLOBECOM - NIS01-5: A Novel Voting Mechanism for Compromised Node Revocation in Wireless Ad Hoc Networks
    IEEE Globecom 2006, 2006
    Co-Authors: Xiaodong Lin, Haojin Zhu, Bin Lin, Xuemin Shen
    Abstract:

    Due to the nature of wireless ad hoc networks such as dynamic infrastructure and non-centralized management, the routing process has a huge exposure to malicious hacking and intrusions. This fact results in a likelihood of Node compromise, leading to a disruption of the legitimate network functions/services. Most reported studies in coping with the problem have focused on the effort of protection on route discovery and data transmission against various attacks. In this paper, we solve the problem from a different perspective by targeting the Node compromise revocation, i.e., isolating and breaking off the misbehaving Nodes. To mitigate the security breaches from internal Compromised Nodes and eventually eliminate Compromised Nodes from the wireless ad hoc networks, we propose an energy efficient malicious Node removal mechanism. Further, a new attack on routing service called entrap attack is introduced, where an innocent Node is incriminated as a malicious Node.

  • nis01 5 a novel voting mechanism for Compromised Node revocation in wireless ad hoc networks
    Global Communications Conference, 2006
    Co-Authors: Xiaodong Lin, Haojin Zhu, Bin Lin, Xuemin Shen
    Abstract:

    Due to the nature of wireless ad hoc networks such as dynamic infrastructure and non-centralized management, the routing process has a huge exposure to malicious hacking and intrusions. This fact results in a likelihood of Node compromise, leading to a disruption of the legitimate network functions/services. Most reported studies in coping with the problem have focused on the effort of protection on route discovery and data transmission against various attacks. In this paper, we solve the problem from a different perspective by targeting the Node compromise revocation, i.e., isolating and breaking off the misbehaving Nodes. To mitigate the security breaches from internal Compromised Nodes and eventually eliminate Compromised Nodes from the wireless ad hoc networks, we propose an energy efficient malicious Node removal mechanism. Further, a new attack on routing service called entrap attack is introduced, where an innocent Node is incriminated as a malicious Node.