https://scholars.lib.ntu.edu.tw/handle/123456789/394612
標題: | On the Multichannel Rendezvous Problem: Fundamental Limits, Optimal Hopping Sequences, and Bounded Time-To-Rendezvous | 作者: | Cheng-Shang Chang Ching-Min Lien WANJIUN LIAO |
關鍵字: | Cognitive radio networks; Finite projective planes; Orthogonal latin squares; Rendezvous search | 公開日期: | 二月-2015 | 卷: | 40 | 期: | 1 | 起(迄)頁: | 1-23 | 來源出版物: | Mathematics of Operations Research | 摘要: | One of the fundamental problems in a cognitive radio network, known as the multichannel rendezvous problem, is for two secondary users to find a common channel that is not blocked by primary users. The basic idea for solving such a problem in most works in the literature is for the two users to select their own channel hopping sequences and then rendezvous when they both hop to a common unblocked channel at the same time. In this paper, we focus on the fundamental limits of the multichannel rendezvous problem and formulate such a problem as a constrained optimization problem, where the selection of the random hopping sequences of the two secondary users must satisfy certain constraints. We derive various lower bounds for the expected (respectively, maximum) time-to-rendezvous under certain constraints. For some of these lower bounds, we are also able to construct optimal channel hopping sequences that achieve the lower bounds. Inspired by the constructions of quorum systems and relative difference sets, our constructions of the channel hopping sequences are based on the mathematical theories of finite projective planes, orthogonal Latin squares, and sawtooth sequences. The use of such theories in the constructions of channel hopping sequences appear to be new and better than other existing schemes in terms of minimizing the expected (respectively, maximum) time-to-rendezvous. © 2015 INFORMS |
URI: | http://scholars.lib.ntu.edu.tw/handle/123456789/394612 https://www.scopus.com/inward/record.uri?eid=2-s2.0-84923108539&doi=10.1287%2fmoor.2014.0680&partnerID=40&md5=f79d3688f8e1e76da875641ac708426c |
ISSN: | 0364765X | DOI: | 10.1287/moor.2014.0680 | SDG/關鍵字: | Constrained optimization; Cognitive radio network; Constrained optimi-zation problems; Finite projective plane; Mathematical theory; Orthogonal latin squares; Relative difference set; Rendezvous problems; Rendezvous searches; Cognitive radio |
顯示於: | 電機工程學系 |
在 IR 系統中的文件,除了特別指名其著作權條款之外,均受到著作權保護,並且保留所有的權利。