1,586 research outputs found

    A Survey on Wireless Sensor Network Security

    Full text link
    Wireless sensor networks (WSNs) have recently attracted a lot of interest in the research community due their wide range of applications. Due to distributed nature of these networks and their deployment in remote areas, these networks are vulnerable to numerous security threats that can adversely affect their proper functioning. This problem is more critical if the network is deployed for some mission-critical applications such as in a tactical battlefield. Random failure of nodes is also very likely in real-life deployment scenarios. Due to resource constraints in the sensor nodes, traditional security mechanisms with large overhead of computation and communication are infeasible in WSNs. Security in sensor networks is, therefore, a particularly challenging task. This paper discusses the current state of the art in security mechanisms for WSNs. Various types of attacks are discussed and their countermeasures presented. A brief discussion on the future direction of research in WSN security is also included.Comment: 24 pages, 4 figures, 2 table

    Salient Features Selection Techniques for Instruction Detection in Mobile Ad Hoc Networks

    Get PDF
    The development of wireless mobile ad hoc networks offers the promise of flexibility, low cost solution for the area where there is difficulties for infrastructure network. A key attraction of this mode of communication is their ease of deployment and operation. However, having a good and robust mobile ad hoc networking will depend entirely on security mechanism system in place. Traditional security mechanisms know as firewalls were used for defensive approach to oppose security obstacle. However, firewalls do not fully or completely defeat intrusions. To cope with this limitation, various intrusions detection systems (IDSs) have been proposed to detect such network intrusion activities. The problem encounter for this particular technique of instruction detections technique is that during network monitoring for data collection for anomaly detection, data that does not contribute to detection must be deleted before detection can be processed or application of learning algorithm for detection of abnormal attacks. In this paper we present a novel feature technique for feature selection before learning technique should be applied. The method has been applied into our own data set, and for the detection purpose we have used most of the well reputed three Machine Learning classifiers with the new selected features for performance evaluation and the experiment shows that higher accuracy results could be achieved with only all the 9 features extracted with our own algorithm with the data set created by using RandomForest classifier

    A New MANET Wormhole Detection Algorithm Based on Traversal Time and Hop Count Analysis

    Get PDF
    As demand increases for ubiquitous network facilities, infrastructure-less and self-configuring systems like Mobile Ad hoc Networks (MANET) are gaining popularity. MANET routing security however, is one of the most significant challenges to wide scale adoption, with wormhole attacks being an especially severe MANET routing threat. This is because wormholes are able to disrupt a major component of network traffic, while concomitantly being extremely difficult to detect. This paper introduces a new wormhole detection paradigm based upon Traversal Time and Hop Count Analysis (TTHCA), which in comparison to existing algorithms, consistently affords superior detection performance, allied with low false positive rates for all wormhole variants. Simulation results confirm that the TTHCA model exhibits robust wormhole route detection in various network scenarios, while incurring only a small network overhead. This feature makes TTHCA an attractive choice for MANET environments which generally comprise devices, such as wireless sensors, which possess a limited processing capability

    Time of Flight and Fingerprinting Based Methods for Wireless Rogue Device Detection

    Get PDF
    Existing network detection techniques rely on SSIDs, network patterns or MAC addresses of genuine wireless devices to identify malicious attacks on the network. However, these device characteristics can be manipulated posing a security threat to information integrity, lowering detection accuracy, and weakening device protection. This research study focuses on empirical analysis to elaborate the relationship between received signal strength (RSSI) and distance; investigates methods to detect rogue devices and access points on Wi-Fi networks using network traffic analysis and fingerprint identification methods. In this paper, we conducted three experiments to evaluate the performance of RSSI and clock skews as features to detect rogue devices for indoor and outdoor locations. Results from the experiments suggest different devices connected to the same access point can be detected (p \u3c 0.05) using RSSI values. However, the magnitude of the difference was not consistent as devices were placed further from the same access point. Therefore, an optimal distance for maximizing the detection rate requires further examination. The random forest classifier provided the best performance with a mean accuracy of 79% across all distances. Our experiment on clock skew shows improved accuracy in using beacon timestamps to detect rogue APs on the network

    Attacks and countermeasures on routing protocols in wireless networks

    Get PDF
    Routing in wireless networks is not an easy task as they are highly vulnerable to attacks. The main goal of this work is to study the routing performance and security aspects of wireless ad hoc and mesh networks. Most of the routing protocols use hop-count as the routing metric. Hop count metric may not be appropriate for routing in wireless networks as this does not account for the link qualities, advantages of multi-radio paradigm etc. There are several metrics designed for link quality based source routing protocols for multi-radio wireless ad hoc and mesh networks. For example Weighted Cumulative Expected Transmission Time (WCETT), Adjusted Expected Transfer Delay(AETD) etc. But these metrics do not consider the effect of individual link qualities on the total route quality and route selection. This lack of ability from WCETT or AETD would allow them to select suboptimal paths when actually an optimal path is available. In another point of view, this inability can create a routing disruption attack named as delay-variation attack (a variant of black hole attack). It can be launched by a couple of colluding attackers attracting packets at one point by showing very good link qualities and dropping packets at another point by decreasing the link quality. To select an optimal route and prevent the above mentioned attack, a new routing metric known as Variance Based Path Quality metric (VBPQ) is proposed. VBPQ metric provides a robust, reliable and secure edge to the routing mechanism. Another major contribution of this study is to provide a detection mechanism for wormhole attacks in wireless ad hoc networks operating on link quality based source routing protocols. There have been several detection techniques designed for hop count based routing protocols but not for link quality based source routing protocols. In this work, a data mining approach called Cross feature analysis is used in an algorithm to detect wormhole attacks

    Generative Boltzmann Adversarial Network in Manet Attack Detection and QOS Enhancement with Latency

    Get PDF
    Mobile Ad-Hoc Network (MANET) are considered as self-configured network those does not have any centralized base station for the network monitoring and control. MANET environment does not control architecture for routing for the frequent maintenance of topology. The drastic development of Internet leads to adverse effect of development in MANET for different multimedia application those are sensitive to latency. Upon the effective maintenance of the QoS routing route discovery is performed to calculate queue and contention delay. However, the MANET requirement comprises of the complex procedure to withstand the Quality of Service (QoS) with Artificial Intelligence (AI). In MANET it is necessary to compute the MANET attacks with improved QoS with the reduced latency as existing model leads to higher routing and increased latency.  In this paper proposed a Generative Boltzmann Networking Weighted Graph (GBNWG) model for the QoS improvement in MANET to reduce latency. With GBNWG model the MANET model network performance are computed with the weighted graph model. The developed weighted graph computes the routes in the MANET network for the estimation of the available path in the routing metrices. The proposed GBNWG model is comparatively estimated with the conventional QOD technique. Simulation analysis stated that GBNWG scheme exhibits the improved performance in the QoS parameters. The GBNWG scheme improves the PDR value by 12%, 41% reduced control packets and 45% improved throughput value

    Performance Analysis of Routing Protocol Using Trust-Based Hybrid FCRO-AEPO Optimization Techniques

    Get PDF
    Mobile Ad hoc Networks (MANETs) offer numerous benefits and have been used in different applications. MANETs are dynamic peer-to-peer networks that use multi-hop data transfer without the need for-existing infrastructure. Due to their nature, for secure communication of mobile nodes, they need unique security requirements in MANET. In this work, a Hybrid Firefly Cyclic Rider Optimization (FCRO) algorithm is proposed for Cluster Head (CH) selection, it efficiently selects the CH and improves the network efficiency. The Ridge Regression Classification algorithm is presented in this work to sense the malicious nodes in the network and the data is transmitted using trusted Mobile nodes for the QoS enactment metric improvement. A trust-based routing protocol (TBRP) is introduced utilizing the Atom Emperor Penguin Optimization (AEPO) algorithm, it identifies the best-forwarded path to moderate the routing overhead problem in MANET. The planned method is implemented using Matlab software and the presentation metrics are packet delivers ratio, packet loss ratio (PLR), routing overhead, throughput, end-to-end delay (E2ED), transmission delay, energy consumption and network lifetime. The suggested AEPO algorithm is compared with the prevailing PSO-GA, TID-CMGR, and MFFA. The AEPO algorithm’s performance is approximately 1.5%, 3.2%, 2%, 3%, and 4% higher than the existing methods for PLR, packet delivers ratio, throughput, and E2ED and network lifetime. The sender nodes can increase their information transmission rates and reduce delays in appreciation of this evaluation. Additionally, the suggested technique has a perfect benefit in terms of demonstrating the genuine contribution of distinct nodes to trust evaluation (TE)
    • …
    corecore