1 / 16

Load-Balanced Virtual Backbone Construction for Wireless Sensor Networks

This paper presents a comprehensive study on the Load-Balanced Connected Dominating Set (LBCDS) for constructing a virtual backbone in wireless sensor networks. The authors, Jing (Selena) He, Shouling Ji, Yi Pan, and Zhipeng Cai, detail motivations for load-balanced allocation methods and introduce algorithms such as MinMax Valid-degree Dominatee Allocation (MVDA) and MinMax Degree Maximal Independent Set (MDMIS). The findings highlight the NP-Completeness of LBCDS and discuss approximation algorithms and performance analysis, offering insights into efficient resource allocation in sensor networks.

silas
Télécharger la présentation

Load-Balanced Virtual Backbone Construction for Wireless Sensor Networks

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Load-Balanced Virtual Backbone Constructionfor Wireless Sensor Networks Jing (Selena) He, Shouling Ji, Yi Pan, Zhipeng Cai Department of Computer Science Georgia State University

  2. Outline • Motivation • Solution Overview • Problem Formulation and Analysis • Conclusion

  3. Motivation Load-Balanced Connected Dominating Set (LBCDS) 1 2 1 2 3 4  3 4 5 6 7 8 5 6 7 8 Minimum-sized CDS (MCDS) Load-Balanced CDS (LBCDS)

  4. Motivation Load-Balancedly Allocate Diminatees (LBAD) 1 2 1 2 4 3 4 3  5 6 7 8 5 6 7 8 Unbalanced Allocation Balanced Allocation

  5. Outline • Motivation • Solution Overview • Problem Formulation and Analysis • Conclusion

  6. Solution Overview MinMax Valid-degree Dominatee Allocation (MVDA) MinMax Degree Maximal Independent Set (MDMIS) Connected Maximal Independent Set (CMIS)

  7. Outline • Motivation • Solution Overview • Problem Formulation and Analysis • Conclusion

  8. MinMax Degree Maximal Independent Set (MDMIS) DS Property Constraint IS Property Constraint (quadratic) 1 viis a dominator xi Relaxing 0otherwise linearization

  9. Approximation Algorithm (Random Rounding) Due to the relaxation enlarged the optimization space, the solution of LP*MDMIScorresponds to a lower bound to the objective of INPMDMIS .

  10. MinMax Degree Maximal Independent Set (MDMIS)

  11. Connected Maximal Independent Set (CMIS)

  12. MinMax Valid-degree Dominatee Allocation (MVDA) Each dominatee can be allocated to only one dominator Relaxing

  13. MinMax Valid-degree Dominatee Allocation (MVDA)

  14. Outline • Motivation • Solution Overview • Problem Formulation and Analysis • Conclusion

  15. Conclusions • LBCDS is NP-Complete, constructed in two steps: • MinMax Degree Maximal Independent Set (MDMIS) • Connected Maximal Independent Set (CMIS) • Load-Balanced Allocation • MinMax Valid-Degree Dominatee Allocation (MVDA) • Approximation algorithms and performance ratio analysis are presented.

  16. Q & A

More Related