Research On Routing Protocols In Wireless Sensor Networks For Energy Efficiency

Due to recent advances in microelectronics, the development of low cost, small, and energy efficient devices becames possible. Those advances led to the birth of the Wireless Sensor Networks (WSNs). WSNs consist of a large set of sensor nodes equipped with communication capabilities, scattered in the area to monitor. Researchers focus on several aspects of WSNs. Such aspects include the quality of service the WSNs provides (data delivery delay, accuracy of data, etc…), the scalability of the network to contain thousands of sensor nodes, the robustness of the network (allowing the network to work even if a certain percentage of nodes fails), and making the energy consumption in the network as low as possible to prolong the network's lifetime.As regarding of the research on energy efficiency in Wireless Sensor Networking, some of current proposals focus on modifying the internal sensor node's hardware . Other techniques focus on building routing protocols that will utilize the least possible amount of power when transmitting data to the Base Station (BS). By selecting the optimum path the data will go through, energy consumption can be reduced and the lifetime of the network will be prolonged.In this thesis, we are discussing an approach that can be applied to the sensing devices that are scattered in an area and are the making blocks of the Sensor Networks. This work will utilize the well known approach that is awaking scheduling to extend the network's lifespan. In this work, we designed a scheduling algorithm that will reduce the delay's upper bound the reported data will experience, while at the same time keeps the advantages that are offered by the use of the awaking scheduling– the energy consumption reduction which will lead to the increase in the network's lifetime.The wakeup scheduling will be based on the location of the node relative to its neighbors and its distance from the Base Station. We will apply the method we come up with to a set of simulated nodes using the one simulator. We will test the performance of this approach with two other approaches– the well known LEACH algorithm and a multi-parent scheduling algorithm. We are anticipating a good improvement on the network's quality of service and a reduction of the consumed energy.