Green Cooperative Spectrum Sensing and Scheduling in Heterogeneous Cognitive Radio Networks

Çelik, Abdulkadir; Kamal, Ahmed E.

doi:10.1109/tccn.2016.2608337

Cited by 33 publications

(16 citation statements)

References 89 publications

(127 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Therefore, we take the logarithm of both sides of the first constraint to put the problem in a convex form. We refer interested readers to [30]- [32] for a more in-depth convexity analysis of Binomial and Poisson-Binomial distribution.…”

Section: Appendix B Convexity Analysismentioning

confidence: 99%

End-to-End Performance Analysis of Underwater Optical Wireless Relaying and Routing Techniques Under Location Uncertainty

Çelik

Saeed

Shihada

et al. 2020

IEEE Trans. Wireless Commun.

Self Cite

View full text Add to dashboard Cite

On the contrary of low speed and high delay acoustic systems, underwater optical wireless communication (UOWC) can deliver a high speed and low latency service at the expense of short communication ranges. Therefore, multihop communication is of utmost importance to improve degree of connectivity and overall performance of underwater optical wireless networks (UOWNs). In this regard, this paper investigates relaying and routing techniques and provides their end-to-end (E2E) performance analysis under the location uncertainty. To achieve robust and reliable links, we first consider adaptive beamwidths and derive the divergence angles under the absence and presence of a pointing-acquisitioning-and-tracking (PAT) mechanism. Thereafter, important E2E performance metrics (e.g., data rate, bit error rate, transmission power, amplifier gain, etc.) are obtained for two potential relaying techniques; decode & forward (DF) and optical amplify & forward (AF). We develop centralized routing schemes for both relaying techniques to optimize E2E rate, bit error rate, and power consumption. Alternatively, a distributed routing protocol, namely Light Path Routing (LiPaR), is proposed by leveraging the range-beamwidth tradeoff of UOWCs. LiPaR is especially shown to be favorable when there is no PAT mechanism and available network information. In order to show the benefits of multihop communications, extensive simulations are conducted to compare different routing and relaying schemes under different network parameters and underwater environments.

show abstract

Section: Appendix B Convexity Analysismentioning

confidence: 99%

End-to-End Performance Analysis of Underwater Optical Wireless Relaying and Routing Techniques Under Location Uncertainty

Çelik

Saeed

Shihada

et al. 2020

IEEE Trans. Wireless Commun.

Self Cite

View full text Add to dashboard Cite

show abstract

“…Then F implies a subgraph F of G. Since all the original vertices have degree 2 in F , they have degree 2 in F , i.e. F is a 2-factor of G. Furthermore, the cost at every original vertex is zero since c extends c. Now for any r ∈ [3,5], we have to reduce an instance (G, χ, c, k) of 2-MRCF where ∆(G) ≤ 6, d = 2, k = k min , q = 6, to an instance (G , χ , c , k ) of r-MRCF, where ∆(G ) ≤ r + 4, d = 2, k = k min , q = 7 and G is planar. Note that, since whenever G is planar, we have δ(G) ≤ 5, it does not make sense to consider other values of r.…”

Section: Classical Complexity Of R-mrcfmentioning

confidence: 99%

“…For every r ∈[2,5], r-MRCF is NP-hard even when the input graph G is planar,∆(G) ≤ r + 4, d = 2, k = k min , and q = 6 if r = 2 7 otherwise.Proof. We start by proving the theorem for r = 2 by reducing an instance (G, χ, c, k) of 2-MRCF with ∆(G) ≤ 4, d = 2, k = k min , q = 2 to an instance (G , χ , c , k ) of 2-MRCF, with ∆(G ) ≤ 6, d = 2, k = k min , q = 6, and G is planar.…”

mentioning

confidence: 99%

Minimum Reload Cost Graph Factors

Baste

Gözüpek

Shalom

et al. 2019

SOFSEM 2019: Theory and Practice of Computer Science

View full text Add to dashboard Cite

The concept of Reload cost in a graph refers to the cost that occurs while traversing a vertex via two of its incident edges. This cost is uniquely determined by the colors of the two edges. This concept has various applications in transportation networks, communication networks, and energy distribution networks. Various problems using this model are defined and studied in the literature. The problem of finding a spanning tree whose diameter with respect to the reload costs is smallest possible, the problems of finding a path, trail or walk with minimum total reload cost between two given vertices, problems about finding a proper edge coloring of a graph such that the total reload cost is minimized, the problem of finding a spanning tree such that the sum of the reload costs of all paths between all pairs of vertices is minimized, and the problem of finding a set of cycles of minimum reload cost, that cover all the vertices of a graph, are examples of such problems. In this work we focus on the last problem. Noting that a cycle cover of a graph is a 2-factor of it, we generalize the problem the the problem of finding an r-factor of minimum reload cost of an edge colored graph. We prove several NP-hardness results for special cases of the problem. Namely, bounded degree graphs, planar graphs, bounded total cost, and bounded number of distinct costs. For the special case of r = 2, our results imply an improved NP-hardness result. On the positive side, we present a polynomial-time solvable special case which provides a tight boundary between the polynomial and hard cases in terms of r and the and the maximum degree of the graph. We then investigate the parameterized complexity of the problem, prove W[1]-hardness results and present an FPT-algorithm.

show abstract

Section: Introductionmentioning

confidence: 99%

“…Hence, applications of the reload cost concept in communication networks continuously increase. In particular, the energy consumption aspect of this switching cost is especially important in the recently active research area of green networks, which aim to tackle the increasing energy consumption of information and communication technologies [6,8].The concept of reload cost also finds applications in other networks such as transportation networks and energy distribution networks. For instance, a cargo transportation network uses different means of transportation.…”

mentioning

confidence: 99%

Parameterized complexity of finding a spanning tree with minimum reload cost diameter

et al. 2019

View full text Add to dashboard Cite

We study the minimum diameter spanning tree problem under the reload cost model (Diameter‐Tree for short) introduced by Wirth and Steffan. In this problem, given an undirected edge‐colored graph G, reload costs on a path arise at a node where the path uses consecutive edges of different colors. The objective is to find a spanning tree of G of minimum diameter with respect to the reload costs. We initiate a systematic study of the parameterized complexity of the Diameter‐Tree problem by considering the following parameters: the cost of a solution, and the treewidth and the maximum degree Δ of the input graph. We prove that Diameter‐Tree is para‐NP‐hard for any combination of two of these three parameters, and that it is FPT parameterized by the three of them. We also prove that the problem can be solved in polynomial time on cactus graphs. This result is somehow surprising since we prove Diameter‐Tree to be NP‐hard on graphs of treewidth two, which is best possible as the problem can be trivially solved on forests. When the reload costs satisfy the triangle inequality, Wirth and Steffan proved that the problem can be solved in polynomial time on graphs with Δ = 3, and Galbiati proved that it is NP‐hard if Δ = 4. Our results show, in particular, that without the requirement of the triangle inequality, the problem is NP‐hard if Δ = 3, which is also best possible. Finally, in the case where the reload costs are polynomially bounded by the size of the input graph, we prove that Diameter‐Tree is in XP and W[1]‐hard parameterized by the treewidth plus Δ.

show abstract

Green Cooperative Spectrum Sensing and Scheduling in Heterogeneous Cognitive Radio Networks

Cited by 33 publications

References 89 publications

End-to-End Performance Analysis of Underwater Optical Wireless Relaying and Routing Techniques Under Location Uncertainty

End-to-End Performance Analysis of Underwater Optical Wireless Relaying and Routing Techniques Under Location Uncertainty

Minimum Reload Cost Graph Factors

Parameterized complexity of finding a spanning tree with minimum reload cost diameter

Contact Info

Product

Resources

About