CN106877976B - High system throughput design method for sawtooth decoding in distributed multiple access network - Google Patents

High system throughput design method for sawtooth decoding in distributed multiple access network Download PDF

Info

Publication number
CN106877976B
CN106877976B CN201611269797.0A CN201611269797A CN106877976B CN 106877976 B CN106877976 B CN 106877976B CN 201611269797 A CN201611269797 A CN 201611269797A CN 106877976 B CN106877976 B CN 106877976B
Authority
CN
China
Prior art keywords
antenna
user
symbol
time slot
data packet
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.)
Active
Application number
CN201611269797.0A
Other languages
Chinese (zh)
Other versions
CN106877976A (en
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.)
He Qiyu
Original Assignee
Shenzhen University
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 Shenzhen University filed Critical Shenzhen University
Priority to CN201611269797.0A priority Critical patent/CN106877976B/en
Publication of CN106877976A publication Critical patent/CN106877976A/en
Application granted granted Critical
Publication of CN106877976B publication Critical patent/CN106877976B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H04L1/12—Arrangements for detecting or preventing errors in the information received by using return channel
    • H04L1/16—Arrangements for detecting or preventing errors in the information received by using return channel in which the return channel carries supervisory signals, e.g. repetition request signals
    • H04L1/1607—Details of the supervisory signal
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H04L1/004—Arrangements for detecting or preventing errors in the information received by using forward error control
    • H04L1/0045—Arrangements at the receiver end
    • H04L1/0047—Decoding adapted to other signal detection operation

Landscapes

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

Abstract

The invention provides a distribution of sawtooth decodingA high system throughput design method in a multiple access network,
Figure DEST_PATH_IMAGE002
single-antenna users with mutually dispersed positions
Figure DEST_PATH_IMAGE004
Representing, respectively transmitting data to a receiving end, the receiving end being provided with
Figure DEST_PATH_IMAGE006
A receiving antenna distributed dispersedly and not at the same position
Figure DEST_PATH_IMAGE008
The method shows that the time consumption of transmission of each path is different by scattered single-antenna users and receiving antennas, and the single-antenna users
Figure DEST_PATH_IMAGE010
Want to send includes
Figure DEST_PATH_IMAGE012
Data packet of modulation symbols, using
Figure DEST_PATH_IMAGE014
Is shown in which
Figure DEST_PATH_IMAGE016
Indicates the second in this data packet
Figure DEST_PATH_IMAGE018
One modulation symbol, initially considering binary phase shift keying modulation, i.e.
Figure DEST_PATH_IMAGE020
Information bits in DS system
Figure DEST_PATH_IMAGE022
With the difference that
Figure 301525DEST_PATH_IMAGE016
Can be regarded as
Figure DEST_PATH_IMAGE024
Assuming a time slot, i.e. the duration of one symbol. The invention has the advantage of improving the throughput of the system.

Description

