Robust routing and channel allocation in multi-hop cognitive radio networks

Dong, Bei; Wu, Jianshe; Jiao, Licheng

doi:10.1007/s11276-014-0776-0

Cited by 5 publications

(6 citation statements)

References 19 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The delay performance of the network is characterized using queue theoretic analysis. Also, similar efforts towards joint routing and resource allocation for CRN, WMN and CR-WMNs have been reported in [17], [18] [19] [20]. However, according to the best of our knowledge, our work is the first to consider the channel assignment and sharing problem in CR-WMNs from the viewpoint of maximizing the throughput per unit of energy consumption while minimizing the delay and keeping it within in the maximum tolerable limit for a flow.…”

Section: Introductionmentioning

confidence: 75%

“…Sharma et al [1] presented a channel-selection mechanism for CR-WMNs in which a node can transmit over the selected channels, such that the interference within the transmission range of the node does not exceed a predefined threshold. Also, similar efforts towards joint routing and resource allocation for CRN, WMN and CR-WMNs have been reported in [17], [18] [19] [20]. Chowdhury et al [2] presented a spectrum-sensing and spectrum assignment-based unified framework named cognitive mesh network (COMNET).…”

Section: Introductionmentioning

confidence: 98%

See 1 more Smart Citation

On energy‐efficient performance‐guaranteed channel assignment in cognitive radio‐based wireless mesh networks

Hasan

2015

Int J Communication

View full text Add to dashboard Cite

In recent years, in order to make efficient use of spectrum resources, much attention has been given to solving the problem of channel assignment in cognitive radio-based wireless mesh networks (CR-WMNs). Current approaches focus mainly on avoiding interference in order to enhance performance in terms of throughput. WMNs are intended to provide low-cost multimedia communication. Therefore, in order to provide lowcost real-time communication, channel assignment in CR-WMNs should take into consideration not only the issue of throughput, but also energy consumption and delays. In this paper, we first define an optimization problem to maximize the end-to-end throughput per unit of energy consumption while minimizing, as well as guaranteeing, the delay constraint specified for a data stream. Based on this, we then propose a novel distributive heuristic channel assignment approach to solve the optimization problem in a self-organized manner. Finally, we present the simulation results to evaluate the performance of the proposed solution in terms of end-to-end throughput per unit of energy consumption and delays.require that network performance should be optimized not only in terms of throughput, but also in terms of energy consumption (given the fact that the cost of energy continues to rise) and delay, because several broadband services such as video streaming, video conferencing and online gaming are delay sensitive. Moreover, in recent years, a dramatic growth has been witnessed in Internet of Things (IoT). Because it is anticipated that IoT will be carried over multi-hop mesh-type networks with a large number of energy-constrained devices and delay-sensitive applications [6], an energy and delay efficient WMN will be the most suitable choice for IoT applications. Hence, a channel assignment mechanism optimizing performance in terms of throughput and energy consumption while considering the delay constraints for CR-WMNs is highly desired.This paper focuses on the channel assignment problem in multi-hop CR-WMNs with the aim of maximizing the end-to-end throughput per unit of energy consumption while keeping the end-toend delay within the specified limit for each flow. Therefore, we first establish link/hop throughput, energy consumption and delay models based on PU activities. Then, an optimization problem is formulated for channel assignment in CR-WMN with the objective function of maximizing the end-to-end throughput per unit of energy consumption while satisfying the spectrum-sharing constraints among the nodes and the end-to-end constraints for each flow. To solve the problem, a novel distributive heuristic channel assignment (DHCA) is presented, which works in a distributive and self-organized manner, while keeping in view the scalability concerns of CR-WMNs and the simplicity of the solution to be implemented in real time. DHCA works in two steps. The first step is to introduce the concept of delay gradient. The delay gradient is defined as the difference in the accumulative delay incurred by the packets of a fl...

show abstract

Section: Introductionmentioning

confidence: 75%

Section: Introductionmentioning

confidence: 98%

On energy‐efficient performance‐guaranteed channel assignment in cognitive radio‐based wireless mesh networks

Hasan

2015

Int J Communication

View full text Add to dashboard Cite

show abstract

“…(12). Then, To consider the situation where the weight information is not exactly known, this section constructs several models for the optimal weight vector, which can both deal with the independent and dependent situations.…”

