CN108834194B - Packet aggregation-based selection cooperation method under multi-source multi-target network - Google Patents
Packet aggregation-based selection cooperation method under multi-source multi-target network Download PDFInfo
- Publication number
- CN108834194B CN108834194B CN201810482235.7A CN201810482235A CN108834194B CN 108834194 B CN108834194 B CN 108834194B CN 201810482235 A CN201810482235 A CN 201810482235A CN 108834194 B CN108834194 B CN 108834194B
- Authority
- CN
- China
- Prior art keywords
- source
- node
- target
- nodes
- relay
- 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
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
- H04W40/22—Communication route or path selection, e.g. power-based or shortest path routing using selective relaying for reaching a BTS [Base Transceiver Station] or an access point
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04B—TRANSMISSION
- H04B7/00—Radio transmission systems, i.e. using radiation field
- H04B7/02—Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas
- H04B7/022—Site diversity; Macro-diversity
- H04B7/026—Co-operative diversity, e.g. using fixed or mobile stations as relays
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
- H04W40/04—Communication route or path selection, e.g. power-based or shortest path routing based on wireless node resources
- H04W40/10—Communication route or path selection, e.g. power-based or shortest path routing based on wireless node resources based on available power or energy
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
- H04W40/12—Communication route or path selection, e.g. power-based or shortest path routing based on transmission quality or channel quality
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W52/00—Power management, e.g. TPC [Transmission Power Control], power saving or power classes
- H04W52/02—Power saving arrangements
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W72/00—Local resource management
- H04W72/50—Allocation or scheduling criteria for wireless resources
- H04W72/535—Allocation or scheduling criteria for wireless resources based on resource usage policies
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W84/00—Network topologies
- H04W84/18—Self-organising networks, e.g. ad-hoc networks or sensor networks
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D30/00—Reducing energy consumption in communication networks
- Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks
Abstract
The invention relates to a packet aggregation-based selective cooperation method under a multi-source multi-target network, which belongs to the field of cooperative communication, and aims at a large number of real multi-source (M source nodes) multi-target (N target nodes, M > N) networks in a wireless sensor network, and converts the M > N multi-source multi-target networks into N multi-source single-target networks by constructing an incidence matrix among the source nodes; according to the characteristic that a data packet transmitted by a network node is small, a packet aggregation strategy is adopted for N multi-source single-target network data transmission, and a selection cooperation method based on packet aggregation is provided. The invention effectively improves the reliability of the system, reduces the energy consumption of the system, improves the frequency spectrum utilization rate and has better practical application value through the mutual cooperation and the data packet aggregation among the source nodes with the same target node.
Description
Technical Field
The invention belongs to the field of cooperative communication, and relates to a selective cooperation method based on packet aggregation in a multi-source multi-target network.
Background
The cooperative communication is selected as an important branch in a single-relay cooperative technology, and is always a research hotspot in the field of cooperative communication. The basic idea is to select an optimal relay to execute a cooperative forwarding task, and all relays do not need to participate in a cooperative transmission process, so that the method has the characteristics of high reliability and low complexity, and is very suitable for being applied to a wireless sensor network. Currently, there are some related researches for selecting collaboration technologies, mainly focusing on the derivation and analysis of selecting collaboration performance and the application in different network scenarios, such as: single-source single-target networks, multi-source multi-target (source and target node one-to-one correspondence) networks, and the like. The method has the advantages that the performance of a single relay selection scheme under Rayleigh fading is researched and analyzed, and various relay selection schemes are provided for a centralized network and a distributed network.
However, the above researches are directed to specific network scenarios, and it is a rare research on a wireless sensor network with M source nodes and N target nodes (M > N) that are widely available in practice, and protocol design and optimization are not performed on the characteristic that a data packet in the wireless sensor network is small.
Disclosure of Invention
In view of this, the present invention provides a selection cooperation method based on packet aggregation in a multi-source multi-target network, which improves system reliability, reduces energy consumption of the network, and improves spectrum utilization.
In order to achieve the purpose, the invention provides the following technical scheme:
the selective cooperation method based on packet aggregation under the multi-source multi-target network comprises the following steps:
there are M source nodes s in the networki(i ═ 1.. said., M) and N target nodes dk(k 1.. multidot.n), M > N, the network does not need to set a special relay node, and source nodes with the same target node cooperate with each other. In the cooperation process, aiming at the characteristic that the data packet is small, a packet aggregation strategy is implemented. The data transmission process is divided into two phases. The first stage is as follows: and (4) directly transmitting. Before each round of data transmission, TDMA scheduling is carried out, the transmission sequence of the source nodes is obtained, and according to the scheduling result, each source node sequentially transmits data to each target node in the self time slot, such as: node siTarget node d for sending data to itselfkAt the same time, the source node with the same target node receives the data and tries decoding, and the source node with successful decoding adds in the decoding set D(s)i) If the data transmission is successful, the target node returns an Acknowledgement (ACK) frame, decodes set D(s)i) The source node in (1) deletes the data packet in the respective cacheWhen the data transmission of the source node is finished, the next source node is started to transmit data; if the data reception fails, the target node feeds back a Negative Acknowledgement (NACK) frame, D(s)i) Nodes that can successfully receive NACK frames further join active set a(s)i) If A(s)i) Null, meaning that no other source node can decode s correctlyiGenerating interrupt for the transmitted data; if A(s)i) If not, then according to a certain strategy, the signal is in A(s)i) To select the best relay biAnd entering the second stage. And a second stage: and (4) polymerization and transmission. In the best relay biTransmission time slot of, biAssociating self data with slave siThe received data are aggregated, and the aggregated data are sent to a target node dkAnd finishing the data transmission.
Further, when source nodes with the same target node cooperate with each other, a correlation matrix between the source nodes and the target nodes is constructed, and the specific scheme is as follows: constructing an M × N incidence matrix R, each element R in RikRepresenting the corresponding relation between the source node i and the target node k, if k is the target node of the source node i, rikIs 1, otherwise, rikIs 0, R and RikRespectively expressed as:
each target node corresponds to one column in the incidence matrix, nodes with element values of 1 in each column cooperate with each other, and nodes with element values of 0 do not need to be decoded and do not participate in cooperation. The method comprises the steps of converting an MxN multi-source multi-target network into N multi-source single-target networks by constructing a correlation matrix among source and target nodes, and implementing selective cooperative communication on the multi-source single-target networks.
Further, in the first stage, before each round of data transmission, TDMA scheduling is performed to obtain a transmission sequence of the source node. The specific scheme is as follows: three TDMA scheduling schemes are adopted, which are respectively as follows: fixed scheduling, random scheduling, adaptive scheduling. The fixed scheduling means that the transmission sequence of the source node is always unchanged in the whole data transmission process and is performed according to the source node sequence numbers 1,2, … and N. The random scheduling refers to that the transmission sequence of the source nodes in each round is generated randomly, and the sequence of each source node in each round of data transmission is not necessarily the same. The self-adaptive scheduling means that after each round of data transmission is finished, a target node sorts source nodes according to the quality of a channel in the previous round, the source node with the worst channel quality is arranged at the front, the source node with the worst channel quality is arranged at the last, the target node broadcasts a transmission sequence before the next round of data transmission, and the source node arranged at the front preferentially transmits.
Further, the selection of the best relay in the first phase may be in active set a(s)i) And carrying out secondary screening according to the optimization target, and selecting the optimal relay meeting the requirement. The best relay selection strategy is: into the active set A(s)i) Each relay in the relay group has better channel quality with the source node and the target node, and can bear the sending of own data and cooperative data, so that the relay group can be selected as the optimal relay. Therefore, if a plurality of optimal relays are selectable in the active set, the relays can be selected according to indexes such as optimal channel quality, maximum residual energy of nodes, minimum relay electing times and the like, so as to realize multi-objective optimization of the network.
The optimal channel quality relay selection strategy is as follows: in the first stage of relay selection, the best relay is selected from the instantaneous channel quality perspective between the source and destination nodes, i.e. from the active set a(s)i) The source node with the maximum instantaneous channel value with the target node is selected as the optimal relay node. The method can ensure the reliable transmission of data to the maximum extent.
The maximum remaining energy relay selection strategy is: in the first stage relay selection, the best relay is selected from the source node remaining energy perspective, i.e., from the active set a(s)i) And selecting the source node with the maximum residual energy as the optimal relay node for data forwarding. The method can balance the energy consumption of the source nodes, and avoid the situation that some nodes are frequently elected and the energy is rapidly exhausted.
The relay selection strategy for the minimum relay elected times is as follows: in the first stage relay selection, selection is made from the perspective of the number of times the source node is elected as a relay node, i.e., the active set a(s)i) The node with the least elected number is preferentially selected as the best relay. The method can ensure the relative fairness of the selected relay, so that the resources of the network can be used fairly.
Further, in the second-stage aggregate transmission, according to the characteristic that a data packet sent by a source node in a network is small, each source node aggregates one data packet according to a certain strategy while sending own data, and sends the data packet to the same target node. When a plurality of data packets wait to be aggregated, the selection strategy of the aggregated packets is as follows: random polymerization, first-come first polymerization, and first polymerization with a large number of polymerization times. The specific scheme is as follows: the random aggregation refers to randomly selecting a data packet from packets to be aggregated for aggregation; first come first aggregate means to aggregate the earliest received data packet preferentially; the first aggregation with the largest aggregation number refers to selecting and aggregating the data packets which have the largest aggregation number but are not successfully transmitted.
The invention has the beneficial effects that:
(1) the method considers a large number of real multi-source multi-target wireless sensor networks in reality, converts the multi-source multi-target networks into a plurality of multi-source single-target networks by constructing the incidence matrix among the source nodes, and implements selective cooperative communication in the multi-source single-target wireless sensor networks.
(2) The invention considers that the transmission sequence of the source node has great influence on the transmission performance of each node, schedules the transmission time slot of the source node before data transmission, and provides three scheduling schemes: fixed scheduling, random scheduling, adaptive scheduling to improve or equalize the transmission performance of each node.
(3) The invention considers the optimal relay selection strategy as follows: active set A(s)i) When a plurality of optimal relay nodes exist, secondary selection can be performed on the relays according to indexes such as optimal channel quality, maximum node residual energy, minimum electing times and the like, so that multi-objective optimization of the system is realized.
(4) The invention considers the characteristic of smaller data packet of the wireless sensor network, implements packet aggregation strategy in selecting cooperative communication, and provides three aggregation schemes: the random aggregation, the first-come first aggregation and the first aggregation with more aggregation times enable source nodes with the same target node to cooperate with each other, and cooperative transmission is implemented while self data transmission is carried out, so that the energy consumption of a system is reduced, and the frequency spectrum utilization rate of the system is improved.
Drawings
In order to make the object, technical scheme and beneficial effect of the invention more clear, the invention provides the following drawings for explanation:
FIG. 1 is a model of a selective collaboration system based on packet aggregation in a multi-source multi-target network according to an embodiment of the present invention;
FIG. 2 is a diagram illustrating a multi-source multi-target network decomposed into multiple multi-source single-target networks by using a correlation matrix according to an embodiment of the present invention;
fig. 3 is a communication flow of a packet aggregation-based selection collaboration method in a multi-source single-target network according to an embodiment of the present invention;
fig. 3(a) shows: source node siTarget node d for sending data to itselfkSubsequent source nodes with the same target node as that successfully decoded join decoding set D(s)i)；
Fig. 3(b) shows: successful data transmission, target node dkFeeding back an ACK frame;
fig. 3(c) shows: data transmission failure, target node dkFeeding back a NACK frame, and adding a source node which can successfully receive the NACK in a decoding set into an active set A(s)i) Further selecting the best relay b according to the relay selection strategyi；
Fig. 3(d) shows: in the best relay bi(s in this figure)i+3For optimal relay) transmission time slot, and the self data and the received data are aggregated and sent to a target node dk。
Detailed Description
Preferred embodiments of the present invention will be described in detail below with reference to the accompanying drawings.
As shown in fig. 1, the invention is a model of a selective collaboration system based on packet aggregation in a multi-source multi-target network.
In an actual wireless sensor network, a selection cooperation method based on packet aggregation under a multi-source multi-target network for improving transmission reliability and energy conservation and speed acceleration is provided, wherein M source nodes of the network are respectively represented as s1,s2,…,sMAnd N target nodes, denoted d respectively1,d2,…,dNAnd all source nodes with the same target node cooperate with each other. The channels are independent and subject to Rayleigh distribution, the source node si(i-1, 2, …, M) and a target node dkThe instantaneous channel gain between ( k 1,2, …, N) is shown as
The instantaneous channel gain between different source nodes is expressed as
Under Rayleigh distribution, the square of the instantaneous channel gain follows an exponential distribution,
and
respectively is a parameter of
And
respectively, the variance of the exponential random variables of
And
all channels in the system are reversible and equivalent, i.e.
And the instantaneous gain of all channels remains unchanged in the same round of data transmission. In addition, each node is only provided with a single antenna, a half-duplex mode is adopted, and the data transmission rate among the nodes is R. The system adopts a feedback mechanism, namely the target node feeds back an ACK frame or a NACK frame according to the receiving condition, and the relay node does not execute or executes cooperative transmission according to the feedback result.
Fig. 2 is a schematic diagram of decomposing a multi-source multi-target network into a plurality of multi-source single-target networks by using a correlation matrix according to the present invention. The specific scheme is as follows:
when source nodes with the same target node cooperate with each other, constructing an incidence matrix between the source nodes and the target nodes, namely: constructing an M × N incidence matrix R, each element R in RikRepresenting the corresponding relation between the source node i and the target node k, if k is the target node of the source node i, rikIs 1, otherwise, rikIs 0. Each target node corresponds to one column in the incidence matrix, nodes with element values of 1 in each column cooperate with each other, and nodes with element values of 0 do not need to be decoded and do not participate in cooperation. The method comprises the steps of converting an MxN multi-source multi-target network into N multi-source single-target networks by constructing a correlation matrix among source and target nodes, and implementing selective cooperative communication on the multi-source single-target networks. The black source nodes in fig. 2 represent source nodes corresponding to the current target node, and they correspond to the same target node, and can cooperate with each other to perform aggregation forwarding of data; the grey source node indicates that the grey source node is not the source node corresponding to the current target node, and does not need to participate in cooperation between the source nodes corresponding to the current target node.
Fig. 3(a) - (d) are communication flow diagrams of a packet aggregation-based selective collaboration method in a multi-source single-target network according to the present invention. The implementation process is as follows:
before data transmission, TDMA scheduling is carried out, and the transmission sequence of a source node is obtained. In the cooperation process, aiming at the characteristic that the data packet is small, a packet aggregation strategy is implemented. The data transmission process is divided into two phases. The first stage is as follows: and (4) directly transmitting. According to the scheduling result, each source node sequentially sends data to each target node in the self time slot,such as: as shown in FIG. 3(a), node siTarget node d for sending data to itselfk. Meanwhile, the source node with the same target node receives data and tries decoding, and the source node with successful decoding is added into a decoding set D(s)i). As shown in FIG. 3(b), if the data transmission is successful, the target node returns an ACK frame, decodes set D(s)i) The source node in (1) deletes the data packet in the respective cache, and the data transmission of the source node is finished, and the next source node is sent with the turn. As shown in FIG. 3(c), if the data reception fails, the target node feeds back a NACK frame, D(s)i) Nodes that can successfully receive NACK frames further join active set a(s)i) If A(s)i) Null, meaning that no other source node can decode s correctlyiGenerating interrupt for the transmitted data; if A(s)i) If not, then according to a certain strategy, the signal is in A(s)i) To select the best relay biAnd entering the second stage. And a second stage: and (4) polymerization and transmission. As shown in fig. 3(d), in the best relay biTransmission time slot of, biAssociating self data with slave siThe received data are aggregated, and the aggregated data are sent to a target node dkAnd finishing the data transmission.
TDMA scheduling may be performed using the three scheduling schemes of the present invention.
Firstly, fixed scheduling: in the whole data transmission process, the transmission sequence of the source node is always unchanged and is carried out according to the sequence numbers 1,2, … and M of the source node.
Random scheduling: the transmission sequence of the source nodes in each round is randomly generated, and the sequence of each source node in each round of data transmission is not necessarily the same.
Thirdly, adaptive scheduling: after each round of data transmission is finished, the target node sorts the source nodes according to the quality of the channel quality in the previous round, the source node with the worst channel quality is arranged at the top, the source node with the worst channel quality is arranged at the last, the target node broadcasts the transmission sequence before the next round of data transmission, and the source node arranged at the top preferentially transmits.
The selection of the best relay can be performed by adopting three relay selection strategies of the invention.
Is bestChannel quality relay selection strategy: from the active set A(s)i) The source node with the maximum instantaneous channel value with the target node is selected as the optimal relay node. The method can ensure the reliable transmission of data to the maximum extent.
The maximum remaining energy relay selection strategy is as follows: active set A(s)i) And selecting the source node with the maximum residual energy as the optimal relay node for data forwarding. The method can balance the energy consumption of the source nodes, and avoid the situation that some nodes are frequently elected and the energy is rapidly exhausted.
And thirdly, a relay selection strategy for the minimum relay electing times is as follows: active set A(s)i) The node with the least elected number is preferentially selected as the best relay. The method can ensure the relative fairness of the selected relay, so that the resources of the network can be used fairly.
When the optimal relay carries out data packet aggregation, a plurality of data packets wait for aggregation, and the selection strategy of the aggregation packet is carried out by adopting the three aggregation schemes of the invention.
Random polymerization: and randomly selecting one aggregation from the packets to be aggregated to form an aggregation packet, and then sending the aggregation packet to the target node together.
② first polymerization: and preferentially selecting the earliest received data packet from the data packets to be aggregated to form an aggregated packet and sending the aggregated packet to the target node.
Third, the first polymerization with a plurality of polymerization times: and preferentially selecting the data packets with the largest aggregation times from the data packets to be aggregated, aggregating to form an aggregated packet, and sending the aggregated packet to the target node.
Finally, it should be noted that the above-mentioned embodiments are preferred embodiments of the present invention, but the present invention is not limited to the above-mentioned embodiments, and any other modifications, such as replacement, simplification, etc., which do not depart from the spirit and scope of the present invention should be covered by the protection scope of the present invention.
Claims (1)
1. The selective cooperation method based on packet aggregation under the multi-source multi-target network is characterized in that: for M source nodes siI 1.. M and N target nodes dkNetworks with k 1., N, M > N, source nodes having the same target node cooperate with each other, in whichIn the cooperation process, aiming at the characteristic of small data packets, a packet aggregation strategy is implemented;
the data transmission process includes two phases:
the first stage is as follows: direct transmission, TDMA scheduling is carried out before each round of data transmission, the transmission sequence of the source nodes is obtained, and each source node s is transmitted according to the scheduling resultiSequentially sending data packets to respective target nodes d in self time slotskMeanwhile, a subsequent source node with the same target node receives the data packet and tries to decode, and the source node which succeeds in decoding is added into a decoding set D(s)i)；
If the data transmission is successful, the target node returns an acknowledgement ACK frame, decodes set D(s)i) The source node deletes the data packet in each buffer, and the data transmission of the source node is finished and the next source node sends data in turn;
if the data reception fails, the target node feeds back a negative NACK frame, D(s)i) Nodes that can successfully receive NACK frames further join active set a(s)i) According to a certain strategy in A(s)i) To select the best relay biEntering the second stage;
in the first stage, 3 TDMA scheduling schemes are adopted to obtain the transmission sequence of the source node, which respectively are: fixed scheduling, random scheduling and adaptive scheduling; the fixed scheduling refers to that the transmission sequence of the source node is always unchanged in the whole data transmission process and is carried out according to the serial numbers 1,2, … and N of the source node; the random scheduling refers to the random arrangement of the transmission sequence of the source nodes in each round; the self-adaptive scheduling means that after each round of data transmission is finished, a target node sorts source nodes according to the quality of a channel in the previous round, the source node with the worst channel quality is arranged at the front, the source node with the worst channel quality is arranged at the last, the target node broadcasts a transmission sequence before the next round of data transmission, and the source node arranged at the front preferentially transmits;
in the selection of the best relay, any one exists in the active set a(s)i) The source nodes in the network can be selected as the optimal relay, if a plurality of optimal relays are selected, the optimal relay is selected according to the indexes of the optimal channel quality, the maximum residual energy of the nodes and the minimum relay selection timesSelecting the optimal relay to realize multi-objective optimization of the network;
the optimal channel quality relay selection strategy comprises: in the first stage of relay selection, the best relay is selected from the instantaneous channel quality perspective between the source and destination nodes, i.e. from the active set a(s)i) Selecting a source node with the maximum instantaneous channel value with a target node as an optimal relay node;
the maximum remaining energy relay selection strategy comprises: in the first stage relay selection, the best relay is selected from the source node remaining energy perspective, i.e., from the active set a(s)i) Selecting a source node with the maximum residual energy as an optimal relay node to forward data;
the relay selection strategy for the minimum relay elected times comprises the following steps: in the first stage relay selection, selection is made from the perspective of the number of times the relay node is elected, i.e., active set a(s)i) The node with the least elected times is preferentially selected as the optimal relay;
and a second stage: polymerization transport in biTransmission time slot of, biAssociating self data with slave siThe received data are aggregated, and the aggregated data are sent to a target node dkWhen the data transmission of the source node is finished, the next source node is started to transmit data;
converting the M & gt N multi-source multi-target network into N multi-source single-target networks by constructing an incidence matrix among source and target nodes, and then carrying out selective cooperative communication on the multi-source single-target networks;
constructing the incidence matrix among the source and destination nodes according to the following method:
constructing an M × N incidence matrix R, each element R in RikRepresenting the corresponding relation between the source node i and the target node k, if k is the target node of the source node i, rikIs 1, otherwise, rikIs 0, R and RikRespectively expressed as:
each target node corresponds to one column in the incidence matrix, nodes with element values of 1 in each column cooperate with each other, and nodes with element values of 0 do not need to be decoded and do not participate in cooperation;
in the aggregation transmission process of the second stage, when a plurality of data packets wait for aggregation, the selection strategy of the aggregation packet is as follows: random polymerization, first-come first-polymerization and first-polymerization with a large number of polymerization times; the random aggregation refers to randomly selecting a data packet from packets to be aggregated for aggregation; the first-come first-aggregate means that the earliest received data packet is preferentially aggregated; the first aggregation with the largest aggregation times refers to selecting the data packets which have the largest aggregation times but are not successfully sent before aggregation.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810482235.7A CN108834194B (en) | 2018-05-18 | 2018-05-18 | Packet aggregation-based selection cooperation method under multi-source multi-target network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810482235.7A CN108834194B (en) | 2018-05-18 | 2018-05-18 | Packet aggregation-based selection cooperation method under multi-source multi-target network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN108834194A CN108834194A (en) | 2018-11-16 |
| CN108834194B true CN108834194B (en) | 2021-09-07 |
Family
ID=64147869
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201810482235.7A Active CN108834194B (en) | 2018-05-18 | 2018-05-18 | Packet aggregation-based selection cooperation method under multi-source multi-target network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN108834194B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110149660B (en) * | 2019-05-24 | 2022-05-06 | 重庆邮电大学 | Multi-data packet aggregation selection method based on target direction |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105430709A (en) * | 2015-12-11 | 2016-03-23 | 重庆邮电大学 | Relay selection and power distribution method in multisource and multi-objective wireless network |
| CN106358258A (en) * | 2016-08-31 | 2017-01-25 | 重庆大学 | Device and method for selecting cooperative relay node |
| CN107959956A (en) * | 2018-01-16 | 2018-04-24 | 重庆邮电大学 | A kind of WIA-PA network packet aggregation method based on radio channel state |
-
2018
- 2018-05-18 CN CN201810482235.7A patent/CN108834194B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105430709A (en) * | 2015-12-11 | 2016-03-23 | 重庆邮电大学 | Relay selection and power distribution method in multisource and multi-objective wireless network |
| CN106358258A (en) * | 2016-08-31 | 2017-01-25 | 重庆大学 | Device and method for selecting cooperative relay node |
| CN107959956A (en) * | 2018-01-16 | 2018-04-24 | 重庆邮电大学 | A kind of WIA-PA network packet aggregation method based on radio channel state |
Non-Patent Citations (3)
| Title |
|---|
| Scheduling for Source Relaying With Packet Aggregation in Industrial Wireless Networks;Svetlana Girs,etc;《IEEE TRANSACTIONS ON INDUSTRIAL INFORMATICS》;20161031;全文 * |
| 一种基于ARQ的最优中继动态选择协作方法;王恒等;《电子科技大学学报》;20170930;全文 * |
| 面向多源多目标协作网络的中继选择方法;王恒等;《系统工程与电子技术》;20170630;全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN108834194A (en) | 2018-11-16 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| JP7342988B2 (en) | Access point device and station device | |
| Liao et al. | MU-MIMO MAC protocols for wireless local area networks: A survey | |
| CN106559900B (en) | A kind of multi-channel multi-address access method based on asymmetric bandwidth | |
| CN102301812A (en) | Base station and wireless communication system | |
| CN103298084A (en) | Coordinated multi-relay selection and power distribution method based on energy efficiency criteria | |
| CN107710817A (en) | Associated wireless link control with network code（RLC）Signaling | |
| CN102111820A (en) | Method for realizing scheduling control of network encoding perceived by transmission control protocol in wireless network | |
| CN108834194B (en) | Packet aggregation-based selection cooperation method under multi-source multi-target network | |
| Liao et al. | Uni-MUMAC: A unified down/up-link MU-MIMO MAC protocol for IEEE 802.11 ac WLANs | |
| CN108880633B (en) | Joint design optimization method for beamforming antenna selection grouping algorithm | |
| CN104837194B (en) | A kind of bidirectional relay system power distribution method based on AF mechanism | |
| CN102780545A (en) | Method for selecting transmitting antenna in amplification forwarding distribution type cooperative system | |
| Kartsakli et al. | Multiuser MAC protocols for 802.11 n wireless networks | |
| CN106788637B (en) | Joint optimization method for transmission mode and transmission beam in D2D communication | |
| CN110381561B (en) | Safe transmission method based on energy efficiency in cache-assisted multi-relay transmission system | |
| Hung et al. | Cooperative MAC protocol for multi-channel wireless networks | |
| Alkhrijah et al. | Throughput-Fairness Tradeoff MAC for Multiuser IBFD (TFMAC) | |
| Liu et al. | Achieving Ultra-Low Latency for Network Coding-Aware Multicast Fronthaul Transmission in Cache-Enabled C-RANs | |
| Mannan et al. | Energy Efficient Error-free Cooperative Transmission for Wireless Networks | |
| Tian et al. | An algorithm of MAC-based network coding for Butterfly wireless networks | |
| Wang et al. | Multi-Relay Selection Algorithm for Optimizing Symbol Error Rate and Network Lifetime | |
| Wei et al. | Cooperative transmission in the wireless sensors network: Realization and analysis | |
| Kartsakli et al. | Multiuser MAC schemes for high-throughput IEEE 802.11 n/ac WLANs | |
| Willig | Coordination-free repeater groups in wireless sensor networks | |
| VARDHAN et al. | Optimal Channel and Relay Assignment in OFDM Design for Cross-Layer Cooperative Networks |
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 |