# Combined Sector and Channel Hopping Schemes for Efficient Rendezvous in Directional Antenna Cognitive Radio Networks.

1. IntroductionThe inefficiency of radio spectrum utilization due to the fixed assignment of spectrum bands, coupled with the huge increase in the number of wireless devices recently, leads to the emerging of cognitive radios (CRs). CRs have been introduced as an efficient solution for the spectrum scarcity issue. They allow unlicensed users, also known as secondary users (SUs), to opportunistically use licensed bands as long as this use does not create any interference to the bands licensed users, that is, primary users (PUs). In distributed CRNs, SUs need to meet each other on a common channel and exchange control messages in order to set up their data transmissions [1]. This operation is called rendezvous, which is a fundamental and a vital process for initiating the connection of the SUs data communications.

The use of a dedicated common control channel (CCC) is one widely adopted rendezvous approach in the literature [2-6]. Although this approach can simplify the rendezvous process, it has many drawbacks such as the CCC susceptibility to long-time blocking by PUs, early saturation by SUs, or jamming by attackers [7,8]. Moreover, the spectrum heterogeneity among SUs, caused by the spatial and temporal variations of the spectrum opportunities (influenced by neighboring PU activities), makes this approach not practical. Therefore, channel hopping (CH) has been proposed as an alternative approach for rendezvous without the need for any predefined CCC. The existing CH-based rendezvous schemes were designed with omnidirectional antenna according to different mathematical structures (e.g., [9-18]) in order to provide a successful channel rendezvous between a pair of single-hop SUs. In the CH approach, each SU generates its CH sequence based on the available channels that are sensed to be idle from any PU activities within its omnidirectional range. Then, the SU keeps hopping over the channels according to the generated CH sequence for achieving channel rendezvous. The rendezvous occurs between a pair of communicating SUs when they hop during the same time slot over a channel that is commonly available for both of them. The existence of common available channels (at least one) between the pair of communicating SUs is a common and essential assumption made by all the existing CH schemes. Their designs rely mainly on this assumption to take place for ensuring the success of the rendezvous operation. However, none of the existing CH rendezvous designs were tailored for high-density PU networks, where the number of active PUs in the network is larger than the number of the channels. In such networks, the channel availabilities may vary dramatically among the SUs within the single-hop rendezvous region itself. This can lead to the inexistence of any common available channel between a pair of SUs and hence the failure of the rendezvous process.

One approach to overcome this serious rendezvous problem is using directional antennas instead of the conventionally used omnidirectional ones [19]. Directional antennas have been utilized in emerging wireless networks such as the millimeter-wave (MMW) networks for providing highly reliable transmission and multi-Gigabit data rates. This is mainly due to their capabilities in enlarging the transmission range and limiting the interference [20, 21]. However, In CRNs, equipping SUs with directional antennas for channel rendezvous can bring about many advantages. First of all, it allows SUs to transmit their rendezvous messages towards specific directions which can reduce the amount of interference to the PUs in the network as compared with the omnidirectional antennas. This is because the transmission of the SU that is equipped with directional antenna is directed to a particular region which can only cause interference to those PUs that are within this region. On the contrary, when using the omnidirectional antennas, the transmission of the SU is scattered towards all the directions. Thus, it can cause interference to all the surrounding PUs within the SU transmission range. Second, as related to the interference restriction imposed by the CR concept, SUs can use only the channels that are idle from any PU activities within their transmission range. According to that and due to its directed transmission range, using directional antenna will increase the number of available channels that can be utilized by the SU in each of its transmission sectors. As a consequence, the probability for any pair of neighbouring SUs to have at least a common available channel within their crossed sectors is high regardless of the number of PUs in the CRN. Note that, in omnidirectional antennas, this probability could be less than 0.1 for some scenarios when the number of PUs is larger than the network channels [19]. Increasing the probability of existing common available channel between the SUs will significantly enhance the probability of successful channel rendezvous. Therefore, in this paper, we study the rendezvous problem in directional antenna CRNs where SUs are equipped with directional antennas.

While the use of directional antennas for channel rendezvous in CRNs can bring about the above-mentioned advantages, it also imposes some unique challenges. Among these challenges is the sector rendezvous which must be achieved in advance between the pair of communicating SUs before they can achieve channel rendezvous. Specifically, the SUs need to steer their antennas towards each other in order to communicate over their commonly available channels. This necessitates the design of a deterministic sector hopping (SH) scheme that can guarantee that any pair of neighbouring SUs will steer their antennas to the proper directions (i.e., towards each other) at a certain time instance. So, when the SH scheme is combined with a suitable and deterministic CH scheme, SUs can achieve successful sector and channel rendezvous simultaneously within a bounded time. However, since the SUs do not know the relative locations of each other as well as the available channels before they rendezvous, the combined sector and channel hopping (SCH) scheme should be designed in fully distributed manner without any prior information or synchronization. Designing such combined SCH schemes for achieving rendezvous in DIR-CRNs is intuitively more challenging as compared with the traditional omnidirectional antenna paradigm.

In spite of the existing research in the literature, there have been some papers that addressed the utilization of directional antennas in CRNs. However, most of the proposed works investigated issues other than the rendezvous issue such as sensing [22, 23], routing [24, 25], and connectivity [26, 27]. To the best of our knowledge, the works in [19, 28] are the only proposals that tackle the sector and channel rendezvous issue in DIR-CRNS. In [19], an efficient framework for beamforming was proposed to provide a pairwise sector and channel rendezvous in DIR-CRNs. However, the SH scheme in [19] is not a blind design, where it assumes that the receiver must have prior knowledge of the sender number of sectors in order to achieve a successful sector rendezvous. This is not practical, since SUs do not know any information about each other before they rendezvous. On the other hand, Li and Xie in [28] proposed a blind prime-based SH scheme, where the number of sectors is adjusted to primes for achieving a guaranteed sector rendezvous. However, since the scheme relies on the coprimality between prime numbers only, the authors added an initiating rotated SH sequence on the sender side. This is in order to ensure a successful rendezvous with the receiver when the sender and the receiver construct their sequences with the same prime. Accordingly, the extra sequence overhead incurs extensively long sector rendezvous latency and hence a long time-to-rendezvous (TTR) will result when the SH is combined with a CH sequence. Furthermore, the SH schemes in [19,28] are designed only for asymmetric-role environment, where SUs have preassigned role (i.e., SU is either a sender or receiver). However, this design limits the applications of the schemes; for example, SUs cannot work as a forwarder (i.e., receive packets from one SU and then forward them to another SU) due to the permanent role assignment [29]. Another drawback of these works is their limitations to provide a complete solution for combining the SH scheme with a suitable and efficient CH scheme which consider the unique traits of DIR-CRNs. They claimed that their SH schemes can work on top of any existing deterministic CH schemes which were designed for the omnidirectional antennas paradigm. However, the combined CH scheme must be designed appropriately by taking into account the unique traits of DIR-CRNs such as the channels' qualities in the different sectors.

In this paper, we propose efficient schemes for achieving rendezvous in DIR-CRNs. The main contributions of this paper are summarized as follows:

(i) We propose two asymmetric- and symmetric-role coprimality-based SH schemes, called PES-SH and IPES-SH, for pairwise sector rendezvous in DIR-CRNs.

(ii) We combined our SH schemes with an efficient grid-quorum-based CH scheme, where the CH sequences are generated based on the best-quality channels in the sectors. The combined SCH schemes will provide guaranteed sector and channel rendezvous between the pair of SUs.

(iii) We derive the upper bound of the rendezvous delay metrics for all of our schemes. Also, we conduct extensive simulations to study their performance under various network settings and compare them with the related existing works in [19, 28, 30].

The rest of this paper is organized as follows. The system model and problem formulation are presented in Section 2. The design and theoretical analysis of the proposed SH schemes are presented in Sections 3 and 4. In Section 5, we present the combined sector and channel hopping schemes. Using simulations, in Section 6, we evaluate the performance of our proposed schemes and compare their performance with other comparable schemes. Finally, we conclude the paper in Section 7.

2. Models and Problem Definition

In this section, we present the system model and rendezvous problem definition in DIR-CRNs.

2.1. System Model. We consider a CRN consisting of K SUs that coexist with several PUs in an wxw area. There are totally L primary channels which can be accessed opportunistically by the SUs in order to communicate with each other. Each SU i [member of] K is equipped with a directional antenna with beamwidth [[theta].sub.i] (0 < [[theta].sub.i] < 2[pi]). Accordingly, the 2[pi] communication range of the SU i is divided into [N.sub.i] = (2[pi]/[[theta].sub.i]) nonoverlapping sectors that are indexed from 1 to Nt. However, the number of sectors and the orientation of the sector indexing (i.e., either clockwise or anticlockwise) by each SU maybe different from the others (see Figure 1). This is a very practical issue because each SU will configure its sectors based only on its own view to the surrounding environment. Each SU can transmit over any of its transmission sectors as long as it does not make any interference to any active PU transmission. Accordingly, we assume that the transmission sectors are also used as sensing sectors by which every SU can sense the appearance of the active PUs within them. Thus, the SU can obtain the channel availability information per each sector. We consider a time-slotted communication, where time is divided into discrete slots that have fixed and equal durations. During each time slot, we assume that a SU can only transmit in one sector over a single channel.

2.2. Definitions of Sector and Channel Rendezvous. In this paper, we mainly focus on the pairwise sector and channel rendezvous between any pair of SUs in a DIR-CRN. Firstly, we define the sector rendezvous problem as follows.

2.2.1. The Sector Rendezvous Problem. For any two neighbour SUs (say [SU.sub.i] and [SU.sub.j]) that are equipped with directional antennas and want to communicate with each other, assume that [SU.sub.i] is located in the sector [h.sub.j] [member of] [1, [N.sub.j]] of [SU.sub.j] and [SU.sub.j] is situated in the sector [h.sub.i] [member of] [1, [N.sub.i]] of [SU.sub.i]. The pair of the sectors ([h.sub.i], [h.sub.f]) is called the sector rendezvous pair. SUs are said to achieve a successful sector rendezvous if and only if they steer their antennas towards each other, where their transmission sectors can cover each other. Formally, let [mathematical expression not reproducible] and [mathematical expression not reproducible] denote the sector hopping sequences for [SU.sub.i] and [SU.sub.j], with periods [T.sub.i] and [T.sub.j], respectively. Also let [delta] denote the clock drift between [SU.sub.i] and [SU.sub.j] in the asynchronous scenario. The sector rendezvous problem can be formulated as follows:

If [for all][delta], [for all][N.sub.i], [N.sub.j], [there exists]t [member of] [0, [T.sub.i][T.sub.j] - 1], s.t, ([S.sup.t.sub.i] = [h.sub.i] and [S.sup.t+[delta].sub.j] = [h.sub.j]), then the sector rendezvous is achieved over the sector rendezvous pair ([h.sub.i], [h.sub.j]).

