CN106851768B - Self-adaptive cross-layer multiple access method and system for ensuring service quality - Google Patents

Self-adaptive cross-layer multiple access method and system for ensuring service quality Download PDF

Info

Publication number
CN106851768B
CN106851768B CN201611256684.7A CN201611256684A CN106851768B CN 106851768 B CN106851768 B CN 106851768B CN 201611256684 A CN201611256684 A CN 201611256684A CN 106851768 B CN106851768 B CN 106851768B
Authority
CN
China
Prior art keywords
node
cooperative
source node
transmission
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
CN201611256684.7A
Other languages
Chinese (zh)
Other versions
CN106851768A (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.)
Beihang University
Original Assignee
Beihang 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 Beihang University filed Critical Beihang University
Priority to CN201611256684.7A priority Critical patent/CN106851768B/en
Publication of CN106851768A publication Critical patent/CN106851768A/en
Application granted granted Critical
Publication of CN106851768B publication Critical patent/CN106851768B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W40/00Communication routing or communication path finding
    • H04W40/02Communication route or path selection, e.g. power-based or shortest path routing
    • H04W40/04Communication route or path selection, e.g. power-based or shortest path routing based on wireless node resources
    • H04W40/10Communication route or path selection, e.g. power-based or shortest path routing based on wireless node resources based on available power or energy
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04BTRANSMISSION
    • H04B7/00Radio transmission systems, i.e. using radiation field
    • H04B7/02Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas
    • H04B7/022Site diversity; Macro-diversity
    • H04B7/026Co-operative diversity, e.g. using fixed or mobile stations as relays
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W40/00Communication routing or communication path finding
    • H04W40/02Communication route or path selection, e.g. power-based or shortest path routing
    • H04W40/12Communication route or path selection, e.g. power-based or shortest path routing based on transmission quality or channel quality
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W40/00Communication routing or communication path finding
    • H04W40/02Communication route or path selection, e.g. power-based or shortest path routing
    • H04W40/22Communication 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
    • YGENERAL 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
    • Y02TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02DCLIMATE 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/00Reducing energy consumption in communication networks
    • Y02D30/70Reducing energy consumption in communication networks in wireless communication networks

Abstract

The invention provides a self-adaptive cross-layer multiple access method and a system for ensuring service quality, wherein the method comprises the following steps: judging whether the residual energy parameter is greater than or equal to the threshold of the residual energy ratio through the source node; if yes, the destination node judges whether the channel quality parameter is greater than or equal to the channel gain threshold between the corresponding links; if the channel quality parameter is larger than or equal to the channel gain threshold between the corresponding links, the destination node informs the source node of adopting a direct transmission mode for transmission; if the residual energy parameter is greater than or equal to the threshold of the residual energy ratio and the channel quality parameter is less than the channel gain threshold between corresponding links, the target node informs the source node and the candidate cooperative node to transmit in a single-node cooperative transmission mode; and if the residual energy parameter is smaller than the threshold of the residual energy ratio, the destination node informs the source node and the candidate cooperative node to transmit in a multi-node cooperative transmission mode.

Description

