z-logo
Premium
Rank‐based dynamic frequency hopping without strict coordination in IEEE 802.22 WRAN system
Author(s) -
Kinoshita Harumasa,
Tachibana Takuji,
Sugimoto Kenji
Publication year - 2012
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.1244
Subject(s) - computer science , channel (broadcasting) , base station , interference (communication) , transmission (telecommunications) , rank (graph theory) , computer network , ranking (information retrieval) , data transmission , ieee 802 , wireless , real time computing , telecommunications , information retrieval , mathematics , combinatorics
SUMMARY In IEEE 802.22 wireless regional area networks (WRAN), it is indispensable to prevent the in‐use channel from interfering with incumbent services such as digital TV. To achieve this end, in this paper, we propose a dynamic frequency hopping based on rank accounting. In this method, a base station utilizes a ranking database where a rank of a channel which is used frequently is high. Each base station uses an idle channel whose rank is the highest based on the database, and hence this can reduce the number of channels which are used for the data transmission. Moreover, the proposed method performs interference avoidance processes. The proposed method does not require a strict coordination for base stations. We evaluate the performance of the proposed method with simulation. Numerical examples show that the failure probability of the channel switching for the proposed method is smaller than that for the conventional random method. It is also shown that the number of channels that are used for the data transmission can be reduced by using the proposed method. Finally, we investigate the performance of the proposed method in some situations. Copyright © 2011 John Wiley & Sons, Ltd.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here