Dongxu Jin

Time-Based Detection and Location of Wormhole Attacks in Wireless Ad Hoc Networks

Nowadays, wireless ad hoc networks become more and more popular and significant in many fields. However, the important applications of wireless ad hoc networks make them very attractive to attackers. Moreover, the deployment scenarios, the functionality requirements and the limited capabilities of these types of networks make them vulnerable to a large group of attacks, e.g., wormhole attacks concerned in this paper. We propose a time-based scheme for the purpose of preventing wormhole attacks in wireless ad hoc networks. The scheme includes two phases which are detection phase and location phase. By detection phase, the existence of wormhole attacks can be detected. By location phase, the wormhole nodes can be identified. Simulation results show that our scheme is feasible and efficient in preventing wormhole attacks.

A cluster-based countermeasure against blackhole attacks in MANETs

Mobile ad hoc networks (MANETs) become more and more popular and significant in many fields. However, the important applications of MANETs make them very attractive to attackers. The deployment scenarios, the functionality requirements, and the limited capabilities of these types of networks make them vulnerable to a large group of attacks, e.g., blackhole attacks. In this paper, we propose a cluster-based scheme for the purpose of preventing blackhole attacks in MANETs. In our scheme, we firstly present a novel algorithm that employs a powerful analytic hierarchy process (AHP) methodology to elect clusterheads (CHs). Then CHs are required to implement the blackhole attacks prevention scheme to not only detect the existence of blackhole attacks but also identify the blackhole nodes. Simulation results show that our scheme is feasible and efficient in preventing blackhole attacks.

A survey of traffic-based routing metrics in family of expected transmission count for self-organizing networks

We survey the traffic-based routing metrics in self-organizing networks.We present our viewpoints on the principle for designing routing metrics.Different routing metrics may suit for different scenarios or different kinds of network.Balance or tradeoff among the considered factors becomes very important. Self-Organizing Networks (SONs) are attractive for applications where flexibility, resilience, and a large network service area are required. In order to meet the requirements of those applications, the principal issue is to guarantee efficient routing in SONs. Hence, the design and selection of appropriate routing metrics is important. A mass of metrics have been proposed in the past several decades. Among all the metrics, Expected Transmission Count (ETX) has drawn the most attention. Since the proposal of ETX, many ETX-based or extended metrics have been proposed. ETX and its descendants compose the ETX family. This paper is an attempt to analyze, compare and summarize traffic-based routing metrics in the ETX family. Details of each routing metric are presented and analyzed. Some of our viewpoints on the principal for designing metrics in SONs are presented.

Cluster based emergency message dissemination scheme for vehicular ad hoc networks

Wireless and mobile communications has experienced an unprecedented rapid growth during the last decade. Vehicular Ad Hoc Networks (VANETs) are a completely wirelessly connected through the nodes, which usually has dynamic topologies. VANETs can be employed in many applications such as traffic control, safety related message dissemination, and entertainment infotainment. Broadcast storm problem is one of the hot issues in VANETs as it lacks of central management. Many methods are proposed to solve this problem, such as p-persistence based, 1-persistance based, and counter based schemes. However, all of the related works have weaknesses that cannot be ignored either associated with intersection problem or limited environment. In this paper, a novel clustering algorithm is proposed that guarantees efficient clustering. Thereafter, an efficient cluster maintenance mechanism is proposed. Then we show how the emergency messages are transmitted in proposed cluster structure. Finally, the simulation study confirms the availability and efficiency of the proposed clustering algorithm.

A Traffic Flow Theory Aided Physical Measurement-Based Sybil Nodes Detection Mechanism in Vehicular Ad-hoc Networks

In traffic safety related application of Vehicular Ad-hoc Networks (VANETs), security is a great important issue. Sybil attack is a particular kind of attack where the attacker illegitimately claims multiple identities. In the past years, several approaches have been proposed for solving this problem. They are categorized into PKI-based, infrastructure-based, observer-based, and resource-test-based schemes. In this paper, previous protocols are analyzed, and a novel scheme to detect the Sybil nodes in VANETs is presented, mitigating the effect of a Sybil attack. The proposed Sybil nodes detection scheme, Traffic Flow Theory Aided Physical Measurement-Based Sybil Nodes Detection Mechanism in VANETs (PMSD), takes advantage of unmodifiable physical measurements of the beacon messages instead of key-based materials, which dose not only solve the Sybil attack problem, but also reduces the overhead for the detection. The proposed scheme does not require fixed infrastructure, which makes it easy to implement. To increase the detection accuracy, traffic flow theory and safety guard distance is introduced into the scheme. The simulation results show a 97% detection rate of Sybil nodes, with only about a 2% error rate.

Energy-Efficiency Media Independent Handover Mechanism

Nowadays with the development of wireless communication technology, current User End (UE) in mobile system could access different kinds of network with different Network Interface Cards (NICs). Energy-efficiency media independent handover is needed to support the converting between NICs and save the energy of UE. The decision of media independent handover has directly effect on the performance of the service, lifetime of the battery and user satisfaction. In this paper, we propose a new energy-efficiency media independent handover mechanism which makes the handover decision based on multi-criteria. The Energy-Efficiency Media Independent Handover Mechanism (EMIH) consists of two mechanisms: application classification and handover decision. By using these two mechanisms, we achieve the goals of energy-efficiency handover and satisfying the users requirement. EMIH identifies Wireless Local Area Network (WLAN) Access Points (APs) without turning the WLAN NIC on and it also consider about the energy cost of the converting between different NIC so as to avoid the ping-pong effect. The simulation results show the proposed EMIH reduces the amount of exchanged messages so it save the energy of UE and prolong the battery lifetime.

A traffic flow theory based density adopted emergency message dissemination scheme for vehicular ad hoc networks

In traffic safety applications for vehicular ad hoc networks (VANETs), emergency messages have to be disseminated quickly and extensively in order to inform as many vehicles as possible in a short period of time. Hence, the broadcast storm problem is prone to occur. In the past, several approaches have been proposed to solve the problem. Among them, we find counter-, distance-, location-, cluster-, and probabilistic-based schemes. In this paper, we analyze existing protocols and present a novel scheme that is designed to mitigate the broadcast storm problem, reduce the end-to-end latency in real urban scenarios, and deal with the faults that occur during transmission. The proposed routing protocol assigns a density adopted dynamic back-off time based on traffic flow theory to vehicle. It ensures the dissemination of the emergency message onto every part of the road, and when there is no relay vehicle, the emergency message will be retransmitted. We use the GrooveNet simulator to demonstrate that the proposed scheme has a low collision probability, low overhead and a short end-to-end latency.

Preventing Blackhole Attack in DSR-Based Wireless Ad Hoc Networks

Wireless ad hoc networks become more and more popular and significant in many fields. However, the deployment scenarios, the functionality requirements, and the limited capabilities of these types of networks make them vulnerable to a large group of attacks, such as blackhole attacks. In this paper, we proposed a scheme to prevent blackhole attacks in wireless ad hoc networks. Our scheme consists of three mechanisms which are trust management mechanism, detection mechanism and location mechanism. The performance simulation analysis confirms the availability and efficiency of our scheme.