Self-adaptive cross-layer multiple access method and system for ensuring service quality
Technical Field
The embodiment of the invention relates to the technical field of communication, in particular to a self-adaptive cross-layer multiple access method and a self-adaptive cross-layer multiple access system for ensuring service quality.
Background
In a wireless network and a sensor network, a multiple access method (MAC method for short) is responsible for solving the problem that how each mobile user or sensor node can fairly, quickly and safely access a use channel and efficiently share limited wireless bandwidth resources. The quality of the MAC method directly influences the quality of performance indexes such as network throughput, time delay, energy efficiency, network service life and the like.
The existing MAC method mainly comprises a direct transmission method, a single-node cooperative transmission method and a multi-node cooperative transmission method. The direct transmission method completes the direct transmission process according to the IEEE 802.11 distributed coordination function mode, the transmitting and receiving parties firstly control the packet reservation channel, the source node sends data packets after the reservation is successful, and the destination node replies a confirmation packet after the destination node successfully receives the data packets. The single-node cooperative transmission method helps a source node to forward a data packet to a destination node by selecting a single cooperative node. The multi-node cooperative transmission method helps a source node to forward a data packet to a destination node by selecting a plurality of cooperative nodes.
The direct transmission method has small time delay overhead and larger throughput under the condition of good channel quality; however, when dealing with the situation of poor channel quality, the energy consumption of the source node needs to be used for quality assurance of the received signal of the destination node. The single-node cooperative transmission method and the multi-node cooperative transmission method improve the energy efficiency and prolong the service life of the network, but improve the complexity of control grouping, increase the time delay of the transmission process and reduce the throughput performance.
Therefore, at present, the MAC method is not reasonably selected according to the channel quality and the energy efficiency, and the advantage of each MAC method cannot be fully utilized and the disadvantage of each MAC method is avoided due to the adoption of a single MAC method in the whole data transmission process.
Disclosure of Invention
The embodiment of the invention provides a self-adaptive cross-layer multiple access method and a self-adaptive cross-layer multiple access system for ensuring service quality, which solve the technical problems that an MAC method is not reasonably selected aiming at channel quality and energy efficiency at present, and the advantages of each MAC method cannot be fully utilized and the defects of each MAC method are avoided due to the adoption of a single MAC method in the whole data transmission process.
The embodiment of the invention provides a self-adaptive cross-layer multiple access method for ensuring service quality, which comprises the following steps:
the source node judges whether the residual energy parameter is greater than or equal to the threshold of the residual energy ratio;
if the source node determines that the residual energy parameter is greater than or equal to the threshold of the residual energy ratio, the destination node judges whether the channel quality parameter between the links of the source node and the destination node is greater than or equal to the channel gain threshold between the corresponding links;
if the source node determines that the residual energy parameter is greater than or equal to the threshold of the residual energy ratio, and the destination node determines that the channel quality parameter between the links of the source node and the destination node is greater than or equal to the channel gain threshold between the corresponding links, the destination node informs the source node of adopting a direct transmission mode for transmission;
if the source node determines that the residual energy parameter is larger than or equal to the threshold of the residual energy ratio, and the destination node determines that the channel quality parameter between the links of the source node and the destination node is smaller than the channel gain threshold between the corresponding links, the destination node informs the source node and the candidate cooperative node to adopt a single-node cooperative transmission mode for transmission;
and if the source node determines that the residual energy parameter is smaller than the threshold of the residual energy ratio, the destination node informs the source node and the candidate cooperative nodes to adopt a multi-node cooperative transmission mode for transmission.
The embodiment of the invention provides a self-adaptive cross-layer multiple access system with guaranteed service quality, which comprises the following steps:
the source node includes:
the residual energy parameter judging module is used for judging whether the residual energy parameter is greater than or equal to the threshold of the residual energy ratio;
the destination node includes:
a channel quality parameter judgment module, configured to judge whether a channel quality parameter between links of the source node and the destination node is greater than or equal to a channel gain threshold between corresponding links if the source node determines that the remaining energy parameter is greater than or equal to a threshold of a remaining energy ratio;
a direct transmission mode determining module, configured to notify the source node of performing transmission in a direct transmission mode if the source node determines that the remaining energy parameter of the source node is greater than or equal to a threshold of a remaining energy ratio, and the destination node determines that a channel quality parameter between links of the source node and the destination node is greater than or equal to a channel gain threshold between corresponding links;
a single-node cooperative transmission mode determining module, configured to notify the source node and the candidate cooperative node to perform transmission in a single-node cooperative transmission mode if the source node determines that the residual energy parameter of the source node is greater than or equal to a threshold of a residual energy ratio and the destination node determines that a channel quality parameter between links of the source node and the destination node is less than a channel gain threshold between corresponding links;
and the multi-node cooperative transmission mode determining module is used for notifying the source node and the candidate cooperative nodes to adopt a multi-node cooperative transmission mode for transmission if the source node determines that the residual energy parameter is smaller than the threshold of the residual energy ratio.
The embodiment of the invention provides a self-adaptive cross-layer multiple access method and a self-adaptive cross-layer multiple access system for ensuring service quality, wherein a source node is used for judging whether a residual energy parameter is greater than or equal to a threshold of a residual energy ratio; if the source node determines that the residual energy parameter is greater than or equal to the threshold of the residual energy ratio, the destination node judges whether the channel quality parameter between the links of the source node and the destination node is greater than or equal to the channel gain threshold between the corresponding links; if the source node determines that the residual energy parameter is greater than or equal to the threshold of the residual energy ratio, and the destination node determines that the channel quality parameter between the links of the source node and the destination node is greater than or equal to the channel gain threshold between the corresponding links, the destination node informs the source node of adopting a direct transmission mode for transmission; if the source node determines that the residual energy parameter is larger than or equal to the threshold of the residual energy ratio, and the destination node determines that the channel quality parameter between the links of the source node and the destination node is smaller than the channel gain threshold between the corresponding links, the destination node informs the source node and the candidate cooperative node to transmit in a single-node cooperative transmission mode; and if the source node determines that the residual energy parameter is smaller than the threshold of the residual energy ratio, the destination node informs the source node and the candidate cooperative node to transmit in a multi-node cooperative transmission mode. Adopting a direct transmission mode under the conditions of sufficient residual energy and good channel quality; under the condition of sufficient residual energy and poor channel quality, a single-node cooperative transmission mode is adopted, appropriate control grouping and time delay expenses are introduced, energy consumption in the transmission process can be reduced by using a single cooperative link, and energy efficiency is improved to prolong the service life of a network; under the condition of insufficient residual energy, a multi-node cooperative transmission mode is adopted, a large amount of control packets and time delay overhead are introduced, energy consumption in the transmission process is reduced by utilizing a plurality of cooperative links, and energy efficiency is improved; particularly, the energy consumption of the source node is reduced by balancing the residual energy between the source node and the cooperative node, and the premature end of the network life caused by the energy exhaustion of the source node is avoided, so that the network life is prolonged. The method takes full advantage of the advantages of each MAC method and circumvents the disadvantages of each MAC method.
Drawings
In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings needed to be used in the description of the embodiments or the prior art will be briefly introduced below, and it is obvious that the drawings in the following description are some embodiments of the present invention, and for those skilled in the art, other drawings can be obtained according to these drawings without creative efforts.
Fig. 1 is a flowchart of a first embodiment of an adaptive cross-layer multiple access method for qos guarantee according to the present invention;
FIG. 2 is a timing diagram illustrating a direct transmission mode according to a first embodiment of the present invention;
FIG. 3 is a flowchart of a second embodiment of a quality of service guaranteed adaptive cross-layer multiple access method of the present invention;
fig. 4 is a flowchart of determining a single cooperative node and performing transmission in a single-node cooperative transmission manner according to a second embodiment of the present invention;
fig. 5 is a timing chart of successful cooperative transmission of a single node in the second embodiment of the present invention;
fig. 6 is a timing diagram illustrating the collision of HTS packets cooperatively transmitted by a single node according to a second embodiment of the present invention;
fig. 7 is a timing diagram of cooperative transmission without cooperative nodes by a single node in the second embodiment of the present invention;
fig. 8 is a flowchart of determining a plurality of cooperative nodes and performing transmission in a multi-node cooperative transmission manner according to a second embodiment of the present invention;
FIG. 9 is a success timing diagram of a multi-node cooperative transmission scheme according to a second embodiment of the present invention;
fig. 10 is a timing diagram illustrating a piggyback transmission from a single-node cooperative transmission source node to a cooperative node in the second embodiment of the present invention;
fig. 11 is a timing diagram illustrating a process of a single node cooperatively transmitting a cooperative node to a source node in a second embodiment of the present invention;
fig. 12 is a timing chart illustrating a process of a single node cooperatively transmitting a destination node to a cooperative node incidentally according to a second embodiment of the present invention;
FIG. 13 is a diagram illustrating a first embodiment of an adaptive cross-layer multiple access system with QoS enforcement according to the present invention;
fig. 14 is a schematic structural diagram of a second embodiment of an adaptive cross-layer multiple access system with guaranteed qos according to the present invention;
fig. 15 is a schematic structural diagram of a third embodiment of an adaptive cross-layer multiple access system with qos guarantee according to the present invention.
Detailed Description
In order to make the objects, technical solutions and advantages of the embodiments of the present invention clearer, the technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are some, but not all, embodiments of the present invention. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.
It should be understood that the term "and/or" as used herein is merely one type of association that describes an associated object, meaning that three relationships may exist, e.g., a and/or B may mean: a exists alone, A and B exist simultaneously, and B exists alone. In addition, the character "/" herein generally indicates that the former and latter related objects are in an "or" relationship.
The word "if" as used herein may be interpreted as "at … …" or "when … …" or "in response to a determination" or "in response to a detection", depending on the context. Similarly, the phrases "if determined" or "if detected (a stated condition or event)" may be interpreted as "when determined" or "in response to a determination" or "when detected (a stated condition or event)" or "in response to a detection (a stated condition or event)", depending on the context.
For purposes of clarity, the definitions of certain words and phrases used herein will first be described.
Fig. 1 is a flowchart of a first embodiment of a quality-of-service guaranteed adaptive cross-layer multiple access method according to the present invention, and as shown in fig. 1, an execution subject of this embodiment is a quality-of-service guaranteed adaptive cross-layer multiple access system, where the quality-of-service guaranteed adaptive cross-layer multiple access system includes: the source node and the destination node can also comprise cooperative nodes. The adaptive cross-layer multiple access method for quality of service assurance provided by the present embodiment includes the following steps.
In step 101, a source node determines whether its residual energy is greater than or equal to a threshold of a residual energy ratio.
Specifically, in this embodiment, before the determining, by the source node, whether the remaining energy is greater than or equal to the threshold of the remaining energy ratio, the method further includes: if the source node has data to transmit,first, it needs to monitor the channel idle continuous distributed coordination inter frame space (DCF inter frame Spacing; referred to as DIFS for short), and if it is not detected that other nodes are transmitting in the channel idle continuous distributed coordination inter frame space time, the source node follows [0, CW]A random number is selected, CW is a contention window, and then the CW is multiplied by a Slot time (t for short)SLOT) A random back-off time is obtained.
In this embodiment, after the random back-off time, the source node determines whether the remaining energy is greater than or equal to a threshold of the remaining energy ratio.
And the residual energy parameter of the source node is the ratio of the residual energy of the source node to the initial energy. Represents ES/E0Wherein E isSRepresenting the residual energy of the source node, E0The initial energy of the source node is shown, and in this embodiment, the initial energy of all nodes is the same. Gamma denotes the threshold of the residual energy ratio. If the residual energy parameter of the source node is greater than or equal to the threshold of the residual energy ratio, namely ES/E0If the number of the nodes is larger than or equal to gamma, the residual energy of the source node is more, and the control packet complexity, the time delay, the throughput and other performances of the network can be considered. If the residual energy parameter of the source node is smaller than the threshold of the residual energy ratio, namely ES/E0<γ, it means that the source node has less residual energy and the performance of the network in terms of lifetime needs to be considered.
It can be understood that, in this embodiment, after the source node determines whether the remaining energy parameter is greater than or equal to the threshold of the remaining energy ratio, if the source node determines that the remaining energy parameter is greater than or equal to the threshold of the remaining energy ratio, the source node sends a request to send packet (referred to as an RTS packet for short) to the destination node, otherwise, the source node sends a cooperation request to send packet (referred to as a C-RTS packet for short) to the destination node.
In this embodiment, the C-RTS packet is shown in table 1. It contains 2 byte frame control, 2 byte duration, 6 byte destination receiver address, 6 byte sender address, 2 byte source node residual energy and 4 byte frame check. The C-RTS packet has 2-byte source nodes added compared with the RTS packetResidual energy, ESCorresponding parameters are provided for the subsequent cooperative node access process.
Table 1: C-RTS frame structure
Figure GDA0002291649940000061
Step 102, if the source node determines that the residual energy parameter is greater than or equal to the threshold of the residual energy ratio, the destination node determines whether the channel quality parameter between the links of the source node and the destination node is greater than or equal to the channel gain threshold between the corresponding links.
In this embodiment, the channel quality parameter between links of the source node and the destination node is a channel gain between links, which can be expressed as: hSD=Prec/PmaxWherein P isrecFor received power of RTS packet, PmaxIs the maximum received power between links; λ represents an inter-link channel gain threshold value.
In this embodiment, if the destination node determines that the channel quality parameter between the links of the source node and the destination node is greater than or equal to the channel gain threshold between the corresponding links, that is, HSDIf the channel quality parameter between the links of the source node and the destination node is determined to be smaller than the channel gain threshold between the corresponding links, namely H, by the destination nodeSD<And lambda indicates that the channel quality between the links is poor, and the single-node cooperative transmission mode can be adopted for transmission.
Step 103, if the source node determines that the residual energy parameter is greater than or equal to the threshold of the residual energy ratio, and the destination node determines that the channel quality parameter between the links of the source node and the destination node is greater than or equal to the channel gain threshold between the corresponding links, the destination node notifies the source node to transmit in a direct transmission mode.
It can be understood that, if the destination node determines that the channel quality parameter between the links of the source node and the destination node is greater than or equal to the channel gain threshold between the corresponding links, a clear to send packet (CTS packet for short) is replied to the source node to notify the source node to transmit in a direct transmission manner. If the destination node determines that the channel quality parameter between the links of the source node and the destination node is smaller than the channel gain threshold between the corresponding links, a protocol clear-to-send packet (C-CTS packet for short) is replied to the source node to inform the source node of adopting a single-node cooperative transmission mode for transmission.
In the present embodiment, the frame structure of the C-CTS packet is shown in table 2. Including 2-byte frame control, 2-byte duration, 6-byte receiver address, 2-byte S-D channel gain, and 4-byte frame check. The C-CTS packet increases the channel gain H between the 2-byte flags S-D compared to the CTS packetSDIn order to make the candidate cooperative nodes utilize HSDThe information judges whether to access according to relevant conditions.
Table 2: frame structure of C-CTS packet
Figure GDA0002291649940000071
In the timing chart provided in this embodiment, the node where the control packet or the data packet is located indicates the node that transmits the control packet or the data packet, the NAV indicates the state where the corresponding node is located, and the NAV indicates the network allocation vector, that is, the corresponding node sets the NAV state to perform backoff. Fig. 2 is a timing diagram of a direct transmission mode according to a first embodiment of the present invention, as shown in fig. 2, wherein DIFS represents a channel idle continuous distributed coordination inter-frame space time and a random back-off time, and a random number of time slots t are selected for a source nodeSLOTAnd performing backoff, wherein the SIFS indicates that each node needs to wait for a short inter-frame interval after receiving the packet. It can be seen from fig. 2 that in the direct transmission mode, the cooperative node RiThe method is characterized in that the method does not participate in the method, only carries out transmission of a control packet and a data packet between a source node and a destination node, and replies an acknowledgement packet (ACK packet for short) to the source node after the destination node receives the data packet. To indicate that the transfer process is complete.
And 104, if the source node determines that the residual energy parameter is greater than or equal to the threshold of the residual energy ratio, and the destination node determines that the channel quality parameter between the links of the source node and the destination node is less than the channel gain threshold between the corresponding links, the destination node informs the source node and the candidate cooperative nodes to transmit in a single-node cooperative transmission mode.
And 105, if the source node determines that the residual energy parameter is smaller than the threshold of the residual energy ratio, the destination node informs the source node and the candidate cooperative node to transmit in a multi-node cooperative transmission mode.
This embodiment will be described with reference to steps 104 to 105. Specifically, the advantages of the single-node cooperative transmission mode and the multi-node cooperative transmission mode based on cooperative transmission are emphasized for different network performance indexes: therefore, in this embodiment, the single-node cooperative transmission method is suitable for the case where the source node has sufficient residual energy and the channel quality is poor. In order to avoid excessive energy consumption and energy efficiency reduction caused by poor channel link quality of the direct transmission mode, a single-node cooperative transmission mode is adopted. Because a single cooperative node can provide a cooperative link with better channel quality, the energy consumption in the transmission process is saved, and the network energy efficiency is improved. And the multi-node cooperative transmission mode is suitable for the condition that the residual energy of the source node is insufficient. The multi-node cooperative transmission mode not only can fully utilize cooperative diversity gain brought by transmission of a plurality of cooperative links, but also can distribute energy consumption required by data transmission of the source node to a plurality of cooperative nodes with relatively sufficient residual energy, thereby reducing the energy consumption of the source node, avoiding network non-communication caused by premature energy consumption of the source node and prolonging the service life of the network.
It can be understood that, if the destination node determines that the channel quality parameter between the links of the source node and the destination node is smaller than the channel gain threshold between the corresponding links, the destination node replies a C-CTS packet to the source node to notify the source node to transmit in a single-node cooperative transmission mode or a multi-node cooperative transmission mode. The frame format of the C-CTS packet is shown in table 2, and is not described in detail here.
In the adaptive cross-layer multiple access method for ensuring quality of service provided by this embodiment, whether a residual energy parameter is greater than or equal to a threshold of a residual energy ratio is determined by a source node; if the source node determines that the residual energy parameter is greater than or equal to the threshold of the residual energy ratio, the destination node judges whether the channel quality parameter between the links of the source node and the destination node is greater than or equal to the channel gain threshold between the corresponding links; if the source node determines that the residual energy parameter is greater than or equal to the threshold of the residual energy ratio, and the destination node determines that the channel quality parameter between the links of the source node and the destination node is greater than or equal to the channel gain threshold between the corresponding links, the destination node informs the source node of adopting a direct transmission mode for transmission; if the source node determines that the residual energy parameter is larger than or equal to the threshold of the residual energy ratio, and the destination node determines that the channel quality parameter between the links of the source node and the destination node is smaller than the channel gain threshold between the corresponding links, the destination node informs the source node and the candidate cooperative node to transmit in a single-node cooperative transmission mode; and if the source node determines that the residual energy parameter is smaller than the threshold of the residual energy ratio, the destination node informs the source node and the candidate cooperative node to transmit in a multi-node cooperative transmission mode. Adopting a direct transmission mode under the conditions of sufficient residual energy and good channel quality; under the condition of sufficient residual energy and poor channel quality, a single-node cooperative transmission mode is adopted, appropriate control grouping and time delay expenses are introduced, energy consumption in the transmission process can be reduced by using a single cooperative link, and energy efficiency is improved to prolong the service life of a network; under the condition of insufficient residual energy, a multi-node cooperative transmission mode is adopted, a large amount of control packets and time delay overhead are introduced, energy consumption in the transmission process is reduced by utilizing a plurality of cooperative links, and energy efficiency is improved; particularly, the energy consumption of the source node is reduced by balancing the residual energy between the source node and the cooperative node, and the premature end of the network life caused by the energy exhaustion of the source node is avoided, so that the network life is prolonged. The method takes full advantage of the advantages of each MAC method and circumvents the disadvantages of each MAC method.
Fig. 3 is a flowchart of a second embodiment of the adaptive cross-layer multiple access method for guaranteeing quality of service according to the present invention, and as shown in fig. 3, the adaptive cross-layer multiple access method for guaranteeing quality of service provided in this embodiment is further detailed in steps 104 to 105 on the basis of the first embodiment of the adaptive cross-layer multiple access method for guaranteeing quality of service according to the present invention, and further includes a step of piggybacking data packet transmission.
Step 201, if the source node determines that the transmission of other nodes is not monitored within the channel idle continuous distributed coordination interframe interval time, determining random evading time.
Specifically, in this embodiment, if the source node has data to send to the destination node, it is first determined whether the channel is in an idle state, that is, it is determined that the channel is not in an idle continuous distributed coordination inter-frame interval and other nodes are not monitoring that the channel is transmitting, that is, the channel is in an idle state, and transmission of the control packet and the data packet can be performed after a random evasive time.
The calculation method of the random evasive time is the same as that in the first embodiment of the adaptive cross-layer multiple access method for ensuring the service quality, and is not described in detail here.
In step 202, it is determined at the source node whether the residual energy parameter is greater than or equal to the threshold of the residual energy ratio, if so, step 203 is executed, otherwise, step 209 is executed.
In this embodiment, the implementation manner of step 202 is the same as the implementation manner of step 101 in the first embodiment of the adaptive cross-layer multiple access method for ensuring quality of service of the present invention, and details are not repeated here.
In step 203, the source node sends a request-to-send packet to the destination node.
In step 204, the destination node determines whether the channel quality parameter between the links of the source node and the destination node is greater than or equal to the channel gain threshold between the corresponding links, if so, step 205 is executed, otherwise, step 207 is executed.
Step 205, the destination node replies a clear-to-send packet to the source node to notify the source node to transmit in a direct transmission manner.
And step 206, the source node and the destination node adopt a direct transmission mode for transmission.
The source node and the destination node transmit in a direct transmission manner, which is shown in fig. 2 and is not described in detail herein.
And step 207, the destination node replies a cooperation clearing sending packet to the source node so as to inform the source node of adopting a single-node cooperation transmission mode for transmission.
And 208, the source node determines a single cooperative node and transmits the single cooperative node in a single-node cooperative transmission mode.
Further, in this embodiment, if the destination node notifies the source node of performing transmission in a single-node cooperative transmission manner, the method further includes the following steps. Fig. 4 is a flowchart of determining a single cooperative node and performing transmission in a single-node cooperative transmission manner in the second embodiment of the present invention. Steps 208a to 208l are steps of determining a single cooperative node and performing transmission by adopting a single-node cooperative transmission manner.
In step 208a, each candidate cooperative node determines whether it meets the condition that the single node participates in the cooperative transmission, if so, step 208b is executed, otherwise, step 208l is executed.
Further, in this embodiment, in the process of performing control packet transmission by the source node and the destination node, the neighbor node performs interception. If the neighbor node listens to the RTS group and the C-CTS group, the neighbor node can be used as a candidate node for single-node cooperative transmission.
The condition that the single node participates in the cooperative transmission can be expressed as shown in formula (1) and formula (2):
HSR≥HSD;HRD≥HSD; (1)
ER/E0≥γ; (2)
wherein HSRRepresenting the channel gain between the source node S and the candidate cooperative node R, and calculating the receiving power obtained by the candidate cooperative node R by monitoring RTS grouping; hRDRepresenting the channel gain between the candidate cooperative node R and the destination node D, and calculating the receiving power obtained by the cooperative node R by monitoring the C-CTS group; hSDDerived from information carried in C-CTS packetsTo; eRRepresenting the remaining energy of the cooperative node R, E0The initial energy of the candidate cooperative nodes is represented, the formulas (1) and (2) limit that the cooperative link gain must be larger than the direct transmission link gain, and the residual energy of the cooperative nodes is larger than the residual energy limit threshold, so that the effectiveness of single-node cooperative transmission is ensured.
And step 208b, calculating the access waiting time of the single node according to the channel quality parameters of the candidate cooperative node and the source node or the destination node.
Wherein, the channel quality parameters of the candidate cooperative nodes and the source node are the channel gains H of the candidate cooperative nodes and the source nodeSR. The channel quality parameters of the candidate cooperative nodes and the destination node are the channel gains H of the candidate cooperative nodes and the destination nodeRD
And step 208c, the candidate cooperative nodes monitor whether other candidate cooperative nodes send help sending packets to the source node within the corresponding single-node access waiting time, if not, step 208d is executed, otherwise, step 208e is executed.
Further, in the present embodiment, transmission of a packet (abbreviated as an HTS packet) is facilitated. The frame format of the HTS packet is shown in Table 3, and includes a 2-byte frame control, a 2-byte duration, a 6-byte receiver address, and a 6-byte sender address, which is a candidate cooperative node RiAddress of, 2 bytes RiResidual energy ER2 bytes Riinter-D channel gain HRiDAnd 4 byte frame check. The frame structure does not contain S-RiGain of inter channel because of HSRiMay be calculated by the source node based on its received power after receiving the HTS packet.
Table 3: frame format for HTS packets
Figure GDA0002291649940000111
The candidate cooperative node sends a help-send packet to the source node, step 208 d.
At step 208e, the candidate cooperator node cancels sending the assist transmission packet to the source node.
After step 208e is performed, step 208l is performed.
In step 208f, the source node determines whether a helper transmit packet is received within the latency threshold, if so, step 208g is performed, otherwise, step 208k is performed.
In step 208g, the source node determines whether the received assisted transmission packet can be decoded correctly, if so, step 208h is executed, otherwise, step 208i is executed.
And step 208h, the source node sends the data packet, the cooperative node forwards the data packet, and the destination node replies an ACK packet to the source node after the data packet is decoded successfully.
Step 208i, the source node broadcasts a conflict resolution control packet to the various candidate cooperator nodes.
And step 208j, performing backoff operation on the candidate cooperative nodes in the corresponding random time respectively, and monitoring whether other candidate cooperative nodes send help sending packets to the source node in the corresponding random time.
After step 208j is performed, step 208c is performed.
And step 208k, the source node sends the data packet to the destination node by adopting a direct transmission mode.
And step 208l, the candidate cooperative node exits the single-node cooperative transmission mode and retreats.
In the embodiment, the description is made with reference to steps 208a to 208l, so that candidate cooperative nodes compete in the single-node transmission manner in the embodiment, and finally, the determination of the cooperative node includes three cases.
Case 1: fig. 5 is a timing chart of successful cooperative transmission of a single node in the second embodiment of the present invention. As shown in fig. 5, candidate cooperative nodes RiWaiting for corresponding single-node access waiting time tiIf no other candidate cooperative node sending help sending packet to the source node is sensed later or no data packet is sensed to be sent by the source node, the candidate cooperative node RiTransmitting an HTS packet, and continuously listening to a channel by other cooperative nodes before transmitting the HTS packet of the other cooperative nodes; if R isjAt corresponding single node access latency time tjListening to RiThe transmitted HTS packet cancels the transmission of the HTS packet; if R iskIs different from RiIn the transmission range of (1), cancelling the transmission of the HTS packet after monitoring that the source node S transmits the data packet; after receiving the HTS packet, the source node S ensures that the selected cooperative node can correctly receive the power PSTransmitting data packets, cooperative nodes RiCalculated by itself as power PRiForwarding data, PRiThe sum of the power of the source node S and the cooperative node needs to ensure that the destination node successfully receives and correctly decodes the data packet. The destination node replies with an ACK packet after successfully receiving and decoding.
Case 2: FIG. 6 is a timing diagram illustrating a collision of HTS packets transmitted by a single node in cooperation according to a second embodiment of the present invention, as shown in FIG. 6, if RiAt wait tiSending HTS packets after time, RjAt wait tjSending HTS grouping after time, wherein the sending time interval of the two nodes is smaller than the transmission delay in the network, after collision occurs, the source node S sends a conflict resolution grouping (CR grouping for short), after receiving the CR grouping, the two candidate cooperative nodes wait for random time to carry out backoff operation, and respectively resending the HTS grouping until a single cooperative node is successfully selected; the source node S, upon receiving the HTS packet, ensures that the cooperative node is at the correct received power PSSending data, cooperative node RiCalculated by itself as power PRiForwarding data, PRiThe sum of the power of the source node and the power of the cooperative node needs to ensure that the destination node successfully receives and correctly decodes the data packet. The destination node replies with an ACK after successful reception and decoding.
Case 3: fig. 7 is a timing chart of single-node cooperative transmission without cooperative nodes in the second embodiment of the present invention, as shown in fig. 7, if no candidate cooperative node satisfies the above constraint condition of the cooperative node, or there is a candidate cooperative node, but the access waiting time of the single node corresponding to poor channel quality is too long, and exceeds the longest waiting time TmaxThe source node S transmits power P directly in a direct transmission modeDAnd sending the data packet, and replying an ACK packet by the destination node after the destination node successfully receives the data packet.
In steps 208a to 208l of this embodiment, the source node sends an RTS packet after successfully accessing the channel, and if the channel quality between S-D is poor, the destination node D replies a C-CTS to determine a single-node cooperative transmission process. After learning the single-node cooperative transmission process, the candidate cooperative nodes judge whether the candidate cooperative nodes meet the limiting conditions, and the nodes which do not meet the limiting conditions exit cooperative transmission and retreat; candidate cooperative nodes meeting the conditions can calculate single-node access waiting time according to respective channel quality, and if the fact that other candidate cooperative nodes send HTS packets is monitored before the single-node access waiting time is over, the sending of the HTS packets of the candidate cooperative nodes is cancelled, cooperative transmission is quitted, and backoff is performed; if no other candidate cooperative node is sensed to transmit an HTS packet, the candidate cooperative node transmits an HTS packet after the end of the timing. If the source node is at TmaxThe HTS packet is not received within time, the source node sends the data packet directly, and the destination node replies with an ACK packet after successfully decoding the data packet. If the source node is at TmaxAnd receiving HTS packets within time, if two candidate cooperative nodes which have close HTS transmission time are sensed to collide when transmitting, the source node transmits CR packets to decompose the collision, and the candidate cooperative nodes which collide perform random backoff respectively and retransmit the HTS packets. And if the HTS packet is successfully received and correctly decoded, the source node sends a data packet, the cooperative node forwards the data packet, the target node replies an ACK packet after successful joint decoding, and the transmission process is finished.
In step 209, the source node sends a cooperation request sending packet to the destination node.
Further, the format of the C-RTS frame is shown in table 1, and is not described in detail herein.
Step 210, the destination node sends a cooperative clear packet to the source node to notify the source node to perform transmission in a multi-node cooperative transmission manner.
And step 211, the source node determines a plurality of cooperative nodes and transmits the cooperative nodes in a multi-node cooperative transmission mode.
Further, in this embodiment, after the random back-off timer ends, the source node S determines whether E is satisfiedS/E0≥γIf the condition is not met, the source node indicates that the residual energy of the source node is insufficient, the source node S sends a cooperation request to the destination node to send a C-RTS packet, the destination node D does not perform any judgment condition any more, directly replies to the C-CTS control packet, and informs the source node to transmit in a multi-node cooperation transmission mode. After simultaneously listening to the C-RTS and the C-CTS, the neighbor nodes perform competition access among the candidate cooperative nodes, so that the source node selects a plurality of cooperative nodes for multi-node cooperative transmission.
Further, in this embodiment, if the destination node notifies the source node of the transmission in the multi-node cooperative transmission manner, the method further includes the following steps. Fig. 8 is a flowchart of determining a plurality of cooperative nodes and performing transmission by using a multi-node cooperative transmission method according to a second embodiment of the present invention. Steps 211a to 211l are steps of determining a plurality of cooperative nodes and performing transmission by using a multi-node cooperative transmission method.
In step 211a, each candidate cooperative node determines whether it meets the condition of multi-node cooperative transmission, if yes, step 211b is executed, otherwise, step 211l is executed.
Further, the multi-node cooperation transmission condition can be expressed as shown in equations (1), (3) and (4).
HSR≥HSD;HRD≥HSD; (1)
ER≥ES-PDTD; (3)
PSTS<PDTD; (4)
The formula (1) is the same as the formula (1) in the condition that the single node participates in the cooperative transmission, so that the gain of the cooperative link is ensured to be larger than that of the direct transmission link; e in the formula (3)SRepresenting the residual energy, P, of the source nodeDDenotes the transmission power, T, used by the source node in the direct transmission mode for data packet transmissionDRepresenting the sending time of the data packet of the source node during direct transmission, and the formula (3) defines that the residual energy requirement of the cooperative node is greater than that of the source node after direct transmission; p in formula (4)SIndicating the transmission power, T, used by the source node in the coordinated multi-node transmissionSThe sending time of the data packet of the source node in the multi-node cooperative transmission is represented, and the formula (4) limits that the energy consumed by the source node in the cooperative process is less than that consumed in the direct transmission process. Formulas (3) and (4) respectively limit the residual energy of the cooperative node and the energy saving of the source node in the multi-node cooperative transmission process, and present situation that the residual energy of the source node is insufficient in the multi-node cooperative transmission mode is reflected, and the cooperative node can participate in cooperative transmission only under the condition that the energy of the cooperative node is superior to that of the source node; compared with the formula (2), the energy limitation on the cooperative node is relaxed, and the urgency of urgent cooperative transmission of the source node is met.
And step 211b, calculating the multi-node access waiting time according to the channel quality parameters of the candidate cooperative nodes and the source node or the destination node and the residual energy parameters of the candidate cooperative nodes.
Further, in this embodiment, the multi-node access waiting time is calculated according to the channel quality parameters of the candidate cooperative node and the source node or the destination node and the residual energy parameter of the candidate cooperative node, so that the larger the cooperative link channel gain is, the more the residual energy is, the shorter the multi-node access waiting time is for the candidate cooperative node.
In step 211c, the cooperative node determines whether the power allocation flag packet broadcasted by the source node is sensed within the corresponding multi-node cooperative waiting time, if not, step 211d is executed, otherwise, step 211l is executed.
Further, the frame format of the power allocation flag packet (PAI packet) can be represented as shown in table 4, which contains 2-byte frame control, 2-byte duration, 6-byte cooperative node address 1, transmission power of 2-byte cooperative node 1, 6-byte cooperative node address 2, transmission power of 2-byte cooperative node 2, 6-byte cooperative node address 3, transmission power of 2-byte cooperative node 3, and 4-byte frame check. And determining the cooperative nodes participating in cooperative transmission and the forwarding power adopted by the corresponding cooperative nodes through the PAI grouping.
Table 4: frame format for PAI packets
Figure GDA0002291649940000151
In step 211d, the candidate cooperative node determines whether the corresponding multi-node access waiting time is reached, if not, step 211e is executed, otherwise, step 211h is executed.
In step 211e, the candidate cooperative node determines whether it detects a transmission assisting packet sent by another candidate cooperative node to the source node, if so, step 211f is executed, otherwise, step 211g is executed.
In step 211f, the candidate node suspends the multi-node access waiting time counting until the transmission of the help transmission packet transmitted to the source node by other candidate cooperative nodes is finished.
And step 211g, the candidate cooperative nodes continue to time the multi-node access waiting time.
Step 211f is followed by step 211g, and step 211c is followed by step 211 g.
In step 211h, the candidate cooperative node sends a help send packet to the source node.
In step 211i, the source node broadcasts the power allocation flag packet after determining that the maximum waiting time is reached or receiving a preset number of the help transmission packets.
And the power distribution mark packet carries the determined address of each cooperative node and corresponding transmission power.
In step 211j, the candidate cooperative nodes check whether they participate in the multi-node cooperative transmission according to the power distribution flag packet, if so, execute step 211k, otherwise execute step 211 l.
And step 211k, the candidate cooperative node receives the data packet sent by the source node and forwards the data packet to the destination node, and the destination node replies an ACK packet after successful joint decoding.
In step 211l, the candidate node exits the multi-node cooperative transmission mode and performs a back-off operation.
In this embodiment, the present embodiment is described with reference to steps 211a to 211l, and fig. 9 is a success timing chart of a multi-node cooperative transmission mode in the second embodiment of the present invention, as shown in fig. 9, a source node sends a C-RTS packet after successfully accessing a channel because a source node sends a C-RTS packet after successfully accessing a channelAnd S, the residual energy is low, and the destination node D replies the C-CTS to determine the multi-node cooperative transmission process. After learning the multi-node cooperative transmission process, the candidate cooperative node judges whether the candidate cooperative node meets the condition of the multi-node participating in cooperative transmission, and the node which does not meet the condition exits cooperative transmission and backs off; and the candidate cooperative nodes meeting the conditions can calculate the multi-node access waiting time according to the respective channel quality parameters and the residual energy parameters of the candidate cooperative nodes, and if the candidate cooperative nodes receive the PAI packet sent by the source node in the waiting process and indicate that the cooperative node selection process is finished, the candidate cooperative nodes quit the multi-node cooperative transmission and perform backoff. If the PAI packet is not received, the timing of the candidate cooperative node is not finished, if other candidate cooperative nodes are sensed to transmit HTS packets, the multi-node access waiting time timing is suspended, the timing is continued after the HTS packet transmission is finished, and if other candidate cooperative nodes are not sensed, the timing is continued. If the timing of the candidate cooperative node is finished, the HTS packet is sent, and the source node waits for the maximum time TmaxWithin or upon receipt of M HTS packets, a PAI packet is transmitted. Where the values of M are suggested to be three. And after receiving the PAI packet, the candidate cooperative nodes check whether the candidate cooperative nodes are contained in the determined cooperative node group, if not, quit the multi-node cooperative transmission mode and perform backoff, if the candidate cooperative nodes are contained in the cooperative node group, the cooperative nodes forward the data packet after the source node sends the data packet, and after the target node joint decoding succeeds, the ACK packet is replied, and the transmission process is ended.
In the embodiment, the cooperative nodes with relatively sufficient residual energy and good cooperative link quality preferentially participate in cooperative transmission, so that the high effectiveness of the cooperative transmission process is ensured. PAI grouping is adopted to determine nodes participating in cooperative transmission and the adopted transmission power thereof, and the transmission power control of a physical layer is combined with a data link layer MAC protocol through cross-layer design, so that the comprehensive improvement of network performance is facilitated.
Further, in this embodiment, if the destination node notifies the source node and the candidate cooperative node to perform transmission by using a single-node cooperative transmission method or a multi-node cooperative transmission method, the method further includes the following steps.
Firstly, if the destination node informs the source node and the candidate cooperative node to adopt a single-node cooperative transmission mode or a multi-node cooperative transmission mode for transmission, the source node, the destination node or the cooperative node judges whether the piggybacked data packet transmission is needed, if so, the next step is executed, otherwise, the method is ended.
Second, the highest priority link for transmission of the piggybacked data packet is determined to exist.
And finally, carrying out piggyback data packet transmission on the link with the highest priority.
Specifically, in this embodiment, the three steps are performed in the process of determining the cooperative node or the data packet transmission process in the single-node cooperative transmission manner or the multi-node cooperative transmission manner during the steps 201 to 211.
Specifically, in this embodiment, in order to reduce the control packet overhead and increase the network throughput, the method adds a cooperative piggyback data transmission process on the basis of basic data transmission. If there is a need for packet transmission between S or D and R, piggybacking description can be performed in the current transmission control packet interaction process, and then transmission of piggybacked data is performed.
First, since the transmission between the source node S and the destination node D is the main target of the transmission, the data transmission of S-D and D-S has the highest priority and is not considered as piggyback transmission. The piggybacked data packet transmission only considers the piggybacked data packet transmission between the source node S or the destination nodes D and R. The method comprises four conditions of S-R, R-S, R-D and D-R, and if more than two links need piggyback transmission, a link with high priority is selected for piggyback transmission according to the priority sequence.
In this embodiment, the source node, the destination node, or the cooperative node may determine whether to perform piggyback data packet transmission by whether to add a piggyback description field in a corresponding control packet.
The piggyback description fields carried in different control packets sent by different nodes can be used for describing a piggyback sender and a piggyback receiver in the piggyback transmission process, so that the corresponding piggyback receiver can wait for piggyback transmission after basic data transmission is finished, and nodes which do not participate in the piggyback transmission can enter an idle state or a retreat state after the basic data transmission is finished. In addition, if the piggyback receiver determines that the piggyback receiver is in a state of preparing to receive the data packet, the process of describing the piggyback transmission by using the control packet can be skipped, and the piggyback data packet can be directly sent.
It should be noted that, in this embodiment, a single-node cooperative transmission mode is different from a multi-node cooperative transmission mode in that the multi-node cooperative transmission mode needs to select a unique node from a plurality of cooperative nodes for piggybacking the node.
In this embodiment, for the single-node cooperative transmission mode, since the single-node cooperative transmission does not need to select a piggyback party in the cooperative node, the process is simplified, and the following description is given in the order of the link priorities from high to low:
in this embodiment, if a link that is piggybacked by the source node S and sent to the cooperative node R exists in the piggybacked data packet transmission, it is determined that the highest priority link in the piggybacked data packet transmission is: and the source node S is sent to the cooperative node R incidentally. Fig. 10 is a timing diagram illustrating a piggyback transmission sequence from a source node to a cooperative node by a single-node protocol in the second embodiment of the present invention, as shown in fig. 10, a source node S directly transmits a DATA packet P-DATA of a cooperative node R after transmitting the DATA packet D-DATA to a destination node D, the cooperative node forwards a received DATA packet with a destination address D, but does not forward the received DATA packet with the destination address D after receiving the DATA packet, the destination node D successfully receives and jointly decodes the D-DATA packet and then replies an ACK packet to the source node S, and then the cooperative node R replies the ACK packet to the received P-DATA packet to notify a sender that the sender indicates that the sender successfully receives the piggybacked DATA packet.
In this embodiment, if there is no link piggybacked data packet transmission that is piggybacked by the source node S and sent to the cooperative node R, and there is a link piggybacked data packet transmission that is piggybacked and sent to S or D, it is determined that the existing highest priority link for piggybacked data packet transmission is: r is sent to S or D in a piggyback mode. Fig. 11 is a timing diagram illustrating piggybacking transmission of a cooperative node to a source node by a single-node protocol in a second embodiment of the present invention. And after receiving the P-HTS packet sent by the R, the piggybacking receiver waits for the cooperative node R to send piggybacked data after finishing basic data transmission. And after the piggybacking party successfully receives the P-DATA, the piggybacking party replies an ACK packet to the piggybacking party.
Where table 5 is the frame format of the P-HTS packet. It contains 2 byte frame control, 2 byte duration, 6 byte receiving end address, 6 byte sending end address, the sending end address is the address of cooperative node R, 2 byte RiResidual energy information ERi2 bytes Riinter-D channel gain information HRiDAnd the 1-byte piggyback receiver identifier is a source node or destination node identifier and 4-byte frame check. The P-HTS packet is augmented with a piggyback identity field to indicate the piggyback recipient compared to the HTS packet.
Table 5: frame format for P-HTS packets
Figure GDA0002291649940000181
In this embodiment, if there is no link piggybacked data packet transmission that the source node S piggybacks to the cooperative node R, there is no link piggybacked data packet transmission that the R piggybacks to the source node S or the destination node D, and there is only a link piggybacked data packet transmission that the destination node D piggybacks to the cooperative node R, it is determined that the existing highest priority link piggybacked data packet transmission is: and the destination node D piggybacks a data packet transmission link to the cooperative node R.
Fig. 12 is a timing diagram illustrating piggybacking transmission from a destination node to a cooperative node according to a single node protocol in a second embodiment of the present invention, as shown in fig. 12, a piggybacking receiver address is added to a P-ACK packet compared to an ACK packet to indicate that a destination node D has DATA to be piggybacked, after basic transmission is finished, the destination node D may transmit a piggybacked DATA packet P-DATA, and a cooperative node R is configured to transmit a piggybacked DATA packet P-DATA to the cooperative node RiAn ACK packet is replied to the piggyback party for P-DATA after successful reception.
In this embodiment, the source node S is incidentally sent to the cooperative node R, since the sending process from S to R can be directly proceeded toAnd (4) sending the data without negotiating with the R, so that the link which is sent by the source node S to the cooperative node R incidentally is the highest priority link. Link H due to sufficient cooperative node residual energySRAnd HSDAnd the priority of a link for piggybacked data packet transmission sent by the R to the S or D is higher than that of a link sent by the source node S to the cooperative node R. And the link for piggybacking data packet transmission from the destination node D to the cooperative node R only knows H due to unknown residual energy condition of DRDAnd thus the link has the lowest priority.
Table 6 shows a frame format of a P-ACK packet, which includes 2-byte frame control, 2-byte duration, 6-byte receiving end address, 6-byte piggyback receiving end address, and 4-byte frame check, as shown in table 6. The P-ACK packet is added with the address of the piggyback receiver side, namely the address of the selected cooperative node, compared with the ACK packet.
Table 6: frame format for P-ACK packet
Figure GDA0002291649940000191
In this embodiment, for a multi-node cooperative transmission scheme, there may be a plurality of cooperative nodes that perform piggybacking transmission. Therefore, in the process of piggybacking data packet transmission, a process of piggybacking node selection in cooperative nodes is added, and a node for piggybacking data packet transmission is selected, and at this time, the following is described according to the sequence of link priorities.
If the source node S exists in the piggybacked data packet transmission and is sent to the cooperative node R incidentallyiDetermining that there is a highest priority link for piggybacked data packet transmission as: the source node S sends to the cooperative node R incidentallyiThe link of (2). The source node may send P-PAI packets instead of PAI packets.
Wherein, table 7 is a P-PAI frame format, as shown in table 7, it includes 2-byte frame control, 2-byte duration, 6-byte cooperative node address 1, transmission power of 2-byte cooperative node 1, 6-byte cooperative node address 2, transmission power of 2-byte cooperative node 2, 6-wordNode cooperation node address 3, transmission power of 2-byte cooperation node 3, 1-byte piggyback destination node identification and 4-byte frame check. The P-PAI packet is augmented with a 1-byte piggybacked destination node identification compared to the PAI packet to inform the selected corresponding piggybacked destination node Ri
Table 7: P-PAI frame format
Figure GDA0002291649940000201
In this embodiment, after the basic DATA transmission is completed, i.e. the source node S receives the ACK packet for D-DATA sent by the destination node D, S sends an ACK packet to RiSending piggybacked DATA packets P-DATA, RiAn ACK packet is replied to the P-DATA after successful reception. Since the residual energy of S is low, in order to avoid the energy consumption of control packets caused by reinitiating transmission, the source node S sends to the cooperative node R incidentallyiThe link of (1) has the highest priority.
In this embodiment, if the source node S is not incidentally sent to the cooperative node R, the source node S is not sent to the cooperative node RiLink of (2) having RiAnd if the piggybacked data packet transmission link sent to the S or D is piggybacked, determining that the existing highest priority link for the piggybacked data packet transmission is as follows: riAnd sending the data to S or D in a piggyback mode. If the candidate cooperative nodes include nodes which want to carry out piggyback sending, the P-HTS packet can be sent, and the piggyback destination node is designated as a destination node S or a source node D. If a plurality of cooperative nodes send P-HTS packets to indicate that all the cooperative nodes have the intention of piggybacking sending, the source node S sends the P-HTS packets according to the residual energy and the HSR、HRDAnd if the piggybacked destination node is the destination node D, the destination node D can learn whether the piggybacked transmission waiting is needed or not according to the P-HTS packet and the P-PAI packet. Since the piggyback transmission priority of the P-PAI packet notification is highest, the cooperative node finally performs piggyback transmission after the basic data transmission is finished according to the P-PAI packet notification.
In this embodiment, if notPresence source node S incidentally sending to cooperative node RiNor does there exist RiAnd if the piggybacked data packet transmission link which is sent to the S or D is piggybacked, determining that the existing highest priority link for the piggybacked data packet transmission is as follows: destination node D incidentally sends to cooperative node Ri. The destination node address may be specified in the P-ACK packet and D sends the piggybacked data packet after the basic transmission is finished. Since the remaining energy condition of the destination node D is unknown, only H is knownRDTherefore, such cooperation priority is the lowest.
The adaptive cross-layer multiple access method for ensuring the quality of service provided by the embodiment of the invention further comprises the following steps that if the destination node informs the source node and the candidate cooperative node to adopt a single-node cooperative transmission mode or a multi-node cooperative transmission mode for transmission: a source node, a destination node or a cooperative node judges whether piggybacked data packet transmission is needed or not; if the source node, the destination node or the cooperative node needs to carry out piggyback data packet transmission, determining the highest priority link for carrying out piggyback data packet transmission; and carrying out piggyback data packet transmission on the link with the highest priority. The piggyback sending mode can enable the cooperative node to transmit extra data with the source node and the destination node by using the existing communication channel, saves control grouping, time delay and energy expenditure caused by reestablishing connection, and improves the network throughput while prolonging the service life of the network. Since the cooperative nodes are privately engaged in cooperative transmission and consume energy for assisting the transmission of the sender node, a piggyback sending transmission mode is provided for the cooperative nodes on the basis of the existing transmission, and the method is also an incentive for the cooperative nodes to actively participate in the cooperative transmission.
Those of ordinary skill in the art will understand that: all or a portion of the steps of implementing the above-described method embodiments may be performed by hardware associated with program instructions. The foregoing program may be stored in a readable storage medium. When executed, the program performs steps comprising the method embodiments described above; and the aforementioned storage medium includes: various media that can store program codes, such as ROM, RAM, magnetic or optical disks.
Fig. 13 is a schematic structural diagram of a first embodiment of an adaptive cross-layer multiple access system for quality of service assurance according to the present invention, and as shown in fig. 13, the adaptive cross-layer multiple access system for quality of service assurance according to the present embodiment includes: a source node 1201 and a destination node 1202;
the source node 1201 includes: a residual energy parameter determining module 1201 a.
The residual energy parameter determining module 1201a is configured to determine whether a residual energy parameter is greater than or equal to a threshold of a residual energy ratio.
The destination node includes: a channel quality parameter judgment module 1202a, a direct transmission mode determination module 1202b, a single-node cooperative transmission mode determination module 1202c, and a multi-node cooperative transmission mode determination module 1202 d.
The channel quality parameter determining module 1202a is configured to determine whether a channel quality parameter between links of a source node and a destination node is greater than or equal to a channel gain threshold between corresponding links if the source node determines that the remaining energy parameter is greater than or equal to a threshold of the remaining energy ratio. A direct transmission mode determining module 1202b, configured to notify the source node to perform transmission in a direct transmission mode if the source node determines that the remaining energy parameter is greater than or equal to the threshold of the remaining energy ratio, and the destination node determines that the channel quality parameter between the links of the source node and the destination node is greater than or equal to the channel gain threshold between the corresponding links. A single-node cooperative transmission mode determining module 1202c, configured to notify the source node and the candidate cooperative node to perform transmission in a single-node cooperative transmission mode if the source node determines that the residual energy parameter of the source node is greater than or equal to the threshold of the residual energy ratio, and the destination node determines that the channel quality parameter between the links of the source node and the destination node is less than the channel gain threshold between the corresponding links. A multi-node cooperative transmission mode determining module 1202d, configured to notify the source node and the candidate cooperative node to perform transmission in a multi-node cooperative transmission mode if the source node determines that the remaining energy parameter of the source node is smaller than the threshold of the remaining energy ratio.
The adaptive cross-layer multiple access system with guaranteed service quality provided by this embodiment may implement the technical solution of the first embodiment of the adaptive cross-layer multiple access method with guaranteed service quality of the present invention, and its implementation principle and technical effect are similar, and are not described herein again.
Fig. 14 is a schematic structural diagram of a second embodiment of the adaptive cross-layer multiple access system for quality of service assurance according to the present invention, and as shown in fig. 14, the adaptive cross-layer multiple access system for quality of service assurance provided in this embodiment further includes, on the basis of the first embodiment of the adaptive cross-layer multiple access system for quality of service assurance: candidate cooperative node 1203.
Candidate cooperative node 1203 includes: a single-node participating cooperative transmission condition determining module 1203a, a single-node access waiting time calculating module 1203b, a help sending packet intercepting module 1203c, and a first help sending packet sending module 1203 d.
A single-node cooperative transmission participation condition determining module 1203a, configured to determine whether the single-node cooperative transmission participation condition is met or not if the destination node notifies the source node to perform transmission in a single-node cooperative transmission manner. And a single-node access waiting time calculation module 1203b, configured to calculate the single-node access waiting time according to the channel quality parameters of the candidate cooperative node and the source node or the destination node if it is determined that the single-node access waiting time satisfies the condition that the single node participates in the cooperative transmission. A help sending packet interception module 1203c, configured to intercept, within the corresponding single-node access waiting time, whether there are other candidate cooperative nodes to send help sending packets to the source node. A first help sending packet sending module 1203d, configured to send a help sending packet to the source node if the candidate cooperative node does not sense that there is another candidate cooperative node sending the help sending packet to the source node within the corresponding single-node access waiting time.
The source node further includes: a help-send-packet judging module 1201b, a help-send-packet collision judging module 1201c, and a single cooperative node selecting module 1201 d.
The assisted transmission packet determining module 1201b is configured to determine whether a assisted transmission packet is received within a waiting time threshold. A help sending packet collision judging module 1201c, configured to judge whether the received help sending packet can be decoded correctly if the source node determines that the help sending packet is received within the waiting time threshold. A single cooperative node selection module 1201d, configured to determine a single cooperative node according to the received assisted transmission packet if the source node determines that the received assisted transmission packet can be decoded correctly.
Further, the source node further includes: a collision resolution control packet broadcasting module 1201 e.
The conflict resolution control packet broadcasting module 1201e is configured to broadcast a conflict resolution control packet to each candidate cooperative node if the source node determines that the received assisted transmission packet cannot be decoded correctly.
The candidate cooperative node further includes: a back-off operation module 1203e for performing a back-off operation,
the back-off operation module 1203e is configured to perform back-off operation on the multiple candidate cooperative nodes within corresponding random time, and monitor whether there are other candidate cooperative nodes sending help sending packets to the source node within the corresponding random time.
Further, the source node 1201 further includes: a direct transfer mode data packet transmission module 1201f,
the direct transmission mode data packet sending module 1201f is configured to send a data packet to a destination node in a direct transmission mode if the source node determines that the assist sending packet is not received within the waiting time threshold.
Further, the source node 1201 and/or the destination node 1202 and/or the cooperative node further include: a piggyback data packet transmission judging module 1201i, a highest priority link determining module 1201j, a piggyback data packet transmission module 1201k,
the piggybacked data packet transmission determining module 1201i is configured to determine whether piggybacked data packet transmission is required. A highest priority link determining module 1201j, configured to determine, by the corresponding node, the highest priority link for piggyback data packet transmission if the piggyback data packet transmission is required. A piggybacked data packet transmission module 1201k, configured to perform piggybacked data packet transmission on the highest priority link.
The adaptive cross-layer multiple access system with guaranteed service quality provided in this embodiment may implement the technical solution of the second embodiment of the adaptive cross-layer multiple access method with guaranteed service quality, and the implementation principle and technical effect are similar, which are not described herein again.
Fig. 15 is a schematic structural diagram of a third embodiment of the adaptive cross-layer multiple access system for quality of service guarantee according to the present invention, and as shown in fig. 15, the adaptive cross-layer multiple access system for quality of service guarantee provided in this embodiment further includes, on the basis of the first embodiment of the adaptive cross-layer multiple access system for quality of service guarantee according to the present invention: candidate cooperative nodes 1203 and 1204.
Further, the candidate cooperative node 1203 further includes: a multi-node participating cooperative transmission condition judging module 1203f, a multi-node access waiting time calculating module 1203g, and a second help sending packet sending module 1203 h.
A multi-node cooperative transmission condition determining module 1203f, configured to determine whether the destination node notifies the source node of performing transmission in a multi-node cooperative transmission manner, so as to determine whether the destination node meets a multi-node cooperative transmission condition. A multi-node access waiting time calculating module 1203g, configured to calculate, if the candidate cooperative node determines that the candidate cooperative node meets the condition that the multi-node participates in the cooperative transmission, the multi-node access waiting time according to the channel quality parameters of the candidate cooperative node and the source node or the destination node, and the remaining energy parameters of the candidate cooperative node. A second help sending packet sending module 1203h, configured to send a help sending packet to the source node after the corresponding multi-node access waiting time if the candidate cooperative node does not hear the power allocation flag packet broadcasted by the source node within the corresponding multi-node access waiting time;
the source node 1201 further includes: a flag packet broadcasting module 1201g and a data packet transmitting module 1201h are assigned.
The distribution flag packet broadcasting module 1201g is configured to determine a power distribution flag packet according to the received multiple help transmission packets and broadcast the power distribution flag packet, where the power distribution flag packet carries the determined address of each cooperative node and the corresponding transmission power.
A data packet sending module 1201h, configured to send a data packet.
The cooperative node includes: a cooperative node forwarding module 1204 a.
A cooperative node forwarding module 1204a, configured to forward the data packet to the destination node according to the corresponding transmission power.
Further, the source node 1201 and/or the destination node 1202 and/or the cooperative node 1204 further include: a piggyback data packet transmission judging module 1201i, a highest priority link determining module 1201j, a piggyback data packet transmission module 1201k,
the piggybacked data packet transmission determining module 1201i is configured to determine whether piggybacked data packet transmission is required. A highest priority link determining module 1201j, configured to determine, by the corresponding node, the highest priority link for piggyback data packet transmission if the piggyback data packet transmission is required. A piggybacked data packet transmission module 1201k, configured to perform piggybacked data packet transmission on the highest priority link.
The adaptive cross-layer multiple access system with guaranteed service quality provided in this embodiment may implement the technical solution of the second embodiment of the adaptive cross-layer multiple access method with guaranteed service quality, and the implementation principle and technical effect are similar, which are not described herein again.
Finally, it should be noted that: the above embodiments are only used to illustrate the technical solution of the present invention, and not to limit the same; while the invention has been described in detail and with reference to the foregoing embodiments, it will be understood by those skilled in the art that: the technical solutions described in the foregoing embodiments may still be modified, or some or all of the technical features may be equivalently replaced; and the modifications or the substitutions do not make the essence of the corresponding technical solutions depart from the scope of the technical solutions of the embodiments of the present invention.

