A Secure Routing Scheme Against Malicious Nodes in Ad Hoc Networks

Author(s):  
Abdelaziz Amara Korba ◽  
Mohamed Amine Ferrag

This chapter proposes a new cluster-based secure routing scheme to detect and prevent intrusions in ad hoc networks. The proposed scheme combines both specification and anomaly detection techniques to provide an accurate detection of wide range of routing attacks. The proposed secure scheme provides an adaptive response mechanism to isolate malicious nodes from the network. A key advantage of the proposed secure scheme is its capacity to prevent wormhole and rushing attacks and its real-time detection of both known and unknown attacks which violate specification. The simulation results show that the proposed scheme shows high detection rate and low false positive rate compared to other security mechanisms.

2013 ◽  
Vol 3 (2) ◽  
pp. 06-11
Author(s):  
Haboub Rachid ◽  
Dr. Mohammed Ouzzif

Mobile Ad-hoc Networks (MANETs) can be deployed quickly without any existing infrastructure. These networks are useful in many areas, such as emergency assistance, disaster relief, intelligent systems houses, patient monitoring, industrial applications, health monitoring, environmental control, military applications, etc. However ad-hoc networks face many challenges, such as the unpredictable mobility of the network, the limited amount of energy available, security challenges, low computational resources, low memory, etc. There is a need for routing approaches aware of those challenges. Thus, this work aims to provide a secure and context aware ad-hoc network, by changing the frequency of data transmission and routing the packets through reliable links. The proposed approaches has been tested, the results shows an interesting decrease of the transmission throughput coming from malicious nodes, a decrease in the packet loss and an increase of the network lifetime.


Author(s):  
Yiftach Richter ◽  
Itsik Bergel

AbstractIn this paper we consider opportunistic routing in multiple-input–multiple-output (MIMO) random wireless ad-hoc networks (WANETs). Our analysis uses a proper model of the physical layer together with an abstraction of the higher communication layers. We assume that the nodes are distributed according to a Poisson point process and consider a routing scheme that opportunistically selects the next relay and the number of spatially multiplexed data streams. The routing decisions are based on geographic locations, the channel gains of the neighbor nodes, and the statistical characterization of all other nodes. Unlike the single antenna case, the optimal routing scheme cannot be explicitly expressed. Hence, we propose a smart-routing scheme for MIMO that adapts the number of data streams per user to the channel conditions. The numerical results demonstrate that this scheme outperforms all previously published schemes for this scenario. The findings highlight the importance of channel state information for efficient routing, and the need for an adaptive selection of the number of data streams at each transmitter.


Sign in / Sign up

Export Citation Format

Share Document