Please use this identifier to cite or link to this item:
|Title:||Energy efficient target coverage in wireless sensor networks||Authors:||Ramu Uma||Keywords:||DRNTU::Engineering::Electrical and electronic engineering||Issue Date:||2016||Abstract:||Wireless sensor networks (WSNs) have recently attained a great deal of attention due to their various attractive applications in many different fields. Sensors and WSNs possess various promising characters in a wide range of applications, but there are also lots of constraints that make issues in sensor network particularly challenging. These constraints may include topology control, routing, coverage, security, data management and many others. Among them the most critical aspect is the network lifetime. It is an important to maximize the network lifetime by minimizing energy consumed in the sensor networks. We consider a wireless sensor network, which has several sensor nodes for data relay and a large number of energy-constrained sensor nodes that are deployed randomly to cover certain targets. Since targets are covered by many sensors, we create several cover sets that are active successively to save power. The Greedy-MSC heuristic from the paper “Energy-Efficient Target Coverage in Wireless Sensor Networks”  is used as the base algorithm. We then proposed a modified algorithm that has energy harvesting capabilities along with the characteristics of the base algorithm. Extensive simulations are conducted to validate the efficiency of our proposed solutions.||URI:||http://hdl.handle.net/10356/65889||Fulltext Permission:||restricted||Fulltext Availability:||With Fulltext|
|Appears in Collections:||EEE Theses|
Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.