WO2016082265A1 - 一种基于置换群的多天线认知无线网络信道汇合方法 - Google Patents

一种基于置换群的多天线认知无线网络信道汇合方法 Download PDF

Info

Publication number
WO2016082265A1
WO2016082265A1 PCT/CN2014/094499 CN2014094499W WO2016082265A1 WO 2016082265 A1 WO2016082265 A1 WO 2016082265A1 CN 2014094499 W CN2014094499 W CN 2014094499W WO 2016082265 A1 WO2016082265 A1 WO 2016082265A1
Authority
WO
WIPO (PCT)
Prior art keywords
different
channel
antenna
wireless network
user
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Ceased
Application number
PCT/CN2014/094499
Other languages
English (en)
French (fr)
Inventor
梁炜
于海斌
杨博
张晓玲
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Shenyang Institute of Automation of CAS
Original Assignee
Shenyang Institute of Automation of CAS
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Shenyang Institute of Automation of CAS filed Critical Shenyang Institute of Automation of CAS
Priority to EP14906821.5A priority Critical patent/EP3226596B1/en
Priority to US15/527,955 priority patent/US9838070B1/en
Publication of WO2016082265A1 publication Critical patent/WO2016082265A1/zh
Anticipated expiration legal-status Critical
Ceased legal-status Critical Current

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04B—TRANSMISSION
    • H04B1/00—Details of transmission systems, not covered by a single one of groups H04B3/00 - H04B13/00; Details of transmission systems not characterised by the medium used for transmission
    • H04B1/69—Spread spectrum techniques
    • H04B1/713—Spread spectrum techniques using frequency hopping
    • H04B1/7143—Arrangements for generation of hop patterns
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04B—TRANSMISSION
    • H04B1/00—Details of transmission systems, not covered by a single one of groups H04B3/00 - H04B13/00; Details of transmission systems not characterised by the medium used for transmission
    • H04B1/69—Spread spectrum techniques
    • H04B1/713—Spread spectrum techniques using frequency hopping
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W16/00—Network planning, e.g. coverage or traffic planning tools; Network deployment, e.g. resource partitioning or cells structures
    • H04W16/02—Resource partitioning among network components, e.g. reuse partitioning
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W72/00—Local resource management
    • H04W72/12—Wireless traffic scheduling
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04B—TRANSMISSION
    • H04B1/00—Details of transmission systems, not covered by a single one of groups H04B3/00 - H04B13/00; Details of transmission systems not characterised by the medium used for transmission
    • H04B1/38—Transceivers, i.e. devices in which transmitter and receiver form a structural unit and in which at least one part is used for functions of transmitting and receiving
    • H04B1/40—Circuits
    • H04B1/403—Circuits using the same oscillator for generating both the transmitter frequency and the receiver local oscillator frequency
    • H04B1/405—Circuits using the same oscillator for generating both the transmitter frequency and the receiver local oscillator frequency with multiple discrete channels
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04B—TRANSMISSION
    • H04B1/00—Details of transmission systems, not covered by a single one of groups H04B3/00 - H04B13/00; Details of transmission systems not characterised by the medium used for transmission
    • H04B1/06—Receivers
    • H04B1/10—Means associated with receiver for limiting or suppressing noise or interference
    • H04B1/1027—Means associated with receiver for limiting or suppressing noise or interference assessing signal quality or detecting noise/interference for the received signal
    • H04B2001/1045—Adjacent-channel interference
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W72/00—Local resource management
    • H04W72/20—Control channels or signalling for resource management
    • H04W72/27—Control channels or signalling for resource management between access points