2.2.2. The Sector and Channel Rendezvous Problem. When a SU steers its directional antenna to each sector of its transmission sectors, it performs CH over the available channels within the sector according to a CH sequence. This is in order to attempt channel rendezvous with another SU over a commonly available channel between them. The combined CH scheme should be designed in such a way that guarantees a successful channel rendezvous within bounded time whenever the communicating SUs already achieved a successful sector rendezvous. During the current sector, if the SU does not achieve channel rendezvous with its intended communicating SU within the bounded time slots, it then steers its antenna to the next sector of its SH sequence and executes the CH scheme based on the available channels within this sector.

One approach to view the problem is to look at it in a hierarchical way, in which time is divided into frames, where the SU tunes its antenna to one sector during each frame. In other words, the SH is implemented on the frame scale. Then, each frame is divided into number of time slots, where the combined CH sequence is executed (i.e., the CH is implemented on the time slot scale). The main goal of this paper is to design deterministic combined SCH scheme so as to tackle the sector and channel rendezvous problem.

2.2.3. Metrics. The proposed SH schemes as well as the combined SCH schemes will be evaluated according to the following metrics:

(i) Sector rendezvous latency (SRL): it is defined as the required latency (in number of sector frames) for a pair of SUs to achieve sector rendezvous. We consider the maximum and average latency (MSRL/ASRL). MSRL is defined as the upper bound of the SRL between the SUs for all the possible clock drifts between them

(ii) Time-to-rendezvous (TTR): it is defined as the required time (in number of time slots) for a pair of SUs to achieve sector and channel rendezvous simultaneously. Maximum and average time-to-rendezvous (MTTR/ATTR) are considered. MTTR means the required time for a guaranteed rendezvous even in the worst case.

3. Prime- and Even-Based Sequences Sector Hopping (PES-SH) Scheme

In this section, we propose an asymmetric-role SH scheme, called prime- and even-based sequences sector hopping (PES-SH) scheme, and then we analyze its theoretical performance.

3.1. Scheme Design. For ensuring a successful sector rendezvous between a pair of communicating SUs, the key for the deterministic design of our PES-SH scheme is to construct two SH sequences based on two coprime numbers. However, the coprimality is maintained between a pair of prime and even numbers that are relatively prime (i.e., coprime). In our PES-SH scheme, we assume that [N.sub.max] is a global variable known by all SUs, which indicates the maximum number of sectors by which any SU is allowed to divide its omnidirectional 2[pi] transmission range. The value of [N.sub.max] is obtained based on the number of channels in the network; for example, for L number of channels, the value of [N.sub.max] could be 2 x L. Accordingly, we consider two avoided sets: 1

(1) The Avoided Prime Set (APS) which contains the primes {2,3}

(2) The Avoided Even Set (AES) which contains any even number in the range [2, [P.sub.max]], such that this even number is dividable by any prime number in the range [5, [P.sub.max]]. [P.sub.max] is the smallest prime not less than [N.sub.max]. For example, if N.sub.max] = 20, then [P.sub.max] = 23 and hence AES = {10,14,20,22}

The APS and AES sets are avoided by the sender and receiver, respectively, when they construct their SH sequences. Without loss of generality, assume that sender and receiver have [N.sub.s] and [N.sub.r] antenna sectors, respectively, where [N.sub.s], [N.sub.r] [member of] [1, N.sub.max]]. The main idea for the rendezvous of our PES-SH scheme is to let one SU (sender) adjust the number of its sectors to be the smallest prime number greater than [N.sub.s]. On the other hand, the other SU (receiver) adjusts the number of its sectors to the smallest even number which is not smaller than [N.sub.r] and not in the AES. Accordingly, the adjusted prime number of sectors for the sender and the adjusted even number of sectors for the receiver are guaranteed to be relatively prime.

Algorithms 1 and 2 are used by the sender and receiver, respectively, to construct each round of their SH sequences. The generating steps of the PES-SH sequences are as follows.

3.1.1. Sender Sequence in PES-SH. When a SU has data to transmit, it serves as a sender and hence generates a prime-based (PS-SH) sequence as follows. First, given the sector set S = {1, ..., Ns}, randomly select a starting sector index i [member of] [1, [N.sub.s]] and rotate S circularly starting from i as S = rotate(S, i - 1). Second, adjust Ns to be the smallest prime number [P.sub.s] which is not smaller than Ns and is not in the APS set (i.e., [P.sub.s] should be 5 when [N.sub.s] < 5). Third, construct each round of the PS sequence which has a length equal to [P.sub.s] as follows: the [k.sub.th] sector index of the PS round is S(k) if k [less than or equal to] [N.sub.s]; otherwise the [k.sub.th] sector is selected randomly form S when k > [N.sub.s]. The sender will keep steering its antenna according to the PS sequence until it achieves sector rendezvous with its intended receiver.

Consider the cases for the sender SUs X and V in Figure 1; SU X in Figure 1(a) has a prime number of sectors [N.sub.x] = 5, where [S.sub.x] = {1, 2, ...,5} is not rotated. Then the first round of the [PS.sub.X] SH sequence with a length 5 is [1 2 3 4 5]. This round is repeated many times, where [SU.sub.X] continues steering its directional antenna into its sectors as shown in Figure 2(a) to achieve sector rendezvous with its receiver [SU.sub.Y]. On the other hand, the sender [SU.sub.V] in Figure 1(b) has [N.sub.V] = 4 number of sectors, so it selects [P.sub.V] = 5 as the smallest prime which is larger than [N.sub.V]. [S.sub.V] is rotated to start from 3 and hence [S.sub.v] = {3, 4, 2, 1}. Then the first round of the [PS.sub.V] SH sequence which has adjusted length equal to [P.sub.v] = 5 is [3 4 2 1 r], where r indicates a randomly selected sector from [S.sub.V]. The [PS.sub.V] SH sequence is constructed as many rounds as shown in Figure 2(b), where [SU.sub.V] keeps hopping on its sectors to achieve sector rendezvous with the receiver [SU.sub.Z].

ALGORITHM 1: The sender SH generation algorithm (PS-SH). Input: [N.sub.s], [S.sub.s]. Output: a round a of the PS sequence for the sender s. (1) Find the smallest prime ([P.sub.s] > 3) that is not smaller than [N.sub.s]. (2) for t = 0 : [P.sub.s] - 1 do (3) if ((t mod [P.sub.s]) < [N.sub.s]) then (4) [[omega].sub.s](t) = [S.sub.s](t + 1). (5) else (6) r is a random number e [1,MS] (7) [[omega].sub.s](t) = [S.sub.s](r). (8) end if (9) end for (10) return [[omega].sub.s]. ALGORITHM 2: The receiver SH generation algorithm (ES-SH). Input: [N.sub.r], [S.sub.r], AES. Output: a round [gamma] of the ES-SH sequence for the receiver r. (1) Find ([E.sub.r] : [E.sub.r] [not member of] AES) as the smallest even number that is not smaller than [N.sub.r]. (2) for t = 0 : [E.sub.r] - 1 do (3) if ((t mod [E.sub.r]) < [N.sub.r]) then (4) [[gamma].sub.r](t) = [S.sub.r](t + 1). (5) else (6) r is a random number [member of] [1, [N.sub.r]] (7) [[gamma].sub.r](t) = [S.sub.r](r). (8) end if (9) end for (10) return [[gamma].sub.r].

3.1.2. Receiver Sequence in PES-SH. If a SU has nothing to transmit, it serves as a receiver and generates an even-based (ES-SH) sequence as follows. First, randomly select a starting sector index j [member of] [1, [N.sub.r]] and circularly rotate the sector set S = {1, ..., [N.sub.r]} starting from j as S = rotate(S, j - 1). Second, adjust [N.sub.r] to be the smallest even number [E.sub.r] which is not smaller than [N.sub.r] and is not in the Avoided Even Set (AES). Finally, construct each round of the ES sequence which has a length equal to [E.sub.r] as follows: the [k.sub.th] sector index of the ESSH round is S(k) if k [less than or equal to] [N.sub.r]; otherwise the [k.sub.th] sector is selected randomly form S.

Consider the receiver [SU.sub.Y] in Figure 1(a) which has an even number of sectors NY = 4 which is not in AES and does not rotate its [S.sub.Y] set. The round of the [ES.sub.Y] SH sequence with a length 4 is [1 2 3 4]. This round is repeated many times by [SU.sub.Y] in order to be paired by a sender as shown in Figure 2(a). On the other hand, the receiver [SU.sub.Z] in Figure 1(b) has [N.sub.Z] = 3 sectors; hence it finds [E.sub.Z] = 4 as the smallest even number larger than [N.sub.Z] and not in AES. [SU.sub.Z] rotates its [S.sub.Z] to start from sector 2 and hence [S.sub.V] = {2,3,1}. Accordingly, a round of the [ES.sub.Z] SH sequence with a length adjusted to [E.sub.z] = 4 is [2 3 1 r], where r is a randomly selected sector from [S.sub.z]. The [ES.sub.Z] SH sequence is constructed in rounds as shown in Figure 2(b).

3.2. Scheme Analysis. In this subsection, we study the theoretical performance of the PES-SH, where the MSRL between any two arbitrary SUs performing the PES-SH is derived.

Theorem 1. The MSRL under the PES-SH scheme is ([P.sub.s][E.sub.r]), where [P.sub.s] and [E.sub.r] denote the adjusted prime and even numbers of the sectors for the sender and receiver SUs, respectively.

Proof. Suppose that the sector rendezvous pair is (hs, hr) e {1, 2, ..., [N.sub.s]} x {1, 2, ..., [N.sub.r]}, where x here indicates the Cartesian product of the two SUs sectors sets. Without loss of generality, we assume that [P.sub.s] < [E.sub.r]. Also, we assume that the receiver [SU.sub.r] starts its SH sequence with [delta] sector slots earlier than the start of the sender [SU.sub.s]. Accordingly, in each PS-SH period of [SU.sub.s], the ES-SH sequence of [SU.sub.r] is rotate ([ES.sub.r], [delta]). In the first round of the SH, when the sender [SU.sub.s] is on its [h.sub.s] sector, the receiver [SU.sub.r] is on the ([u.sub.1] = [u.sub.0] mod [E.sub.r] + 1) sector, where 1 [less than or equal to] [u.sub.0] [less than or equal to] [N.sub.r]. During the subsequent [E.sub.r] - 1 rounds, while the sender SU is on its [h.sub.s] sector, the receiver [SU.sub.r] must be sequentially on [u.sub.2] = (([u.sub.0] + [P.sub.s]) mod [mathematical expression not reproducible] mod [E.sub.r] + 1). As [P.sub.s] and [E.sub.r] are relatively prime, it can be easily proven with the help of the Chinese Reminder Theorem [31] that these [mathematical expression not reproducible] sectors where the receiver resides in the [E.sub.r] rounds are all different. Hence, there must exist a sector among them which is equal to [h.sub.r]. According to that and since every round of the PS-SH contains [P.sub.s] sector hops, the SRL required to guarantee a sector rendezvous is upper bound by [P.sub.s][E.sub.r].

