Distributed Detection in Mobile Access Wireless Sensor Networks under Byzantine Attacks
This paper explores reliable data fusion in mobile access wireless sensor networks under Byzantine attacks. We consider the q-out-of-m rule, which is popular in distributed detection and can achieve a good tradeoff between the miss detection probability and the false alarm rate. However, a major limitation with it is that the optimal scheme parameters can only be obtained through exhaustive search, making it infeasible for large networks. In this paper, first, by exploiting the linear relationship between the scheme parameters and the network size, we propose simple but effective sub-optimal linear approaches. Second, for better flexibility and scalability, we derive a near-optimal closed-form solution based on the central limit theorem. Third, subjecting to a miss detection constraint, we prove that the false alarm rate of q-out-of-m diminishes exponentially as the network size increases, even if the percentage of malicious nodes remains fixed. Finally, we propose an effective malicious node detection scheme for adaptive data fusion under time-varying attacks; the proposed scheme is analyzed using the entropy-based trust model, and shown to be optimal from the information theory point of view. Simulation examples are provided to illustrate the performance of proposed approaches under both static and dynamic attacks.
PROJECT OUTPUT VIDEO: (Click the below link to see the project output video):
- WIRELESS sensor networks have received significant attention from the research community due to their impact on both military and civilian applications. Limited by the processing capability and power supply of the sensor nodes, incorporating security into wireless sensor networks has been a challenging task.
- A serious threat to wireless sensor networks is the Byzantine attack, where the adversary has full control over some of the authenticated nodes and can perform arbitrary behavior to disrupt the system
DISADVANTAGES OF EXISTING SYSTEM:
- In many cases, due to bandwidth and energy limitations, the sensors quantize their sensing result into a single bit.
- The MA receives the sensing reports and applies the fusion rule to make the final decision.
- In this paper, we consider reliable data fusion in wireless sensor networks with mobile access points (SENMA) under both static and dynamic Byzantine attacks, in which the malicious nodes report false information with a fixed or time-varying probability, respectively. In SENMA, the mobile access point (MA) traverses the network and collects the sensing information from the individual sensor nodes.
- The main contributions of the paper can be summarized as follows: First, we propose a simplified, linear q-out-of-m scheme that can be easily applied to large size networks. The basic idea is to find the optimal scheme parameters at relatively small network sizes through exhaustive search, and then obtain the fusion parameters for large network size by exploiting the approximately linear relationship between the scheme parameters and the network size.
- Second, in an effort to search for an easier and more flexible distributed data fusion solutions that can easily adapt to unpredictable environmental changes and cognitive behavior of malicious nodes, we derive a closed-form solution for the q-out-of-m fusion scheme based on the central limit theorem.
- Third, we perform theoretical analysis for both the linear approach and the closed-form solution. We show that under a fixed percentage of malicious nodes, the false alarm rate for both approaches diminishes exponentially as the network size increases.
ADVANTAGES OF PROPOSED SYSTEM:
- The major advantage of the SENMA architecture is that it ensures a line of sight path to the access point within the power range of the sensor nodes, allowing the information to be conveyed without routing. This feature makes it a resilient, scalable and energy efficient architecture for wireless sensor networks.
- The proposed approach is analyzed using an entropy-based trust model. We show that under the same system settings, the proposed malicious node detection approach is optimal from the information theory point of view
- Service provider
- IDS Router
- Service provider
In this module, the service provider transfer the data over the networks. With this transmission, Separate MAC address was generated for the transferring data. MAC address is the unique ID for transferable data’s generated for security purposes and intrusion among attacks. In SENMA (sensor networks with mobile access points), the mobile access point traverses the network and collects the sensing information from the individual sensor nodes. The major advantage of the SENMA architecture is that it ensures a line of sight path to the access point within the power range of the sensor nodes, allowing the information to be conveyed without routing.
- IDS Router
In this module, the IDS Router (Intrusion detection system) monitors each and every node over the network. The process to find the attacks during transmission process. If it founds malicious node detection, it prevents from the detection of intrusion happened. On distributed detection, helps achieve a good trade-off between the miss detection probability and the false alarm rate rises over network. IDS Router verified the MAC address, Allotted time, Attackers and Log details of the transmission.
In this module, there are different attack strategies that could be adopted by the malicious sensors. Let attackers be the probability that each malicious node intentionally reports the opposite information to its actual sensing decision. It is assumed that all malicious nodes have the same probability of attack in a particular sensing period. Two categories are:
1) Static Attack: In this strategy, the malicious nodes send opposite data with an arbitrary probability that is fixed.
2) Dynamic Attack: In this strategy, the malicious nodes change after each attacking block, which is composed of one or more sensing periods.
After removing malicious node detection, receiver ready to receive the data over networks from each node. Then the transmitted data received by the Receiver and collect the data.
- System : Pentium IV 2.4 GHz.
- Hard Disk : 40 GB.
- Floppy Drive : 44 Mb.
- Monitor : 15 VGA Colour.
- Mouse :
- Ram : 512 Mb.
- Operating system : Windows XP/7.
- Coding Language : C#.NET
- IDE : VISUAL STUDIO 2008
- Database : SQL SERVER
Mai Abdelhakim, Leonard E. Lightfoot, Jian Ren, Senior Member, IEEE , and Tongtong Li, “|Distributed Detection in Mobile Access Wireless Sensor Networks under Byzantine Attacks”, IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, VOL. 25, NO. 4, APRIL 2014.