Approximation algorithms for load-balanced virtual backbone construction in wireless sensor networks
48
TL;DR: Three NP-hard problems are investigated in the paper, namely, the MinMax Degree Maximal Independent Set (MDMIS), the Load-Balanced Virtual Backbone (LBVB) problem, and the Min Max Valid-degree non-Backbone node Allocation (MVBA) problem.
read more
About: This article is published in Theoretical Computer Science. The article was published on 01 Oct 2013. and is currently open access. The article focuses on the topics: Approximation algorithm & Connected dominating set.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
A survey of optimization algorithms for wireless sensor network lifetime maximization
Robert M. Curry,J. Cole Smith +1 more
TL;DR: This survey explores various research approaches and extensions to the WSN lifetime maximization problem, which include online routing, clustering approaches, and lifetime maximizations on specially structured networks.
100
Constructing Load-Balanced Data Aggregation Trees in Probabilistic Wireless Sensor Networks
TL;DR: This paper focuses on constructing a Load-Balanced Data Aggregation Tree (LBDAT) under the PNM, and the proposed algorithms outperform the existing state-of-the-art approaches significantly.
63
Snapshot and Continuous Data Collection in Probabilistic Wireless Sensor Networks
TL;DR: A novel Cell-based Path Scheduling (CPS) algorithm is proposed that achieves capacity of Ω(1/ 5ω ln n·W) in the sense of the worst case and order-optimal capacity in thesense of expectation, where n is the number of sensor nodes, ω is a constant, and W is the data transmitting rate.
59
Constructing a CDS-Based Network Backbone for Data Collection in Wireless Sensor Networks
TL;DR: This paper investigates the problem of constructing an energy-balanced CDS to effectively preserve the energy of nodes in order to extend the network lifetime in data collection and proposed DGA-EBCDS, and each node in the network can effectively transmit its data through the virtual backbone.
43
An energy efficient and optimized load balanced localization method using CDS with one-hop neighbourhood and genetic algorithm in WSNs
TL;DR: The proposed algorithm balances the computational load among anchor nodes for location calculation of unknown nodes for network lifetime improvement and has been optimized using genetic algorithm.
33
References
•Book
Computers and Intractability: A Guide to the Theory of NP-Completeness
Michael Randolph Garey,David S. Johnson +1 more
- 01 Jan 1979
TL;DR: The second edition of a quarterly column as discussed by the authors provides a continuing update to the list of problems (NP-complete and harder) presented by M. R. Garey and myself in our book "Computers and Intractability: A Guide to the Theory of NP-Completeness,” W. H. Freeman & Co., San Francisco, 1979.
The broadcast storm problem in a mobile ad hoc network
Sze-Yao Ni,Yu-Chee Tseng,Yuh-Shyan Chen,Jang-Ping Sheu +3 more
- 01 Aug 1999
TL;DR: This paper proposes several schemes to reduce redundant rebroadcasts and differentiate timing of rebroadcast to alleviate the broadcast storm problem, which is identified by showing how serious it is through analyses and simulations.
Approximation Algorithms for Connected Dominating Sets
TL;DR: The dominating set problem in graphs asks for a minimum size subset of vertices with the following property: each vertex is required to be either in the dominating set, or adjacent to some vertex.
A design concept for reliable mobile radio networks with frequency hopping signaling
Anthony Ephremides,Jeffrey E. Wieselthier,Dennis J. Baker +2 more
- 01 Jan 1987
TL;DR: This paper outlines those features that distinguish the High Frequency (HF) Intra Task Force (ITF) Network from other packet radio networks, and presents a design concept for this network that encompasses organizational structure, waveform design, and channel access.