Definitions

  • the invention relates to a wireless network technology, in particular to a multi-antenna cognitive wireless network channel convergence method based on a permutation group.
  • Cognitive wireless technology is a promising technology for solving the problem of low spectrum utilization caused by static spectrum allocation.
  • the dynamic spectrum access method can effectively improve the utilization of licensed frequency bands. Since the primary user in the cognitive network has higher priority for spectrum usage than the secondary user, the secondary user needs to detect the primary user signal before using the frequency band, and implements the underlying (Overlay) or overlay spectrum sharing mechanism with the primary user. Coexistence to avoid interference with the primary user's communication.
  • the basis of cognitive wireless network networking protocol design is that the sender can find the receiver and use the same channel for communication.
  • the channel convergence mechanism provides a common transmission medium for the secondary user to establish a communication link for the problem, which is a necessary process for completing control command interaction and data information transmission, and is implemented for neighbor discovery, sending and receiving handshake, topology control, and routing request broadcast and routing information. Prerequisites for updates and other processes.
  • auxiliary channel convergence strategy also known as the channel convergence strategy based on the dedicated common control channel, inherits the idea of the traditional multi-channel wireless network medium access control (MAC) design, and belongs to the static active channel convergence strategy.
  • MAC wireless network medium access control
  • the preset dedicated common control channel is a channel convergence point known to the secondary user, the process of completing channel convergence and establishing a communication link between the secondary users can be simplified.
  • the dedicated public control channel covering the entire network is very easy to become a bottleneck restricting network capacity due to the increase of network load.
  • the common control channel is susceptible to the activity of the primary user.
  • the primary user When the primary user appears on the control channel, all secondary users must delay communication and switch to other channels, resulting in reduced network throughput. Moreover, when the primary user occupies the control channel for a long time, it blocks. Secondary user access, ie in cognitive wireless networks, the common control channel is not guaranteed to be always available.
  • the dedicated public control channel introduces a single point of failure to the network due to a denial of service attack.
  • the blind channel convergence strategy does not depend on the dedicated common control channel. It is a dynamic on-demand channel convergence strategy, which is suitable for cognitive network network channel dynamics. It can be divided into signal processing based channel convergence and reception-oriented reception. Channel convergence, channel convergence based on channel hopping sequences, and channel merging strategy based on packet/clustering.
  • the excellent channel switching performance of cognitive radio equipment makes the channel hopping mode the main method for achieving blind channel convergence of secondary users.
  • the channel convergence based on the channel jump sequence works on the time slot system, and each secondary user constructs its own channel jump sequence according to the sequence generation algorithm, which determines the secondary user channel jump trajectory. Once the sender and receiver switch to the same channel through channel hopping, the channel becomes the merging channel.
  • the design of the channel jump sequence has a synchronization sequence that relies on clock synchronization and an asynchronous sequence that does not rely on clock synchronization. Obviously, the latter is more applicable.
  • the coverage of the channel hopping method is not the whole network, which can effectively avoid the behavioral convergence of users.
  • the convergence strategy based on the channel jump sequence mainly considers that each user only needs to configure one antenna, which is the most common configuration of most network devices.
  • the delay of the convergence search is usually large, and the processing capability of configuring only one antenna is very limited, which becomes a bottleneck restricting the overall performance.
  • each antenna independently jumps according to its own hopping sequence, and the characteristics of the channel diversity can be utilized more effectively, as long as any one of the transmitting and receiving antennas is in the same time slot. Convergence can be achieved by jumping to the same channel.
  • This multi-antenna parallel processing frequency hopping method is an effective way to improve search efficiency.
  • the present invention proposes a multi-antenna cognitive wireless network channel convergence method based on a permutation group, which can accelerate the convergence only by appropriately increasing the number of antennas, that is, only the problem of long convergence time is achieved by the commonly used single-antenna channel convergence method. Neighbor users can be quickly discovered by adding a small amount of hardware overhead.
  • mapping a channel number to an element in a permutation group mapping a frequency hopping sequence in one cycle of different antennas to an arrangement of different elements in a finite group
  • the elements in the permutation group are the vertices of the regular polyhedron, and the hopping sequences of different antennas are constructed by using the positive polyhedrons to rotate the different angles of the different axes toward the symmetry axis to construct the hopping sequences of different antennas;
  • the elements in the permutation group are the vertices of the regular polygon, and the permutation group obtained by rotating the different angles of the different types of symmetry axes by the regular polygons is sequentially rotated to the left/right cycle to construct different Frequency hopping sequence of the antenna;
  • the different users select a permutation group corresponding to different types of symmetry axes when constructing the hopping sequence.
  • the hopping sequence of one antenna of the same user is a symmetry axis of the same type and the rotation axis of the corresponding replacement group is rotated at different angles.
  • the hopping sequence of different antennas of the same user is a cyclic splicing of the corresponding permutation group rotated at different angles by the symmetry axes of different orientations of the same type.
  • the hopping sequence of one antenna of the same user is a cyclic splicing of the same type of symmetry axis rotating the corresponding replacement group at different angles, and the user's other splicing
  • the hopping sequence of the antenna is a cyclic splicing of a sequence in which the hopping sequence of the previous antenna is continuously shifted to the left/right by one slot.
  • the method for channel convergence of multi-antenna cognitive wireless network based on permutation group proposed by the present invention is proposed under the premise of fully considering the characteristics of multi-channel switching of cognitive wireless networks, only by adding a small amount of hardware overhead (ie, antenna) To speed up the process of channel convergence for different users. Specifically in:
  • the channel grouping method based on permutation group proposed by the present invention performs replacement and looping of elements (ie, channel labels) according to different rules of different antennas, and can ensure the occurrence of repeated elements in a limited time, that is, realize channel convergence, effectively shortening The time at which the channels meet;
  • the method of the invention fully utilizes the characteristics of parallel search of multiple antennas and the characteristics of channel diversity of cognitive wireless networks, ensures fast channel convergence, is a key link of networking, and is suitable for large-scale wireless networks.
  • the channel convergence method proposed by the method of the invention has universality, is suitable for any number of channels, and has no constraint on the parity of the number of channels, and is an effective method suitable for a multi-antenna clock asynchronous scene.
  • 1 is a schematic diagram of a frequency hopping sequence generated by different antennas of different users (i and j) under consideration;
  • FIG. 2 is a schematic diagram of rotating a permutation group by taking a positive cube as an example
  • FIG. 3 is a schematic diagram of constructing a frequency hopping sequence by a permutation group obtained by a positive cube;
  • FIG. 4 is a schematic diagram of rotating a permutation group by taking a regular pentagon as an example
  • FIG. 5 is a schematic diagram of constructing a frequency hopping sequence by a permutation group obtained by a regular pentagon.
  • the cognitive wireless network environment contemplated by the present invention includes K (K ⁇ 2) users. Assuming the network is slotted, all time slots are of the same fixed length.
  • user i configures m (m > 1) antennas
  • user j configures n (n > 1) antennas.
  • m and n are not equal.
  • Frequency hopping sequences representing different antennas of users i and j, respectively, Specifically, the channel of the mth antenna of the user i is located in the tth time slot, and Specifically, it indicates the channel where the nth antenna of the user j is located at the tth time slot.
  • the present invention contemplates a more general case applicable to clock asynchronous, since in the multi-antenna configuration, as long as any one of the transmitting and receiving antennas jumps in the same time slot
  • the same channel is considered to achieve convergence, and the same time slot in the clock asynchronous situation means that the time slots between users do not completely overlap, but the overlapping part time is enough to complete all the necessary steps to achieve convergence (such as communication handshake, exchange report)
  • the time slots are not aligned, they can be considered to be the same time slot to some extent.
  • the present invention exploits the nature of permutation groups in finite groups when designing hopping sequences for different antennas.
  • identity replacement refers to
  • the non-empty subset G in the global permutation S m on M satisfies: (1) for all permutations f and g in G, f ⁇ g also belongs to G; (2) the permutation permutation I belongs to G; (3) Each of G replaces f, and its inverse f -1 also belongs to G, and G is a permutation group on M.
  • the invention abstracts the channel number in the cognitive wireless network into an element in the permutation group, abstracts the frequency hopping sequence in one cycle of different antennas into an arrangement of different elements in the finite group, and replaces and circulates according to a certain rule.
  • the replacement and cyclic laws of the hopping sequences of different antennas are not the same. For example, an antenna of user i does not adopt a special law, only the periodic replacement of the channel number is performed periodically, and other antennas adopt a certain law.
  • the hopping sequences of the antennas are independently generated according to the permutation group theory in the finite group. As long as any one of the transmitting and receiving antennas jumps to the same channel in the same time slot, the convergence can be successfully realized.
  • the following is an example of a permutation group of positive cubes. Take a positive cube, called a fixed body, whose set of vertices is ⁇ 1, 2, ..., 8 ⁇ , which can also be regarded as a set of channels in a cognitive wireless network, C ⁇ c 1 , c 2 ,...c 8 ⁇ .
  • another positive cube is completely coincident with the body, and the vertex marks are the same, called the moving body.
  • the moving body makes various rotations around the axis of symmetry of the body, so that the two overlap again, and each rotation determines a permutation on the set of vertices.
  • These rotations include the following four different types (the same pattern becomes
  • the corresponding permutation groups are rotated at different angles.
  • the present invention adopts the following methods:
  • the hopping sequence of an antenna of the same user is a cyclical splicing of the corresponding permutation group by different angles of the symmetry axis of the same type (for example, the hopping sequence of the first antenna of user i may be
  • the hopping sequence of different antennas of the same user is a cyclic splicing of the corresponding permutation group by different angles of the symmetry axes of different orientations of the same type (for example, the hopping sequence of the second antenna of user i may be
  • FIG. 3 is a frequency hopping sequence constructed according to this principle.
  • User 1 configures 3 antennas (R1, R2, and R3 of user 1), and selects the second type of symmetry axis, and the user hops the first antenna.
  • the sequence is a cyclic splicing that rotates the corresponding permutation group at different angles (ie, 90°, 180°, and 270°) toward the axis of symmetry, and the second antenna hopping sequence will rotate the corresponding permutation group at another angle toward the other axis of symmetry.
  • User 2 configures 2 antennas (R2, R2 of User 2), and selects the third type of symmetry axis (different from User 1), as for the hopping sequence of each antenna of User 2.
  • the construction method is the same as that of User 1, and will not be described again. It can be seen from the figure that although different users start to hop different time slots (ie, the clock is asynchronous), it is guaranteed to achieve deterministic convergence in a limited time, that is, the time slots marked with the same color in the figure. It is worth mentioning that as long as any antenna of different users accesses the same channel in the same time slot, they can successfully merge. As shown in FIG.
  • the method proposed by the present invention can realize convergence of different antennas of users not only in a short time, but also achieve multiple convergences in one frequency hopping period, that is, the method not only shortens the convergence time but also improves Meeting The degree of convergence (ie the number of convergences).
  • the acquisition method of the permutation group can be various.
  • the channel label of the cognitive wireless network is mapped to the vertices of the positive cube, a total of eight, but not all networks have eight channels, and six different faces of the positive cube can also be used to represent the channel.
  • a cognitive wireless network with 6 channels can be described.
  • the vertices or faces of regular tetrahedrons, regular octahedrons, etc. can be used to represent different channels, and the construction method of the frequency hopping sequence is similar to that of the above-mentioned positive cubes, except that the type, orientation and rotatable angle of the axis of symmetry are Different.
  • the present invention further proposes a method for constructing a frequency-hopping sequence based on a permutation group with an odd number of channels, which uses a planar regular polygon to obtain a permutation group.
  • the cognitive wireless network with channel number 5 is taken as an example to illustrate the construction method of the frequency hopping sequence.
  • Five channels can be obtained by using a regular pentagon (fixed body) to obtain a permutation group.
  • Each vertex represents a channel.
  • the set of vertices is ⁇ 1, 2, ..., 5 ⁇ , which can also be regarded as
  • another regular pentagon is exactly coincident with the body, and the vertex marks are the same, called the moving body.
  • the moving body makes various rotations around the axis of symmetry of the body, so that the two overlap again, and each rotation determines a permutation on the set of vertices. These rotations include the following 3 different types:
  • the present invention adopts the following methods:
  • the hopping sequence of an antenna of the same user is a cyclic splicing of the same type of symmetry axis rotating the corresponding permutation group at different angles (for example, the hopping sequence of the first antenna of user i may be
  • the hopping sequence of the other antennas of the user is a cyclic splicing of a sequence in which the hopping sequence of the previous antenna is sequentially shifted to the left by one slot.
  • FIG. 5 is a frequency hopping sequence constructed according to this principle.
  • User 1 configures 3 antennas (R1, R2, and R3 of user 1), and selects the second type of symmetry axis, and the user hops the first antenna.
  • the sequence is a cyclic splicing in which the symmetry axis of the type rotates the corresponding permutation group at different angles (ie, 72°, 144°, 216°, and 288°), and the second antenna hopping sequence has its previous antenna (ie, the first antenna) ) sequentially shifting one slot to the left to obtain, and so on; and user 2 configures two antennas (R1, R2 of user 2), and selects the third type of symmetry axis (different from user 1).
  • the method for constructing the hopping sequence of each antenna of the user 2 is the same as that of the user 1, and will not be described again. It can be seen from the figure that although different users start to hop different time slots (ie, the clock is asynchronous), it is guaranteed to achieve deterministic convergence in a limited time, that is, the time slots marked with the same color in the figure. As for the case where the number of other channels is an odd number, similar to the above method, only the type of the symmetry axis and the rotatable angle are different, and will not be described again.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

本发明涉及无线网络技术，是一种基于置换群的多天线认知无线网络信道汇合方法，可以使配备多根天线的认知用户在无需时钟同步的情况下实现信道盲汇合。本发明在设计跳频序列时充分利用信道多样性、置换群封闭性、多天线并发性等特性，将正多面体或正多边形按不同类型的对称轴旋转不同角度所得的置换群作为基础，进行循环拼接，并且不同天线可按照不同规律独立生成跳频序列并切换信道，序列生成方式多样且灵活，通过并行搜索可保证在有限时间内尽可能快并且尽可能多地与其它认知用户实现确定性汇合，是一种适用性较广、可应用于大规模无线网络的高效的盲信道汇合方法。

Description

一种基于置换群的多天线认知无线网络信道汇合方法 技术领域
本发明涉及无线网络技术，具体是一种基于置换群的多天线认知无线网络信道汇合方法。
背景技术
认知无线技术是目前解决静态频谱分配方式所导致的频谱利用率低下问题的很有前景的技术，采用动态频谱接入方式可有效提高授权频段的利用率。由于认知网中的主用户对频谱使用的优先级高于次用户，次用户在使用频段之前需要探测主用户信号，采用衬底(Underlay)或叠加(Overlay)频谱共享机制实现和主用户的共存，以避免对主用户的通信产生干扰。
认知无线网络组网协议设计的基础是发送方能找到接收方，并采用相同信道进行通信。信道汇合机制针对该问题为次用户提供公共传输媒介以建立通信链路，是完成控制指令交互和数据信息传输的必要过程，是实现邻居发现、收发双方握手、拓扑控制及路由请求广播和路由信息更新等过程的前提条件。
根据是否依赖网络预设的专用公共控制信道，目前信道汇合策略分为有辅助的信道汇合和盲信道汇合两类。有辅助的信道汇合策略又称为基于专用公共控制信道的信道汇合策略，继承了传统多信道无线网络介质访问控制(MAC，Medium Access Control)协议设计的思想，属于静态主动的信道汇合策略。由于预设专用公共控制信道是次用户已知的信道汇合点，因而可简化次用户之间完成信道汇合和建立通信链路的过程。但覆盖全网的专用公共控制信道极易因网络负载的增加而成为限制网络容量的瓶颈。公共控制信道容易受主用户活动的影响，当主用户出现在控制信道时，所有的次用户必须延迟通信并切换至其它信道，致使网络的吞吐量降低，况且当主用户长期占用控制信道，就阻塞了次用户的接入，即在认知无线网络中，公共控制信道也不能保证始终可用。此外，专用公共控制信道会因拒绝服务攻击给网络带来单点失效的问题。盲信道汇合策略不依赖于专用公共控制信道，是一种动态按需的信道汇合策略，适合于认知无线网络信道可用性动态变化的特性，进而可分为基于信号处理的信道汇合、基于面向接收者的信道汇合、基于信道跳转序列的信道汇合以及基于分组/分簇的信道汇合策略等。认知无线电设备优良的信道切换性能，使得信道跳转方式成为当前实现次用户盲信道汇合的主要方法。基于信道跳转序列的信道汇合工作在时隙系统上，每个次用户按照序列生成算法构造自己的信道跳转序列，该序列决定了次用户信道跳转轨迹。一旦发送方和接收方通过信道跳转切换至同一信道，该信道就成为汇合信道。信道跳转序列的设计有依赖时钟同步的同步序列和不依赖时钟同步的异步序列，显然后者的适用性更广。信道跳频方法的覆盖范围是非全网的，可有效避免用户出现行为趋同现象。为防止汇合信道拥塞， 在设计时需要保证网络的所有信道都有相同的机会成为汇合信道，保证信道被接入使用的公平性。通过将汇合信道分散到所有信道上，可充分利用认知无线网络信道多样性的特点。然而采用该方法，次用户为实现信道汇合需要频繁地切换信道，时间开销较大。为此，设计在有限时间内尽可能快地实现确定性汇合的跳频序列是最为关键的。
目前基于信道跳转序列的汇合策略主要考虑各次用户只需要配置一根天线，这是大多数网络设备最常具备的配置。但在认知无线网络这种多信道而且信道可用性动态变化的网络中，汇合搜索的时延开销通常会很大，只配置一根天线的处理能力会很受限制，成为制约整体性能的瓶颈。通过使用多天线的认知无线电设备，每根天线都独立地按照各自的跳频序列进行跳转，可更有效地利用信道多样性的特征，只要收发双方的任意一根天线在相同时隙内跳转至同一信道，即可实现汇合，这种多天线并行处理的跳频方法是一种提高搜索效率的有效途径。
发明内容
针对目前普遍采用的单天线信道汇合方法实现汇合时间较长的问题，本发明提出一种基于置换群的多天线认知无线网络信道汇合方法，仅通过适当增加天线数量就可加速汇合，即只通过增加少量的硬件开销就可快速发现邻居用户。
本发明为实现上述目的所采用的技术方案是：一种基于置换群的多天线认知无线网络信道汇合方法，网络中的需要汇合的不同用户至少有一个公共的可用信道，其汇合过程包括：
将信道编号映射为置换群中的元素，将不同天线的一个周期内的跳频序列映射为有限群中不同元素的排列；
对于认知无线网络信道数为偶数的情形，置换群中的元素为正多面体的顶点，利用正多面体按不同类型不同朝向对称轴旋转不同角度所得置换群来构建不同天线的跳频序列；
对于认知无线网络信道数为奇数的情形，置换群中的元素为正多边形的顶点，利用正多边形按不同类型对称轴旋转不同角度所得置换群并依次持续向左/向右循环轮转来构建不同天线的跳频序列；
经过有限个时隙，公共的可用信道在所述不同用户的同一时隙内出现，实现信道汇合。
所述不同用户在构建跳频序列时选取不同类型对称轴对应的置换群。
所述对于认知无线网络信道数为偶数的情形，当用户具有多根天线时，同一用户的某根天线的跳频序列是同一类型同一朝向的对称轴按不同角度旋转对应置换群的循环拼接，而同一用户的不同天线的跳频序列是同一类型不同朝向的对称轴按不同角度旋转对应置换群的循环拼接。
所述对于网络信道数为奇数的情形，当用户具有多根天线时，同一用户的某根天线的跳频序列是同一类型对称轴按不同角度旋转对应置换群的循环拼接，而该用户的其它天线的跳频序列是其前一根天线的跳频序列依次持续向左/向右循环移动1个时隙所得序列的循环拼接。
本发明提出的一种基于置换群的多天线认知无线网络信道汇合方法，是在充分考虑认知无线网络多信道切换特点的前提下提出的，仅需通过增加少量的硬件开销(即天线)，即可加快不同用户实现信道汇合的过程。具体表现在：
1.本发明提出的基于置换群的信道汇合方法对不同天线按照不同规律进行元素(即信道标号)的置换和循环，可以在有限时间内保证重复元素的出现，即实现信道汇合，有效缩短了信道汇合的时间；
2.本发明方法充分利用多根天线并行搜索的特点以及认知无线网络信道多样性的特点，保证了快速实现信道汇合，是组网的关键环节，适合应用于大规模的无线网络。
3.本发明方法所提出的信道汇合方法具备通用性，适合任何数量的信道，对信道数目的奇偶性没有约束，是一种适用于多天线时钟异步场景的有效方法。
附图说明
图1为考虑的不同用户(i和j)的不同天线生成的跳频序列示意图；
图2为以正立方体为例旋转构建置换群的示意图；
图3为按正立方体所得置换群构建跳频序列的示意图；
图4为以正五边形为例旋转构建置换群的示意图；
图5为按正五边形所得置换群构建跳频序列的示意图。
具体实施方式
下面结合附图及实施例对本发明做进一步的详细说明。
本发明考虑的认知无线网络环境包括K(K≥2)个用户。假设网络是分时隙的，所有时隙都是相同的固定长度。认知无线网络中的授权频段分为M(M≥1)个非正交信道，即C＝{c1,c2,…cM}。假设网络中的所有用户均已知信道的标号。若次用户可在某信道上通信并且不会对主用户的活动产生任何干扰，即认为该信道对于该次用户是可用的。而信道是否可用可通过目前已经较为成熟的频谱检测技术获知。不失一般性，本发明考虑一对用户i和j(i≠j且i,j＝1,2,…,K)之间的信道汇合问题。假设用户i配置m(m>1)根天线，而用户j配置n(n>1)根天线，在异构的认知无线网络环境中，m与n并不相等。为了确保不同用户之间实现确定性汇合，不管它们的可用信道集有多么不同，始终要有至少一个的公共可用信道才可以期望汇合。由于同一用户的不同天线均独立地生成跳频序列，用
Figure PCTCN2014094499-appb-000001
分别表示用户i和j的不同天线的跳频序列，其中
Figure PCTCN2014094499-appb-000002
具体表示用户i的第m根天线在第t时隙所在的信道，而
Figure PCTCN2014094499-appb-000003
具体表示用户j的第n根天线在第t时隙所在的信道。鉴于时钟同步在认知无线网络环境中不易于实现，本发明考虑适用于时钟异步这种更为普遍的情形，由于在多天线配置下只要收发双方的任意一根天线在相同时隙内跳转至同一信道即认为实现汇合，而在时钟异步情 形下的相同时隙意味着用户之间的时隙不完全重叠，但重叠的部分时长足以完成实现汇合的所有必需步骤(如通信握手、交换报文等)，此时尽管时隙不对齐，仍可在一定程度上认为是相同时隙。
本发明在设计不同天线的跳频序列时利用了有限群中的置换群的性质。有限非空集M＝{1,2,...,m}上的双射σ称为M上的一个置换，记作
Figure PCTCN2014094499-appb-000004
其中，a1,…,am互不相等。
特别地，恒等置换是指
Figure PCTCN2014094499-appb-000005
如果M上的全体置换Sm中的非空子集G满足：(1)对G中的所有置换f与g，f·g也属于G；(2)恒等置换I属于G；(3)对G中的每一个置换f，它的逆f-1也属于G，则G是M上的一个置换群。
本发明将认知无线网络中的信道编号抽象为置换群中的元素，将不同天线的一个周期内的跳频序列抽象为有限群中不同元素的排列，对其按照一定规律进行置换和循环，而不同天线的跳频序列的置换和循环规律不尽相同，比如用户i的一根天线不采用特殊规律，仅是对信道号的恒等置换进行周期性的循环，而其它天线将采用一定规律(比如按不同的方向和角度旋转)进行置换和循环，这样由于置换群的封闭性，在一定时间内会出现相同元素的重复，亦即在不同用户的不同天线之间可以期望在有限时间内实现确定性汇合。各天线的跳频序列均按照有限群中的置换群理论独立地生成，只要收发双方的任意一根天线在相同时隙内跳转至同一信道，即可成功实现汇合。
下面以正立方体的置换群为例，阐述实现方法。取一个正立方体，称之为定体，其顶点集合为{1,2,…,8}，亦可视作认知无线网络中的信道集合为C＝{c1,c2,…c8}。设想另一个正立方体与定体完全重合，并且顶点标记相同，称之为动体。动体围绕定体的对称轴作各种旋转，使得二者再度重合，每一种旋转都确定了顶点集合上的一个置换。这些旋转包括以下4种不同类型(在置换群的作用下变成相同的模式算是同一种置换)：
(ⅰ)不旋转，对应于恒等置换
σT1＝(1)(2)(3)(4)(5)(6)(7)(8)
(ⅱ)以相对面中心连线为轴旋转，这种轴共有3种不同朝向，每条轴可做90°、180°和270°(即-90°)共3种不同角度的旋转，比如附图2中左二图所示的轴对应的置换分别为
σT211＝(1234)(5678)
σT212＝(13)(24)(57)(68)
σT213＝(1432)(5876)
再如另外一种不同朝向的轴按不同角度旋转对应的置换群分别为
σT221＝(1485)(2376)
σT222＝(18)(45)(27)(36)
σT223＝(1584)(2673)
以此类推。
(ⅲ)以相对两顶点连线为轴旋转，这种轴共有4种不同朝向，每条轴可做120°和240°共2种不同角度的旋转，比如附图2中右二图所示的轴对应的置换分别为
σT311＝(3)(5)(168)(274)
σT312＝(3)(5)(186)(247)
以此类推。
(ⅳ)以相对两边中心连线为轴旋转，这种轴共有6种不同朝向，每条轴可做180°这1种旋转，比如附图2中右一图所示的轴对应的置换为
σT41＝(15)(37)(46)(28)
以此类推。
依照上述不同对称轴的不同旋转对应的置换群，在构造认知无线网络中不同用户的不同天线的跳频序列时，本发明将采用以下方法：
(ⅰ)同一用户在构建跳频序列时将选取同一类型(比如从上述4种类型σT1～σT4中选取某一种)的对称轴，不同用户在构建跳频序列时将选取不同类型的对称轴。
(ⅱ)同一用户的某根天线的跳频序列是同一类型同一朝向的对称轴按不同角度旋转对应置换群的循环拼接(比如用户i的第1根天线的跳频序列可以为
Figure PCTCN2014094499-appb-000006
而同一用户的不同天线的跳频序列是同一类型不同朝向的对称轴按不同角度旋转对应置换群的循环拼接(比如用户i的第2根天线的跳频序列可以为
Figure PCTCN2014094499-appb-000007
比如附图3是按照此原则构造的跳频序列，用户1配置3根天线(用户1的R1、R2、R3)，并选取上述第2种类型对称轴，该用户第1根天线的跳频序列是某一朝向对称轴按不同角度(即90°、180°和270°)旋转对应置换群的循环拼接，第2根天线跳频序列将是另一朝向对称轴按不同角度旋转对应置换群的循环拼接，以此类推；而用户2配置2根天线(用户2的R1、R2)，并选取上述第3种类型对称轴(与用户1不同)，至于用户2的各天线的跳频序列构建方法与用户1的原则相同，不再赘述。从图中可以看出，尽管不同用户开始跳频的时隙不同(即时钟异步)，但仍可保证在有限时间内实现确定性汇合，即图中标记相同颜色的时隙。值得一提的是，只要不同用户的任何一根天线在同一时隙内访问同一信道，即可成功汇合。如附图3所示，本发明提出的方法不仅可在短时间内实现用户不同天线间的汇合，而且可在一个跳频周期内实现多次汇合，即该方法不仅缩短了汇合时间，而且提高了汇 合度(即汇合次数)。
以上通过正立方体旋转所得置换群的实例说明了本方法的实施过程，为提高本发明方法的通用性，置换群的获取方式可以多种多样。比如，上例中是将认知无线网络的信道标号映射为正立方体的顶点，共8个，但并非所有网络的信道数都为8个，还可以用正立方体的6个不同面来表示信道，这样就可描述有6个信道的认知无线网络。不仅如此，还可以用正四面体、正八面体……的顶点或面来表示不同的信道，而跳频序列的构建方法与上述正立方体的类似，只是对称轴的类型、朝向及可旋转角度有所不同。
尽管通过正多面体的置换群来构建跳频序列可在一定程度上提高认知无线网络信道汇合的性能，但只适合于信道数为偶数的情况。对于信道数为奇数的情形，不宜采用正多面体来表示。为此，本发明进而提出适用于信道数为奇数的基于置换群的跳频序列构建方法，该方法用平面的正多边形来获取置换群。
不失一般性，下面以信道数为5的认知无线网络为例，来阐述跳频序列的构建方法。5个信道可以用正五边形(定体)来得到置换群，每个顶点表示一个信道，如附图4所示，其顶点集合为{1,2,…,5}，亦可视作认知无线网络中的信道集合为C＝{c1,c2,…c5}。设想另一个正五边形与定体完全重合，并且顶点标记相同，称之为动体。动体围绕定体的对称轴作各种旋转，使得二者再度重合，每一种旋转都确定了顶点集合上的一个置换。这些旋转包括以下3种不同类型：
(ⅰ)不旋转，对应于恒等置换
σT1＝(1)(2)(3)(4)(5)
(ⅱ)以正五边形的中心为轴旋转，这种轴只有1条，可做72°、144°、216°和288°共4种不同角度的旋转，对应的置换分别为
σT21＝(12345)
σT22＝(13524)
σT23＝(14253)
σT24＝(15432)
(ⅲ)以顶点与其相对边中点连线为轴旋转，这种轴共有5条，可做180°旋转，对应的置换分别为
σT31＝(1)(25)(34)
σT32＝(2)(13)(45)
σT33＝(3)(15)(24)
σT34＝(4)(12)(35)
σT35＝(5)(14)(23)
依照上述不同对称轴的不同旋转对应的置换群，在构造认知无线网络中不同用户的不同天线的跳频序列时，本发明将采用以下方法：
(ⅰ)同一用户在构建跳频序列时将选取同一类型(比如从上述3种类型σT1～σT3中选取某一种)的对称轴，不同用户在构建跳频序列时将选取不同类型的对称轴。
(ⅱ)同一用户的某根天线的跳频序列是同一类型对称轴按不同角度旋转对应置换群的循环拼接(比如用户i的第1根天线的跳频序列可以为
Figure PCTCN2014094499-appb-000008
而该用户的其它天线的跳频序列是其前一根天线的跳频序列依次向左循环移动1个时隙所得序列的循环拼接，即
Figure PCTCN2014094499-appb-000009
比如附图5是按照此原则构造的跳频序列，用户1配置3根天线(用户1的R1、R2、R3)，并选取上述第2种类型对称轴，该用户第1根天线的跳频序列是该类型对称轴按不同角度(即72°、144°、216°和288°)旋转对应置换群的循环拼接，第2根天线跳频序列将其前一根天线(即第1根天线)依次向左循环移动1个时隙而得到，以此类推；而用户2配置2根天线(用户2的R1、R2)，并选取上述第3种类型对称轴(与用户1不同)，至于用户2的各天线的跳频序列构建方法与用户1的原则相同，不再赘述。从图中可以看出，尽管不同用户开始跳频的时隙不同(即时钟异步)，但仍可保证在有限时间内实现确定性汇合，即图中标记相同颜色的时隙。至于其它信道数为奇数的情况，与上述方法类似，只是对称轴的类型及可旋转角度有所不同而已，不再赘述。

Claims (4)

  1. 一种基于置换群的多天线认知无线网络信道汇合方法，其特征在于，网络中的需要汇合的不同用户至少有一个公共的可用信道，其汇合过程包括：
    将信道编号映射为置换群中的元素，将不同天线的一个周期内的跳频序列映射为有限群中不同元素的排列；
    对于认知无线网络信道数为偶数的情形，置换群中的元素为正多面体的顶点，利用正多面体按不同类型不同朝向对称轴旋转不同角度所得置换群来构建不同天线的跳频序列；
    对于认知无线网络信道数为奇数的情形，置换群中的元素为正多边形的顶点，利用正多边形按不同类型对称轴旋转不同角度所得置换群并依次持续向左/向右循环轮转来构建不同天线的跳频序列；
    经过有限个时隙，公共的可用信道在所述不同用户的同一时隙内出现，实现信道汇合。
  2. 根据权利要求1所述的一种基于置换群的多天线认知无线网络信道汇合方法，其特征在于，所述不同用户在构建跳频序列时选取不同类型对称轴对应的置换群。
  3. 根据权利要求1所述的一种基于置换群的多天线认知无线网络信道汇合方法，其特征在于，所述对于认知无线网络信道数为偶数的情形，当用户具有多根天线时，同一用户的某根天线的跳频序列是同一类型同一朝向的对称轴按不同角度旋转对应置换群的循环拼接，而同一用户的不同天线的跳频序列是同一类型不同朝向的对称轴按不同角度旋转对应置换群的循环拼接。
  4. 根据权利要求1所述的一种基于置换群的多天线认知无线网络信道汇合方法，其特征在于，所述对于网络信道数为奇数的情形，当用户具有多根天线时，同一用户的某根天线的跳频序列是同一类型对称轴按不同角度旋转对应置换群的循环拼接，而该用户的其它天线的跳频序列是其前一根天线的跳频序列依次持续向左/向右循环移动1个时隙所得序列的循环拼接。
PCT/CN2014/094499 2014-11-30 2014-12-22 一种基于置换群的多天线认知无线网络信道汇合方法 Ceased WO2016082265A1 (zh)

Priority Applications (2)

Application Number Priority Date Filing Date Title
EP14906821.5A EP3226596B1 (en) 2014-11-30 2014-12-22 Permutation group-based channel convergence method for multi-antenna cognitive wireless network
US15/527,955 US9838070B1 (en) 2014-11-30 2014-12-22 Permutation group-based channel rendezvous method for multi-antenna cognitive radio network

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201410719074.0A CN105722092B (zh) 2014-11-30 2014-11-30 一种基于置换群的多天线认知无线网络信道汇合方法
CN201410719074.0 2014-11-30

Publications (1)

Publication Number Publication Date
WO2016082265A1 true WO2016082265A1 (zh) 2016-06-02

Family

ID=56073426

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2014/094499 Ceased WO2016082265A1 (zh) 2014-11-30 2014-12-22 一种基于置换群的多天线认知无线网络信道汇合方法

Country Status (4)

Country Link
US (1) US9838070B1 (zh)
EP (1) EP3226596B1 (zh)
CN (1) CN105722092B (zh)
WO (1) WO2016082265A1 (zh)

Families Citing this family (10)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2017074377A1 (en) * 2015-10-29 2017-05-04 Intel Corporation Boosting local memory performance in processor graphics
CN108124263B (zh) * 2016-11-30 2021-06-22 中国科学院沈阳自动化研究所 一种基于循环仲裁集合的定向天线信道汇合方法
CN106604321B (zh) * 2016-12-23 2020-12-04 西安电子科技大学 认知无线网络中基于有限覆盖的可调解信道交会方法
CN106685550B (zh) * 2017-01-04 2020-06-05 河海大学常州校区 认知无线电网络中非授权用户完全分布式相遇方法
CN108649995B (zh) * 2018-05-16 2020-03-31 广东技术师范学院 一种基于可用信道集的认知无线电盲会合方法
CN110474659B (zh) * 2019-09-25 2020-12-29 电子科技大学 一种天线异构认知无线网络的异步跳频序列设计方法
WO2021119933A1 (zh) * 2019-12-16 2021-06-24 鹤壁天海电子信息系统有限公司 一种跳频同步的实现方法、接收机及通信设备
CN112994742B (zh) * 2019-12-16 2023-03-31 鹤壁天海电子信息系统有限公司 一种跳频同步的实现方法、接收机及通信设备
CN117118482A (zh) * 2023-08-07 2023-11-24 广东技术师范大学 一种基于主从模式的快速多信道跳频盲会合方法及系统
CN118966681B (zh) * 2024-07-31 2025-05-27 昆明理工大学 一种考虑带释放和截止时间约束的单机调度中拖期工件数的优化方法

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101588213A (zh) * 2009-05-21 2009-11-25 北京邮电大学 一种认知无线电网络中的频谱分配方法及装置
CN103297982A (zh) * 2013-06-26 2013-09-11 苏州大学 一种认知无线电节点组网方法
CN103391143A (zh) * 2013-07-29 2013-11-13 哈尔滨工业大学深圳研究生院 基于特征值的多天线盲频谱感知方法及系统
CN104038944A (zh) * 2014-06-25 2014-09-10 哈尔滨工业大学 一种基于随机矩阵的认知无线电频谱感知方法

Family Cites Families (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5838794A (en) * 1996-01-11 1998-11-17 Teledyne Electronic Technologies Method and apparatus for inter-round mixing in iterated block substitution systems
US8184653B2 (en) * 2007-08-15 2012-05-22 Shared Spectrum Company Systems and methods for a cognitive radio having adaptable characteristics
KR101378310B1 (ko) * 2006-09-26 2014-04-04 코닌클리케 필립스 엔.브이. 무선 애드 혹 네트워크에서의 다중 채널 ｍａｃ 프로토콜을위한 효율적 채널 구조
US8379584B2 (en) * 2010-04-15 2013-02-19 General Electric Company Generalized division free duplexing techniques for decreasing rendevous time
US9066320B2 (en) * 2012-02-07 2015-06-23 Harris Corporation Method to bootstrap into a frequency agile ad hoc network of radios that use a non-deterministic frequency pattern
US9979484B2 (en) * 2016-02-01 2018-05-22 Vencore Labs, Inc. Photonics-based channelization enabled by phase-sensitive amplification

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101588213A (zh) * 2009-05-21 2009-11-25 北京邮电大学 一种认知无线电网络中的频谱分配方法及装置
CN103297982A (zh) * 2013-06-26 2013-09-11 苏州大学 一种认知无线电节点组网方法
CN103391143A (zh) * 2013-07-29 2013-11-13 哈尔滨工业大学深圳研究生院 基于特征值的多天线盲频谱感知方法及系统
CN104038944A (zh) * 2014-06-25 2014-09-10 哈尔滨工业大学 一种基于随机矩阵的认知无线电频谱感知方法

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
See also references of EP3226596A4 *

Also Published As

Publication number Publication date
EP3226596B1 (en) 2019-10-02
CN105722092B (zh) 2019-01-04
EP3226596A4 (en) 2018-12-05
US9838070B1 (en) 2017-12-05
US20170331513A1 (en) 2017-11-16
EP3226596A1 (en) 2017-10-04
CN105722092A (zh) 2016-06-29

Similar Documents

Publication Publication Date Title
WO2016082265A1 (zh) 一种基于置换群的多天线认知无线网络信道汇合方法
An et al. A mobility‐based clustering approach to support mobility management and multicast routing in mobile ad‐hoc wireless networks
US8948229B2 (en) Dynamic hopping sequence computation in channel hopping communication networks
So et al. McMAC: A multi-channel MAC proposal for ad-hoc wireless networks
CN104703247B (zh) 一种基于多微时隙的网络邻居发现方法和系统
Wang et al. On directional neighbor discovery in mmwave networks
Chen et al. A constant approximation algorithm for interference aware broadcast in wireless networks
Robertazzi Introduction to computer networking
Das et al. WLC30-4: static channel assignment in multi-radio multi-channel 802.11 wireless mesh networks: issues, metrics and algorithms
Cai et al. On 2-way neighbor discovery in wireless networks with directional antennas
Goyal et al. Multi-party computation in iot for privacy-preservation
CN106792620A (zh) 面向定向天线的移动自组网的邻居发现方法
Yu et al. Channel-hopping based on available channel set for rendezvous of cognitive radios
EP3550868B1 (en) Cyclic quorum set-based directional antenna channel converging method
Duan et al. Opportunistic channel-hopping based effective rendezvous establishment in cognitive radio networks
Rahman et al. Demo abstract: Enabling inter-snow concurrent p2p communications
Nagaraju et al. Multiple token‐based neighbor discovery for directional sensor networks
Proulx et al. Topology control in aerial multi-beam directional networks
Wang Power control, neighbor discovery, and backup scheme for emerging wireless networks
Changizi et al. Degrees of Freedom of Cache-Aided Interference Channels Assisted by Active Intelligent Reflecting Surfaces
US20250301023A1 (en) Ranging method and related apparatus
Bansal et al. Leader election algorithms for multi-channel wireless networks
Rezaeirad et al. A novel clustering paradigm for key pre-distribution: Toward a better security in homogenous wsns
Liu et al. Practical neighbor discovery in multi-carrier ad hoc networks with directional antennas
Nikodem et al. Multi-hop and directed routing based on neighborhood cooperation in WSN

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 14906821

Country of ref document: EP

Kind code of ref document: A1

REEP Request for entry into the european phase

Ref document number: 2014906821

Country of ref document: EP

WWE Wipo information: entry into national phase

Ref document number: 15527955

Country of ref document: US

NENP Non-entry into the national phase

Ref country code: DE