| Summary: | 碩士 === 國立中央大學 === 資訊工程學系 === 104 === Cognitive radio network (CRN) is a promising technology to solve unlicensed spectrum shortage problem and enhance the utilization of licensed spectrum. Channel hopping scheme are widely used to develop communication links between users (SU) in CRNs. However, existing channel hopping for CRNs, which have fixed hopping patterns, are extremely vulnerable to malicious attacks in CRNs. Most of existing anti-jamming CH protocols need pre-shared informations (e.g. hopping sequences) to the communication link between the communication pairs. Due to the nature of opportunistic spectrum access, pre sharing informations is impractical in CRNs. Hence, anti-jamming channel hopping approaches without pre-shared secrets have gained more and more research interests. For anti-jamming CH protocols without pre-shared informations, they either have unbounded time to rendezvous or require role pre-assignment (i.e. every SU is pre-assigned as either a sender or a receiver). Role pre-assignment is inapplicable to scenarios that a SU may be a sender and receiver simultaneously. In this paper, we propose an anti-jamming channel hopping algorithm, SP CH, with bounded rendezvous time, but without pre-shared secrets.
|
|---|
