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.

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.

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.

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.

Abstract: A solid-liquid separation device includes a kettle body, a piston, a stirrer, a separation plate having filtration pores, and a filtration mesh. The kettle body is hollow along an axial direction to form a chamber body. The separation plate is fitly installed in the chamber body, and divides the chamber body into a washing chamber and a draining chamber. The piston and the stirrer are fitly disposed in the washing chamber. The filtration mesh is attached on a side of the separation plate to cover the filtration pores. The kettle body is further provided with a feed inlet, a water inlet, a material outlet, and a liquid outlet. The feed inlet and material outlet are communicated with the washing chamber, and the water inlet and the liquid outlet are communicated with the draining chamber. The method includes the following steps: feeding, solid-liquid separation, washing, and material discharge.

Abstract: A solid-liquid separation device includes a kettle body, a piston, a stirrer, a separation plate having filtration pores, and a filtration mesh. The kettle body is hollow along an axial direction to form a chamber body. The separation plate is fitly installed in the chamber body, and divides the chamber body into a washing chamber and a draining chamber. The piston and the stirrer are fitly disposed in the washing chamber. The filtration mesh is attached on a side of the separation plate to cover the filtration pores. The kettle body is further provided with a feed inlet, a water inlet, a material outlet, and a liquid outlet. The feed inlet and material outlet are communicated with the washing chamber, and the water inlet and the liquid outlet are communicated with the draining chamber. The method includes the following steps: feeding, solid-liquid separation, washing, and material discharge.

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.

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.

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, ATTR, 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<1. The frequency-hopping system of the present invention can use a minimal number of transceivers at each cognitive node to ensure that any two cognitive nodes always achieve frequency hopping rendezvous in each timeslot under the limiting conditions of a certain anti-jamming ability against the primary users and a certain degree of the most serious collisions of control information exchange.

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<1. The frequency-hopping system of the present invention can use a minimal number of transceivers at each cognitive node to ensure that any two cognitive nodes always achieve frequency hopping rendezvous in each timeslot under the limiting conditions of a certain anti-jamming ability against the primary users and a certain degree of the most serious collisions of control information exchange.

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?Ui,j 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.

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.