4. Interleaved Prime- and Even-Based Sequences Sector Hopping (IPES-SH) Scheme

In the previous section, the PES-SH scheme was designed using the asymmetric approach which requires that each SU have a preassigned role as either a sender or a receiver. In this section, we introduce our interleaved prime- and even-based sequences (IPES-SH) scheme, which is symmetric (i.e., no preassigned role assumption).

4.1. Scheme Design. In our symmetric IPES-SH scheme, every SU generates its SH sequence with the help of a binary bit sequence such as its globally unique ID. The SH sequence is constructed as an interleaved sequence of several PS and ES SH sequences through a two-step approach. Firstly, each SU transforms its unique ID according to a certain design into another ID sequence so that it is cyclically unique; that is, the resulting ID sequences of any two SUs are cyclic rotationally distinct to each other. Secondly, the SU replaces any bit of 1 (or 0) in its new ID sequence with a PS-based (or ES-based) SH sequence. Accordingly, for any pair of SUs, the cyclic uniqueness property will guarantee the existence of some time instances, where the two SUs are playing different roles. Hence, the sector rendezvous is achieved when one SU is hopping according to its PS sequence while the other SU is hopping based on its ES sequence and vice versa.

Several methods have been proposed in the literature to transform the unique ID into another cyclically unique binary sequence. In [32], a method was proposed to expand the m-bit ID into another 3m-bit extended ID that is cyclically unique. The unique m-bit ID in that method is expanded by appending m-bit consecutive 0's into the beginning of the ID and other m-bit consecutive 1's at the end of the ID. Another method for generating cyclically unique IDs that are used for the construction of symmetric role SH sequences has been proposed in [30]. The method appends the original m-bit ID with other (m + 1)-bits of consecutive 0's and 1's, which results in (2m + 1)-bits expanded ID sequence. However, the extended ID sequences generated by these methods are relatively long, especially for the former method. This results in long rendezvous delay when they are used for constructing symmetric role sequences. Therefore, we propose an alternative method for constructing cyclic rotationally distinct sequences, which provides shorter extended ID lengths than the methods in [30, 32]. So, it provides shorter sector rendezvous delay when it is used for constructing symmetric role sequences in our IPES-SH scheme.

4.1.1. Constructing the Cyclic Unique ID Sequences. In our method, each m-bit ID is extended by appending only m-bits of 1's and 0's in the beginning and in the end of the ID.

Lemma 2. Given any two m-bit ID sequences [alpha] = {[[alpha].sub.1], ..., [[alpha].sub.m]} and [beta] = {[[beta].sub.1], ..., [[beta].sub.m]}, let a and b be two 2m-bit expanded ID sequences generated from [alpha] and [beta] as follows:

[mathematical expression not reproducible] and [mathematical expression not reproducible], where 1(*) is a bit sequence composed of only 1's and 0(*) is a bit sequence composed of only 0's. Then a and b are cyclic rotationally distinct from each other, which means that

If a [not equal to] b [??] a [not equal to] rotate (b, k), [for all]k [member of] (0, 2m - 1]. (1)

Proof. To prove the above lemma, we consider all the possible cases that may happen when sequence b is rotated with (k [member of] (0, 2m - 1]). We show in each case that bits in sequence a and other bits in sequence b' = rotate(b, k) have different values, even though these bits are in the same positions. Considering the five cases in Figure 3, it is sufficient to prove that a and b' = rotate(b, k) are cyclic rotationally distinct to each other.

