Abstract
Standard on-demand routing protocols in wireless ad hoc networks were not originally designed to deal with security threats. Because of that, malicious users have been finding ways to attack networks. Rushing attacks represent one of such possibilities. In these attacks, malicious nodes forward the Route Request (RREQ) packets, asking for a route, to the destination node quicker than the legitimate nodes do. This is possible because the legitimate nodes only forward the first received RREQ packet for a given route discovery. Besides, the attackers can tamper with either the Medium Access Control or routing protocols to get faster processing. As a result, the path through the malicious nodes is chosen, which renders throughput degradation. We propose here a novel, robust routing scheme to defend ad hoc networks against rushing attacks. Our scheme utilizes the "neighbor map mechanism" to establish robust paths as far as rushing attacks are concerned. The proposed scheme also improves path recovery delay by using, whenever it is possible, route maintenance rather than route discovery. Yet, it is energy efficient. The simulation results show that our proposal is indeed viable.
| Original language | English |
|---|---|
| Pages (from-to) | 1339-1351 |
| Number of pages | 13 |
| Journal | Wireless Personal Communications |
| Volume | 70 |
| Issue number | 4 |
| DOIs | |
| Publication status | Published - 2013 Jun 1 |
Fingerprint
All Science Journal Classification (ASJC) codes
- Computer Science Applications
- Electrical and Electronic Engineering
Cite this
}
A novel robust routing scheme against rushing attacks in wireless ad hoc networks. / Kim, Hyojin; De Oliveira, Ruy; Bhargava, Bharat; Song, Jooseok.
In: Wireless Personal Communications, Vol. 70, No. 4, 01.06.2013, p. 1339-1351.Research output: Contribution to journal › Article
TY - JOUR
T1 - A novel robust routing scheme against rushing attacks in wireless ad hoc networks
AU - Kim, Hyojin
AU - De Oliveira, Ruy
AU - Bhargava, Bharat
AU - Song, Jooseok
PY - 2013/6/1
Y1 - 2013/6/1
N2 - Standard on-demand routing protocols in wireless ad hoc networks were not originally designed to deal with security threats. Because of that, malicious users have been finding ways to attack networks. Rushing attacks represent one of such possibilities. In these attacks, malicious nodes forward the Route Request (RREQ) packets, asking for a route, to the destination node quicker than the legitimate nodes do. This is possible because the legitimate nodes only forward the first received RREQ packet for a given route discovery. Besides, the attackers can tamper with either the Medium Access Control or routing protocols to get faster processing. As a result, the path through the malicious nodes is chosen, which renders throughput degradation. We propose here a novel, robust routing scheme to defend ad hoc networks against rushing attacks. Our scheme utilizes the "neighbor map mechanism" to establish robust paths as far as rushing attacks are concerned. The proposed scheme also improves path recovery delay by using, whenever it is possible, route maintenance rather than route discovery. Yet, it is energy efficient. The simulation results show that our proposal is indeed viable.
AB - Standard on-demand routing protocols in wireless ad hoc networks were not originally designed to deal with security threats. Because of that, malicious users have been finding ways to attack networks. Rushing attacks represent one of such possibilities. In these attacks, malicious nodes forward the Route Request (RREQ) packets, asking for a route, to the destination node quicker than the legitimate nodes do. This is possible because the legitimate nodes only forward the first received RREQ packet for a given route discovery. Besides, the attackers can tamper with either the Medium Access Control or routing protocols to get faster processing. As a result, the path through the malicious nodes is chosen, which renders throughput degradation. We propose here a novel, robust routing scheme to defend ad hoc networks against rushing attacks. Our scheme utilizes the "neighbor map mechanism" to establish robust paths as far as rushing attacks are concerned. The proposed scheme also improves path recovery delay by using, whenever it is possible, route maintenance rather than route discovery. Yet, it is energy efficient. The simulation results show that our proposal is indeed viable.
UR - http://www.scopus.com/inward/record.url?scp=84878597893&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84878597893&partnerID=8YFLogxK
U2 - 10.1007/s11277-012-0751-y
DO - 10.1007/s11277-012-0751-y
M3 - Article
AN - SCOPUS:84878597893
VL - 70
SP - 1339
EP - 1351
JO - Wireless Personal Communications
JF - Wireless Personal Communications
SN - 0929-6212
IS - 4
ER -