Abstract Connected dominating set (CDS) is a representative technique for constructing virtual backbones of wireless networks to improve the efficiency of communication. Most of existing works on CDS aim to construct the minimum CDS (MCDS). However, MCDS may not be sufficient in cognitive radio networks where communication links are prone to failure due to random activities of primary users. To solve the problem, an algorithm is proposed in this paper to construct a CDS with redundancy and the maximum spectrums in CRNs. Moreover, with an integer programming formulation, an algorithm is designed to obtain the minimum 2-conneted 2-dominating set with maximum spectrums (MSs) in CRNs. To the best of our knowledge, this is the first integer programming formulation for the problem and the concept of MSs is put forward first. Simulation results indicate that our algorithm performs well.
On Constructing Minimum 2-Connected 2-Domiating Set with Maximum Spectrums in Cognitive Radio Networks
Lihua Han,Deqian Fu,Zifen Yang,Q. Gao,Zhiquan Feng
Published 2015 in FNC/MobiSPC
ABSTRACT
PUBLICATION RECORD
- Publication year
2015
- Venue
FNC/MobiSPC
- Publication date
Unknown publication date
- Fields of study
Computer Science, Engineering
- Identifiers
- External record
- Source metadata
Semantic Scholar
CITATION MAP
EXTRACTION MAP
CLAIMS
- No claims are published for this paper.
CONCEPTS
- No concepts are published for this paper.
REFERENCES
Showing 1-11 of 11 references · Page 1 of 1
CITED BY
- No citing papers are available for this paper.
Showing 0-0 of 0 citing papers · Page 1 of 1