Cognitive radio network frequency hopping communication method supporting node priorities
A cognitive wireless network and node-supporting technology, applied in the field of communication interaction mechanism design, can solve problems such as inability to distinguish communication priority levels, unfavorable communication transmission performance of cognitive wireless network, and inability to reduce communication transmission performance
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment 1
[0048] Example of Cognitive Transmit and Receive Frequency Hopping Sequence Generation Algorithms Supporting Node Priority
[0049] When the total number of authorized channels is N=8, since the integer 8 has only two non-1 true factors 4 and 2, the cognitive frequency hopping communication mechanism supporting node priority proposed by the present invention can support up to 2 node priority level, ie M=2. Among them, the time interval for the low priority sending and receiving nodes to achieve two consecutive convergences is q 1 = 4 time slots, and the time interval between high-priority sending and receiving nodes to achieve 2 consecutive aggregations is q 2 = 2 time slots.
[0050] According to the constraints, the channel interval r of a single frequency hop of a low-priority cognitive sending node 1,s can be set to r 1,s = 1, while the channel interval r of a single frequency hop of the low priority cognitive receiving node 1,t can be set to r 1,t =1. At this time,...
Embodiment 2
[0068] An example of an existing cognitive transmit and receive frequency hopping sequence generation algorithm that does not support node priority
[0069] The existing cognitive sending and receiving frequency hopping sequences are obtained based on a generation algorithm of synchronous frequency hopping sequences without distinguishing priorities. In this algorithm, the number N of authorized channels must be an even number, and each sending frequency hopping sequence for the next N 2 Periodic repetition of a sequence of / 2 elements:
[0070] {b i +0moduloN,b i +1moduloN,...,b i +N-1moduloN,(b i +2)+0moduloN,(b i +2)+1moduloN,...,(b i +2)+N-1moduloN,...,(b i +N-2)+0moduloN,(b i +N-2)+1moduloN,...,(b i +N-2)+N-1moduloN}, where, b i , i∈[1,N / 2], represents the sending frequency hopping sequence The initial channel where it is located, and satisfies b 1 =b 2 =...=b N / 2 modulo2.
[0071] At the same time, each received frequency hopping sequence ψ i is an N-e...
PUM
Abstract
Description
Claims
Application Information
- R&D Engineer
- R&D Manager
- IP Professional
- Industry Leading Data Capabilities
- Powerful AI technology
- Patent DNA Extraction
Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.
© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com