Claims (12)

1. An adaptive cross-layer multiple access method for guaranteeing service quality, comprising:
the source node judges whether the residual energy parameter is greater than or equal to the threshold of the residual energy ratio;
if the source node determines that the residual energy parameter is greater than or equal to the threshold of the residual energy ratio, the destination node judges whether the channel quality parameter between the links of the source node and the destination node is greater than or equal to the channel gain threshold between the corresponding links;
if the source node determines that the residual energy parameter is greater than or equal to the threshold of the residual energy ratio, and the destination node determines that the channel quality parameter between the links of the source node and the destination node is greater than or equal to the channel gain threshold between the corresponding links, the destination node informs the source node of adopting a direct transmission mode for transmission;
if the source node determines that the residual energy parameter is larger than or equal to the threshold of the residual energy ratio, and the destination node determines that the channel quality parameter between the links of the source node and the destination node is smaller than the channel gain threshold between the corresponding links, the destination node informs the source node and the candidate cooperative node to adopt a single-node cooperative transmission mode for transmission;
if the source node determines that the residual energy parameter is smaller than the threshold of the residual energy ratio, the destination node informs the source node and the candidate cooperative nodes to adopt a multi-node cooperative transmission mode for transmission;
the residual energy parameter of the source node is the ratio of the residual energy of the source node to the initial energy;
the channel quality parameter between the links of the source node and the destination node is the channel gain between the links, and is expressed as: hSD=Prec/PmaxWherein P isrecFor received power of RTS packet, PmaxIs the maximum received power between links.
2. The method of claim 1, wherein if the destination node notifies the source node and the candidate cooperative node to perform transmission in a single-node cooperative transmission manner, the method further comprises:
each candidate cooperative node judges whether the candidate cooperative node meets the cooperative transmission condition of single node participation;
if the candidate cooperative node determines that the candidate cooperative node meets the condition that the single node participates in cooperative transmission, calculating the single node access waiting time according to the channel quality parameters of the candidate cooperative node and the source node or the destination node;
the candidate cooperative nodes monitor whether other candidate cooperative nodes send help sending packets to the source node within the corresponding single-node access waiting time;
if the candidate cooperative node does not sense that other candidate cooperative nodes send the help sending packet to the source node within the corresponding single-node access waiting time, sending the help sending packet to the source node;
the source node judges whether a help-to-send packet is received within a waiting time threshold;
if the source node determines that the help-to-send packet is received within the waiting time threshold, the source node judges whether the received help-to-send packet can be correctly decoded;
and if the source node determines that the received help-to-send packet can be decoded correctly, the source node determines a single cooperative node according to the received help-to-send packet.
3. The method of claim 2, further comprising:
if the source node determines that the received help-to-send packet cannot be decoded correctly, the source node broadcasts a conflict resolution control packet to each candidate cooperative node;
and the candidate cooperative nodes carry out backoff operation in corresponding random time respectively and sense whether other candidate cooperative nodes send help sending packets to the source node in the corresponding random time.
4. The method of claim 3, further comprising:
and if the source node determines that the help sending packet is not received within the waiting time threshold, the source node sends the data packet to the destination node by adopting a direct transmission mode.
5. The method according to any one of claims 1 to 4, wherein if the destination node notifies the source node and the candidate cooperative node to perform transmission by using a multi-node cooperative transmission method, the method further comprises:
each candidate cooperative node judges whether the candidate cooperative node meets the cooperative transmission condition of the multi-node;
if the candidate cooperative node determines that the candidate cooperative node meets the condition that the multiple nodes participate in cooperative transmission, calculating the access waiting time of the multiple nodes according to the channel quality parameters of the candidate cooperative node and a source node or a destination node and the residual energy parameters of the candidate cooperative node;
if the candidate cooperative node does not monitor the power distribution flag packet broadcast by the source node within the corresponding multi-node access waiting time, the candidate cooperative node sends a help sending packet to the source node after the corresponding multi-node access waiting time;
the source node determines the power distribution mark packet according to the received multiple help sending packets and broadcasts the power distribution mark packet, wherein the power distribution mark packet carries the determined address of each cooperative node and the corresponding sending power;
the source node sends a data packet;
and each cooperative node forwards the data packet to a destination node according to the corresponding sending power.
6. The method of claim 5, wherein if the destination node notifies the source node and the candidate cooperative node to perform transmission in a single-node cooperative transmission manner or a multi-node cooperative transmission manner, the method further comprises:
a source node, a destination node or a cooperative node judges whether piggybacked data packet transmission is needed or not;
if the source node, the destination node or the cooperative node needs to transmit the piggybacked data packet, determining the highest priority link for transmitting the piggybacked data packet;
and carrying out piggyback data packet transmission on the link with the highest priority.
7. An adaptive cross-layer multiple access system with quality of service guarantees, comprising: a source node and a destination node;
the source node includes:
the residual energy parameter judging module is used for judging whether the residual energy parameter is greater than or equal to the threshold of the residual energy ratio;
the destination node includes:
a channel quality parameter judgment module, configured to judge whether a channel quality parameter between links of the source node and the destination node is greater than or equal to a channel gain threshold between corresponding links if the source node determines that the remaining energy parameter is greater than or equal to a threshold of a remaining energy ratio;
a direct transmission mode determining module, configured to notify the source node of performing transmission in a direct transmission mode if the source node determines that the remaining energy parameter of the source node is greater than or equal to a threshold of a remaining energy ratio, and the destination node determines that a channel quality parameter between links of the source node and the destination node is greater than or equal to a channel gain threshold between corresponding links;
a single-node cooperative transmission mode determining module, configured to notify the source node and the candidate cooperative node to perform transmission in a single-node cooperative transmission mode if the source node determines that the residual energy parameter of the source node is greater than or equal to a threshold of a residual energy ratio and the destination node determines that a channel quality parameter between links of the source node and the destination node is less than a channel gain threshold between corresponding links;
a multi-node cooperative transmission mode determining module, configured to notify the source node and the candidate cooperative node to perform transmission in a multi-node cooperative transmission mode if the source node determines that the remaining energy parameter of the source node is smaller than a threshold of a remaining energy ratio;
the residual energy parameter of the source node is the ratio of the residual energy of the source node to the initial energy;
the channel quality parameter between the links of the source node and the destination node is the channel gain between the links, and is expressed as: hSD=Prec/PmaxWherein P isrecFor received power of RTS packet, PmaxIs the maximum received power between links.
8. The system of claim 7, further comprising: a candidate cooperative node; the candidate cooperative nodes include:
the single-node cooperative transmission participation condition judging module is used for judging whether the single-node cooperative transmission participation condition is met or not if the target node informs the source node of adopting a single-node cooperative transmission mode to carry out transmission;
the single-node access waiting time calculation module is used for calculating the single-node access waiting time according to the channel quality parameters of the candidate cooperative node and the source node or the destination node if the single-node access waiting time calculation module meets the condition that the single node participates in cooperative transmission;
the help sending packet interception module is used for intercepting whether other candidate cooperative nodes send help sending packets to the source node within the corresponding single-node access waiting time;
a first help sending packet sending module, configured to send a help sending packet to the source node if the candidate cooperative node does not sense that there is another candidate cooperative node sending the help sending packet to the source node within the corresponding single-node access waiting time;
the source node further comprises:
a help-send packet determining module for determining whether a help-send packet is received within a waiting time threshold;
a transmission aid packet collision judgment module, configured to judge whether the received transmission aid packet can be decoded correctly if the source node determines that the transmission aid packet is received within the waiting time threshold;
and the single cooperative node selection module is used for determining a single cooperative node according to the received help sending packet if the source node determines that the received help sending packet can be decoded correctly.
9. The system of claim 8, wherein the source node further comprises:
a conflict resolution control packet broadcasting module, configured to broadcast a conflict resolution control packet to each candidate cooperative node if the source node determines that the received help-to-send packet cannot be decoded correctly;
the candidate cooperative node further includes:
and the back-off operation module is used for performing back-off operation on the candidate cooperative nodes in corresponding random time respectively and monitoring whether other candidate cooperative nodes send help sending packets to the source node in the corresponding random time.
10. The system of claim 9, wherein the source node further comprises:
and the direct transmission mode data packet sending module is used for sending the data packet to the destination node by adopting a direct transmission mode if the source node determines that the help sending packet is not received within the waiting time threshold.
11. The system of any one of claims 7-10, further comprising: a cooperative node;
the candidate cooperative node further includes:
a multi-node cooperative transmission condition judgment module, configured to judge whether the multi-node cooperative transmission condition is satisfied or not if the destination node notifies the source node to perform transmission in a multi-node cooperative transmission manner;
a multi-node access waiting time calculation module, configured to calculate multi-node access waiting time according to channel quality parameters of the candidate cooperative node and a source node or a destination node and remaining energy parameters of the candidate cooperative node if the candidate cooperative node determines that the candidate cooperative node satisfies a multi-node cooperative transmission condition;
a second help sending packet sending module, configured to send a help sending packet to the source node after the corresponding multi-node access waiting time if the candidate cooperative node does not monitor the power allocation flag packet broadcast by the source node within the corresponding multi-node access waiting time;
the source node further comprises:
a distribution mark packet broadcasting module, configured to determine the power distribution mark packet according to the received multiple help transmission packets and broadcast the power distribution mark packet, where the power distribution mark packet carries the determined address of each cooperative node and the corresponding transmission power;
a data packet sending module for sending data packets;
the cooperative node includes:
and the cooperative node forwarding module is used for forwarding the data packet to the destination node according to the corresponding sending power.
12. The system of claim 11,
the source node and/or the destination node and/or the cooperative node further comprises:
the piggybacked data packet transmission judging module is used for judging whether the piggybacked data packet transmission is required or not;
a highest priority link determining module, configured to determine, by the corresponding node, a highest priority link for piggyback data packet transmission if the piggyback data packet transmission is required;
and the piggybacked data packet transmission module is used for carrying out piggybacked data packet transmission on the link with the highest priority.
CN201611256684.7A 2016-12-30 2016-12-30 Self-adaptive cross-layer multiple access method and system for ensuring service quality Active CN106851768B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201611256684.7A CN106851768B (en) 2016-12-30 2016-12-30 Self-adaptive cross-layer multiple access method and system for ensuring service quality

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201611256684.7A CN106851768B (en) 2016-12-30 2016-12-30 Self-adaptive cross-layer multiple access method and system for ensuring service quality

