Priority and random selection for dynamic window secured implicit geographic routing in wireless sensor network

Problem statement: Sensor nodes are easily exposed to many attacks since it were deployed in unattended adversarial environment with no global addressing and used for critical applications such as battlefield surveillance and emergency response. While the sensor also needs to act as a router to rela...

Full description

Bibliographic Details
Main Authors: Mohd Hanapi, Zurina, Ismail, Mahamod, Jumari, Kasmiran
Format: Article
Language:English
Published: Science Publications 2009
Online Access:http://psasir.upm.edu.my/id/eprint/16345/
http://psasir.upm.edu.my/id/eprint/16345/1/ajeassp.2009.494.500.pdf
_version_ 1848842935918919680
author Mohd Hanapi, Zurina
Ismail, Mahamod
Jumari, Kasmiran
author_facet Mohd Hanapi, Zurina
Ismail, Mahamod
Jumari, Kasmiran
author_sort Mohd Hanapi, Zurina
building UPM Institutional Repository
collection Online Access
description Problem statement: Sensor nodes are easily exposed to many attacks since it were deployed in unattended adversarial environment with no global addressing and used for critical applications such as battlefield surveillance and emergency response. While the sensor also needs to act as a router to relay a message to a required recipient, then this increased the vulnerabilities to a network layer. However, existing security mechanisms are not permissible to be fitted directly into any sensor network due to constraints on energy and computational capabilities of sensor node itself that require on the modification on the protocols that associated with the sensor node itself in order to provide the security. Approach: In this study, a Dynamic Window Secured Implicit Geographic Forwarding (DWIGF) routing protocol was presented which based on an approach of lazy binding technique and dynamic time on collection window and inherits a geographical routing techniques. Results: The DWIGF was intelligent to minimize a Clear To Send (CTS) rushing attack and robust against black hole and selective forwarding attacks with high packet delivery ratios because of selection of a failed node and an attacker was minimized respectively. Moreover, few routing attacks were eliminated since the routing technique used was classified as geographic routing. Conclusion: This novel routing protocol was promising a secured routing without inserting any existing security mechanism inside.
first_indexed 2025-11-15T08:07:02Z
format Article
id upm-16345
institution Universiti Putra Malaysia
institution_category Local University
language English
last_indexed 2025-11-15T08:07:02Z
publishDate 2009
publisher Science Publications
recordtype eprints
repository_type Digital Repository
spelling upm-163452017-12-04T09:12:46Z http://psasir.upm.edu.my/id/eprint/16345/ Priority and random selection for dynamic window secured implicit geographic routing in wireless sensor network Mohd Hanapi, Zurina Ismail, Mahamod Jumari, Kasmiran Problem statement: Sensor nodes are easily exposed to many attacks since it were deployed in unattended adversarial environment with no global addressing and used for critical applications such as battlefield surveillance and emergency response. While the sensor also needs to act as a router to relay a message to a required recipient, then this increased the vulnerabilities to a network layer. However, existing security mechanisms are not permissible to be fitted directly into any sensor network due to constraints on energy and computational capabilities of sensor node itself that require on the modification on the protocols that associated with the sensor node itself in order to provide the security. Approach: In this study, a Dynamic Window Secured Implicit Geographic Forwarding (DWIGF) routing protocol was presented which based on an approach of lazy binding technique and dynamic time on collection window and inherits a geographical routing techniques. Results: The DWIGF was intelligent to minimize a Clear To Send (CTS) rushing attack and robust against black hole and selective forwarding attacks with high packet delivery ratios because of selection of a failed node and an attacker was minimized respectively. Moreover, few routing attacks were eliminated since the routing technique used was classified as geographic routing. Conclusion: This novel routing protocol was promising a secured routing without inserting any existing security mechanism inside. Science Publications 2009 Article PeerReviewed application/pdf en http://psasir.upm.edu.my/id/eprint/16345/1/ajeassp.2009.494.500.pdf Mohd Hanapi, Zurina and Ismail, Mahamod and Jumari, Kasmiran (2009) Priority and random selection for dynamic window secured implicit geographic routing in wireless sensor network. American Journal of Engineering and Applied Sciences, 2 (2). pp. 494-500. ISSN 1941-7020; ESSN: 1941-7039 http://www.thescipub.com/abstract/?doi=ajeassp.2009.494.500 10.3844/ajeassp.2009.494.500
spellingShingle Mohd Hanapi, Zurina
Ismail, Mahamod
Jumari, Kasmiran
Priority and random selection for dynamic window secured implicit geographic routing in wireless sensor network
title Priority and random selection for dynamic window secured implicit geographic routing in wireless sensor network
title_full Priority and random selection for dynamic window secured implicit geographic routing in wireless sensor network
title_fullStr Priority and random selection for dynamic window secured implicit geographic routing in wireless sensor network
title_full_unstemmed Priority and random selection for dynamic window secured implicit geographic routing in wireless sensor network
title_short Priority and random selection for dynamic window secured implicit geographic routing in wireless sensor network
title_sort priority and random selection for dynamic window secured implicit geographic routing in wireless sensor network
url http://psasir.upm.edu.my/id/eprint/16345/
http://psasir.upm.edu.my/id/eprint/16345/
http://psasir.upm.edu.my/id/eprint/16345/
http://psasir.upm.edu.my/id/eprint/16345/1/ajeassp.2009.494.500.pdf