Search Results (16)

In this paper, we propose a method for applying the p-ary m-sequence as a channel-searching pattern for rendezvous in the asymmetric channel model of cognitive radio. We mathematically analyzed and calculated the ETTR when the m-sequence is applied to the conventional scheme, and our simulation results demonstrated that the ETTR performance is significantly better than that of the JS algorithm. Furthermore, we introduced a new channel-searching scheme that maximizes the benefits of the m-sequence and proposed a method to adapt the generation of the m-sequence for use in the newly proposed scheme. We also derived the ETTR mathematically for the new scheme with the m-sequence and showed through simulations that the performance of the new scheme with the m-sequence is superior to that of the conventional scheme with the m-sequence. Notably, when there is only one common channel, the new scheme with the m-sequence achieved approximately four times the improvement in the ETTR compared to the conventional scheme. Full article

This paper addresses the rendezvous problem in asymmetric cognitive radio networks (CRNs) by proposing a novel reinforcement learning (RL)-based channel-hopping algorithm. Traditional methods like the jump-stay (JS) algorithm, while effective, often struggle with high time-to-rendezvous (TTR) in asymmetric scenarios where secondary users (SUs) have varying channel availability. Our proposed RL-based algorithm leverages the actor-critic policy gradient method to learn optimal channel selection strategies by dynamically adapting to the environment and minimizing TTR. Extensive simulations demonstrate that the RL-based algorithm significantly reduces the expected TTR (ETTR) compared to the JS algorithm, particularly in asymmetric scenarios where M-sequence-based approaches are less effective. This suggests that RL-based approaches not only offer robustness in asymmetric environments but also provide a promising alternative in more predictable settings. Full article

Achieving neighbor discovery for a directional flying ad hoc network (FANET) with multiple channels poses challenges for media access control (MAC) protocol design, as it requires simultaneous main lobe and channel rendezvous while dealing with the high UAV mobility. In order to achieve fast neighbor discovery for initial access without coordination or prior information, we first establish the theoretical supremum for the directional main lobe. Then, to achieve the supremum, we introduce the BR-DA and BR-DA-FANET algorithms to respectively establish the supremum on rendezvous between a pair of UAVs’ main lobes and rendezvous of main lobes for all UAVs in the FANET. To further accelerate the neighbor discovery process, we propose the neighbor discovery with location prediction protocol (ND-LP) and the avoiding communication interruption with location prediction (ACI-LP) protocol. ND-LP enables quick main lobe rendezvous and channel rendezvous, while ACI-LP enables beam tracking and channel rendezvous together with the avoidance of communication interruptions. The simulation results demonstrate that the proposed protocols outperform the state-of-the-art works in terms of neighbor discovery delay. Full article

The channel-hopping-based rendezvous is essential to alleviate the problem of under-utilization and scarcity of the spectrum in cognitive radio networks. It dynamically allows unlicensed secondary users to schedule rendezvous channels using the assigned hopping sequence to guarantee the self-organization property in a limited time. In this paper, we use the interleaving technique to cleverly construct a set of asynchronous channel-hopping sequences consisting of d sequences of period $x{N}^2$ with flexible parameters, which can generate sequences of different lengths. By this advantage, the new designed CHSs can be used to adapt to the demands of various communication scenarios. Furthermore, we focus on the improved maximum-time-to-rendezvous and maximum-first-time-to-rendezvous performance of the new construction compared to the prior research at the same sequence length. The new channel-hopping sequences ensure that rendezvous occurs between any two sequences and the rendezvous times are random and unpredictable when using licensed channels under asynchronous access, although the full degree-of-rendezvous is not satisfied. Our simulation results show that the new construction is more balanced and unpredictable between the maximum-time-to-rendezvous and the mean and variance of time-to-rendezvous. Full article

