The present invention relates to wireless network technology and presents a permutation group-based channel rendezvous method for a multi-antenna cognitive radio network, allowing a cognitive user equipped with multiple antennas to achieve blind channel rendezvous without the need for clock synchronisation. The present invention defines channel hopping sequences whilst making full use of properties such as channel diversity, the closure nature of permutation groups, and multi-antenna concurrency; based on the permutation groups obtained by rotating a regular polyhedron or a regular polygon around different angles according to different types of axes of symmetry, cyclical splicing is implemented, and different antennas can, according to different rules, independently generate hopping sequences and switching channels; the sequence generating methods are various and flexible; the use of parallel search ensures that deterministic rendezvous with other cognitive users is achieved as quickly as possible and as much as possible in a limited time; and the present method is a highly efficient blind channel rendezvous method having wide applicability and suitable for use in large-scale wireless networks.
Legal claims defining the scope of protection. Each claim is shown in both the original legal language and a plain English translation.
1. A permutation group-based channel rendezvous method for a multi-antenna cognitive radio network, wherein different users which need rendezvous in the network at least have one common available channel, and the rendezvous process comprises: Channel numbers are mapped as elements in permutation groups, and channel hopping sequences of different antennas within one period are mapped as sequences of different elements in finite groups; under the condition that the number of channels in the cognitive radio network is even, the elements in the permutation groups are vertexes of a regular polyhedron and the channel hopping sequences of different antennas are constructed through permutation groups obtained by rotating the regular polyhedron by different angles according to different types and different directions of axes of symmetry; under the condition that the number of the channels in the cognitive radio network is odd, the elements in the permutation groups are vertexes of a regular polygon and the channel hopping sequences of different antennas are constructed through permutation groups obtained by rotating the regular polygon by different angles according to different types of axes of symmetry and successively sustained left/right cyclical rotation; through limited time slots, the common available channel appears in the same time slot of the different users to achieve channel rendezvous.
In a multi-antenna cognitive radio network, this method achieves channel rendezvous (users finding a common channel) without clock synchronization. It requires users to have at least one channel in common. The method maps channel numbers to elements within permutation groups. Channel hopping sequences for each antenna are mapped to sequences of elements within these groups. For an even number of channels, the permutation group elements are vertices of a regular polyhedron, and hopping sequences are generated by rotating the polyhedron around different axes of symmetry. For an odd number of channels, the elements are vertices of a regular polygon, and hopping sequences are generated by polygon rotations around symmetry axes plus cyclical left/right rotations. Through parallel searching, users will discover available common channels during overlapping time slots.
2. The permutation group-based channel rendezvous method for the multi-antenna cognitive radio network according to claim 1 , wherein said different users select the permutation groups corresponding to different types of axes of symmetry when constructing the channel hopping sequences.
Builds upon the method of Claim 1. When creating channel hopping sequences using permutation groups for channel rendezvous in a multi-antenna cognitive radio network, different users specifically select permutation groups that correspond to different types of axes of symmetry. This means one user might use rotations around one type of axis of symmetry (e.g., an axis through opposite faces of a cube) while another uses a different type (e.g., an axis through opposite edges). This variation in the chosen permutation groups introduces diversity in the hopping sequences, making it more likely that two users will eventually find a common channel for rendezvous.
3. The permutation group-based channel rendezvous method for the multi-antenna cognitive radio network according to claim 1 , wherein under said condition that the number of the channels in the cognitive radio network is even, when the users have a plurality of antennas, the channel hopping sequence of a certain antenna of the same user is cyclical splicing by rotating the corresponding permutation groups by different angles according to the same type and the same direction of axes of symmetry, while the channel hopping sequence of different antennas of the same user is cyclical splicing by rotating the corresponding permutation groups by different angles according to the same type and different directions of axes of symmetry.
Expands on the method of Claim 1 for an even number of channels. When users have multiple antennas, the channel hopping sequence for a *single* antenna is generated by cyclically splicing permutation groups rotated by different angles, but around the *same* type and direction of symmetry axis. The channel hopping sequences for *different* antennas on the *same* user are generated by cyclically splicing permutation groups rotated by different angles around the *same* type of symmetry axis, but with *different* directions. This creates distinct but related hopping sequences for each antenna of the same user.
4. The permutation group-based channel rendezvous method for the multi-antenna cognitive radio network according to claim 1 , wherein under said condition that the number of the channels in the cognitive radio network is odd, when the users have a plurality of antennas, the channel hopping sequence of a certain antenna of the same user is cyclical splicing by rotating the corresponding permutation groups by different angles according to the same type of axes of symmetry, while the channel hopping sequence of other antennas of the user is cyclical splicing of sequences obtained by successively and continuously rotating the channel hopping sequence of a previous antenna left/right cyclically by one time slot.
Expands on the method of Claim 1 for an odd number of channels. When users have multiple antennas, the channel hopping sequence for one antenna is created by cyclical splicing of permutation groups rotated by different angles around the *same* type of symmetry axis. For other antennas on the *same* user, their channel hopping sequences are generated by taking the *previous* antenna's hopping sequence and successively and continuously rotating it either left or right cyclically by one time slot. Each successive antenna uses a sequence derived from the previous one, which increases the probability of finding a common channel.
Cooperative Patent Classification codes for this invention. Click any code to explore related patents in that topic.
December 22, 2014
December 5, 2017
Browse 5M+ US patents with plain-English claim translations and AI-generated analysis.