z-logo
Premium
On energy‐efficient performance‐guaranteed channel assignment in cognitive radio‐based wireless mesh networks
Author(s) -
Hasan Najam,
Tu Wanqing
Publication year - 2015
Publication title -
international journal of communication systems
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.344
H-Index - 49
eISSN - 1099-1131
pISSN - 1074-5351
DOI - 10.1002/dac.3003
Subject(s) - computer science , cognitive radio , throughput , energy consumption , wireless mesh network , heuristic , channel (broadcasting) , computer network , efficient energy use , wireless , interference (communication) , mathematical optimization , distributed computing , wireless network , telecommunications , ecology , artificial intelligence , electrical engineering , biology , engineering , mathematics
Summary 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 low‐cost 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. Copyright © 2015 John Wiley & Sons, Ltd.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here