High system throughput design method for sawtooth decoding in distributed multiple access network
Technical Field
The invention relates to wireless communication, in particular to a design method for high system throughput of sawtooth decoding in a distributed multiple access network.
Background
The ALOHA protocol is mainly divided into pure ALOHA and slotted ALOHA.
The pure ALOHA protocol works according to the principle: as long as the station generates the frame, the station immediately sends the frame to the channel; if the response is received within the specified time, the transmission is successful, otherwise, the retransmission is carried out.
And (3) retransmission strategy: waiting for a random period of time and then retransmitting; if the collision happens again, waiting for a random time until the retransmission is successful.
Slotted ALOHA protocol basic idea: the data transmission of the users is unified by a clock. The method is to divide the time into discrete time slices, and the user must wait for the next time slice to start to send the data each time, thereby avoiding the randomness of sending the data by the user, reducing the possibility of data collision and improving the utilization rate of the channel.
The slotted ALOHA protocol is a protocol that divides the channel time into discrete time slots, the slot length being the transmission time required for one frame. Each station can only allow transmission at the beginning of a time slot. The other procedures are the same as the pure ALOHA protocol.
The basic principle of Successive Interference Cancellation (SIC) is to gradually subtract the interference of the user with the maximum signal power, the SIC detector judges the data of a plurality of users one by one in the received signal, and determines that one user simultaneously subtracts the Multiple Access Interference (MAI) caused by the user signal, the operation is carried out according to the sequence of the signal power, and the signal with larger power is operated first. This is done cyclically until all the multiple access interference is cancelled.
CSMA/cd (carrier Sense Multiple Access with Collision detection), i.e. carrier Sense Multiple Access with Collision detection (carrier Sense Multiple Access/Collision detection). It has a higher medium utilization than the ALOHA protocol. The working principle is as follows: before sending data, whether the channel is idle is monitored, and if the channel is idle, the data is sent immediately. If the channel is busy, waiting for a period of time until the information transmission in the channel is finished, and then sending data; if two or more nodes simultaneously send sending requests after the last section of information is sent, the collision is determined. And if the conflict is sensed, immediately stopping sending the data, waiting for a random time, and then retrying.
The idea of the pure ALOHA protocol is simple, as long as the users have data to send, although they are allowed to send. But this can create collisions that cause frame corruption. Because the broadcast channel has feedback, the sender can perform collision detection in the process of sending data, and can know whether the data frame is damaged or not by comparing the received data with the data in the buffer. For a Local Area Network (LAN), feedback information can be obtained quickly; for the satellite network, the sender can confirm whether the data transmission is successful after 270 ms. The pure ALOHA protocol has been proved to have a maximum channel utilization of not more than 18.4% by study. Compared with the pure ALOHA protocol, the slotted ALOHA protocol reduces the probability of generating collisions, and the channel utilization rate is 36.8% at most, which is twice that of the pure ALOHA protocol. But the channel utilization rate of the two is not high enough to meet the requirements of the wireless communication at present. Also, for slotted ALOHA, the average transmission time of user data is higher than for pure ALOHA systems.
The Successive Interference Cancellation (SIC) technique determines the best receiving effect according to the user sequence of signal power rank, but in the actual process, the power of the user is constantly changed, which requires the SIC receiver to constantly rank the user power. In addition, in the SIC processing, each stage generates a certain time delay, and in the actual multi-stage processing, the generated time delay is very large.
One drawback to using CSMA/CD media access control is that when each computer interconnected in a LAN has only a small amount of data to transmit, each station in the network has almost fair sharing of the media; but this may be the case if a station needs to send a large amount of data (as in the case of a station acting as a high quality video source) for a long time to control the entire LAN.
Summarizing the existing ALOHA and CSMA schemes, the commonality is that the system throughput is less than 1.
Disclosure of Invention
In order to solve the problems in the prior art, the invention provides a design method for high system throughput of sawtooth decoding in a distributed multiple access network.
The invention provides a design method for high system throughput of sawtooth decoding in a distributed multiple access network, wherein K single-antenna users with mutually dispersed positions are represented by {1,2, …, K }, and respectively transmit data to a receiving end, the receiving end is provided with M receiving antennas which are dispersedly distributed and not at the same position and represented by {1,2, …, M }, the time consumption of each path transmission is different due to the dispersed single-antenna users and the receiving antennas, and the single-antenna user K wants to transmit a data packet containing L modulation symbols and uses the data packet
Figure BDA0001199382020000021
Is represented by the formula (I) in which xk,lIndicating the i-th modulation symbol in the data packet, initially considering binary phase shift keying modulation, i.e. xk,lE { +1, -1}, and information bit s in DS systemk,lE {0,1} differs by xk,lCan be regarded as sk,lAssuming that a time slot is a duration of one symbol;
it is assumed that the system is symbol level synchronized, i.e. the received signal at a certain time slot is a superposition of all users' complete symbol levels, let hk,mDenotes the channel gain from user k to receive antenna m, let wm[t]Means additive noise of receiving antenna m at t time slotthe signal received in the t time slot is:
Figure BDA0001199382020000031
wherein
Figure BDA0001199382020000032
Represents the set of all user indices with corresponding outputs at t slots, and lsRepresents XsThe second symbol in (b) is received by antenna m at time slot t, and P is the power of the transmitted symbol;
let integer τij∈[0,τmax]Represents the transmission delay of the data packet sent by user j to antenna i, assuming that the time slot is the basic unit and τ is assumedijIs an integer, let M × K matrix T represent the transmission delay of the K user data packets, and the (i, j) th element is τijThe matrix is called as a time delay matrix, and it is assumed that the receiving end can accurately obtain hk,mS and T, and assume that the sender does not know hk,mAnd T.
As a further development of the invention, hk,mThe's and the T are obtained by a direct sequence spread spectrum mode, each user is distributed with a unique pseudo-random sequence and placed in a packet header of a data packet, and a receiving end receives the superposition of the packet headers of a plurality of users and then carries out related detection to obtain the transmission delay and the channel gain of each user.
The invention has the beneficial effects that: the throughput of the system is improved.
Drawings
Fig. 1 is a schematic diagram of a high system throughput design method for zigzag decoding in a distributed multiple access network according to the present invention.
Fig. 2 is a schematic diagram of a distributed multiple access received signal of a high system throughput design method for zigzag decoding in a distributed multiple access network according to the present invention.
Detailed Description
The invention is further described with reference to the following description and embodiments in conjunction with the accompanying drawings.
As shown in fig. 1 to 2, oneA design method for high system throughput of sawtooth decoding in a distributed multiple access network is disclosed, wherein K single-antenna users with mutually dispersed positions are respectively transmitted to a receiving end by {1,2, …, K }. The receiving end is equipped with M distributed (non-collocated) receiving antennas, denoted by {1,2, …, M }. The distributed users and antennas make transmission on each path take different time. User k wants to transmit a data packet containing L modulation symbols
Figure BDA0001199382020000033
Is represented by the formula (I) in which xk,lIndicating the i-th modulation symbol in this packet. Initial consideration was Binary Phase Shift Keying (BPSK) modulation, i.e., xk,lE { +1, -1} (with information bit s in the DS system)k,lE {0,1} differs by xk,lCan be regarded as sk,lModulation of (d). A time slot, i.e. the duration of one symbol, is assumed.
It is assumed that the system is symbol level synchronized, i.e. the received signal at a certain time slot is a superposition of all users' complete symbol levels. Let hk,mDenotes the channel gain from user k to receive antenna m, let wm[t]Representing the additive noise of the receiving antenna m at t time slots. The signal received by the receiving antenna m in the t time slot is:
Figure BDA0001199382020000041
wherein
Figure BDA0001199382020000042
Represents the set of all user indices with corresponding outputs at t slots, and lsRepresents XsIs received by antenna m at t time slot, P is the power of the transmitted symbol.
Let integer τij∈[0,τmax]Denotes the transmission delay (assuming the basic unit of time slot) of the data packet sent by user j arriving at antenna i, and assumes τijAre integers. Let M x K matrix T represent the transmission delay of the K user data packets, with the (i, j) th element of τijAnd the matrix is called the delay momentAnd (5) arraying. Suppose that the receiving end can accurately obtain hk,m's and T' (obtained by direct sequence spread spectrum, each user is assigned a unique pseudo-random sequence and placed in the packet header of a data packet, the receiving end receives the packet headers of a plurality of users and performs correlation detection after superposition to obtain the transmission delay and channel gain of each user), and the transmitting end is assumed to be unaware of hk,mAnd T.
Data packet Y intended to be received on M antennas1To YMAnd performing similar sawtooth decoding operation to finally obtain the original data. Specific decoding process referring to the example shown in fig. 2, three user transmission data packets are superimposed on three receiving antennas of the BS with a misalignment as shown. The received signals of the antennas 1 to 3 are represented in order from top to bottom. For example, the received signal of the 4 th time slot of the antenna 1 is x1,4、x2,3、x3,1The noise is added after linear superposition (weighting coefficients are the respective channel gains). The decoding order is as follows: first, x1,1Can be derived from the first antenna estimate/decision (de-noising process) because it is not superimposed with any other signal. Then subtracted from the fourth received symbol carried by the arrow into the second antenna and estimated/decided to obtain x3,4. And so on, the decoding process advances to the right all the time, and finally the decoded data packet is obtained. Note that the zigzag decoding at this time is the zigzag decoding of the physical layer signal, not the zigzag decoding of the information layer data in the aforementioned DS system. Both decodes are substantially the same (zigzag substitution decoding) with the difference that the content of the operation belongs to the information layer data or the physical layer signal.
The invention provides a design method for high system throughput of sawtooth decoding in a distributed multiple access network, and the potential application field of the design method is a distributed multiple access channel model in wireless communication, such as Wifi.
The invention provides an application mode of a design method for high system throughput of sawtooth decoding in a distributed multiple access network, which comprises the following steps: when multiple users simultaneously transmit information to a common receiver, collision between users may occur. The existing solution is that an ap (access point) receiver directly discards collision packets, and specific solutions (including Aloha and CSMA) are to retransmit after a sender randomly waits for a time. The disadvantage of these schemes is that successful transmission of data requires orthogonal transmission of multiple users, i.e. only one user transmits data at a time, resulting in a system throughput of less than 1.
The design method for high system throughput of sawtooth decoding in the distributed multiple access network provided by the invention utilizes the collision data packet for decoding, can improve the system throughput to be far more than 1, and overcomes the defect of low throughput of Aloha or CSMA/CA in the prior art.
The foregoing is a more detailed description of the invention in connection with specific preferred embodiments and it is not intended that the invention be limited to these specific details. For those skilled in the art to which the invention pertains, several simple deductions or substitutions can be made without departing from the spirit of the invention, and all shall be considered as belonging to the protection scope of the invention.

