Channel hopping (CH) is an effective technique to reach a rendezvous in cognitive radio networks (CRNs). However, the holistic requirements of asynchronous clocks, heterogeneous channels, symmetric roles and anonymous...
详细信息
Channel hopping (CH) is an effective technique to reach a rendezvous in cognitive radio networks (CRNs). However, the holistic requirements of asynchronous clocks, heterogeneous channels, symmetric roles and anonymous identifiers make it particularly challenging to achieve deterministic and fast rendezvous. Moreover, some existing regular CH algorithms are easy to be detected and blocked by adversarial jammers. To overcome these deficiencies, this paper designs a novel Parity and Binary CH (PBCH) algorithm in a highly-random manner to enhance the level of anti-jamming. The key idea behind PBCH is to convert a randomly selected parity channel into a carefully designed binary template. Whether secondary users (SUs) select the same parity channel or not, the interleaved zeros and ones naturally included in the adequate binary template can guide fast rendezvous undoubtedly. We analyze the theoretical maximum time-to-rendezvous and the anti-jamming capability by virtue of the Chinese remainder theorem and the information entropy, respectively. We also compare PBCH with the prevailing rendezvousalgorithms through extensive simulations. Evaluation results reveal that PBCH yields superior rendezvous latencies even under moderate jammer attacks.(C) 2020 Elsevier Ltd. All rights reserved.
The objective is to design distributed coordination strategies for a network of agents in a cyber-physical environment. In particular, we concentrate on the rendez-vous of agents having double-integrator dynamics with...
详细信息
ISBN:
(纸本)9783952426937
The objective is to design distributed coordination strategies for a network of agents in a cyber-physical environment. In particular, we concentrate on the rendez-vous of agents having double-integrator dynamics with the addition of a damping term in the velocity dynamics. We start with distributed controllers that solve the problem in continuous-time, and we then explain how to implement these using eventbased sampling. The idea is to define a triggering rule per edge using a clock variable which only depends on the local variables. The triggering laws are designed to compensate for the perturbative term introduced by the sampling, a technique that reminds of Lyapunov-based control redesign. We first present an event-triggered solution which requires continuous measurement of the relative position and we then explain how to convert it to a self-triggered policy. The latter only requires the measurements of the relative position and velocity at the last transmission instants, which is useful to reduce both the communication and the computation costs. The strategies guarantee the existence of a uniform minimum amount of times between any two edge events. The analysis is carried out using an invariance principle for hybrid systems.
暂无评论