Aggregation frame design method and apparatus

Patent metadata

Field	Value
Publication number	US-9893862-B2
Application number	US-201615351781-A
Country	US
Kind code	B2
Filing date	Nov 15, 2016
Priority date	May 16, 2014
Publication date	Feb 13, 2018
Grant date	Feb 13, 2018

Abstract

Embodiments of the present application provide an aggregation frame design method and apparatus, the method includes: selecting, by a transmit end from N different hash function groups, one group that has a same sequence number as that of each receive end, mapping a MAC address of each receive end into a number X, and denoting the number X; obtaining M first sequences of each receive end, and performing a bitwise OR operation on the M first sequences to obtain an identification sequence of each receive end; obtaining N identification sequences of N receive ends, performing a bitwise OR operation on the N identification sequences to obtain a Bloom sequence, and encoding and modulating the Bloom sequence to map the Bloom sequence onto an OFDM symbol; and forming an aggregation frame by using a pilot signal, the OFDM symbol, the N identification sequences, and data of the N receive ends.

First claim

What is claimed is:

1. A transmit end, comprising:
a transmitter;
a memory storing a group of program code;
a processor connected to the memory and configured to execute the program code stored in the memory to:
select, for each receive end from preset N different hash function groups, one group that has a same sequence number as that of the receive end, wherein each of the N different hash function groups comprises M different hash functions;
map a MAC address of the receive end into a number X by successively using each hash function comprised in the hash function group selected by the selection unit, and denote the number X by using a first sequence, to obtain M first sequences corresponding to the receive end, wherein X is an integer greater than or equal to 1, and the first sequence is a sequence whose X th bit is 1 and remaining bits are 0s;
perform a bitwise OR operation on the M first sequences obtained by the mapping unit, to obtain an identification sequence corresponding to the receive end,
and obtain, according to M first sequences that are corresponding to each of N receive ends and obtained by the mapping unit, N identification sequences corresponding to the N receive ends, and perform a bitwise OR operation on the N identification sequences to obtain a Bloom sequence;
encode and modulate the Bloom sequence to map the Bloom sequence onto an orthogonal frequency division multiplexing OFDM symbol by using a subcarrier;
form an aggregation frame by using a pilot signal, the OFDM symbol, the N identification sequences, and data corresponding to the N receive ends; and
send, via the transmitter, the aggregation frame obtained by the aggregation unit to the N receive ends;
N and M are integers greater or equal to 2.

2. The transmit end according to claim 1 , wherein a value range of X is greater than or equal to 1 and less than or equal to 92, and the first sequence is a sequence whose X th bit is 1 and remaining 91 bits are 0s.

3. The transmit end according to claim 1 , wherein the processor is further configured to: aggregate data segments corresponding to all the receive ends, and add, to the front of a data segment corresponding to each receive end, an identification sequence of the receive end corresponding to the data segment to form a load data segment; and place the OFDM symbol before the load data segment and after the pilot signal to form the aggregation frame.

4. The transmit end according to claim 1 , wherein
the processor is further configured to: before the processor selects, for each receive end from the preset N different hash function groups, one group that has the same sequence number as that of the receive end, sort the N receive ends to obtain a sequence number corresponding to each receive end; and design, for the N receive ends, the N different hash function groups, wherein each of the hash function groups comprises M different hash functions, and the sequence number of each receive end is the same as a sequence number of a hash function group corresponding to the receive end.

5. A receive end, comprising:
a receiver;
a memory storing a group of program code;
a processor connected to the memory and configured to execute the program code stored in the memory to:
select, from N different hash function groups, one group that has a same sequence number as that of the receive end, wherein the N different hash function groups are preset by a transmit end for N receive ends, and each of the N different hash function groups comprises M different hash functions;
map a MAC address of the receive end into a number X by successively using each hash function comprised in the hash function group selected by the selection unit, and denote the number X by using a first sequence, to obtain M first sequences corresponding to the receive end, wherein X is an integer greater than or equal to 1, and the first sequence is a sequence whose X th bit is 1 and remaining bits are 0s; and
perform a bitwise OR operation on the M first sequences obtained by the mapping unit, to obtain an identification sequence corresponding to the receive end;
N and M are integers greater or equal to 2.

