Scholars' Mine
Missouri S&T
Research Repository
Curtis Laws Wilson Library
400 W. 14th Street
Rolla, MO 65409-0060
scholarsmine@mst.edu
| Title: | SeRWA: A secure routing protocol against wormhole attacks in sensor networks |
| Author (s): | Yin, Jian Madria, Sanjay |
| Department/Lab Affiliations: | Center for Aerospace Manufacturing Technologies Computer Science Intelligent Systems Center |
| Keywords: | routing security sensor networking wormhole attack |
| Issue Date: | 2009-08 |
| Publisher: | Elsevier |
| Citation: | Madria, Sanjay, and Jian Yin. "SeRWA: A secure routing protocol against wormhole attacks in sensor networks," Ad Hoc Networks, Volume 7, Issue 6, (August 2009): 1051-1063. |
| Abstract: | A wormhole attack is particularly harmful against routing in sensor networks where an attacker receives packets at one location in the network, tunnels and then replays them at another remote location in the network. A wormhole attack can be easily launched by an attacker without compromising any sensor nodes. Since most of the routing protocols do not have mechanisms to defend the network against wormhole attacks, the route request can be tunneled to the target area by the attacker through wormholes. Thus, the sensor nodes in the target area build the route through the attacker. Later, the attacker can tamper the data, messages, or selectively forward data messages to disrupt the functions of the sensor network. Researchers have used some special hardware such as the directional antenna and the precise synchronized clock to defend the sensor network against wormhole attacks during the neighbor discovery process. In this paper, we propose a Secure Routing protocol against wormhole attacks in sensor networks (SeRWA). SeRWA protocol avoids using any special hardware such as the directional antenna and the precise synchronized clock to detect a wormhole. Moreover, it provides a real secure route against the wormhole attack. Simulation results show that SeRWA protocol only has very small false positives for wormhole detection during the neighbor discovery process (less than 10%). The average energy usage at each node for SeRWA protocol during the neighbor discovery and route discovery is below 25 mJ, which is much lower than the available energy (15 kJ) at each node. The cost analysis shows that SeRWA protocol only needs small memory usage at each node (below 14 kB if each node has 20 neighbors), which is suitable for the sensor network. |
| Type: | Article - Journal text |
| In Title: | Ad Hoc Networks |
| Copyright Notice: | This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder. Pre-print: author can archive; Post-print: author can archive; FULL COPYRIGHT INFORMATION: |
| Publisher URL: | |
| Link to this page: |
| title | SeRWA: A secure routing protocol against wormhole attacks in sensor networks |
| contributor.author | Yin, Jian |
| contributor.author | Madria, Sanjay |
| contributor.deptlab | Center for Aerospace Manufacturing Technologies |
| contributor.deptlab | Computer Science |
| contributor.deptlab | Intelligent Systems Center |
| subject | routing |
| subject | security |
| subject | sensor networking |
| subject | wormhole attack |
| date.issued | 2009-08 |
| publisher | Elsevier |
| identifier.citation | Madria, Sanjay, and Jian Yin. "SeRWA: A secure routing protocol against wormhole attacks in sensor networks," Ad Hoc Networks, Volume 7, Issue 6, (August 2009): 1051-1063. |
| identifier.pub.URI | |
| description.abstract | A wormhole attack is particularly harmful against routing in sensor networks where an attacker receives packets at one location in the network, tunnels and then replays them at another remote location in the network. A wormhole attack can be easily launched by an attacker without compromising any sensor nodes. Since most of the routing protocols do not have mechanisms to defend the network against wormhole attacks, the route request can be tunneled to the target area by the attacker through wormholes. Thus, the sensor nodes in the target area build the route through the attacker. Later, the attacker can tamper the data, messages, or selectively forward data messages to disrupt the functions of the sensor network. Researchers have used some special hardware such as the directional antenna and the precise synchronized clock to defend the sensor network against wormhole attacks during the neighbor discovery process. In this paper, we propose a Secure Routing protocol against wormhole attacks in sensor networks (SeRWA). SeRWA protocol avoids using any special hardware such as the directional antenna and the precise synchronized clock to detect a wormhole. Moreover, it provides a real secure route against the wormhole attack. Simulation results show that SeRWA protocol only has very small false positives for wormhole detection during the neighbor discovery process (less than 10%). The average energy usage at each node for SeRWA protocol during the neighbor discovery and route discovery is below 25 mJ, which is much lower than the available energy (15 kJ) at each node. The cost analysis shows that SeRWA protocol only needs small memory usage at each node (below 14 kB if each node has 20 neighbors), which is suitable for the sensor network. |
| type | Article - Journal |
| type.DCMIType | text |
| type.status | Postprint |
| relation.isPartOf | Ad Hoc Networks |
| rights | This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder. |
| rights | Pre-print: author can archive; Post-print: author can archive; |
| rights.URI | |
| identifier.persist.URI | |
| date.available | 2009-05-20T20:48:39Z |