DSpace Repository

Dynamic Energy-Efficient Routing Protocol for Wireless Sensor Networks

Show simple item record

dc.contributor.advisor Tamimi, Liana
dc.contributor.author Amro, Dalia
dc.date.accessioned 2019-08-04T08:01:14Z
dc.date.available 2019-08-04T08:01:14Z
dc.date.issued 2019-01-01
dc.identifier.uri http://scholar.ppu.edu/handle/123456789/1642
dc.description CD , no of pages 78 , 31034 , informatics 2/2019
dc.description.abstract Wireless sensor networks (WSNs) hold a group of spatial sensor nodes circulated to collect, monitor, record data which can be considered as an important data in critical areas that human cannot reach. The special ability for these networks attracted a respectable amount of study. WSNs have unrestrained figuration, and they depend on the wireless networks, for their adaptive nature and tiny size WSNs found in various applications. We can see the presence of WSNs in healthcare, monitoring, transportation, industry, automation, and surveillance. However, the WSNs have many limitations and challenges like memory, power consumption, mobility. Hence, WSNs have so many areas to evolve and develop. The major goal is to conserve and save energy to prolong the network lifetime. Because it’s hard to prolong the network lifetime by minimizing the node consumption of energy, the energy employment is minimized by using two energy efficient protocols with two algorithms one to save energy and the other to optimize the transition of data between nodes. We are using Volcano Routing Scheme (VRS) for the Directed Diffusion (DD) protocol which is known as an energy efficient that helps flat structure protocols to conserve energy, and the optimization algorithm with the LEACH to select the optimal number of sink nodes that will help the process of saving energy for the whole network. All of that is done starting with a detailed study of the LEACH, DD, VRS and the enhancement on the LEACH to see if there is anything advanced to save the network energy. We make use of the optimization algorithm to enhance the LEACH and use the VRS to have the location advantage with the optimized hierarchical protocol. The location benefits the nodes by knowing its location and the neighbor’s location to know how to deal with the data if there are any dead nodes. The new proposed protocol is divided into two parts the first one is manual, dealing with the energy computation and sensing operation to extract the data patterns to make the lookup tables. The second part is the dynamic part when the network decides which protocol to operate according to the needed amount of data. If the data is limited, it means the DD is searching in the lookup tables if the data 1 LIST OF FIGURES 2 amount is huge the network is operating the LEACH to construct a new lookup table. The newly dynamic protocol has been simulated and its performance has been studied using NS3 simulator. The LEACH protocol has been used as a benching mark to evaluate the performance. Simulation results show that the dynamic protocol has better performance than LEACH standing alone in terms of energy and lifetime and we can see it as a percentage ranges from (20-25percent). Keywords: Energy Efficient, Dynamic Routing, VRS, WSNs, LEACH, DD. en_US
dc.language.iso en en_US
dc.publisher جامعة بوليتكنك فلسطين - معلوماتية en_US
dc.subject Wireless Sensor Networks en_US
dc.subject Efficient Routing en_US
dc.subject Dynamic Energy- en_US
dc.title Dynamic Energy-Efficient Routing Protocol for Wireless Sensor Networks en_US
dc.type Other en_US

Files in this item

This item appears in the following Collection(s)

Show simple item record

Search DSpace


My Account