公开(公告)号：US20190021075A1

公开(公告)日：2019-01-17

申请号：US15836947

申请日：2017-12-11

Applicant: University of Electronic Science and Technology of China

Inventor： Xuesong TAN ,  Jieran WANG ,  Yifan WANG

IPC: H04W72/04 ,  H04B1/40

CPC classification number: H04W72/044 ,  H04B1/40 ,  H04B1/713 ,  H04W72/0406

Abstract: This invention relates to the field of communication technology, and particularly to a communication exchange mechanism design based on frequency hopping, which is applicable to cognitive radio networks. A method for generating hopping frequency sequences for multi-transceiver cognitive radio networks is provided, so as to realize the optimization and tradeoff of the five performance parameters, i.e. DoR, MTTR, AITR, CL, and NSS. That, is, for a given DoR, the frequency-hopping system should minimize the NSS of the clock synchronous and asynchronous frequency-hopping systems under the condition of MTTR=ATTR=1 and CL

公开(公告)号：US20170302331A1

公开(公告)日：2017-10-19

申请号：US15487457

申请日：2017-04-14

Applicant: University of Electronic Science and Technology of China

Inventor： Xuesong TAN ,  Chao ZHOU ,  Jie CHEN

IPC: H04B1/713 ,  H04W72/04

CPC classification number: H04B1/713 ,  H04W72/0446

Abstract: A method for generating a distributed channel hopping system in cognitive radio networks. The method includes: 1) providing a symmetric asynchronous CH system comprising n periodic CH sequences such that each period of a CH sequence comprises exactly L frames and each frame comprises n timeslots; 2) labelling the n periodic CH sequences in the constructed CH system; 3) hopping, by the CH sequence i, to the channel (lM+j mod N) in each timeslot tt,j,d ∈ Uij of the frame l; and 4) hopping, by the CH sequence i, to an arbitrary channel h∉ {0, 1, . . . , N−1} in each timeslot t∉ Zn\RoT(U, i) of the frame l.

公开(公告)号：US20200296792A1

公开(公告)日：2020-09-17

申请号：US16809573

申请日：2020-03-05

Applicant: University of Electronic Science and Technology of China

Inventor： Xuesong TAN ,  Wenbo GAO

IPC: H04W84/18 ,  H04L12/26 ,  H04W88/04 ,  H04L12/707 ,  H04L12/66 ,  H04L1/00

Abstract: A two-way wireless relay transmission method based on network coding is provided, wherein two end nodes and n relay nodes (wherein n≥2) which form a two-way wireless relay (TWRN) are divided into three different categories, so that any two nodes in a same category are separated by at least two relay nodes belonging to other different categories, and in a same timeslot, only nodes belonging to one category are allowed to transmit data packets and nodes of the other two categories should keep silent. As a result, the mutual interference caused by the simultaneous transmission of data packets between adjacent nodes is effectively avoided, and the mutual interference caused by the simultaneous transmission of data packets by the nodes belonging to a same category is reduced.

公开(公告)号：US20220173791A1

公开(公告)日：2022-06-02

申请号：US17126058

申请日：2020-12-18

Applicant: University of Electronic Science and Technology of China

Inventor： Xuesong TAN ,  Xingyu ZHANG

IPC: H04B7/155 ,  H04L12/861

Abstract: A two-way wireless relay transmission method suitable for multiple relay nodes proposes a transmission solution based on a Decode-and-Forward (DF) technology and Network Coding (Network Coding, NC) technology suitable for a two-way wireless relay network. The method has an advantage of achieving a maximum spectrum efficiency based on the DF technology, and proposes a retransmission-free error control solution to avoid a problem of error spreading brought about by the NC technology to obtain an effective transmission throughput that is superior to existing solutions.

公开(公告)号：US20220095207A1

公开(公告)日：2022-03-24

申请号：US17095762

申请日：2020-11-12

Applicant: University of Electronic Science and Technology of China

Inventor： Jiabei XIE ,  Xuesong TAN

IPC: H04W48/16 ,  H04W56/00

Abstract: A method for neighbor discovery in a wireless ad hoc network based on an adaptive antenna array includes: generating a synchronous SSS with a period length of n+└log2n┘+1 timeslots, or generating a asynchronous SSS with a period length of 4n timeslots; labeling the n└log2n┘+1 timeslots in each period of the synchronous SSS by 0, 1, . . . , n+└log2n┘; labeling the 4n timeslots in each period of the asynchronous SSS by 0, 1, . . . , 4n−1; if the node is synchronized with its neighbors, representing the number of bit 0 in a binary sequence b0b1 . . . bn−1 by a (└log2n┘+1)-bit binary sequence c0c1 . . . c└log2n┘, and then appending the (└log2n┘+1)-bit binary sequence c0c1 . . . c└log2n┘ behind the binary sequence b0b1 . . . bn−1 to generate an (n+└log2n┘+1)-bit binary sequence b0b1 . . . bn−1c0c1 . . . c└log2n┘; otherwise, extending the binary sequence b0b1 . . . bn−1 into a 4n-bit binary sequence; and based on the (n+└log2n∉+1)-bit or 4n-bit binary sequence, generating the synchronous or asynchronous SSS.