Proceedings Article10.1109/ICCNC.2012.6167568
Constructing a load-balanced virtual backbone in wireless sensor networks
Jing He,Shouling Ji,Pingzhi Fan,Yi Pan,Yingshu Li +4 more
- 12 Mar 2012
- pp 959-963
29
TL;DR: A greedy-based approximation algorithm is proposed to construct an LBCDS in a WSN and an optimal centralized algorithm and an efficient probability-based distributed algorithm to solve the LBAD problem are proposed.
read more
Abstract: A Connected Dominating Set (CDS) is used as a virtual backbone for efficient routing and broadcasting in Wireless Sensor Networks (WSNs). Most existing works focus on constructing a Minimum CDS (MCDS), a k-connect m-dominating CDS, a minimum routing cost CDS or a bounded-diameter CDS. However, no work considers the load-balance factor of CDSs in WSNs. In this paper, we propose a new concept - the Load-Balanced CDS (LBCDS), and a new problem - the Load-Balanced Allocate Dominatee (LBAD) problem. Consequently, a greedy-based approximation algorithm is proposed to construct an LBCDS in a WSN in this paper. Moreover, we propose an optimal centralized algorithm and an efficient probability-based distributed algorithm to solve the LBAD problem. Through extensive simulations, we demonstrate that our proposed methods extend network lifetime by 80% compared with the latest CDS construction algorithm.
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
Constructing load-balanced virtual backbones in probabilistic wireless sensor networks via multi-objective genetic algorithm
Jing Selena He,Shouling Ji,Raheem Beyah,Ying Xie,Yingshu Li +4 more
- 01 Feb 2015
TL;DR: This paper proposes a multi‐objective genetic algorithm to construct a load‐balanced VB under PNM and demonstrates that the proposed methods extend network lifetime by 69% on average compared with the existing state‐of‐the‐art approaches.
16
Data Aggregation Scheduling in Wireless Networks with Cognitive Radio Capability
Mingyuan Yan,Shouling Ji,Meng Han,Yingshu Li,Zhipeng Cai +4 more
- 18 Dec 2014
TL;DR: This paper investigates the Minimum Latency Data Aggregation Scheduling in wireless networks with Cognitive Radio capability (MLDAS-CR) problem and proposes an approximation scheduling algorithm and a heuristic scheduling algorithm with guaranteed latency bound.
14
Connected dominating set algorithms for wireless sensor networks
TL;DR: This paper provides a review on connected dominating set construction techniques for wireless sensor networks and proposes a new approach to manage and extend network lifetime.
14
Localized Fault Tolerant and Connectivity Restoration Algorithms in Mobile Wireless Ad Hoc Network
TL;DR: This paper proposes three hybrid recovering algorithms, namely, cascade movement based on nearest nodes, cascademovement based on connected dominating set, and cascade movementBased on critical nodes, which aim to identify and maintain connectivity of mobile wireless ad hoc networks.
12
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.
Unit disk graphs
Brent N. Clark,Brent N. Clark,Charles J. Colbourn,Charles J. Colbourn,David S. Johnson,David S. Johnson +5 more
TL;DR: It is shown that many standard graph theoretic problems remain NP-complete on unit disks, including coloring, independent set, domination, independent domination, and connected domination; NP-completeness for the domination problem is shown to hold even for grid graphs, a subclass of unit disk graphs.
1.6K
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.