Claims (2)

1. A design method for high system throughput of sawtooth decoding in a distributed multiple access network is characterized in that: k single-antenna users with mutually dispersed positions are respectively transmitted to a receiving end by {1,2, …, K }, the receiving end is provided with M receiving antennas which are dispersedly distributed and are not at the same position by {1,2, …, M }, the dispersed single-antenna users and the receiving antennas cause different time consumption of transmission of each path, and the single-antenna user K wants to transmit a data packet containing L modulation symbols and uses the data packet
Figure FDA0002319211120000011
Is represented by the formula (I) in which xk,lIndicating the i-th modulation symbol in the data packet, using binary phase shift keying modulation, i.e. xk,lE { +1, -1}, assuming that a time slot is the duration of one symbol;
it is assumed that the system is symbol level synchronized, i.e. the received signal at a certain time slot is a superposition of all users' complete symbol levels, let hk,mDenotes the channel gain from user k to receive antenna m, let wm[t]Indicating time slot t of receiving antenna mAdditive noise, the signal received by the receiving antenna m in the t time slot is:
Figure FDA0002319211120000012
wherein
Figure FDA0002319211120000013
Represents the set of all user indices with corresponding outputs at t slots, and lsRepresents XsThe second symbol in (b) is received by antenna m at time slot t, and P is the power of the transmitted symbol;
let integer τij∈[0,τmax]Represents the transmission delay of the data packet sent by user j to antenna i, assuming that the time slot is the basic unit and τ is assumedijIs an integer, let M × K matrix T represent the transmission delay of the K user data packets, and the (i, j) th element is τijThe matrix is called as a time delay matrix, and it is assumed that the receiving end can accurately obtain hk,mS and T, and assume that the sender does not know hk,mAnd T.
2. The method of saw-tooth decoding high system throughput design in a distributed multiple access network as claimed in claim 1, wherein: h isk,mThe's and the T are obtained by a direct sequence spread spectrum mode, each user is distributed with a unique pseudo-random sequence and placed in a packet header of a data packet, and a receiving end receives the superposition of the packet headers of a plurality of users and then carries out related detection to obtain the transmission delay and the channel gain of each user.
CN201611269797.0A 2016-12-30 2016-12-30 High system throughput design method for sawtooth decoding in distributed multiple access network Active CN106877976B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201611269797.0A CN106877976B (en) 2016-12-30 2016-12-30 High system throughput design method for sawtooth decoding in distributed multiple access network

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201611269797.0A CN106877976B (en) 2016-12-30 2016-12-30 High system throughput design method for sawtooth decoding in distributed multiple access network

