| Literature DB >> 26610499 |
Naser Alajmi1, Khaled Elleithy2.
Abstract
Security breaches are a major threat in wireless sensor networks (WSNs). WSNs are increasingly used due to their broad range of important applications in both military and civilian domains. WSNs are prone to several types of security attacks. Sensor nodes have limited capacities and are often deployed in dangerous locations; therefore, they are vulnerable to different types of attacks, including wormhole, sinkhole, and selective forwarding attacks. Security attacks are classified as data traffic and routing attacks. These security attacks could affect the most significant applications of WSNs, namely, military surveillance, traffic monitoring, and healthcare. Therefore, there are different approaches to detecting security attacks on the network layer in WSNs. Reliability, energy efficiency, and scalability are strong constraints on sensor nodes that affect the security of WSNs. Because sensor nodes have limited capabilities in most of these areas, selective forwarding attacks cannot be easily detected in networks. In this paper, we propose an approach to selective forwarding detection (SFD). The approach has three layers: MAC pool IDs, rule-based processing, and anomaly detection. It maintains the safety of data transmission between a source node and base station while detecting selective forwarding attacks. Furthermore, the approach is reliable, energy efficient, and scalable.Entities:
Keywords: selective forwarding attacks; wireless sensor networks
Year: 2015 PMID: 26610499 PMCID: PMC4701335 DOI: 10.3390/s151129332
Source DB: PubMed Journal: Sensors (Basel) ISSN: 1424-8220 Impact factor: 3.576
Figure 1Selective Forwarding Attacks-Redrawn [15].
Figure 2Multi-Layers in Rules-Based IDS.
Figure 3Selective Forwarding Attack Detection Flowchart.
Rules based in selective forwarding attack.
| Rule No. | Rule Description |
|---|---|
| Rule1 | Each node wait to see if the neighbor node forward the message or not. |
| Rule2 | The node that will receives message has to checks the transfer’s identity to make sure it is not change during transferring. |
| Rule3 | Each node makes sure that the next node has a shared key for negotiation. |
| Rule4 | Each node has a message route when it wants to transfer to other node. |
| Rule5 | Each sensor node must have ACKs. |
| Rule6 | Each sensor node must have the same ACK that use. |
| Rule7 | Each node has not created a new response before the previous one transfer. |
| Rule8 | Each node has to send the message using the correct route. |
| Rule9 | Each sensor node only communicates with other sensor nodes that locate in the same topology. |
Experiment Parameters.
| Parameters | Description |
|---|---|
| Transmission Range | 35 m |
| Sensing Range of node | 30 m |
| Initial energy of a node | 5 J |
| Bandwidth of node | 60 Kb/Sec |
| Number of legitimate sensors | 120 |
| Number of Malicious nodes | 80 |
| Size of network | 800 × 800 m2 |
| Buffering capacity | 45 Packets buffering capacity at each node |
| Data Packet size | 128 bytes |
| Simulation time | 27 min |
| Tx energy | 15.2 mW |
| Rx energy | 11.8 mW |
| Power Intensity | −18 dBm to 13 dBm. |
Figure 4(a) Reliable detection rate of selective forwarding attack; (b) Energy consumptions; (c) Probability detection of selective forwarding attack; (d) Packet delivery ratio; (e) Accuracy rate.