PROJECT TITLE :

New optimal solution to disjoint set K-coverage for lifetime extension in wireless sensor networks

ABSTRACT:

Lifetime extension is a fundamental concern in wireless sensor networks (WSNs) owing to the limited energy of each sensor. Random and dense deployment of sensors in many applications impose some coverage redundancy in WSNs, which motivates methods to avoid such redundancy for extending the overall lifetime of the networks. An effective method for this purpose is to divide the sensors into a maximum number of disjoint groups called covers, each of which can cover all targets, so that only one cover is active at any time. The problem of obtaining the maximum number of covers has been proved to be NP-hard. In this study, an optimal method is proposed for the problem. The proposed method is based on the transformation of the problem into the well-known Boolean satisfiability (SAT) problem. Simulation results indicate that the proposed method is superior to existing genetic (GAMDSC) and heuristic (MCMCC) methods. Moreover, as an optimal algorithm, it guarantees obtaining an optimum solution, whereas the existing (meta)heuristic algorithms do not. In addition, we extend the proposed method to the K-coverage problem, where each target is supposed to be covered by at least K number of nodes.


Did you like this research project?

To get this research project Guidelines, Training and Code... Click Here


PROJECT TITLE :A new architecture of INC-fuzzy hybrid method for tracking maximumpower purpose in PV cellsABSTRACT:The importance and necessity of energy for human societies are so clear however the traditional sources of energy
PROJECT TITLE :Performance Analysis of a New Calibration Method for Fiber Nonlinearity Compensation - 2018ABSTRACT:Digital signal processing for fiber nonlinearity compensation could be a key enabler for the ever-increasing demand
PROJECT TITLE :New Bound on Partial Hamming Correlation of Low-Hit-Zone Frequency Hopping Sequences and Optimal Constructions - 2018ABSTRACT:During this letter, a brand new bound on partial Hamming correlation (PHC) of low-hit-zone
PROJECT TITLE :New Automatic Modulation Classifier Using Cyclic-Spectrum Graphs With Optimal Training Features - 2018ABSTRACT:A new feature-extraction paradigm for graph-based automatic modulation classification is proposed in
PROJECT TITLE :A New Construction of EVENODD Codes With Lower Computational Complexity - 2018ABSTRACT:EVENODD codes are binary array codes for correcting double disk failures in RAID-half-dozen with asymptotically optimal encoding

Ready to Complete Your Academic MTech Project Work In Affordable Price ?

Project Enquiry