Non disjoint set covers approach for wireless sensor networks lifetime optimization - Université de Lorraine Access content directly
Conference Papers Year : 2016

Non disjoint set covers approach for wireless sensor networks lifetime optimization

Abstract

The lifetime optimization problem of wireless sensor networks is widely solved using disjoint sets covers in which a sensor cannot participate in more than one cover. The proposed method allows a sensor to join more than one cover. The genetic algorithm is used to find the maximum number of non-disjoint sets covers to be scheduled to optimize wireless sensor networks' lifetime. The investigations show that the algorithm complexity increases when the problem is reasonably divided into two sub-problems. The obtained results encourage to search for better solutions using this approach rather than that based on disjoint set covers.
No file

Dates and versions

hal-03089954 , version 1 (29-12-2020)

Licence

Copyright

Identifiers

Cite

Yousif E.E. Ahmed, Kondo Hloindo Adjallah, Sharef Babikier. Non disjoint set covers approach for wireless sensor networks lifetime optimization. 2016 3rd International Symposium on Wireless Systems within the Conferences on Intelligent Data Acquisition and Advanced Computing Systems (IDAACS-SWS), Sep 2016, Offenburg, Germany. pp.30-35, ⟨10.1109/IDAACS-SWS.2016.7805781⟩. ⟨hal-03089954⟩
60 View
0 Download

Altmetric

Share

Gmail Facebook X LinkedIn More