Realizing the distributed adaptive network construction of multi-UAV networks is an urgent challenge, as they lack a reliable common control channel and can only maintain a limited sensing range in crowded electromagnetic environments. Multi-unmanned aerial vehicle (UAV) networks are gaining popularity in many fields. In order to address these issues, this paper proposes a multi-UAV network channel rendezvous algorithm based on average consistency. The goal of the algorithm is to adjust the communication channels of each UAV to converge on the same channel, since the communication link of the multi-UAV network is broken due to interference. The proposed memory-based average consistency (MAC) algorithm utilizes the network adjacency matrix as prior information. Furthermore, for the case where the adjacency matrix is unknown, this paper also proposes the Multi-Radio Average Consensus (MRAC) algorithm, which achieves a beneficial trade-off between rendezvous performance and hardware cost. Simulation results demonstrate that the proposed MAC and MRAC algorithms provide superior network convergence time and scalability in networks of different densities. Finally, a hardware simulation platform based on a multi-UAV network was designed using a software-defined radio platform, and experimental simulations were performed to prove the effectiveness of the MAC algorithm in a real environment. Full article

In order to increase channel usage efficiency, unlicensed users within a Cognitive Radio Network (CRN) are permitted to utilize channels that are not currently occupied by licensed users. However, ensuring communication between users in a CRN remains a challenge. To overcome this issue, a variety of channel hopping protocols have been developed. Time-invariant channel hopping protocols are vulnerable to attacks, so several channel hopping protocols that are resistant to jamming attacks have been proposed. In the majority of existing anti-jamming protocols, users create their channel hopping sequence using a channel hopping matrix, with the rendezvous probability between two users being determined by the structure of their respective channel hopping matrices. The channel hopping matrices designed by existing methods still have room for improvement. To overcome the difficulty of guaranteeing communication between any pair of users, while also providing protection against jamming attacks and minimizing the time to rendezvous (TTR) in a CRN, this paper presents the Anti-jamming Low-Latency channel hopping (ALL) protocol. This protocol allows a sender to adjust their channel hopping matrix structure to match that of the receiver, thereby improving the chances of successful rendezvous between users. Based on the simulation results, the ALL protocol performs better than the recently proposed practical solution, OLAA, by up to 33% in network throughput and 30% in TTR. On average, ALL outperforms OLAA by 25% in network throughput and 20% in TTR. Full article

Spacecraft component detection is essential for space missions, such as for rendezvous and on-orbit assembly. Traditional intelligent detection algorithms suffer from drawbacks related to high computational burden, and are not applicable for on-board use. This paper proposes a convolutional neural network (CNN)-based lightweight algorithm for spacecraft component detection. A lightweight approach based on the Ghost module and channel compression is first presented to decrease the amount of processing and data storage required by the detection algorithm. To improve feature extraction, we analyze the characteristics of spacecraft imagery, and multi-head self-attention is used. In addition, a weighted bidirectional feature pyramid network is incorporated into the algorithm to increase precision. Numerical simulations show that the proposed method can drastically reduce the computational overhead while still guaranteeing good detection precision. Full article

Aiming at the large-angle maneuver control problem of tracking spacecraft attitude in non-cooperative target rendezvous and proximity tasks, under the condition that the target spacecraft attitude information is unknown and the actuator output has physical limitations, a limited-time autonomous control method is proposed. First, an end-to-end pose estimation network is designed based on adaptive dual-channel feature extraction and dual attention. The information around the target is obtained through the adaptive dual-channel feature extraction module. The addition of spatial attention and channel attention allows the network to learn the target’s characteristics more accurately. Secondly, based on the improved adaptive update law, a finite-time saturation controller is designed using the hyperbolic tangent function and the auxiliary system. The hyperbolic tangent function can strictly ensure that the control torque of the control system is bounded. Finally, the simulation results show that the proposed autonomous control method can accurately estimate the attitude of the non-cooperative target spacecraft and can maneuver to the target attitude within 20 s under the condition that the actuator’s output is physically limited. Full article

