Approximation algorithms for load-balanced virtual backbone construction in wireless sensor networks
From MaRDI portal
Publication:393036
DOI10.1016/j.tcs.2012.11.020zbMath1301.68035OpenAlexW1979517778MaRDI QIDQ393036
Zhipeng Cai, Shouling Ji, Yi Pan, Jing (Selena) He
Publication date: 16 January 2014
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2012.11.020
Network design and communication in computer systems (68M10) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Approximation algorithms (68W25)
Related Items
An efficient connected dominating set algorithm in WSNS based on the induced tree of the crossed cube, A robust and energy-efficient weighted clustering algorithm on mobile ad hoc sensor networks
Cites Work
- Unnamed Item
- Minimum connected dominating sets and maximal independent sets in unit disk graphs
- A linearization framework for unconstrained quadratic (0-1) problems
- Approximation algorithms for connected dominating sets
- The broadcast storm problem in a mobile ad hoc network
- Load-Balanced Virtual Backbone Construction for Wireless Sensor Networks
- ANALYSIS ON THEORETICAL BOUNDS FOR APPROXIMATING DOMINATING SET PROBLEMS
- Tighter Approximation Bounds for Minimum CDS in Wireless Ad Hoc Networks