6. The receive end according to claim 5 , wherein a value range of X is greater than or equal to 1 and less than or equal to 92, and the first sequence is a sequence whose X th bit is 1 and remaining 91 bits are 0s.

7. The receive end according to claim 5 , further comprising a receiver, wherein
the receiver is configured to receive an aggregation frame sent by the transmit end; and the processor is further configured to:
obtain an orthogonal frequency division multiplexing OFDM symbol that is in the aggregation frame and follows a pilot signal, and decode and demodulate the OFDM symbol to obtain a Bloom sequence, wherein the aggregation frame carries the pilot signal, the OFDM symbol, and N data segments and N identification sequences that are corresponding to the N receive ends; and
compare the Bloom sequence with the identification sequence corresponding to the receive end; and when bits that are in the Bloom sequence and corresponding to bits corresponding to all 1s in the identification sequence corresponding to the receive end are all 1s, determine that the aggregation frame carries data of the receive end, or when not all bits that are in the Bloom sequence and corresponding to bits corresponding to all 1s in the identification sequence corresponding to the receive end are 1s, determine that the aggregation frame does not carry data required by the receive end.

8. An aggregation frame design method, applied to a transmit end in a network data transmission system and comprising:
selecting, by the transmit end for each receive end from preset N different hash function groups, one group that has a same sequence number as that of the receive end, mapping a MAC address of the receive end into a number X by successively using each hash function comprised in the selected hash function group, and denoting the number X by using a first sequence, wherein each of the N different hash function groups comprises M different hash functions, X is an integer greater than or equal to 1, and the first sequence is a sequence whose X th bit is 1 and remaining bits are 0s;
obtaining, by the transmit end, M first sequences corresponding to the receive end, and performing a bitwise OR operation on the M first sequences to obtain an identification sequence corresponding to the receive end;
obtaining, by the transmit end, N identification sequences corresponding to N receive ends, performing a bitwise OR operation on the N identification sequences to obtain a Bloom sequence, and encoding and modulating the Bloom sequence to map the Bloom sequence onto an orthogonal frequency division multiplexing OFDM symbol by using a subcarrier; and
forming, by the transmit end, an aggregation frame by using a pilot signal, the OFDM symbol, the N identification sequences, and data corresponding to the N receive ends, and sending the aggregation frame to the N receive ends;
N and M are integers greater or equal to 2.

9. The method according to claim 8 , wherein a value range of X is greater than or equal to 1 and less than or equal to 92, and the first sequence is a sequence whose X th bit is 1 and remaining 91 bits are 0s.

10. The method according to claim 8 , wherein the forming, by the transmit end, an aggregation frame by using a pilot signal, the Bloom sequence, the N identification sequences, and data corresponding to the N receive ends is specifically:
aggregating, by the transmit end, data segments corresponding to all the receive ends, and adding, to the front of a data segment corresponding to each receive end, an identificatio

Assignees

• Huawei Tech Co Ltd

Inventors

• Yan Min
• Zhang Junping
• Wang Wei
• Zhang Qian

Classifications

• H04L5/0048

  Allocation of pilot signals, i.e. of signals known to the receiver (allocation of control signalling H04L5/0053; use of control signalling H04L5/0091) · CPC title

• H04L69/22

  Parsing or analysis of headers · CPC title

• H04L27/2647

  Arrangements specific to the receiver only (equalisation H04L27/01) · CPC title

• H04L29/02

  Electricity · mapped topic

• H04L5/0053 Primary

  Allocation of signalling, i.e. of overhead other than pilot signals · CPC title