In cognitive radio networks (CRNs), two secondary users (SUs) need to meet on a channel among multiple channels within a finite time to establish a link, which is called rendezvous. For blind rendezvous, researchers have devised ample well-grounded channel hopping (CH) sequences that guarantee smaller time-to-rendezvous. However, the best part of these works lacks the impact of network factors, particularly channel availability and collision during rendezvous. In this study, a new CH scheme is investigated by jointly considering the medium access control (MAC) protocol for single-hop multi-user CRNs. The analysis of our new variable hopping sequence (V-HS) guarantees rendezvous for the asymmetric channel model within a finite time. Although this mathematical concept guarantees rendezvous between two SUs, opportunities can be overthrown because of the unsuccessful exchange of control packets on that channel. A successful rendezvous also requires the exchange of messages reliably while two users visit the same channel. We propose a MAC protocol, namely ReMAC, that can work with V-HS and CH schemes. This design allows multiple rendezvous opportunities when a certain user visits the channel and modifies the conventional back-off strategy to maintain the channel list. Both simulation and analytical results exhibited improved performance over the previous approaches. Full article

This paper describes some of the challenges that need to be addressed in order to develop collaborative spectrum-sharing systems. The importance of these challenges stems from the assumption that rules for spectrum sharing can change after the deployment of radio networks and that the whole system must be able to adapt to them. To address such a requirement, we used a policy-based approach in which transmissions are controlled by a policy interpreter system, and the policies can be modified during system operation. Our primary goal was to develop a prototype of such a system. In this paper, we outline the implementation of policy interpretation, automatic generation of transmission opportunities in case a request for transmission is denied by the policy reasoner, and the generation of rendezvous channels for the synchronization of otherwise asynchronously running software-defined radios. Full article

In a distributed cognitive radio (CR) sensor network, transmission and reception on vacant channels require cognitive radio nodes to achieve rendezvous. Because of the lack of adequate assistance from the network environment, such as the central controller and other nodes, assisted rendezvous for distributed CR is inefficient in a dynamic network. As a result, non-assisted blind rendezvous, which is unaware of its counterpart node, has recently led to a lot of interest in the research arena. In this paper, we study a channel rendezvous method based on prime number theory and propose a new multi-radio-based technique for non-assisted rendezvous with the blind and heterogeneous condition. The required time and the optimal number of radios for the guaranteed rendezvous are calculated using probability-based measurement. Analytical expressions for probabilistic guaranteed rendezvous conditions are derived and verified by Monte Carlo simulation. In addition, the maximum time to rendezvous (MTTR) is derived in closed form using statistical and probabilistic analysis. Under different channel conditions, our proposed solution leads to a substantial time reduction for guaranteed rendezvous. For the sake of over-performance of our proposed system, the simulation outcome is compared to a recently proposed heterogeneous and blind rendezvous method. The Matlab simulation results show that our proposed system’s MTTR gains range from $11\%$ to over $95\%$ for various parametric values of the system model. Full article

This paper addresses the communication issue encountered by a hybrid controller when finding consensus in terms of the rendezvous target point in a broadcast and communication environment. This issue may result in a high level of computation and the utilization of agent resources when a continuous communication is required by agents to meet convergence requirements. Thus, an event-triggered system was integrated into the design of a broadcast and distributed consensus linear controller using the simultaneous perturbation stochastic algorithm (SPSA). The agent’s movement towards the rendezvous point is based on the broadcast value, whereas the next agent’s state position depends on the distributed local controller output. The communication error obtained during communication between the agent and neighbors is only added to the gradient approximation error of the SPSA if the event-triggered function is violated. As a result, in our model, the number of channel utilizations was lower and the agents’ performances were preserved. The efficiencies and effectiveness of the proposed controller have been compared with the traditional sampling broadcast time-triggered (BTT) approach. The time and iterations required by the broadcast event-triggered (BET) system were less than 40.42% and 21% on average as compared to BTT. The trajectory was not the same—the BET showed scattered movements at the initial stage, whereas BTT showed a linear movement. In terms of the number of channels, 28.91% of channels were preserved during the few hundred iterations. Consequently, a variety of hybrid controllers with event-triggered mechanisms can be proposed for other multi-agent motion coordination tasks. Full article