Publications (2)

Publication Number Publication Date
CN106851768A CN106851768A (en) 2017-06-13
CN106851768B true CN106851768B (en) 2020-03-27

Family

ID=59113779

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201611256684.7A Active CN106851768B (en) 2016-12-30 2016-12-30 Self-adaptive cross-layer multiple access method and system for ensuring service quality

Country Status (1)

Country Link
CN (1) CN106851768B (en)

Families Citing this family (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109196946B (en) * 2018-08-15 2022-06-03 北京小米移动软件有限公司 Back-off method, device, equipment, system and storage medium in transmission process
CN109068401A (en) * 2018-09-19 2018-12-21 东莞方凡智能科技有限公司 Foreign-going ship intelligent monitor system
CN109407002A (en) * 2018-09-19 2019-03-01 东莞方凡智能科技有限公司 Motor device is health management system arranged
CN109278793A (en) * 2018-09-19 2019-01-29 东莞方凡智能科技有限公司 Train rail condition intelligent detection system
CN109688557B (en) * 2019-02-21 2020-10-23 中国联合网络通信集团有限公司 Cooperative node selection method and device

Citations (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101577956A (en) * 2009-06-15 2009-11-11 北京邮电大学 Method and system for selecting collaboration relay node
CN101977391A (en) * 2010-10-15 2011-02-16 北京邮电大学 Multiple terminal cooperative communication method in cognition wireless network
CN104066142A (en) * 2013-03-22 2014-09-24 中国移动通信集团湖南有限公司 Method for determining data transmission path in wireless sensor network and device thereof
US9083422B2 (en) * 2011-06-17 2015-07-14 Kabushiki Kaisha Toshiba Wireless communications methods and apparatus
EP2995009A1 (en) * 2013-05-08 2016-03-16 Sabanci Üniversitesi Cooperative mac protocol with relay selection and power control
CN105898875A (en) * 2016-05-12 2016-08-24 华南师范大学 Communication method and system of distributed multichannel network
CN106162659A (en) * 2016-06-30 2016-11-23 杭州电子科技大学 A kind of LEO system DCS signal reconfiguring method of energy efficiency priority time delay tolerance
EP3105989A1 (en) * 2014-02-13 2016-12-21 Telefonaktiebolaget LM Ericsson (publ) Method for selecting a device to act as a relay device between a first and a second node based on received signal quality measurements

Family Cites Families (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7822029B2 (en) * 2008-11-14 2010-10-26 Mitsubishi Electric Research Laboratories, Inc. Method for routing packets in ad-hoc networks with partial channel state information

Patent Citations (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101577956A (en) * 2009-06-15 2009-11-11 北京邮电大学 Method and system for selecting collaboration relay node
CN101977391A (en) * 2010-10-15 2011-02-16 北京邮电大学 Multiple terminal cooperative communication method in cognition wireless network
US9083422B2 (en) * 2011-06-17 2015-07-14 Kabushiki Kaisha Toshiba Wireless communications methods and apparatus
CN104066142A (en) * 2013-03-22 2014-09-24 中国移动通信集团湖南有限公司 Method for determining data transmission path in wireless sensor network and device thereof
EP2995009A1 (en) * 2013-05-08 2016-03-16 Sabanci Üniversitesi Cooperative mac protocol with relay selection and power control
EP3105989A1 (en) * 2014-02-13 2016-12-21 Telefonaktiebolaget LM Ericsson (publ) Method for selecting a device to act as a relay device between a first and a second node based on received signal quality measurements
CN105898875A (en) * 2016-05-12 2016-08-24 华南师范大学 Communication method and system of distributed multichannel network
CN106162659A (en) * 2016-06-30 2016-11-23 杭州电子科技大学 A kind of LEO system DCS signal reconfiguring method of energy efficiency priority time delay tolerance

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
A Power-Optimized Cooperative MAC Protocol for Lifetime Extension in Wireless Sensor Networks;Liu Kai,Wu Shan,Liu Feng,Xu Zhen;《sensors》;20161001;全文 *
CRAHN网络节点间协作中继方案研究及物理层实现;卢诗尧;《中国优秀硕士学位论文全文数据库 信息科技辑》;20160515;全文 *

Also Published As

Publication number Publication date
CN106851768A (en) 2017-06-13

Similar Documents

Publication Publication Date Title
CN106851768B (en) Self-adaptive cross-layer multiple access method and system for ensuring service quality
US10892979B2 (en) Routing multiple data streams simultaneously in wireless networks
EP2289257B1 (en) Apparatus and computer program storage device for multicast transmissions in wireless local area networks
US8400960B2 (en) Method of distributive reservation of a medium in a radio communications network
US20160330788A1 (en) Mobile radio communication devices and methods for controlling a mobile radio communication device
US7656831B2 (en) Method and apparatus for power saving in beacon generation of wireless networks in ad hoc mode
US20160073288A1 (en) Reducing contention in a peer-to-peer data link network
US8737281B2 (en) Apparatus for multicast transmissions in wireless local area networks
US20180020476A1 (en) Apparatus and method for simultaneous transmit and receive network mode
US11405944B2 (en) Coordinated stations in OBSS with shared TXOP in the frequency domain
CN106559903B (en) Method for establishing end-to-end communication link, access point and site
US10306602B2 (en) Data transmission method and apparatus
Dang et al. Multi-channel MAC protocol with Directional Antennas in wireless ad hoc networks
CN102625367B (en) Time slot optimized multichannel multiple-access control method in multi-hop Ad Hoc network
US20220264582A1 (en) Method and device for processing network allocation vector
Dang et al. A sinr-based mac protocol for wireless ad hoc networks
CN107181571B (en) Feedback method and system of wireless channel information in wireless network
US20190098662A1 (en) Simultaneous transmit and receive operation in wlans
CN106900073B (en) End-to-end communication method, access point and first site
US20230047705A1 (en) Restricted target wake time service period termination
WO2016201693A1 (en) Data transmission method and apparatus
Nacef et al. COSMIC: a cooperative MAC protocol for WSN with minimal control messages
Palacios et al. Coding-aware MAC: Providing channel access priority for network coding with reverse direction DCF in IEEE 802.11-based wireless networks
WO2023017340A1 (en) Restricted target wake time service period termination
CN110856141A (en) Reliable and effective vehicle-mounted self-organizing network multi-channel MAC protocol

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