Publications (2)

Publication Number Publication Date
CN106877976A CN106877976A (en) 2017-06-20
CN106877976B true CN106877976B (en) 2020-04-10

Family

ID=59165251

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201611269797.0A Active CN106877976B (en) 2016-12-30 2016-12-30 High system throughput design method for sawtooth decoding in distributed multiple access network

Country Status (1)

Country Link
CN (1) CN106877976B (en)

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN105356968A (en) * 2015-06-24 2016-02-24 深圳大学 Network coding method and system based on circulant permutation matrix
CN105356892A (en) * 2015-06-24 2016-02-24 深圳大学 Network coding method and system
EP3001625A1 (en) * 2014-09-29 2016-03-30 Instutut Mines-Télécom Methods and systems for decoding a data signal based on the generation of a decoding tree
EP3104564A1 (en) * 2015-06-12 2016-12-14 Instutut Mines-Télécom Anticipated termination for sequential decoders

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP3001625A1 (en) * 2014-09-29 2016-03-30 Instutut Mines-Télécom Methods and systems for decoding a data signal based on the generation of a decoding tree
EP3104564A1 (en) * 2015-06-12 2016-12-14 Instutut Mines-Télécom Anticipated termination for sequential decoders
CN105356968A (en) * 2015-06-24 2016-02-24 深圳大学 Network coding method and system based on circulant permutation matrix
CN105356892A (en) * 2015-06-24 2016-02-24 深圳大学 Network coding method and system