The high level of robustness and reliability required in industrial environments can be achieved using time-slotted channel hopping (TSCH) medium access control (MAC) specified in institute of electrical and electronics engineers (IEEE) 802.15.4. Using frequency channel hopping in the existing TSCH network, a parallel rendezvous technique is used to exchange packets containing channel information before network synchronization, thereby facilitating fast network synchronization. In this study, we propose a distributed radio listening (DRL)–TSCH technique that uses a two-way transmission strategy based on the parallel rendezvous technique to divide the listening channel by sharing the channel information between nodes before synchronization. The performance evaluation was conducted using the OpenWSN stack, and the actual experiment was carried out by utilizing the OpenMote-cc2538 module. The time taken for synchronization and the number of rendezvous packets transmitted were measured in linear and mesh topologies, and the amount of energy used was evaluated. The performance results demonstrate a maximum average reduction in synchronization time of 67% and a reduction in energy consumption of 58% when compared to the performance results of other techniques. Full article

The rendezvous process is considered a key operation that allows a secondary user (SU) to access an unused authorized spectrum in cognitive radio networks (CRNs). Most existing works focused on fast guaranteed rendezvous without considering a sophisticated jamming attack environment. In this paper, I propose a fast and robust asynchronous rendezvous scheme that can improve robustness against jamming attacks under symmetric asynchronous environments in which all SUs have the same available channels. Unfortunately, in CRNs, each SU can have a different number of available channels due to their relative position to primary nodes (PUs). Therefore, I extend my fast and robust asynchronous rendezvous scheme (FRARS) to a general asymmetric scenario while preserving robustness against jamming attacks. I derive the maximum rendezvous time (MTTR) of my new algorithm and the upper bound of the expected TTR (ETTR) and compare it with the state-of-the-art algorithms such as jump-stay (JS) and Enhanced jump-stay (EJS). My numerical results show that the performance of the proposed technique is better than that of JS and EJS in terms of MTTR and ETTR. Also, the performance will be more significant when there are security concerns about a sophisticated jamming attack. Full article

The widespread growth of the Internet-of-Things (IoT) and its dependence on the license-exempt Industrial, Scientific, and Medical (ISM) bands have made spectrum resources scarce. IoT can nonetheless get advantage from the Cognitive Radio (CR) technology to resolve the spectrum shortage issue. Since in CR networks the unlicensed Secondary Users (SUs) can exploit the white spaces in licensed channels of Primary Users (PUs) opportunistically. CR ad hoc networks are more useful in IoT due to ease of installation, low cost, and less complexity. However, CR ad hoc networks are prone to the rendezvous issue and hidden primary terminal problem. Moreover, the available channels in the CR system are not identical, PUs’ and SUs’ activities can diversify them as well. In this connection, channel selection by SUs is a complex balancing act since the transmission opportunities are space, frequency and time bounded. In this paper, we hence proposed a new Ranked Sense Multiple Access with Collision Avoidance (RSMA/CA) protocol for multichannel CR-based IoT networks. Our proposed RSMA/CA protocol not only resolves the hidden primary terminal problem but also avoids hidden and exposed terminal problems at the same time by mutual spectrum sensing. We suggest a new channel ranking mechanism to rank the available channels based on the long term qualities of the channels, PUs’ return rate, and SUs’ activities and tailor-made the algorithms in an existing scheme to make the rendezvous process more efficient. We analyze the performance of our proposed RSMA/CA in terms of normalized throughput through the Markov chain model and compared with that of the existing scheme. Simulation results show that our RSMA/CA protocol outperforms the existing scheme due to efficient rendezvous and access mechanisms. Full article