Section: Aggregation Operators Based On Fuzzy Measuresmentioning

confidence: 99%

Linguistic Interval Hesitant Fuzzy Sets and Their Application in Decision Making

2015

View full text Add to dashboard Cite

To cope with the hesitancy and uncertainty of the decision makers' cognitions to decision-making problems, this paper introduces a new type of fuzzy sets called linguistic interval hesitant fuzzy sets. A linguistic interval hesitant fuzzy set is composed of several linguistic terms with each one having several interval membership degrees. Considering the application of linguistic interval hesitant fuzzy sets in decision making, an ordered relationship is offered, and several operational laws are defined. After that, several aggregation operators based on additive and fuzzy measures are introduced, by which the comprehensive attribute values can be obtained. Based on the defined distance measure, models for the optimal weight vectors are constructed. In addition, an approach to multi-attribute decision making with linguistic interval hesitant fuzzy information is developed. Finally, two numerical examples are provided to show the concrete application of the procedure.

show abstract

“…It is also very crucial to find out the different such channel assignments in CRNs for different purposes such as finding the -channel connected minimum interference topology control problem and connected realization graph with minimum radios etc. [5][6][7] To minimize the effect of PUs' dynamics, we define the -channel connectivity problem ( -CCP), which finds a channel assignment under which given CRN remains connected when any of − 1 or fewer numbers of channels are reclaimed by PUs. 2,3 The channel assignment is a function that assigns the set of channels to the radios of SUs to enhance the network's connectivity by assigning different channels available to them.…”

Section: Introductionmentioning

confidence: 99%

“…It allocates the available channels to SUs to improve system performance such as robustness on PU arrival, spectrum usage, and fairness. 4,5 The channel assignment in CRN is one of the most challenging problems and has been studied well in reported works. [5][6][7] To minimize the effect of PUs' dynamics, we define the -channel connectivity problem ( -CCP), which finds a channel assignment under which given CRN remains connected when any of − 1 or fewer numbers of channels are reclaimed by PUs.…”

Section: Introductionmentioning

confidence: 99%

κ‐channel connectivity in cognitive radio networks for bounded tree‐width graphs

Yadav

Misra

2017

Int J Communication

View full text Add to dashboard Cite

Channel connectivity problem in cognitive radio network (CCP in CRN) is to find a channel assignment for secondary users (SUs) such that underlying graph induced by SUs (potential graph) is connected. Channel connectivity problem in CRNs has been proved to be NP-complete for general graph and remains NP-complete even if the underlying potential graph is the tree. Fixed parameter tractability of CCP in CRN has been of research interest because of its practicability. In this work, we have proposed novel problem of fixed parameter tractability for -CCP of CRN ( -CCP in CRN), ie, whether a given CRN remains connected when any of −1 channels are reclaimed by primary users, called -CCP. This is very crucial to check and design an effective channel assignment algorithm that provides connectivity to SUs on channels reclamation by primary users. To our knowledge, fixed parameter tractability of -CCP in CRNs has not been studied and becoming useful because of development of 5G if the underlying potential graph has bounded tree-width and number of channels is parameterized. We address -CCP in CRN and propose an O( ) O( ) n O(1) time algorithm if the underlying potential graph is bounded by tree-width and generates a feasible channel assignment under which given CRN is -channel connected, where is the number of channels and n is the number of SUs in CRN. We show that the -CCP is fixed parameter tractable, when underlying potential graph has bounded tree-width and number of channels is parameterized. To count the different possible potential solution of -CCP, we propose a polynomial time algorithm for the corresponding enumeration problem (the number of different feasible channel assignments) Enum--CCP on the potential graph with bounded tree-width when the number of channels is bounded by a constant. Through simulation, we have observed that the feasibility of -CCP highly depends on the available channels at each SU and number of radio present at each SU.

show abstract

Robust routing and channel allocation in multi-hop cognitive radio networks

Cited by 5 publications

References 19 publications

On energy‐efficient performance‐guaranteed channel assignment in cognitive radio‐based wireless mesh networks

On energy‐efficient performance‐guaranteed channel assignment in cognitive radio‐based wireless mesh networks

Linguistic Interval Hesitant Fuzzy Sets and Their Application in Decision Making

κ‐channel connectivity in cognitive radio networks for bounded tree‐width graphs

Contact Info

Product

Resources

About