Case 1 (k [member of] (0, [??]m/2[??]]). As indicated by the red arrow in Figure 3, it holds that [a.sub.2m] = 0 and [b'.sub.2m] = 1.

Case 2 (k [member of] ([??]m/2[??], m)). As indicated by the red arrow in figure 3, it holds that [a.sub.([??]m/2[??]]+m+1)] = 0 and [b'.sub.([??]m/2[??]+m+1)] = 1.

Case 3 (k = m). As indicated by the m red arrows in Figure 3, the m bits of sequence a starting from [a.sub.([??]m/2[??]+1)] are {[[alpha].sub.1], ..., [[alpha].sub.m-1]}, while the m bits of b' in the same positions are 0([??]m/2[??]) [parallel] 1([??]m/2[??]). On the other hand, as indicated by the m purple arrows in Figure 3, the first [??]m/2[??] bits of sequence a are 1's and the last [??]m/2[??] are 0's, whereas the first [??]m/2[??] bits of b' are {[[beta].sub.([??]m/2p[??]), ..., [[beta].sub.m]] and the last [??]m/2[??] bits are {[[beta].sub.1], ..., [[beta].sub.([??]m/2[??])]. And because [alpha] [not equal to] [beta], it holds that there must be at least a single bit that is different in a and b'.

Case 4 (k [member of] (m, m + [??]m/2[??]]). As indicated by the red arrow in Figure 3, it holds that [a.sub.([??]m/2[??])] = 1 and [b'.sub.([??]m/2[??])] = 0.

Case 5 (k [member of] (m + [??]m/2[??], 2m - 1]). As indicated by the red arrow in Figure 3, it holds that [a.sub.1] = 1 and [b'.sub.1] = 0.

According to these possible cases, we conclude that a [not equal to] rotate(b, k), [for all]k [member of] (0, 2m - 1]. In Figure 4, we give an example for two ID sequences of original lengths m = 4 which are expanded to m = 8 bits. The figure illustrates the cyclic uniqueness property between the IDs for all the rotation cases (i.e., [for all]k [member of] [0,7]).

4.1.2. Generating the Interleaved Sector Hopping Sequence. We now explain how to generate the symmetric IPES-SH sequence for any SU, say [SU.sub.i]. Let the number of sectors for [SU.sub.i] be [N.sub.i] and hence the sector set [S.sub.i] = {1, ..., [N.sub.i]}. Suppose that [SU.sub.i] has m-bits globally unique ID sequence, [alpha], which is extended by our above method to 2m-bits sequence a = 1([??]m/2[??])[parallel][alpha][parallel]0([??]m/2[??]).

(i) Select randomly a starting index k [member of] [1, [N.sub.i]] and generate a rotated set [S.sup.P.sub.i] by rotating circularly starting from k as [S.sup.P.sub.i] = rotate([S.sub.i], k - 1). Also, generate another sector indices set as a reverse of [S.sup.P.sub.i] which is [S.sup.E.sub.i] = Reverse([S.sup.P.sub.i]).

(ii) Find ([P.sub.i] : [P.sub.i] > 3) as the smallest prime number that is not smaller than [N.sub.i]. Also find ([E.sub.i] : [E.sub.i] [not member of] AES) as the smallest even number that is not smaller than [N.sub.i].

(iii) Define an empty matrix [M.sub.i] that has 2m columns and [P.sub.i] x [E.sub.i] rows.

(iv) Fill the matrix by mapping each bit in a to a certain column as described in Algorithm 3.

(v) Generate the SH sequence by concatenating the matrix rows (row by row). SU; keeps hopping according to this generated SH sequence and repeats it in order to rendezvous with its pair partner SU.

Figure 5 illustrates the IPES-SH sequence construction matrices for [SU.sub.V] and [SU.sub.Z] in our previous example in Section 3.1 (Figure 1(b)). In Figure 5, the ID sequence of [SU.sub.V] that has [N.sub.v] = 4 sectors is [alpha] = {1,0} which is expanded to a = {1, 1, 0, 0}. On the other side, the ID sequence of [SU.sub.V] that has [N.sub.z] = 3 sectors is [beta] = {0,1} which is expanded also to b = {1, 0, 1, 0}. The constructed matrix for [SU.sub.V] has [P.sub.v] x [E.sub.v] = 5 x 4 = 20 rows and 2m = 4 columns. Similarly, [SU.sub.Z] constructs its matrix with [P.sub.z] x [E.sub.z] = 5x4 = 20 rows and 2m = 4 columns. Each SU will assign its matrix columns with either PS sequence or ES sequence based on the corresponding bits of its extended ID sequence. For example, since the first bit of [SU.sub.V] extended ID is one, [SU.sub.V] firstly generates its first sector sets as [S.sup.P.sub.v] = {3, 4, 1, 2} and then invokes Algorithm 1 with [S.sup.P.sub.v] and NV = 4 to construct a round of a PS sequence [omega] = [3 4 1 2 r]. This round [omega] is repeated for [E.sub.v] = 4 times and assigned to the first column of [SU.sub.V] matrix. Similarly, since the second bit of [SU.sub.V] extended ID is one, the second column of [SU.sub.V] matrix is assigned with a repeated sequence of the PS sequence [4 1 2 3 r], which is constructed after rotating the sector set [S.sup.P.sub.v] by one. On the other hand, [SU.sub.V] assigns the third and fourth columns of its matrix with ES sequences because the corresponding 3rd and 4th bits of its extended ID sequence are zeros. Specifically, [SU.sub.V] invokes Algorithm 2 with [S.sup.E.sub.v] = Reverse([S.sup.P.sub.v]) and [N.sub.v] = 4 to construct a round of an ES sequence [gamma] = [2 1 4 3]. This round [gamma] of the ES sequence is then repeated for [P.sub.v] = 5 times and assigned to the third column of [SU.sub.V] matrix. Similarly, the fourth column of [SU.sub.V] matrix is filled with the ES sequence [1 4 3 2] after repeating it for [P.sub.v] = 5 times. Note that [SU.sub.Z] will follow the same procedures as [SU.sub.V] to construct its matrix with taking into account the different expanded ID sequence [b.sub.z] = {1, 0, 1, 0} and [N.sub.z], as well as the initial sector sets [S.sup.P.sub.z] and [S.sup.E.sub.z].

ALGORITHM 3 (1) for c = 1 : 2m do (2) if ([a.sub.c] == 1) then (3) Invoke Algorithm 1 with [S.sup.P.sub.i] and [N.sub.i] to construct a round [omega] of an PS sequence. (4) generate [omega] by repeating [omega] for [E.sub.i] times. (5) Map the [c.sub.th] column of the matrix with [omega]'. (6) [S.sup.P.sub.i] = Rotate([S.sup.P.sub.i],, 1). (7) else (8) Invoke Algorithm 2 with [S.sup.E.sub.i] and [N.sub.i] to construct a round [gamma] of an ES sequence. (9) generate [gamma]' by repeating [gamma] for [P.sub.i] times. (10) Map the [c.sub.th] column of the matrix with [gamma]'. (11) [S.sup.E.sub.i] = Rotate([S.sup.E.sub.i], 1). (12) end if (13) end for

Figure 6 shows partial sector slots of the IPES-SH sequences for the two SUs ([SU.sub.V] and [SU.sub.Z]). As depicted from the figure, the IPES-SH sequence of each SU is generated by concatenating the rows of the SU constructed matrix in Figure 5 row by row. The sequences are generated as interleaved slots of PS (light blue) and ES (gray) slots according to the respective columns types in the matrices. The figure also illustrates the rendezvous sector occurrence between the SUs (indicated by the green circle) on the sector rendezvous pair (4,1).

4.2. Scheme Analysis. In this subsection, the theoretical performance of IPES-SH scheme is studied where the MSRL is derived.

Theorem 3. Under the IPES-SH scheme, the MSRL between a pair of SUs ([SU.sub.i] and [SU.sub.j]) is 2m x (max{([P.sub.i][E.sub.j]), ([E.sub.i][P.sub.j])}).

Proof. To prove that IPES-SH has MSRL = 2m(max{([P.sub.i][E.sub.j]), ([E.sub.i][P.sub.j])}), it is sufficient to prove that any arbitrary pair of IPES-SH sequences, for example, [IPES.sub.i] and [IPES.sub.j], can achieve a successful sector rendezvous within 2m (max{([P.sub.i][E.sub.j]), ([E.sub.i][P.sub.j])}) sector slots.

Let [IPES.sub.i] and [IPES.sub.j] be the corresponding IPES-SH sequences of IPES matrices [M.sub.i] and [M.sub.j] (i.e., [IPES.sub.i] and [IPES.sub.j] are generated by concatenating the rows of matrices [M.sub.i] and [M.sub.j], resp.). For example, Figures 5(a) and 5(b) show the IPES matrices [M.sub.V] and [M.sub.Z], respectively. Without loss of generality, assume that [SU.sub.j] starts its SH sequence [delta] sector slots earlier than the start of [SU.sub.i]. In each SH period of [SU.sub.i], the SH sequence of [SU.sub.j] is rotate([IPES.sub.j], [delta]). Clearly, the rendezvous between this pair of SUs is the same as the rendezvous of [M.sub.i] and [M.sub.(j,[delta])]. Suppose that the sector rendezvous pair is ([h.sub.i], [h.sub.j]) [member of] {1, 2, ..., [N.sub.i]} x {1, 2, ..., [N.sub.j]}. The rendezvous of the matrices is a pair of entries in the matrices whose value in [M.sub.i] is [h.sub.i] and its values in [M.sub.(j,[delta])] is [h.sub.j]. Without loss of generality, suppose that the sector slot shift [delta] = 2m [[delta].sub.R] + [[delta]sub.C], where [[delta].sub.R] [member of] [0, ([P.sub.j] x [E.sub.j]) - 1], is the shift of row and [[delta].sub.C] [member of] [0,(2m) - 1] is the shift of column. Below, we consider the two different cases for rendezvous of [IPES.sub.i] and [IPES.sub.j].

Case 1 ([[delta].sub.C] = 0). In this case, it is implied that there is no column shift. Recall that the expanded ID sequences of [SU.sub.i] and [SU.sub.j] are distinct. Since the columns types of the matrices are assigned based on these distinct expanded IDs, it is guaranteed that there must exist at least a single common column f in both matrices which is a PS-column in one matrix and an ES-column in the other matrix, and vice versa. In other words, the [f.sub.th] column of [M.sub.i] contains a PS-SH sequence (reps., ES-SH), while the same position [f.sub.th] column in contains an ES-SH (resp., PS-SH). By Theorem 1, we know that when [SU.sub.i] and [SU.sub.i] repeat the PS-SH (resp., ES-SH) and the ES-SH (resp., PS-SH) sequences, respectively, they rendezvous within [P.sub.i] x [E.sub.j] (resp., [E.sub.i] x [P.sub.j]). Meanwhile, since the elements of a specific column of each matrix appear in the corresponding IPES-SH sequence every 2m slots, for any value of the row shift [[delta].sub.R], [M.sub.i] and [M.sub.(j,[delta])] are guaranteed to rendezvous on their [f.sub.th] columns no later than 2m x max{([P.sub.i][E.sub.j]), ([E.sub.i][P.sub.j])}. Specifically, the rendezvous happens when an entry of the [f.sub.th] column in [M.sub.i] is [h.sub.i], while the same position entry of the [f.sub.th] column in [M.sub.(j,[delta])] is [h.sub.j]. For example, Figure 5 shows the rendezvous of [M.sub.V] and [M.sub.Z] for the synchronous case where the slots shift [delta] = 2m x 0 + 0 = 0. The sector rendezvous occurs between the second columns of [M.sub.V] and [M.sub.Z] which is indicated by the green entry in [M.sub.Z]. However, Figure 7(a) shows the IPES matrix of [SU.sub.Z] when it is shifted with row shift [[delta].sub.R] = 10. Hence, this means that [delta] = 2m x 10 + 0 = 40. The rendezvous between [M.sub.V] in Figure 5 and [M.sub.(Z,40)] in Figure 7(a) is achieved at their third columns.

Case 2 ([[delta].sub.C] = 0). In this case, it holds that there is a column shift [[delta].sub.C] [member of] [1, (2m - 1)]. Let a and b be the expanded ID sequences of [SU.sub.i] and [SU.sub.j], respectively. By Lemma 2, we know that a and b' = rotate(b, k), where k [member of] (2m - 1) are cyclic rotationally distinct to each other. Thus, for a column shift [[delta].sub.C] [member of] [1, (2m - 1)] of matrix [M.sub.j], there must exist a column f in matrix [M.sub.i] which has different type than the same position [f.sub.th] column in the shifted matrix [mathematical expression not reproducible]. Accordingly, the rendezvous is guaranteed to occur at the [f.sub.th] columns in the matrices, despite any value of the row shift [[delta].sub.R]. For example, Figure 7(b) shows the shifted IPES matrix of [SU.sub.Z] when the column shift [[delta].sub.C] = 1 and the row shift [[delta].sub.R] = 10, which results in [delta] = 2m x 10 + 1 = 41 slots. The first rendezvous between [M.sub.V] in Figure 5 and [M.sub.(Z,41)] in Figure 7(b) is achieved at the forth columns.

Summarizing the discussion above, we show that, in IPES-SH, any two SUs are guaranteed to rendezvous on their sector rendezvous pair within SH period 2m x max{([P.sub.i][E.sub.j]), ([E.sub.i][P.sub.j])}.

5. Combined Sector and Channel Hopping Schemes

While we explained in the previous sections the procedures of our SH schemes by which the SUs keep steering their antennas in order to achieve sector rendezvous with their communicating partners, the scheme for channel hopping (CH) exposed by the SUs in their sectors for achieving a channel rendezvous between them was not explained. In this section, the design of the exposed CH scheme and the procedure for the combined sector and channel hopping (SCH) schemes are presented. The key for the design of the exposed CH scheme is to construct two different types of CH sequences which will be combined within the two different types of PES-SH sequences. These CH sequences must guarantee a successful channel rendezvous between the pair of SUs as long as they achieve a successful sector rendezvous (i.e., directing their antenna beams towards each other). Furthermore, the CH sequences should be designed in such a way that the pair of communicating SUs stay for a similar period (i.e., number of time slots) in each sector of their SH sequences. By doing this, the pair of communicating SUs are guaranteed to achieve successful sector and channel rendezvous within a bounded and short time, despite any asynchronous time offsets between their local clocks.

5.1. Asymmetric Grid Quorum-Based Channel Hopping. In this subsection, we explain the design of our Asymmetric Grid Quorum-based Channel Hopping (AGQ-CH) scheme that is executed by the SUs in each sector of their SH sequences. The AGQ-CH scheme utilizes the grid quorum system (GQS) in asymmetric-role design, where two types of CH sequences are constructed. These types of CH sequences will be combined within the two different types of our SH sequences. Some preliminary definitions related to grid quorum systems are presented first to facilitate the understanding of the CH scheme.

Definition 4. For a set [Z.sub.n] = {1, 2, ..., n}, a quorum system Q under [Z.sub.n] is a group of nonempty subsets of [Z.sub.n], each called a quorum, such that [for all]X and Y [member of] Q, X [intersection] Y [not equal to] 0. Here, [Z.sub.n] is the set of integers less than or equal to n.

Definition 5. A GQS arranges the elements of [Z.sub.n] as a [square root of n]x [square root of n] square grid array, where n must be a square of a positive integer. Hence, a quorum is formed as a union of the elements of one column and one row of the grid. There are n grid quorums in a GQS that is constructed under [Z.sub.n] and each quorum has a size of (2 x [square root of n] - 1).

For example, a GQS Q under [Z.sub.n] = {1, 2, 3, 4} is Q = {[Q.sub.1], ..., [Q.sub.4]} = {{1, 2, 3}, {1, 2, 4}, {1, 3, 4}, {2, 3, 4}}.

Definition 6. For a given integer i and a grid quorum G in a GQS Q under [Z.sub.n], we define rotate(G, i) = {(x + i) mod n, x [member of] G} to denote a cyclic rotation of quorum G by i.

Definition 7. A GQS Q under [Z.sub.n] satisfies the rotation closure property because, [for all][G.sub.i1], [G.sub.i2] [member of] Q and [for all][j.sub.1], [j.sub.2] [member of] [Z.sub.n], rotate([G.sub.i1], [j.sub.1]) [intersection] rotate([G.sub.i2], [j.sub.2]) [not equal to] 0.

GQSs have been utilized to construct CH sequences that achieve asynchronous communications because they satisfy the intersection and the rotation closure properties [33, 34]. In the conventional GQS, each grid quorum is formed as a union of the elements of one column and one row of the grid array. However, different from the conventional GQS, our asymmetric GQS (AGQS) uses semigrid quorums. One semiquorum, called the Grid Column-based Quorum (GCQ), is formed from the elements of a single column of the grid. Meanwhile, the other semiquorum, called Grid Row-based Quorum (GRQ), is formed from the elements of a single row in the grid. The nonempty intersection and rotation closure properties in the AGQS are inherited from the conventional GQS. Specifically, for any arbitrary pair of GCQ and GRQ, there must exist one common element between them despite any rotation of the grid.

The GCQs and GRQs in the AGQS are used to construct two asymmetric CH sequences that can be combined within the different types of sectors in our SH schemes. The constructed CH sequences are guaranteed to achieve a successful channel rendezvous between a pair of communicating SUs as long as there exists at least a single common channel between the available channel sets of the SUs. In our AGQ-CH scheme, to construct CH sequences for assigning n channels, n x n grid array is built. In the GCQ-based CH sequence, the n rows of the grid are used for assigning the n channels into the CH sequence, where the elements of each row are used to map a single channel. On the other side, the n columns of the grid are used for the assignment of the n channels into the GRQ-based CH sequence. For example, Let n = 4 be the number of channels for a sender [SU.sub.x] and a receiver [SU.sub.y]. Suppose that SUX has the channel set [C.sub.x] = {[Ch.sub.1], [Ch.sub.2], [Ch.sub.3], [Ch.sub.4]}, while the channel set of [SU.sub.y] is [C.sub.y] = {[Ch.sub.3], [Ch.sub.5], [Ch.sub.6], [Ch.sub.8]}. Accordingly, a grid array of size 4x4 is formed by both SUs as shown in Figure 8. Without loss of generality, assume that the sender uses the 4 GCQs to map its channels into the time slots of its CH sequence as depicted in Figure 8(a), while the receiver [SU.sub.y] maps its channels based on the 4 GRQs as depicted in Figure 8(b). The CH sequences for both SUs are shown in Figure 8(c), where they map each channel of their channel sets into the time slots of their CH sequence according to the selected (GCQ or GRQ) semiquorum. As shown in Figure 8(c), the channel rendezvous is achieved on the common channel [Ch.sub.3] between the SUs despite the time offsets between their local clocks.

5.2. Channel Ranking. As explained in the beginning of the section, the sector frame length which represents the number of time slots by which every SU spends on each sector for executing CH should be the same in all SUs. This is in order to guarantee channel rendezvous between any pair of neighbouring SUs side by side with the sector rendezvous despite any time offsets between their local clocks. To achieve this, we let the SUs construct their combined CH sequences based on the best-quality (n [subset or equal to] L) channels. The channel's quality is generally represented by the quantity of the measured PU noise on the channel within the corresponding sector. However, for cases where some of the channels have the same measured PU noise, channels indices are used to differentiate between their ranking levels. Specifically, the bigger the channel index, the higher the quality. We highlight here that the similarity of the measured PU noises for some channels is a practical issue in DIR-CRNs which happen when the channels are idle from any PU activity within the sector area.

The channel ranking is done by each SU before executing the rendezvous process based only on its own view of the available channels in its sectors. Each [SU.sub.i] ranks the L network channels in each sector [S.sub.k] of its sectors set [mathematical expression not reproducible] based on their qualities within the sector k. Thus, a ranking table of size L x [N.sub.i] is maintained by each [SU.sub.i] which contains the ranked channels in all the sectors. This table is called Sectors Ranked Channels Table (SRCT), where each column k of it indicates a sector of the [N.sub.i] sectors. These columns contain the L network channels ranked decreasingly from the best to the worst according to their qualities within the corresponding sectors. We note here that since each SU in the DIR-CRN performs the same ranking mechanism, this will increase the probability of having a similar ranked channel list among any pair of neighbouring SUs on their rendezvous sectors.

5.3. Combined SCH Sequence Generation. We now explain the generation procedures for the combined PES-SCH and IPES-SCH sequences.

5.3.1. Combined PES-SCH Scheme. Since our PES-SH scheme is designed based on two different types of coprimality-based sequences (i.e., either PS or ES), we combine each sector of the SH sequences according to its type with a corresponding type from the two AGQ-CH sequences. Specifically, each sector of the sender PS-SH sequence is combined with a GCQ-CH sequence, while each sector of the receiver ES-SH sequence is combined with a GRQ-CH sequence. Algorithms 4 and 5 describe the SCH generation procedures for the sender and receiver SUs, respectively. As illustrated by the algorithms, each SU will keep hopping on its best n quality channels in each sector of its SH sequence according to the corresponding CH sequence. This will guarantee that when a successful sector rendezvous occurs between a sector frame of the sender [SU.sub.s] and a sector frame of its receiver [SU.sub.r], a successful channel rendezvous is achieved between GCQ-[CH.sub.s] and the GRQ-[CH.sub.r]. The channel rendezvous is guaranteed as long as there is a common channel between their n best channels, where they can set up a link through the exchange of RTS/CTS messages.

ALGORITHM 4: The sender SCH generation algorithm (PS-SCH). Input: [N.sub.s], [S.sub.s], [SRCT.sub.s], n. (1) Invoke Algorithm 1 with [N.sub.s] and [S.sub.s] to construct a round [[omega].sub.s] of an PS-SH sequence. (2) [t.sub.Frame] = 0 (3) while (not rendezvous) do (4) Current-sector= [[omega].sub.s](([t.sub.Frame] mod [P.sub.s]) + 1). (5) Steer the antenna to (Current-sector). (6) Select the best channel list (BCL) in (Current-sector) as BCL = SRCTs [1: n] [Current-sector]. (7) Construct a GCQ-CH sequence based on BCL. (8) for (t = 1 : [n.sup.2]) do (9) Attempt rendezvous on channel [GCQ.sub.s](t). (10) end for (11) [t.sub.Frame] = [t.sub.Frame] + 1 (12) end while ALGORITHM 5: The receiver SCH generation algorithm (ES-SCH). Input: [N.sub.r], [S.sub.r], [SRCT.sub.r], n. (1) Invoke Algorithm 2 with [N.sub.r] and [S.sub.r] to construct a round [[gamma].sub.r] of an ES-SH sequence. (2) [t.sub.Frame] = 0 (3) while (not rendezvous) do (4) Current-sector= [[gamma].sub.r](([t.sub.Frame] mod [E.sub.r]) + 1). (5) Steer the antenna to (Current-sector). (6) BCL = [SRCT.sub.s] [1: n] [Current-sector]. (7) Construct a GRQ-CH sequence based on BCL. (8) for (t = 1 : [n.sup.2]) do (9) Attempt rendezvous on channel [GRQ.sub.r](t). (10) end for (11) [t.sub.Frame] = [t.sub.Frame] + 1. (12) end while

For example, consider the pair of sender [SU.sub.X] and receiver [SU.sub.Y] in our previous example in Figure 1(a). The SCH sequences constructions for the pair of SUs and the rendezvous among them when they construct their combined CH sequences based on n = 2 best-quality channels are illustrated in Figure 9. As a sender, [SU.sub.X] in Figure 9(a) combines each sector of its PS-SH sequence with a grid column (GCQ-CH) sequence based on the two best-ranked channels of the respected column for the sector in [SRCT.sub.X]. For instance, the sector [S.sub.1] is combined with a GCQ-CH sequence generated based on the two best channels {2,4} of the 1st column of [SRCT.sub.X]; the GCQ-CH is [2 4 2 4]. On the other hand, each ES sector of the ES-SH sequence for the receiver [SU.sub.Y] in Figure 9(b) is combined with a grid row (GRQ-CH) sequence based on the best two channels of the [SRCT.sub.Y] column which corresponds to the sector number. For instance, [SU.sub.Y] combine the GRQ-CH sequence [6 6 8 8] within its sector [S.sub.1] which is constructed based on the best channels {6,8}. The sector and channel rendezvous between the SUs when they start their PES-SCH sequences synchronously is shown in Figure 9(c). The rendezvous is achieved during the 25th and 28th time slots on the sector rendezvous pair ([S.sub.2] of [SU.sub.X], [S.sub.3] of [SI.sub.Y]), as well as on the rendezvous channels {1,6}. However, when [SU.sub.X] starts its SCH 4 time slots later than [SU.sub.Y], the channel and sector rendezvous is achieved after 5 time slots only from the SCH start time of [SU.sub.X].

5.3.2. Combined IPES-SCH Scheme. For this symmetric role scheme, any SU can generate its SCH sequence according to Algorithm 6. During each sector frame of its interleaved SH sequence that is constructed using the method in Section 4.1.2, the SU executes one type of the AGQ-CH sequences according to the type of the frame. Specifically, if the sector frame is a prime-based (P-frame), the SU generates a GCQ-CH based on the n best-quality channels in the sector. On the other hand, when the sector is an even-based (E-frame), the SU generates a GRQ-CH. This will ensure that whenever the sector rendezvous occurs between a P-frame of [IPES.sub.i] and an E-frame of [IPES.sub.j], channel rendezvous is achieved between the [GCQ.sub.i] CH sequence and the [GRQ.sub.j] CH sequence, and vice versa.

5.4. Performance Analysis of the Combined SCH Schemes. In this subsection, we analyze the theoretical performance for the combined SCH schemes. Specifically, we prove the guaranteed rendezvous between any two SUs performing the combined SCH scheme by deriving the maximum time-to-rendezvous (MTTR).

Theorem 8. For any scheme S of our SH schemes which is combined with the AGQ-CH scheme for n best-quality channels, the MTTR of the combined SCH is (MSRL (S) x [n.sup.2]). MSRL (S) here denotes the maximum sector rendezvous latency for the S SH scheme.

ALGORITHM 6: IPES-SCH generation algorithm. Input: [N.sub.i], [S.sub.i], Extended-ID a, [SRCT.sub.i] n. (1) Construct an IPES-SH sequence [U.sub.i] as explained in Section 4.1.2. (2) period = ([P.sub.i] x [E.sub.i] x length(a)). (3) [t.sub.Frame] = 0 (4) while (not rendezvous) do (5) Current-sector = [U.sub.i](([t.sub.Frame] mod period) + 1). (6) Steer the antenna to (Current-sector). (7) BCL = [SRCT.sub.i] [1: n] [Current-sector]. (8) if (Current-sector is a P-sector) then (9) Construct a GCQ-CH sequence based on BCL. (10) for (t = 1 : [n.sup.2]) do (11) Attempt rendezvous on channel [GCQ.sub.i](t). (12) end for (13) else (14) Construct a GRQ-CH sequence based on BCL. (15) for (t = 1 : [n.sup.2]) do (16) Attempt rendezvous on channel [GRQ.sub.i](t). (17) end for (18) end if (19) [t.sub.Frame] = [t.sub.Frame] + 1 (20) end while

Proof. To prove that the combined PES-SCH has MTTR = ([P.sub.i][E.sub.j]) x [n.sup.2], it suffices to prove that the pair of combined PES-SCH sequences, for example, [SCH.sub.i] and [SCH.sub.j], can achieve successful sector and channel rendezvous within ([P.sub.i][E.sub.j]) x [n.sup.2] time slots.

Without loss of generality, assume that [SU.sub.j] starts its SCH sequence [delta] time slots earlier than the start of [SU.sub.i]. In each SCH period of [SU.sub.i], the SCH sequence of [SU.sub.j] is rotate([SCH.sub.j], [delta]). As we stated before, the SCH sequence can be viewed as a series of sector frames which are composed of [n.sup.2] channel time slots. Let the clock drift [delta] = [n.sup.2] x [[delta].sub.F] + [[delta].sub.S], where [[delta].sub.F] [member of] [0, [E.sub.j] - 1] denotes the shift amount of the sector frames and [[delta].sub.S] [member of] [0, ([n.sup.2]) - 1] denotes the shift of the channel time slots. Next, we prove the theorem in the following two cases.

Case 1 ([[delta].sub.S] = 0). This case implies that the sector frames are perfectly aligned. In this case, since the SUs stay for similar number of time slots in each sector which is ([n.sup.2]) for executing their corresponding AGQ-CH sequences, for any value of [[delta].sub.F], there must exist an entire overlap between a PS-frame of [SCH.sub.i] and an ES-frame of [SCH.sub.j] where the sector rendezvous happened. By Theorem 1, we know that the sector rendezvous is guaranteed to occur between a PS sector frame [h.sub.i] and an ES sector frame [h.sub.j] within ([P.sub.i][E.sub.j]) sector frames. As a consequence, the channel rendezvous is guaranteed to happen between the [GCQ.sub.i] CH sequence of [h.sub.i] and the [GRQ.sub.j] CH sequence of [h.sub.j]. Thus, the MTTR is ([P.sub.i][E.sub.j]) multiplied by the sector frame length [n.sup.2]. Figures 9(c) and 9(d) show the sector and channel rendezvous between [SU.sub.X] and [SU.sub.Y] when [[delta].sub.S] = 0 for two different values of [[delta].sub.F] and for n = 2. In Figure 9(c), when [[delta].sub.F] = 0 and hence the clock drift [delta] = ([n.sup.2] x 0 + 0) = 0, [SU.sub.X] can achieve the sector rendezvous with [SU.sub.Y] on the second round of its SH frames. The SUs rendezvous on their commonly available channels (i.e., [CH.sub.1] and [Ch.sub.6]). However, when [[delta].sub.F] = 1 and [delta] = ([n.sup.2] x 1 + 0) = 4, [SU.sub.X] can rendezvous with [SU.sub.Y] earlier where it rendezvous with [SU.sub.Y] during the first round of its SH frames.

Case 2 ([[delta].sub.S] [not equal to] 0). When there is a time slot shift [[delta].sub.S] [member of] [1, [n.sup.2]], it implies that the sector frames are not aligned. For any value of [[delta].sub.F], it is easily verified that each PS sector frame of [SCH.sub.i] is overlapped with partial channel time slots form two consecutive ES frames of [SCH.sub.j]. Specifically, the PS frame of SCH; overlaps with [n.sup.2] - [[delta].sub.S] time slots from the former ES frame and [[delta].sub.S] time slots from the later ES frame of [SCH.sub.j]. Recall the proof of Theorem 1, when [SU.sub.i] repeats each round of its sector frames for [E.sub.r] times, each occurrence of the [h.sub.i] sector frame must overlap with different sector frame from the [E.sub.r] sector frames of [SU.sub.j]. The sector rendezvous is achieved when [h.sub.i] overlaps with [h.sub.j]. However, considering the time slot shift [[delta].sub.S] of the [SCH.sub.j] sequence, we can prove in the same way as case 1 that, within the same rendezvous delay bound (([P.sub.i][E.sub.j]) x [n.sup.2] time slots), there must exist at least two occurrences of [h.sub.i] which overlaps with different partial time slots of [h.sub.j]. In one of these occurrences, the overlap happens between the first [n.sup.2] - [[delta].sub.S] time slots of [h.sub.i] and the last [n.sup.2] - [[delta].sub.S] time slots of [h.sub.j]. On the other occurrence, the overlap happens between the last [[delta].sub.S] time slots of [h.sub.i] and the first [[delta].sub.S] time slots of [h.sub.j]. Accordingly, channel rendezvous can be achieved in any of these two partial sector rendezvous chances where partial slots of the [GCQ.sub.i] CH sequence in [h.sub.i] overlap with other partial slots from the [GRQ.sub.j] CH sequence in [h.sub.j]. For example, Figure 10 illustrates the asynchronous rendezvous between [SU.sub.X] and [SU.sub.Y] when [[delta].sub.F] = 0 for three different values of [[delta].sub.S].

Summarizing the discussion above, we show that, under the combined PES-SCH, any two SUs are guaranteed to achieve channel rendezvous within (([P.sub.i][E.sub.j]) x [n.sup.2]) SCH period. We highlight here that the theoretical MTTR for the combined IPES-SCH is (2m x max[([P.sub.i][E.sub.j]), ([E.sub.i][P.sub.j])}) x [n.sup.2]. It can be proven in a similar way to the proof of the PES-SCH MTTR by considering the two alignment cases of the sector frames.

6. Results and Discussions

In this section, we evaluate the performance of our developed directional antenna rendezvous schemes and compare them with three related works in [19, 28, 30]. The former two selected schemes for comparisons are the only schemes in the literature which tackle the rendezvous issue in DIR-CRNs. However, since both of them are asymmetric-role, we select the third scheme [30] which is proposed for rendezvous in the 60 GHz networks for the comparison with our symmetric-role IPES scheme. This scheme follows a similar ID-based approach to our IPES-SH scheme. However, the extended ID in this scheme is relatively longer and the adjusted parameters of the number of sectors which are used for constructing the interleaved SH sequences are different.

6.1. Performance Comparison of the SH Schemes. We first compare the performance of our SH schemes with the two blind SH schemes in [28, 30]. The SH scheme in [19] is not compared here because it is not a blind scheme. Extensive simulation experiments are conducted to compute the sector rendezvous latency (SRL) between two neighboring SUs (a sender [SU.sub.i] and a receiver [SU.sub.j]). In the simulations, we consider different antenna configurations for the SUs where we simulate several combinations for the number of sectors ([N.sub.i] and [N.sub.j]). The relative locations of [SU.sub.i] and [SU.sub.j] represented by ([h.sub.i], [h.sub.j]) as well as the clock drift are randomly generated. For the ID-based schemes, two different 7-bit IDs are randomly assigned to the SUs. For each ([N.sub.i] and [N.sub.j]) combination, the simulation results are obtained by conducting [10.sup.5] independent runs where we accordingly compute the average and maximum SRL (ASRL and MSRL).

Figure 11 depicts the SRL results for the asymmetric-role SH schemes (our PES-SH and Li and Xie's SH [28]). The results illustrate the significant reduction on the SRL provided by our PES-SH in terms of ASRL and MSRL under all the different antenna configurations of the pair of SUs. For some antenna configurations, PES-SH can reduce the ASRL and MSRL significantly up to 80% and 84%, respectively. The shorter ASRL and MSRL provided by the PES-SH scheme are due to its efficient design which relies on the coprimality between the adjusted prime and even numbers of [N.sub.i] and [N.sub.j], respectively. And since [N.sub.i] is prime for all the sender [SU.sub.i] antenna configurations while the values of [N.sub.j] are even numbers that are valid for use (i.e., not in the AES set), this allows the sender [SU.sub.i] in our PES-SH to achieve sector rendezvous with its receiver [SU.sub.j] within [N.sub.i][N.sub.j] SH period.

On the other side, the design of Li and Xie's SH scheme requires [N.sub.i] and [N.sub.j] to be adjusted to primes. Furthermore, the sender should perform an initiating round-robin SH sequence with a length of [N.sup.2.sub.i] before it converts to the regular prime-based sequence. Accordingly, this will prolong the SH period needed for achieving the sector rendezvous to ([N.sup.2.sub.i] + [N.sub.i][P.sub.j]) which actually represents the theoretical upper bound for the MSRL of Li and Xie's SH scheme when ([N.sub.i] [not equal to] [P.sub.j]). We can notice that this upper bound is tight for some ([N.sub.i] and [N.sub.j]) combinations, while it is not for others. Specifically, when (Ni% [P.sub.j] = 1) where [P.sub.j] is the adjusted prime for [N.sub.j], the sender [SU.sub.i] cannot rendezvous with its receiver during its initiating [N.sup.2.sub.i] round-robin SH sequence. However, when it starts following the regular prime-based SH sequence, the sector rendezvous happens within the subsequent [N.sub.i][P.sub.j] slots, which results in ([N.sup.2.sub.i] + [N.sub.i][P.sub.j]) MSRL. For example, when [N.sub.i] = 11 and [N.sub.j] = 4 in Figure 11(b), the sector rendezvous occurs in (121 + 11x5) = 165 sector slots. The same thing can be noticed for the cases when [N.sub.j] = 2 in Figures 11(a), 11(b), and 11(c), where the MSRL is ([N.sup.2.sub.i] + [N.sub.i] x 2). This explains the irregular increased results in the figures for such ([N.sub.i] and [N.sub.j]) combinations.

In Figure 12, the SRL results for the symmetric-role SH schemes (our IPES-SH and the Chen et al.'s SH scheme [30]) are shown. In the figure, it is shown that our IPES-SH scheme outperforms the other compared scheme especially in terms of MSRL. This improvement is due to the shorter SH period provided by IPES for achieving the sector rendezvous. In both schemes, the SH period for sector rendezvous depends mainly on the extended ID length as well as the adjusted numbers for ([N.sub.i] and [N.sub.j]) that are used for constructing the interleaved sequences. However, the adjusted parameters used by our IPES scheme are smaller than those used by the other scheme. Firstly, in the IPES-SH scheme, the extended ID length is 2m =14 which is relatively smaller than the 2m + 1 = 15 extended ID used by the other scheme. Furthermore, the interleaved SH sequences in Chen et al.'s SH scheme are constructed by adjusting the number of sectors to a prime number as well as to a number that is a power-multiple of two (i.e., [mathematical expression not reproducible], where [b.sub.k] is the smallest integer satisfying [mathematical expression not reproducible]). However, these adjusted numbers must be coprime with the extended ID length in order to achieve a successful sector rendezvous. Meanwhile, in IPES-SH, the interleaved PS and ES sequences are constructed based on the closest prime number and the closest even number which is not in the AES set. Hence, under most of the simulated antenna configurations, the adjusted [E.sub.i] and [E.sub.j] in IPES are smaller than the adjusted [q.sub.i] and [q.sub.j] parameters in the other scheme. For example, in our IPES-SH scheme, [E.sub.j] = [N.sub.j] for all the [N.sub.j] values, while the [q.sub.j] adjusted parameters for the [N.sub.j] values in Chen et al.'s SH scheme are {2, 4, 8, 8, 16, 32}. Moreover, when [N.sub.i] or [N.sub.j] is [less than or equal to] 5, the adjusted prime number used in IPES is 5, while it is 7 on the other scheme because 7 is the closest prime that is coprime with the 15-bit extended ID. According to that, SUs in the IPES scheme can achieve the sector rendezvous faster than Chen et al.'s SH scheme.

6.2. Performance Comparison of the Combined SCH Schemes. In this subsection, we compare the channel rendezvous performance of our SCH schemes with the other works under a practical DIR-CRN. The simulation configuration parameters are shown in Table 1.

We start our SCH simulation by comparing the performance of our combined PES-SCH with the combined SCH schemes of Song and Xie [19] and Li and Xie [28]. We evaluate our PES-SCH for n = 4 best-quality channels which correspond to a AGQ-CH period of 16 time slots in each sector (i.e., the frame length = 16). The other selected schemes for comparison are simulated with their proposed CH schemes. In [19], the SH scheme is combined with the asymmetric-role CH scheme in [35], where the sender SU stays for [L.sup.2] slots on each sector frame of its SH sequence performing a sequential fast CH on the ([C.sub.i] [subset or equal to] L) available channels within the sector. Meanwhile, the receiver SU stays for ([N.sub.i] + 1) x [L.sup.2] slots on each sector of its [N.sub.i] sectors performing a slow CH on all of its ([C.sub.i] [subset or equal to] L) available channels. On the other side, the SH scheme of Li and Xie [28] is combined with the EJS-CH scheme [10]. However, due to the long period of the EJS-CH scheme required to guarantee channel rendezvous, Li and Xie simulated their SCH scheme by letting SUs stay for smaller period on each sector of their SH frames. During this period, SUs execute the corresponding subsequences of their generated EJS-CH sequence. Therefore, we simulate Li and Xie's SCH scheme with a similar sector frame length to our PES-SCH scheme (i.e., 16 slots). All the schemes are simulated under different asynchronous settings where the clock drifts amount between SUs is selected randomly in each experiment.

Figure 13 depicts the TTR simulation results for the three schemes when they are evaluated under different antenna configurations for the pair of SUs. Even though the combined SCH scheme of Song and Xie is not a blind scheme, it produces very long TTR results. This is due to the large sector frame length where the sender and receiver stay for [L.sup.2] and [L.sup.2] x ([N.sub.i] + 1) time slots, respectively, on each sector for performing their corresponding CH sequence. As a consequence, the SCH period needed for achieving rendezvous is [N.sub.j] x ([L.sup.2] x ([N.sub.i] + 1)) which is very long as compared to the period of our PES-SCH scheme. On the other side, Li and Xie's SCH scheme can provide shorter ATTR than Song and Xie's scheme because it is simulated with smaller frame length. However, the MTTR of this scheme cannot be traced because we observe that TTR in some cases cannot be achieved within the whole simulation duration which is set to 5 x [10.sup.4] slots. The reason for the indeterministic behaviour of Li and Xie's SCH scheme is because the stay period in each sector (i.e., 16 slots) is insufficient to guarantee rendezvous while using the EJS-CH scheme. According to the EJS-CH [10], the rendezvous cannot be guaranteed unless the EJS-CH sequences of the communicating SUs are overlapped for at least 4[P.sub.L]([P.sub.L] + 1 - G) = 44(12 - G) time slots. [P.sub.L] is the smallest prime number greater than L, while G is the number of common available channels between the SUs available channels. Hence, to ensure rendezvous regardless of any misalignment of their local clocks, the SUs should stay for at least 4[P.sup.2.sub.L] on each sector of their SH sequences to perform their EJS-CH sequences. This trade-off between the bounded MTTR of Song and Xie's SCH scheme and the small ATTR of Li and Xie's SCH scheme illustrates the efficiency of our proposed AGQ-CH scheme, which allows PES-SCH to guarantee rendezvous with the shortest TTR results.

In the second setting of the SCH simulation, we combine the SH schemes of Li and Xie [28] and Chen et al. [30] with our proposed AGQ-CH scheme. This is in order to evaluate their channel rendezvous performance when they are combined with an efficient and suitable CH scheme. Figures 14 and 15 show the TTR results of these schemes and our schemes when they are simulated for different values of the best-quality channel n (2 [less than or equal to] n [less than or equal to] 5). In the simulation, we consider different values for the sender number of sectors ([N.sub.i] = {4, 6, 12}), while the receiver number of sectors [N.sub.j] is set as 4. The figures show that our schemes always outperform the other schemes under all the different antenna configurations of the SUs. This is mainly due to the shorter SRL of our SH schemes and, as explained in Section 5.4, TTR depends on the SRL of the SH scheme coupled with the length of the sector frame ([n.sup.2]). Moreover, the figures illustrate the effect of n (i.e., the number of best-quality channels) on the rendezvous performance where we can notice that as n increases, the TTR results for all the schemes increase. This is because the larger n, the longer the frame length [n.sup.2]. Accordingly, when SUs spend longer period in each sector, they may waste more time while attempting rendezvous on other sectors rather than the rendezvous sector. This will result in a longer TTR until they can achieve a successful sector and channel rendezvous.

Finally, to illustrate the performance gain brought by applying directional antennas for channel rendezvous, we compare the performance of our combined PES-SCH scheme with the AAsync-CH omnidirectional antenna rendezvous scheme [16]. The AAsync-CH is selected among the other omnidirectional CH schemes since it is designed for asymmetric-role environment (i.e., SUs have preassigned role) similar to our PES-SCH. The schemes are compared in terms of their probabilities for achieving a successful channel rendezvous under different number of PUs in the network area. In our PES-SCH, the simulated sender and receiver SUs have [N.sub.i] = 5 and [N.sub.j] = 6 number of sectors and the number of best-quality channels n = 3.

Figure 16 shows the significant outperformance of our directional antenna scheme as compared with the omnidirectional antenna scheme. It can be noticed from the figure that when the number of PUs in the network increases, the probability of the successful channel rendezvous for the omnidirectional scheme decreases dramatically. Meanwhile, in the PES-SCH, this probability is almost 1 for most of the cases and only decreases slightly when the number of PUs is close to 100. This is due to the smaller interference region of the directional antenna, which results in higher channel availability for the SUs as compared to the omnidirectional antenna. So, when the total number of PUs in the network area increases, only few of them may reside within the SUs rendezvous sectors where they can only impose a slight change in the channel availability. Accordingly, the probability of having common channels between the SUs on their sector rendezvous pair is always high, which increases the probability of successful channel rendezvous.

These results justify the motivation of our proposed schemes where equipping SUs with directional antennas can significantly enhance the channel rendezvous performance in high-density PU networks as compared with the omnidirectional antennas paradigm.

7. Conclusions

In this paper, we studied the sector and channel rendezvous problem for SUs in DIR-CRNs. Two efficient coprimality-based sector hopping schemes have been proposed for providing sector rendezvous in asymmetric- and symmetric-role environments. The SH schemes are combined with an efficient grid-quorum-based CH scheme for providing a guaranteed sector and channel rendezvous simultaneously between the SUs in DIR-CRNs. Theoretical analysis and extensive simulations are conducted to demonstrate the efficiency of the proposed schemes. The simulations results verify that our schemes significantly outperform the previous directional antenna rendezvous schemes (in terms of SRL and TTR). Furthermore, they demonstrate that our directional antenna rendezvous paradigm is more resistant to rendezvous failures under high-density PU CRNs, as compared with the omnidirectional antenna rendezvous paradigm.

https://doi.org/10.1155/2017/5748067

Conflicts of Interest

The authors declare that they have no conflicts of interest.

Acknowledgments

The authors would like to acknowledge Malaysian Ministry of Higher Education for funding this study under the Fundamental Research Grant Scheme (FRGS) entitled "On the Cogitation of Primary User Reappearance in Cognitive Radio Network" (Project Code: MoHe: FRGS/1/2015/TK10/ UPM/02/2, UPM:03-01-15-1626FR, Vote no. 5524731).

References

[1] N. C. Theis, R. W. Thomas, and L. A. DaSilva, "Rendezvous for cognitive radios," IEEE Transactions on Mobile Computing, vol. 10, no. 2, pp. 216-227, 2011.

[2] B. F. Lo, "A survey of common control channel design in cognitive radio networks," Physical Communication, vol. 4, no. 1, pp. 26-39, 2011.

[3] M.-R. Kim and S.-J. Yoo, "Distributed coordination protocol for ad hoc cognitive radio networks," Journal of Communications and Networks, vol. 14, no. 1, pp. 51-62, 2012.

[4] P. Ren, Y. Wang, and Q. Du, "CAD-MAC: a channel-aggregation diversity based MAC protocol for spectrum and energy efficient cognitive Ad Hoc networks," IEEE Journal on Selected Areas in Communications, vol. 32, no. 2, pp. 237-250, 2014.

[5] G. Prasad Joshi, S. Y. Nam, S. W. Kim, and B.-S. Kim, "Adaptive window size-based medium access control protocol for cognitive radio wireless sensor networks," Journal of Sensors, vol. 2016, Article ID 2049859, 9 pages, 2016.

[6] S. Omar, O. E. Ghandour, and A. M. A. El-Haleem, "Multipath activity based routing protocol for mobile cognitive radio Ad Hoc networks," Wireless Communications and Mobile Computing, vol. 2017, Article ID 5380525, 12 pages, 2017

[7] A. Mahmud, Y. Lee, and I. Koo, "A fully distributed resource allocation mechanism for CRNS without using a common control channel," Mathematical Problems in Engineering, vol. 2015, Article ID 537078, 9 pages, 2015.

[8] G. P. Joshi, S. Y. Nam, and S. W. Kim, "Rendezvous issues in ad hoc cognitive radio networks," KSII Transactions on Internet and Information Systems, vol. 8, no. 11, pp. 3655-3673, 2014.

[9] S. Romaszko, "A rendezvous protocol with the heterogeneous spectrum availability analysis for cognitive radio ad hoc networks," Journal of Electrical and Computer Engineering, vol. 2013, Article ID 715816, 18 pages, 2013.

[10] Z. Lin, H. Liu, X. Chu, and Y.-W. Leung, "Enhanced jump-stay rendezvous algorithm for cognitive radio networks," IEEE Communications Letters, vol. 17, no. 9, pp. 1742-1745, 2013.

[11] J. Kim, G. Park, and K. Han, "A Rendezvous Scheme for Self-Organizing Cognitive Radio Sensor Networks," International Journal of Distributed Sensor Networks, vol. 10, no. 1, article 315874, 2014.

[12] E. O. Guerra, V. A. Reguera, R. D. Souza, E. G. Fernandez, and M. E. Pellenz, "Systematic construction of common channel hopping rendezvous strategies in cognitive radio networks," EURASIP Journal on Wireless Communications and Networking, vol. 2015, no. 1, 2015.

[13] G.-Y. Chang, J.-F. Huang, and Y.-S. Wang, "Matrix-based channel hopping algorithms for cognitive radio networks," IEEE Transactions on Wireless Communications, vol. 14, no. 5, pp. 2755-2768, 2015.

[14] B. Yang, W. Liang, M. Zheng, and Y.-C. Liang, "Fully distributed channel-hopping algorithms for rendezvous setup in cognitive multi-radio networks," IEEE Transactions on Vehicular Technology, vol. PP, no. 99, 2015.

[15] J.-P. Sheu, C.-W. Su, and G.-Y. Chang, "Asynchronous quorum-based blind rendezvous schemes for cognitive radio networks," IEEE Transactions on Communications, vol. 64, no. 3, pp. 918-930, 2016.

[16] P. K. Sahoo and D. Sahoo, "Sequence-based channel hopping algorithms for dynamic spectrum sharing in cognitive radio networks," IEEE Journal on Selected Areas in Communications, vol. 34, no. 11, pp. 2814-2828, 2016.

[17] W. Chen, G. Yang, M. Chang, and W. C. Kwong, "Construction and analysis of shift-invariant, asynchronous-symmetric channel-hopping sequences for cognitive radio networks," IEEE Transactions on Communications, vol. 65, no. 4, pp. 1494-1506, 2017

[18] A. Al-Mqdashi, A. Sali, M. J. Abdel-Rahman, N. K. Noordin, S. J. Hashim, and R. Nordin, "Efficient rendezvous schemes for fast-varying cognitive radio ad hoc networks," Transactions on Emerging Telecommunications Technologies, article e3217, 2017. http://dx.doi.org/10.1002/ett.3217

[19] Y. Song and J. Xie, "Enhancing channel rendezvous in cognitive radio networks with directional antennas," in Proceedings of the IEEE International Conference on Communications, ICC 2015, pp. 3702-3707, June 2015.

[20] H. Jung and I.-H. Lee, "Connectivity Analysis of Millimeter-Wave Device-to-Device Networks with Blockage," International Journal of Antennas and Propagation, vol. 2016, Article ID 7939671, 9 pages, 2016.

[21] A. M. Al-Samman, T. A. Rahman, M. H. Azmi et al., "Statistical modelling and characterization of experimental mm-wave indoor channels for future 5G wireless communication networks," PLoS ONE, vol. 11, no. 9, pp. 1-29, 2016.

[22] Y. Zhao, Z. Wei, Y. Liu, Q. Zhang, and Z. Feng, "Angle-Domain Spectrum Holes Analysis with Directional Antenna in Cognitive Radio Network," in Proceedings of the 2017 IEEE Wireless Communications and Networking Conference (WCNC), pp. 1-6, San Francisco, CA, USA, March 2017.

[23] H. Yazdani and A. Vosoughi, "On cognitive radio systems with directional antennas and imperfect spectrum sensing," in Proceedings of the 2017 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), pp. 3589-3593, New Orleans, LA, USA, March 2017.

[24] Y. Dai and J. Wu, "Boundary helps: Efficient routing protocol using directional antennas in cognitive radio networks," in Proceedings of the 10th IEEE International Conference on Mobile Ad-Hoc and Sensor Systems, MASS 2013, pp. 502-510, October 2013.

[25] S. Anamalamudi, M. Jin, and J. M. Kim, "Hybrid CCC based AODV routing protocol for cognitive radio ad-hoc networks with directional antennas," in Proceedings of the 7th International Conference on Ubiquitous and Future Networks, ICUFN 2015, pp. 40-45, July 2015.

[26] Y. Wang, Q. Wang, H.-N. Dai, H. Wang, Z. Zheng, and J. Li, "On local connectivity of cognitive radio ad hoc networks with directional antennas," in Proceedings of the 2016 IEEE International Conference on Communication Systems, ICCS 2016, pp. 1-6, December 2016.

[27] L. T. Dung, T. D. Hieu, S.-G. Choi, B.-S. Kim, and B. An, "Impact of beamforming on the path connectivity in cognitive radio ad hoc networks," Sensors, vol. 17, no. 4, 2017

[28] J. Li and J. Xie, "Directional antenna based distributed blind rendezvous in cognitive radio ad-hoc networks," in Proceedings of the 58th IEEE Global Communications Conference, GLOBECOM 2015, pp. 1-6, December 2015.

[29] C.-M. Chao, H.-Y. Fu, and L.-R. Zhang, "A fast rendezvous-guarantee channel hopping protocol for cognitive radio networks," IEEE Transactions on Vehicular Technology, vol. 64, no. 12, pp. 5804-5816, 2015.

[30] L. Chen, Y. Li, and A. V. Vasilakos, "Oblivious neighbor discovery for wireless devices with directional antennas," in Proceedings of the 35th Annual IEEE International Conference on Computer Communications, IEEE INFOCOM 2016, pp. 1-9, April 2016.

[31] I. Niven, H. S. Zuckerman, and H. Montgomery, An Introduction to the Theory of Numbers, John Wiley & Sons, New York, NY, USA, 1991.

[32] K. Bian and J.-M. J. Park, "Maximizing rendezvous diversity in rendezvous protocols for decentralized cognitive radio networks," IEEE Transactions on Mobile Computing, vol. 12, no. 7, pp. 1294-1307, 2013.

[33] M. J. Abdel-Rahman and M. Krunz, "Game-theoretic quorum-based frequency hopping for anti-jamming rendezvous in DSA networks," in Proceedings of the 2014 IEEE International Symposium on Dynamic Spectrum Access Networks, DYSPAN 2014, pp. 248-258, April 2014.

[34] A. Al-Mqdashi, A. Sali, N. K. Noordin, S. J. Hashim, R. Nordin, and M. J. Abdel-Rahman, "An efficient quorum-based rendezvous scheme for multi-radio cognitive radio networks," in Proceedings of the 2016 IEEE 3rd International Symposium on Telecommunication Technologies (ISTT), pp. 59-64, November 2016.

[35] Y. Song and J. Xie, "[QB.sup.2]IC: A QoS-based broadcast protocol under blind information for multihop cognitive radio ad hoc networks," IEEE Transactions on Vehicular Technology, vol. 63, no. 3, pp. 1453-1466, 2014.

AbdulMajid M. Al-Mqdashi, (1) A. Sali, (1) Nor K. Noordin, (1) Shaiful J. Hashim, (1) and Rosdiadee Nordin (2)

(1) Wireless and Photonic Networks Research Centre of Excellence (WiPNEt), Department of Computer and Communication Systems Engineering, Faculty of Engineering, Universiti Putra Malaysia, 43400 Serdang, Selangor, Malaysia

(2) Department of Electrical, Electronic, and Systems Engineering, Universiti Kebangsaan Malaysia, 43600 Bangi, Selangor, Malaysia

Correspondence should be addressed to AbdulMajid M. Al-Mqdashi; abdulmajid.almqdashi@gmail.com

Received 27 August 2017; Accepted 24 October 2017; Published 12 December 2017

Academic Editor: Ahmed M. Al-Samman

Caption: Figure 1: Examples of directional antenna configurations in two pairs of communicating SUs: (a) [SU.sub.X] and [SU.sub.Y] divide their transmission range into [N.sub.X] = 5 and [N.sub.Y] = 4 sectors; the rendezvous sector pair is (2,3). (b) [SU.sub.V] and [SU.sub.Z] divide range into [N.sub.v] = 4 and [N.sub.z] = 3 sectors; the rendezvous sector pair is (4,1).

Caption: Figure 2: Successful synchronous and asynchronous sector rendezvous for the two pairs of communicating SUs in Figure 1.

Caption: Figure 3: Illustration of the five cases in the proof of Lemma 2.

Caption: Figure 4: An illustrative example for the correctness of our cyclic rotationally distinct sequences construction method when m = 4.

Caption: Figure 5: The construction of the IPES matrices [M.sub.V] and [M.sub.Z] for [SU.sub.V] and [SU.sub.Z], respectively. [N.sub.V] = 4 and [N.sub.Z] = 3; [[alpha].sub.V] = {1,0} and [[beta].sub.z] = {0,1}. So the expanded ID sequences are [a.sub.v] = {1,1,0,0} and [b.sub.z] = {1,0,1,0}.

Caption: Figure 6: IPES-SH sector rendezvous between [SU.sub.V] and [SU.sub.Z] for the synchronous case.

Caption: Figure 7: The IPES matrix [M.sub.Z] for [SU.sub.Z] when it is circularly rotated with (a) [delta] = 2m x 10 + 0 = 40 sector slots and (b) [delta] = 2m x 2 + 1 = 41 slots.

Caption: Figure 8: An example of AGQ-CH sequences constructions and rendezvous for a pair of communicating SUs.

Caption: Figure 9: Rendezvous between SUs X and Y according to the combined PES- SCH scheme. [N.sub.X] = 5 and [N.sub.Y] = 4. Number of best-quality channels per each sector n = 2.

Caption: Figure 10: Asynchronous rendezvous between [SU.sub.X] and [SU.sub.Y] according to the combined PES-SCH scheme for n = 2 best-ranked channels. [SCH.sub.Y] is started earlier than [SCH.sub.X] with [[delta].sub.S] [member of] [1,3].

Caption: Figure 11: Comparison of the sector rendezvous latency between our PES- SH scheme and Li and Xie's SH scheme [28] under fixed [N.sub.i] and varying [N.sub.j].

Caption: Figure 12: Comparison of the sector rendezvous latency between our IPES-SH scheme and Chen et al.'s SH scheme [30] under fixed [N.sub.i] and varying [N.sub.j]. ID length = 7 bits.

Caption: Figure 13: Comparison of the time-to-rendezvous (TTR) between the asymmetric-role SCH schemes when [N.sub.i] = 5.

Caption: Figure 14: Comparison of the time-to-rendezvous (TTR) between the asymmetric-role SCH schemes when [N.sub.j] = 4.

Figure 15: Comparison of the TTR between the symmetric-role SCH schemes when [N.sub.j] = 4. ID length = 7 bits.

Caption: Figure 16: Comparison of the successful channel rendezvous probability between our PES-SCH directional antenna scheme and the AAsync-CH omnidirectional scheme.

Table 1: Simulation parameters. Network area deployment 500 m x 500 m Number of channels (L) 10 Number of PUs 50 The radius of the SU sensing/transmission range 150 m Slot duration for sending a packet on a channel 2 ms The PU packet arrival rate 10 packets/s The length of a PU packet 120 slots

Printer friendly Cite/link Email Feedback | |

Title Annotation: | Research Article |
---|---|

Author: | Al-Mqdashi, AbdulMajid M.; Sali, A.; Noordin, Nor K.; Hashim, Shaiful J.; Nordin, Rosdiadee |

Publication: | Wireless Communications and Mobile Computing |

Article Type: | Report |

Date: | Jan 1, 2017 |

Words: | 15208 |

Previous Article: | An Energy Balancing Strategy Based on Hilbert Curve and Genetic Algorithm for Wireless Sensor Networks. |

Next Article: | Energy-Efficient Unequal Chain Length Clustering for Wireless Sensor Networks in Smart Cities. |

Topics: |