Greedy - based Heuristic for OSC Problems in Wireless Sensor Networks

Download Now
Provided by: International Journal of Modern Engineering Research (IJMER)
Topic: Networking
Format: PDF
In this paper, the authors contains optimize set coverage problem in wireless sensor networks with adaptable sensing range. Communication and sensing consume energy, so efficient power management can extended the network lifetime. In this paper, they consider an enormous number of sensors with adaptable sensing range that are randomly positioned to monitor a number of targets. Every single target may be redundantly covered by various sensors. For preserving energy resources they organize sensors in sets stimulated successively.
Download Now

Find By Topic