Also Published As

Publication number Publication date
CN106877976A (en) 2017-06-20

Similar Documents

Publication Publication Date Title
KR100712344B1 (en) Interference cancellation in wireless relaying network
Zheng et al. Multipacket reception in wireless local area networks
CN104885395B (en) System and method for Conflict solving
WO2009098541A2 (en) Cross-layer multi-packet reception based medium access control and resource allocation
JP2010516201A (en) Pilot structure with multiplexed unicast and SFN transmission content
CN102893533A (en) Protection mechanisms for multi-user mimo transmissions
Al-Kadri et al. An energy-efficient full-duplex MAC protocol for distributed wireless networks
Zheng et al. AFDA: Asynchronous flipped diversity ALOHA for emerging wireless networks with long and heterogeneous delay
EP3498025A1 (en) Devices, base stations, and methods for communicating scheduling requests via an underlay control channel in a wireless communication system
US8340062B2 (en) Uncontrolled spatial multiple access in wireless networks
JP5394253B2 (en) Piggyback network
TW201108662A (en) AP to legacy station SDMA protocol
Wang et al. Full duplex random access for multi-user OFDMA communication systems
Zhang et al. A joint user activity detection and channel estimation scheme for packet-asynchronous grant-free access
Toor et al. Distributed transmission control in multichannel S-ALOHA for ad-hoc Networks
CN106877976B (en) High system throughput design method for sawtooth decoding in distributed multiple access network
Ettefagh et al. Performance analysis of distributed cluster-based MAC protocol for multiuser MIMO wireless networks
Songzou et al. An Enhanced Full-Duplex MAC Protocol for an Underwater Acoustic Network
Kim et al. A cooperative arq-based mac protocol for underwater wireless sensor networks
Kim et al. A novel random access framework for uplink cellular IoT: Non-orthogonal preambles and multi-antennas
CN107070606B (en) High-throughput retransmission method based on sawtooth decoding
CN108696913B (en) ARQ wireless network information safety transmission method
US20040141496A1 (en) Optimization of transmissions on a shared communications channel
KR101081253B1 (en) Apparatus and Method for communicating cooperatively using network coding in Uplink System comprised of multiple relay device
Yao et al. Revisiting of Channel Access Mechanisms in Mobile Wireless Networks through Exploiting Physical Layer Technologies

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant
TR01 Transfer of patent right
TR01 Transfer of patent right

Effective date of registration: 20200806

Address after: No.246, Jingjing street, Junchuan Town, suixian County, Suizhou City, Hubei Province

Patentee after: He Qiyu

Address before: 518000 Nanhai Road, Guangdong, Shenzhen, No. 3688, No.

Patentee before: SHENZHEN University

CP02 Change in the address of a patent holder
CP02 Change in the address of a patent holder

Address after: 241000 No.32 Chunjiang Road, Qingshui street, Jiujiang District, Wuhu City, Anhui Province

Patentee after: He Qiyu

Address before: No.246, Jingjing street, Junchuan Town, suixian County, Suizhou City, Hubei Province

Patentee before: He Qiyu