Please use this identifier to cite or link to this item:
https://ptsldigital.ukm.my/jspui/handle/123456789/487253
Title: | Adaptive and dynamic implicitly secured routing protocol for wireless sensor network |
Authors: | Zurina Mohd Hanapi (P39356) |
Supervisor: | Mahamod Ismail, Professor Dr. |
Keywords: | Adaptive and dynamic Implicitly secured Routing protocol Wireless sensor network Wireless sensor networks |
Issue Date: | 14-Mar-2011 |
Description: | Wireless Sensor Network (WSN) is a network consists of hundreds or thousands of low-power and low cost sensor nodes deployed in unattended adversarial environment with no possibility of a global addressing. Due to energy, memory, and computational capabilities constraints on sensor node, security becomes a major concerned in WSN since existing security mechanisms such as cryptography and key management are not allowed to be integrated directly. Moreover, absence of a pre-existing infrastructure in WSN network increases the vulnerabilities to a network layer particularly because the sensor needs to behave as a router to relay all messages to a destination. Thus, a secured routing becomes significantly concerned to ensure a high-quality communication. The objectives of this study are to propose and evaluate new secured and efficient routing protocol for WSN to defend against routing attacks. The study mainly focus on the routing disciplines implemented by Implicit Geographic Forwarding (IGF), that are exposed to routing attacks such as blackhole, selective forwarding, Sybil, and denial of service attacks. As a result, two new routing protocols are proposed, namely Dynamic Windows Implicit Geographic Forwarding (DWSIGF), and Adaptive DWSIGF (ADWSIGF). Both protocols inherit the main behaviours of IGF to ensure the protocols are secured from the other routing attacks includes spoofing and altering of routing table, wormholes, HELLO flood, and sinkholes attacks. The DWSIGF routing protocol uses dynamic collection windows method as opposed to the IGF and Secured Implicit Geographic Forwarding (SIGF) routing protocols which collected only one CTS respondent and implemented fixed window's size respectively. Thorough analyses are performed on the protocols using priority and random selection, optimal and non optimal relay, with and without CTS rushing attack, and single and multiple attackers. The dynamic method promising a better protection against blackhole, selective forwarding, and Sybil attacks with minimum attacker selection and high performance in packet delivery ratio (PDR) as compared to the IGF and SIGF routing protocols even without inserting any security mechanism inside the routing protocol. However, the DWSIGF routing protocol produced inefficiency in PDR, message overhead, and end to end delay when no attack is present. Thus, the ADWSIGF on the other hand, guaranteed a better performance in term of end to end delay even when no attack is performed. The protocol smartly accepts adequate number of CTS reply as opposed to the DWSIGF protocol that collected as many as CTS respondents within the collection window time. The study shown 20% of forwarding candidates are enough to respond to the sender. Ideally in high density network, two to three nodes are considered sufficient to reply with the CTS packet. The protocol also provides outstanding defences against the blackhole/selective forwarding attack even compared to the DWSIGF routing protocol. As a result, the proposed routing protocols are promising a dynamic, efficient, and secured routing without any implementation of existing security mechanism.,PhD |
Pages: | 215 |
Call Number: | TK7872.D48.Z846 2011 3 |
Publisher: | UKM, Bangi |
Appears in Collections: | Faculty of Engineering and Built Environment / Fakulti Kejuruteraan dan Alam Bina |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
ukmvital_73875+Source01+Source010.PDF Restricted Access | 4.11 MB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.