WO2011137680A1 - 无线中继网络的中继节点选择与功率分配的方法和设备 - Google Patents

无线中继网络的中继节点选择与功率分配的方法和设备 Download PDF

Info

Publication number
WO2011137680A1
WO2011137680A1 PCT/CN2011/071283 CN2011071283W WO2011137680A1 WO 2011137680 A1 WO2011137680 A1 WO 2011137680A1 CN 2011071283 W CN2011071283 W CN 2011071283W WO 2011137680 A1 WO2011137680 A1 WO 2011137680A1
Authority
WO
WIPO (PCT)
Prior art keywords
node
energy
power allocation
relay
price
Prior art date
Application number
PCT/CN2011/071283
Other languages
English (en)
French (fr)
Inventor
柯峰
庄宏成
冯穗力
Original Assignee
华为技术有限公司
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 华为技术有限公司 filed Critical 华为技术有限公司
Priority to EP11777101A priority Critical patent/EP2538726A4/en
Publication of WO2011137680A1 publication Critical patent/WO2011137680A1/zh
Priority to US13/622,285 priority patent/US20130016652A1/en

Links

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
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W84/00Network topologies
    • H04W84/02Hierarchically pre-organised networks, e.g. paging networks, cellular networks, WLAN [Wireless Local Area Network] or WLL [Wireless Local Loop]
    • H04W84/04Large scale networks; Deep hierarchical networks
    • H04W84/042Public Land Mobile systems, e.g. cellular systems
    • H04W84/047Public Land Mobile systems, e.g. cellular systems using dedicated repeater stations
    • 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

Definitions

  • the present invention relates to the field of wireless communications, and in particular, to a method and a communication device for relay node selection and power allocation of a wireless relay network. Background technique
  • the relay technology can cover the users in the "blind spot” and "hot spot” areas of the cell by relaying on the one hand, thereby reducing The wireless transmit power improves the quality of the received signal, thereby greatly improving the network coverage and increasing the channel capacity.
  • the network structure can be stabilized, managed simply and efficiently, and can be simplified. Protocol design. Therefore, the wireless relay network using the relay technology has become the most promising wireless communication network in the future mobile communication field.
  • the relay node may Provided by different service providers or individuals. Therefore, in many cases, the relay node in the wireless relay network is implemented by the user terminal using the battery, and the relay node with less battery power is unwilling to use its own limited resources (including energy, time, bandwidth) for other users. Service, network life is affected. In addition, in order to ensure the stability of the network topology, in order to achieve uninterrupted data transmission, it is also necessary to extend the network life as much as possible. Therefore, a major problem facing wireless relay networks is how to effectively extend network lifetime.
  • the network lifetime is generally defined as the network from the start of work to the first node consumption. The time required to complete the energy.
  • MIE Minimum Energy
  • MARE Maximum Residual Energy
  • MAEE Maximum Residual Energy Efficiency
  • the technical problem to be solved by the embodiments of the present invention is to provide a method and a communication device for relay node selection and power allocation of a wireless relay network, so as to balance the improvement of energy utilization efficiency and the balance of node energy consumption, thereby effectively extending The service life of wireless relay networks improves network performance.
  • an embodiment of the present invention provides a method for relay node selection and power allocation of a wireless relay network, where the method includes:
  • the node and power allocation corresponding to the minimum value of the target function values of the respective nodes at the time of power allocation are respectively determined as relay nodes and power allocations for data transmission.
  • an embodiment of the present invention provides a communication device for relay node selection and power allocation of a wireless relay network, where the communication device includes:
  • An obtaining module configured to obtain energy prices of nodes in the wireless relay network, and link information of links between each node and a neighboring node, where the energy price is determined such that the remaining energy of the node is less, the node is The higher the energy price;
  • a first determining module configured to determine, according to an energy price of each node and link information, a power corresponding to each node when the target function value of the energy price of the node is the smallest, when the node is selected as the relay node Assignment
  • a second determining module configured to determine, according to power allocation and energy price of each node, a node and a power allocation corresponding to a minimum value of the target function values of each node at the time of power allocation, respectively Relay node and power allocation for data transmission.
  • the embodiment of the present invention determines the selection of the relay node and the allocation of the power by the objective function based on the energy price. Since the energy price in the embodiment of the present invention is determined such that the remaining energy of the node is less, the node has The higher the energy price, the higher the priority node considers the node with more residual energy as the relay node, thus having the advantage of equalizing the energy consumption of each node for the entire wireless relay network; on the other hand, due to the relay node and the source The node uses the power allocation when the value of the objective function is the smallest, thereby improving the energy utilization efficiency of the node. Therefore, the embodiment of the present invention takes into consideration the improvement of energy utilization efficiency and the balance of node energy consumption in node cooperative transmission, thereby effectively extending the service life of the wireless relay network and improving network performance.
  • FIG. 1 is a flow chart showing a method of relay node selection and power allocation of a wireless relay network according to an embodiment of the present invention
  • FIG. 2 is a schematic diagram showing a time division multiplexing based cooperative transmission scheme suitable for an embodiment of the present invention
  • FIG. 3 shows a schematic diagram of solving power allocation according to an embodiment of the present invention
  • FIG. 4 is a flow chart showing a method of relay node selection and power allocation of a wireless relay network according to another embodiment of the present invention.
  • FIG. 5 is a diagram showing a comparison of residual energy of nodes of a network in a case where a method according to an embodiment of the present invention and an existing method are respectively employed in a given wireless relay network;
  • FIG. 6 is a diagram showing a comparison of energy utilization rates in a case where a method according to an embodiment of the present invention and an existing method are respectively employed in a given wireless relay network;
  • Figure 7 is a diagram showing a comparison of network lifetimes in a case where a method according to an embodiment of the present invention and an existing method are respectively employed in a given wireless relay network;
  • FIG. 8 is another schematic diagram showing network lifetime comparison in a case where a method according to an embodiment of the present invention and an existing method are respectively employed in a given wireless relay network; Schematic diagram of the distribution of communication devices; and
  • FIG. 10 is a block diagram showing the structure of a communication device for relay node selection and power allocation of a wireless relay network according to another embodiment of the present invention. detailed description
  • an embodiment of the present invention provides a method 100 for relay node selection and power allocation in a wireless relay network, the method comprising:
  • S120 Determine, according to the energy price of each node and the link information, a power allocation corresponding to each node when the target function value of the energy price of the node is the smallest, when the node is selected as the relay node.
  • S130 Determine, according to power allocation and energy price of each node, a node and a power allocation corresponding to a minimum value of the target function values of each node at the time of power allocation, respectively, as a relay node and power allocation for data transmission.
  • the source node can obtain the energy price of each node in the network. And link information of the link between each node and the neighbor node, wherein the energy price is determined such that the less the remaining energy of the node, the higher the energy price of the node. Subsequently, the source node is based on the energy price of each node and each link information. For each node, it is assumed that each node, when selected as the relay node, separately determines an objective function based on the energy price of the node.
  • the source node Determining, according to the determined power allocation of each node and the energy price, a node corresponding to the minimum value of the target function values of each node at the time of power allocation as a relay node for data transmission, and simultaneously corresponding power of the node The allocation is determined as the power allocation for data transmission.
  • the source node can perform data transmission based on the determined relay node and power allocation.
  • the energy function based on the energy price determines the power allocation when each node is selected as the relay node. And determining, according to the determined power allocation, a minimum value of the target function values of each node in the power allocation, determining a node corresponding to the minimum value as a relay node, and determining a power allocation corresponding to the node as Power allocation for data transmission.
  • the energy price in the embodiment of the present invention is determined such that the remaining energy of the node is less, the energy price of the node is higher, and thus the source node preferentially considers the node with more residual energy as the relay node, thereby
  • the network has the advantage of balancing the energy consumption of each node; on the other hand, since the relay node and the source node use the power allocation when the value of the objective function is the smallest, the energy utilization efficiency of the node is improved. Therefore, the embodiment of the present invention takes into consideration the improvement of the energy utilization efficiency and the balance of the node energy consumption in the cooperative transmission of the node, thereby effectively extending the service life of the wireless relay network and improving the network performance.
  • the source node acquires energy prices of nodes in the wireless relay network, and link information of links between the nodes and the neighbor nodes, wherein the energy price is determined such that the remaining energy of the nodes is less. The higher the energy price of the node.
  • the source node may be a network side device, including but not limited to a base station, a radio network controller, a wireless network subsystem, etc.; the source node may also be a user equipment, including but not limited to a mobile phone, a portable computer, Personal digital assistants, portable game consoles, portable multimedia players, etc.; or the source node can also be other communication devices.
  • a network side device including but not limited to a base station, a radio network controller, a wireless network subsystem, etc.
  • the source node may also be a user equipment, including but not limited to a mobile phone, a portable computer, Personal digital assistants, portable game consoles, portable multimedia players, etc.
  • the source node can also be other communication devices.
  • the source node can obtain the required energy price and link information for each node from its own memory, or obtain the required energy price and link information from each node in a manner well known in the art.
  • the source node may first obtain the required energy information of each node from its own memory, or obtain the required energy information from each node by a method known in the art, and then calculate the required energy price based on the energy information. Thereby obtaining the required energy price.
  • the source node may send a request message by broadcasting, and each node may respond to the request message to provide its own energy information/energy price and link information of a link with a neighbor node to the source node, of course, each node may separately The energy information/energy price and link information are provided to the source node.
  • the request message may be a specially defined message, or may be an extension of an existing message, and the request message may also be other existing control messages for requesting a transmission path, and the reserved fields of the control messages are used to carry the need to be transmitted to Energy information/energy price and link information of the source node.
  • the energy price of each node may be determined to be proportional to the power function of the ratio of the initial total energy of the node to the remaining energy.
  • the energy price of each node can be determined to be proportional to the first or second power function of the ratio of the initial total energy to the remaining energy of the node.
  • the energy price of a node can be as follows:
  • the initial energy price for the jth node, m is 1 or 2.
  • obtaining the energy price of each node in the wireless relay network includes: acquiring initial total energy and remaining energy of each node, and calculating an energy price of each node; or directly acquiring each node Energy price.
  • the link information is information about a link between adjacent nodes on the path.
  • the link information may include complex channel fading coefficients or channel gains of the link, link bandwidth, nodes at both ends of the link, and their neighbor nodes.
  • the link information may also include a complex channel fading coefficient or channel gain and a link bandwidth of the source node and the destination node link and the two links of the relay node and the destination node link.
  • the relevant parameters of the link can be known, and the transmission of the link can be known.
  • the source node determines, according to the energy price of each node and the link information, that each node is selected as the relay node. In the case of the power allocation corresponding to the minimum value of the objective function value of the energy price of the node.
  • the objective function based on the energy price of a node may be a linear function of the energy price of the node and the source node, or may be the energy price of the node and the source node. Quadratic functions, power functions, etc.
  • the objective function based on the energy price of a node is a linear function of the energy price of the node and the source node.
  • the objective function may be a function of the sum of the energy costs consumed by the source node and the node, where the energy cost of the node is the product of the energy consumed by the node and the energy price of the node.
  • the power and energy price consumed by the source node is almost constant, or the change is small, at this time, based on the energy price of a certain node.
  • the objective function may also be a linear function only about the energy price of the node, or a quadratic function, a power function, or the like only regarding the energy price of the node. For example, if the data transmission rate is very high, then for the source node, the source node will transmit data at maximum power, regardless of which intermediate node is selected as the relay node, at which point the source node can be selected based on only the assumptions.
  • the power allocation is determined as an objective function of the energy price of the node of the relay node. Since the relay node and the source node use the power allocation when the value of the objective function is the smallest, the energy utilization efficiency of the node is improved.
  • the source node determines the node and the power allocation corresponding to the minimum value of the target function values of each node at the time of power allocation as the relay node for data transmission, respectively, based on the power allocation of each node and the energy price. And power distribution.
  • the source node may first calculate the target function value of each node in the power allocation based on the determined power allocation when each node is selected as the relay node, and then from all the objective function values. A minimum value is selected, and a node corresponding to the minimum value is determined as a relay node, and a power allocation corresponding to the node is determined as a power allocation for data transmission.
  • the source node can also first calculate the target function value of a node in power allocation, and then compare it with the target function value of other nodes in power allocation until the minimum objective function value is found, thereby determining the relay node's Selection and power distribution.
  • other methods known in the art can be used to determine the minimum objective function value, thereby determining the selection and power allocation of the relay node.
  • the target function value of the node at the time of power allocation is already the minimum value of the objective function of the energy price of the node, and therefore, for each node determined by the source node during power allocation
  • the minimum of the objective function values which is the minimum value of the minimum value of the objective function under various power conditions for all intermediate nodes.
  • the energy price in the embodiment of the present invention is determined such that the remaining energy of the node is less, the energy price of the node is higher, and thus the source node preferentially considers the node with more residual energy as the relay node, thereby
  • the network has the advantage of balancing the energy consumption of each node; on the other hand, The power allocation when the target function value is the smallest is used for the relay node and the source node, thereby improving the energy utilization efficiency of the node. Therefore, the embodiment of the present invention takes into consideration the improvement of the energy utilization efficiency and the balance of the node energy consumption in the cooperative transmission of the node, thereby effectively extending the service life of the wireless relay network and improving the network performance.
  • Figure 2 illustrates a cooperative transmission scheme based on a decoding forwarding protocol suitable for use with the present invention.
  • the relay set is represented by ⁇ , and each relay in ⁇ can cooperate with the data transmission of the source node S. It is assumed that the channel conditions remain stable during each data block transmission.
  • the cooperative transmission mechanism is based on time division multiplexing.
  • the transmission time slot allocated to the data block is ⁇ and is divided into two phases, each of which has a length of ⁇ /2.
  • phase 1 the source node broadcasts data to all relay and destination nodes.
  • phase 2 (as shown in Figure 2 (b))
  • source node S selects an optimal relay R from the relay set ⁇ . Pi for collaborative transmission. That is, the selected relay demodulates and decodes the received signal, re-channelizes the estimated signal, modulates it, and transmits it to the destination node.
  • the destination node combines the signals received in the two phases to obtain the final estimated value.
  • the data symbol to be sent by the source node S is represented by 1 ⁇ 2 .
  • ⁇ ,! ⁇ denotes the complex channel fading coefficient of the S ⁇ D link, S ⁇ R (W link and R) ⁇ J D link, respectively.
  • the transmission bandwidth of the relay network is represented by W.
  • the S ⁇ D link, the S ⁇ RW link, and the Gaussian white noise on the R ⁇ ⁇ J D link satisfy n SD , n SR(k) , n R(k)D -CN( , a 2 ).
  • the source node needs to select a chance relay from the relay set ⁇ to implement cooperative transmission and determine the transmit power of the source node S and the relay node, 3 ⁇ 4 .
  • the source node S broadcasts the symbol x s to the relay node in the destination node D and ⁇ , so that the symbols received by the destination node D and the relay Rw can be obtained as follows Shown as follows:
  • the relay R (w demodulates the received signal, decodes, re-encodes the estimated symbol, modulates, and transmits the power at the second stage with ⁇ ).
  • the final data is obtained by maximizing the ratio of the signals from the source node and the relay.
  • the reachability rate of the entire link is determined by the minimum value of the S ⁇ R(k) link and the signal to noise ratio (Signal to Noise Rate, hereinafter referred to as "SNR") of the S ⁇ D and ⁇ D links. That is, as shown in the following formula:
  • the user can be regarded as a buyer, and by purchasing energy from the source node and the relay node, the data block is transmitted, and the consumption rate is kept as low as possible while maintaining the transmission rate/ 3 ⁇ 4 . cost.
  • All the relay nodes in the source node (S) and ⁇ can be regarded as sellers, and the energy is priced according to the amount of energy remaining.
  • Equation (6) p s , the energy price of the source node (S) and the relay node RW, respectively, and assume that the pricing strategy of the node satisfies the formula (1), that is, the energy price of each node can be determined as the initial with the node
  • the first or second power function of the ratio of total energy to residual energy is proportional.
  • the optimal relay nodes are available as follows:
  • h l ⁇ x ⁇ - ⁇ 2 2 ⁇ w - ⁇ -A R ⁇ klD x) ( 11 )
  • the absolute value of the slope of the cost contour ⁇ is now greater than the absolute value of the slope of the signal-to-noise ratio (SNR) contour, indicating that the energy price of the source node S is too high.
  • the user consumes as little energy as possible from the source node.
  • the signal-to-noise ratio (SNR) contour is S, and the optimal power distribution point is above the line segment AB;
  • the optimal power distribution point is above the line segment AC. Then the optimal power allocation vector can be obtained as shown in equation (13):
  • the absolute value of the slope of the cost contour is less than the slope of the signal-to-noise ratio (SNR) contour Si , when / (i o) ⁇ i h ⁇ /(n x ), the SNR contour is, the optimal power distribution point is above the line segment BD as shown; when / ⁇ , ⁇ ) ⁇ / 3 ⁇ 4 ⁇ / ⁇ , ⁇ ), the SNR contour is &, the most The best power distribution point is shown in Figure 4, which is above the line segment CD. Then the optimal power allocation vector can be obtained as shown in equation (14):
  • the source node acquires the energy price of each node in the wireless relay network, and the source node and the destination node and The channel gain of the two links of the intermediate node and the destination node.
  • the source node calculates the minimum power required for the neighbor node to meet / 6 , that is, the source node in the valid S ⁇ RW link is established.
  • each node can be directly determined according to equations (13) and (14). Power allocation when selected as a relay node.
  • the source node determines the optimal relay node based on the power allocation of each node and the energy price based on equation (7), thereby determining the power allocation corresponding to the relay node as the power allocation for data transmission.
  • the energy price in the embodiment of the present invention is determined such that the remaining energy of the node is less, the energy price of the node is higher, and thus the source node preferentially considers the node with more residual energy as the relay node, thereby
  • the network has the advantage of balancing the energy consumption of each node; on the other hand, since the relay node and the source node use the power allocation when the value of the objective function is the smallest, the energy utilization efficiency of the node is improved. Therefore, the embodiment of the present invention takes into consideration the improvement of the energy utilization efficiency and the balance of the node energy consumption in the cooperative transmission of the node, thereby effectively extending the service life of the wireless relay network and improving the network performance. In addition, by analyzing the solution process with reference to FIG.
  • the embodiment of the present invention can easily obtain a closed-form solution of power allocation by distributed calculation, thereby having the advantages of less computational resources and low implementation cost. Therefore, the method according to an embodiment of the present invention also has the advantages of good practical performance and low cost.
  • a method 200 for relay node selection and power allocation of a wireless relay network includes:
  • S220 Determine, according to an energy price of each node and link information, a candidate node that can be selected as a relay node among each node of the wireless relay network;
  • S230 Determine, according to the energy price of each candidate node and the link information, respectively, the power allocation corresponding to the sum of the energy costs consumed by the source node and the candidate node when the candidate node is selected as the relay node. ;
  • S240 Determine, according to power allocation and energy price of each candidate node, a candidate node and a power allocation corresponding to a minimum value of a sum of energy costs of each candidate node in power allocation, respectively, as a relay node for data transmission and Power allocation.
  • the source node after acquiring the energy price and the link information, the source node is in the wireless After each node in the network performs primary selection, the node that cannot be selected as the relay node is eliminated, and a candidate node that may be a relay node is obtained. Then, for each candidate node, the energy price-based objective function respectively determines the power allocation when each candidate node is selected as the relay node, and then determines the power allocation of each candidate node according to the determined power allocation and the energy price. The minimum value in the sum of the energy costs of the time, the candidate node corresponding to the minimum value is determined as the relay node, and the power allocation corresponding to the candidate node is determined as the power allocation for data transmission.
  • the embodiment of the present invention determines the selection of the relay node and the allocation of the power by the objective function based on the energy price. Since the energy price in the embodiment of the present invention is determined such that the remaining energy of the node is less, the energy price of the node is higher. Therefore, the source node preferentially considers the node with more residual energy as the relay node, thereby having the advantage of equalizing the energy consumption of each node for the entire wireless relay network; and the sum of the energy costs of the relay node and the source node The lowest power distribution, thereby increasing the energy utilization efficiency of the node.
  • the embodiment of the present invention takes into consideration the improvement of the energy utilization efficiency and the balance of the node energy consumption in the cooperative transmission of the node, thereby effectively extending the service life of the wireless relay network and improving the network performance.
  • the embodiment of the present invention removes nodes that cannot be selected as relay nodes by filtering each node in the wireless relay network, thereby avoiding subsequent calculation processing on these nodes, which can greatly save computing resources and provide The system processes the speed to further improve the performance of the wireless relay network.
  • the source node may determine, according to various methods such as link validity, data transmission requirement, energy cost saving criterion, etc., that each node of the wireless relay network can be selected as A candidate node for a relay node.
  • the link established by the source node with the node is not a valid link and cannot be valid. Data transmission, ie the node cannot be selected as a relay node.
  • the source data first calculates the function values X max, Pmax) and p s W , 0), and then the function value and the transmission rate required by the data block to be transmitted 4 A comparison is made to thereby determine candidate nodes that can be selected as relay nodes.
  • the source node can separately calculate the cost of direct transmission and transmission through the intermediate node. If the energy cost for transmission through the intermediate node is greater, there is no need to perform cooperative transmission through the intermediate node. It is also possible to filter each node in the wireless relay network to determine candidate nodes that can be selected as relay nodes.
  • the source node may also determine a candidate node that can be selected as a relay node among the nodes of the wireless relay network based on one of the above methods or a combination of several methods, or based on some methods known to those skilled in the art.
  • the service life of the wireless relay network can be effectively extended, and the performance of the wireless relay network can be further improved.
  • the inventors conducted the following simulation experiment to minimize the minimum cost (“MIC”) strategy according to an embodiment of the present invention.
  • the minimum energy consumption (MIE) strategy, the maximum residual energy (MARE) strategy, and the maximum residual energy efficiency (MAEE) strategy in the prior art are compared.
  • the set wireless relay network considers the following scenario, uniformly distributing 25 nodes in a rectangular area, the adjacent nodes are 50 meters apart, and the channel between the nodes is Rayleigh superimposed with Gaussian white noise.
  • the destination node considers two cases of random selection and fixed as intermediate nodes respectively.
  • the case where the destination node is an intermediate node is similar to the cooperation of UEs. Access to the base station, otherwise the communication between the UEs.
  • Figure 5 shows the remaining energy of each node except the target node under various strategies when the destination node is set as the intermediate node and the data transmission rate is set to 2.5M (bps) and the network running time is r iooo (s).
  • the horizontal axis represents the node index number
  • the vertical axis represents the remaining energy Joule (J).
  • the MIE strategy can achieve the minimum energy required for each transmission, but can not balance the energy consumption of each node
  • MARE strategy and MAEE strategy can balance the energy consumption of each node, but the energy utilization effect The rate is not high.
  • the MIC strategy can achieve an effective trade-off between improving energy utilization efficiency and balancing the energy consumption of each node, thus facilitating the extension of the overall network life.
  • FIG. 6 is a diagram showing a comparison of energy utilization in the case of using a method according to an embodiment of the present invention and an existing method in a given wireless relay network, in which bits can be transmitted per joule (J) of energy.
  • the number is used as a measure of energy utilization, and the horizontal axis represents the data transmission rate (bps (bits/second)), and the vertical axis represents the energy utilization rate (bps/J).
  • bps bits/second
  • the vertical axis represents the energy utilization rate (bps/J).
  • Figure 7 shows a comparison of network lifetimes when the destination node is randomly selected
  • Figure 8 shows a comparison of network lifetime when the destination node is fixed as a central node.
  • the network life here is defined as the time it takes for the network to consume energy from the start of the work to the first node.
  • the network lifetime of the MIC strategy is significantly longer than that of other networks. Especially when the destination node is fixed as the central node, the superiority of the MIC strategy is more obvious.
  • the data transmission burden of nodes in the network is not balanced, so it can better reflect the comprehensive advantages of the MIC strategy in balancing energy utilization efficiency and balancing node energy consumption.
  • the data transmission rate is 1M (bps)
  • the lifetime of the network using the MIC strategy is 10 times longer than that of the network directly transmitted, even if compared with the MAEE strategy with the closest performance. More than 20% longer.
  • the method of selecting and power allocation takes into account the improvement of energy utilization efficiency and the balance of node energy consumption in the cooperative transmission of nodes, thereby effectively extending the service life of the wireless relay network and improving network performance.
  • a communication device following node selection and power allocation A schematic diagram of the structure of the communication device 300 of the rate allocation.
  • the communication device 300 includes an obtaining module 310, a first determining module 320, and a second determining module 330, where the obtaining module 310 is configured to obtain energy prices of nodes in the wireless relay network, and The link information of the link between each node and the neighbor node, wherein the energy price is determined such that the less the remaining energy of the node, the higher the energy price of the node; the first determining module 320 is configured to calculate the energy price according to each node And link information, respectively, determining, respectively, a power allocation corresponding to the minimum value of the target function value of the energy price of the node when the node is selected as the relay node; the second determining module 330 is configured to be based on each node The power allocation and the energy price determine the node and power allocation corresponding to the minimum value of the target function values of the respective nodes at the time of power allocation as the relay node and power allocation for data transmission, respectively.
  • the acquisition module 310 the first determination module 320, and the second determination module 330 may be referred to the corresponding portions of the above methods 100 and/or 200. To avoid repetition, details are not described herein.
  • a communication device determines a selection of a relay node and an allocation of power by an objective function based on an energy price, and since the energy price is determined such that the remaining energy of the node is less, the energy price of the node is higher,
  • the source node prioritizes the node with more residual energy as the relay node, thereby having the advantage of balancing the energy consumption of each node for the entire wireless relay network; on the other hand, the target node value is used by the relay node and the source node.
  • the obtaining module 310 may be further configured to obtain an energy price of each node in the wireless relay network, and link information of a link between each node and the neighboring node, where the energy price is determined as a node.
  • the initial total energy is proportional to the power function of the ratio of the remaining energy.
  • the obtaining module 310 is further configured to obtain an energy price of each node in the wireless relay network, and link information of a link between each node and the neighbor node, where the energy price is determined as It is proportional to the first or second power function of the ratio of the initial total energy to the remaining energy of the node.
  • the first determining module 320 may be further configured to determine, according to the energy price of each node and the link information, that each node is selected as the relay node, the source node and The power allocation corresponding to the sum of the energy costs consumed by the node.
  • FIG. 10 is a block diagram showing the structure of a communication device 400 for relay node selection and power allocation of a wireless relay network according to still another embodiment of the present invention.
  • the communication device 400 includes an obtaining module 410, a third determining module 440, and a first determining module 420. And a second determining module 430, where the obtaining module 410 is configured to acquire energy prices of nodes in the wireless relay network, and link information of links between each node and the neighboring node, where the energy price is determined to be a node The less the remaining energy, the higher the energy price of the node; the third determining module 440 is configured to determine, according to the energy price of each node and the link information, a candidate that can be selected as a relay node among the nodes of the wireless relay network.
  • a first determining module 420 configured to determine, according to energy prices and link information of each candidate node, a sum of energy costs consumed by the source node and the candidate node, respectively, when each candidate node is selected as the relay node.
  • the power allocation corresponding to the least hour; the second determining module 430 is configured to select candidate nodes and power corresponding to the minimum value of the sum of the energy costs of each candidate node at the time of power allocation based on the power allocation of each candidate node and the energy price
  • the assignments are determined as relay nodes and power allocations for data transmission, respectively.
  • the above and other operations and/or functions of the acquisition module 410, the third determination module 440, the first determination module 420, and the second determination module 430 may refer to corresponding portions in the above methods 100 and/or 200, in order to avoid repetition, here No longer.
  • a communication device determines a selection of a relay node and an allocation of power by an objective function based on an energy price, and since the energy price is determined such that the remaining energy of the node is less, the energy price of the node is higher,
  • the source node prioritizes the node with more residual energy as the relay node, thereby having the advantage of equalizing the energy consumption of each node for the entire wireless relay network; and because the sum of the energy costs of the relay node and the source node is the smallest Power distribution, thereby increasing the energy utilization efficiency of the node.
  • the embodiment of the present invention takes into consideration the improvement of energy utilization efficiency and the balance of node energy consumption in the cooperative transmission of nodes, thereby effectively extending the service life of the wireless relay network and improving network performance.
  • the communication device removes nodes that cannot be selected as relay nodes by filtering each node in the wireless relay network, thereby avoiding subsequent calculation processing on these nodes, which can greatly save Calculate resources and provide system processing speed to further improve wireless relay network performance.
  • RAM random access memory
  • ROM read only memory
  • electrically programmable ROM electrically erasable programmable ROM
  • registers hard disk, removable disk, CD-ROM, or technical field. Any other form of storage medium known.
  • RAM random access memory
  • ROM read only memory
  • electrically programmable ROM electrically erasable programmable ROM
  • registers hard disk, removable disk, CD-ROM, or technical field. Any other form of storage medium known.
  • CD-ROM compact disc-read only memory
  • the invention is not limited to this.
  • Various equivalent modifications and alterations to the embodiments of the present invention may be made by those skilled in the art without departing from the spirit and scope of the invention.

Landscapes

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

Description

无线中继网络的中继节点选择与功率分配的方法和设备 本申请要求于 2010年 5月 6日提交中国专利局, 申请号为 201010164382.3 , 发明名称为"无线中继网络的中继节点选择与功率分配的方法和设备"的中国 专利申请的优先权, 其全部内容通过引用结合在本申请中。 技术领域
本发明涉及无线通信领域,尤其涉及无线中继网络的中继节点选择与功率 分配的方法和通信设备。 背景技术
中继技术由于兼顾了传统蜂窝网络和无中心分布对等网络这两种网络构 架的特点, 因而一方面能够对蜂窝中的 "盲点" 和 "热点" 区域的用户通过中 继进行覆盖, 从而降低无线发射功率, 改善接收信号的品质, 进而大大提高网 络覆盖率和增加信道容量; 另一方面与无中心分布对等网络技术相比, 能够稳 定网络结构, 简单有效地进行管理, 并且也可以简化协议设计。 因此, 应用中 继技术的无线中继网络成为未来移动通信领域中最有前景的一种无线通信网 络。
然而, 由于中继往往是用来覆盖室内的通信盲区, 对于运营商来说, 布置 中继往往比较困难, 这就需要把中继的布置和维护交给个人或者第三方机构, 中继节点可能由不同的服务商或个人提供。 因此,很多种情况下无线中继网络 中的中继节点由使用电池的用户终端来实现,电池电量少的中继节点不愿意用 自己的有限资源(包括能量, 时间, 带宽)为其他用户无偿服务, 网络寿命受 到影响。 此外, 为了保证网络拓朴的稳定, 以实现不间断的数据传输, 也需要 尽可能延长网络寿命。 因此, 无线中继网络面临的一个主要问题是如何有效地 延长网络寿命。
通常地,当网络中的节点由于能量消耗完而失效时,网络拓朴会发生改变, 整个网络数据传输功能会逐渐丧失, 因此, 网络寿命一般地定义为网络从开始 工作到第一个节点消耗完能量所需要的时间。为了实现无线中继网络寿命的延 长, 一些方案将最小能量消耗(Minimum Energy, 简称为 "MIE" )策略、 最 大剩余能量(Maximum Residual Energy, 简称为 "MARE" )策略、 最大剩余 能量效率(Maximum Residual Energy Efficiency, 简称为 "MAEE" )策略应用 于无线中继网络,但是这些方案仅仅局限于考虑某一方面指标的优化, 不能有 效地延长网络寿命, 不能进而提高网络性能。 发明内容
为此,本发明实施例要解决的技术问题是提供无线中继网络的中继节点选 择与功率分配的方法和通信设备,以兼顾能量利用效率的提高和节点能量消耗 的平衡, 从而有效地延长无线中继网络的使用寿命, 提高网络性能。
为解决上述技术问题,一方面, 本发明实施例提供了一种无线中继网络的 中继节点选择与功率分配的方法, 该方法包括:
获取无线中继网络中各节点的能量价格,以及各节点与邻居节点之间链路 的链路信息, 其中所述能量价格确定为使得节点的剩余能量越少, 该节点的能 量价格越高;
根据各节点的能量价格以及链路信息,分别确定每个节点在被选择作为中 继节点的情况下,基于该节点的能量价格的目标函数值最小时所对应的功率分 配;
基于各节点的功率分配以及能量价格,将与各节点在功率分配时的目标函 数值中的最小值所对应的节点和功率分配分别确定为用于数据传输的中继节 点和功率分配。
另一方面,本发明实施例提供了一种用于无线中继网络的中继节点选择与 功率分配的通信设备, 该通信设备包括:
获取模块, 用于获取无线中继网络中各节点的能量价格, 以及各节点与邻 居节点之间链路的链路信息,其中所述能量价格确定为使得节点的剩余能量越 少, 该节点的能量价格越高;
第一确定模块, 用于根据各节点的能量价格以及链路信息, 分别确定每个 节点在被选择作为中继节点的情况下,基于该节点的能量价格的目标函数值最 小时所对应的功率分配;
第二确定模块, 用于基于各节点的功率分配以及能量价格,将与各节点在 功率分配时的目标函数值中的最小值所对应的节点和功率分配分别确定为用 于数据传输的中继节点和功率分配。
基于上述技术方案,本发明实施例通过基于能量价格的目标函数来确定中 继节点的选择和功率的分配,由于本发明实施例中的能量价格确定为使得节点 的剩余能量越少, 该节点的能量价格越高, 由此源节点优先考虑剩余能量较多 的节点作为中继节点,从而对于整个无线中继网络而言具有均衡消耗各节点能 量的优点; 另一方面, 由于中继节点和源节点釆用目标函数值最小时的功率分 配, 由此提高了节点的能量利用效率。 因此, 本发明实施例兼顾了节点协作传 输中能量利用效率的提高和节点能量消耗的平衡,从而能够有效地延长无线中 继网络的使用寿命, 提高网络性能。 附图说明
为了更清楚地说明本发明实施例的技术方案,下面将对本发明实施例中所 需要使用的附图作简单地介绍, 显而易见地, 下面所描述的附图仅仅是本发明 的一些实施例,对于本领域普通技术人员来讲,在不付出创造性劳动的前提下, 还可以根据这些附图获得其他的附图。
图 1 示出了根据本发明实施例的无线中继网络的中继节点选择与功率分 配的方法的流程图;
图 2 示出了适用于本发明实施例的基于时分复用的协作传输方案的示意 图;
图 3示出了求解根据本发明实施例的功率分配的示意图;
图 4 示出了根据本发明另一实施例的无线中继网络的中继节点选择与功 率分配的方法的流程图;
图 5 示出了在给定无线中继网络中分别釆用根据本发明实施例的方法和 现有方法的情况下, 网络各节点剩余能量对比的示意图;
图 6 示出了在给定无线中继网络中分别釆用根据本发明实施例的方法和 现有方法的情况下, 能量利用率对比的示意图;
图 7 示出了在给定无线中继网络中分别釆用根据本发明实施例的方法和 现有方法的情况下, 网络寿命对比的示意图;
图 8 示出了在给定无线中继网络中分别釆用根据本发明实施例的方法和 现有方法的情况下, 网络寿命对比的另一示意图; 率分配的通信设备的结构示意图; 和
图 10示出了根据本发明另一实施例的用于无线中继网络的中继节点选择 与功率分配的通信设备的结构示意图。 具体实施方式
下面将结合本发明实施例中的附图,对本发明实施例中的技术方案进行清 楚、 完整地描述, 显然, 所描述的实施例是本发明的一部分实施例, 而不是全 部实施例。基于本发明中的实施例, 本领域普通技术人员在没有做出创造性劳 动的前提下所获得的所有其他实施例, 都应属于本发明保护的范围。
首先结合图 1 来描述根据本发明实施例的无线中继网络的中继节点选择 与功率分配的方法。
如图 1所示,本发明实施例提供了一种无线中继网络的中继节点选择与功 率分配的方法 100, 该方法包括:
S110, 获取无线中继网络中各节点的能量价格, 以及各节点与邻居节点之 间链路的链路信息, 其中所述能量价格确定为使得节点的剩余能量越少, 该节 点的能量价格越高;
S120,根据各节点的能量价格以及链路信息,分别确定每个节点在被选择 作为中继节点的情况下,基于该节点的能量价格的目标函数值最小时所对应的 功率分配;
S130 ,基于各节点的功率分配以及能量价格,将与各节点在功率分配时的 目标函数值中的最小值所对应的节点和功率分配分别确定为用于数据传输的 中继节点和功率分配。
当无线中继网络中用户设备需要向基站上传数据,或基站需要向用户设备 下传数据, 或无线中继网络中其它节点之间需要传输数据时, 源节点可以获取 网络中各节点的能量价格, 以及各节点与邻居节点之间链路的链路信息, 其中 能量价格确定为使得节点的剩余能量越少, 该节点的能量价格越高。 随后, 源 节点基于各节点的能量价格以及各链路信息,对于每个节点而言,假设每个节 点在被选择作为中继节点的情况下,分别地确定基于该节点的能量价格的目标 函数值最小时所对应的功率分配, 由此得到各节点的功率分配。 此时, 源节点 根据确定的各节点的功率分配以及能量价格,将与各节点在功率分配时的目标 函数值中的最小值所对应的节点确定为用于数据传输的中继节点,同时将该节 点对应的功率分配确定为用于数据传输的功率分配。 由此, 源节点可以根据确 定的中继节点和功率分配进行数据传输。
根据本发明实施例提供的无线中继网络的中继节点选择与功率分配的方 法, 首先对于各节点而言,基于能量价格的目标函数分别地确定各节点被选择 作为中继节点时的功率分配, 然后再基于确定的功率分配,确定各节点分别在 功率分配时的目标函数值中的最小值,将该最小值所对应的节点确定为中继节 点, 同时与该节点对应的功率分配确定为用于数据传输的功率分配。 由于本发 明实施例中的能量价格确定为使得节点的剩余能量越少 ,该节点的能量价格越 高, 由此源节点优先考虑剩余能量较多的节点作为中继节点,从而对于整个无 线中继网络而言具有均衡消耗各节点能量的优点; 另一方面, 由于中继节点和 源节点釆用目标函数值最小时的功率分配, 由此提高了节点的能量利用效率。 因此,本发明实施例兼顾了节点协作传输中能量利用效率的提高和节点能量消 耗的平衡, 从而能够有效地延长无线中继网络的使用寿命, 提高网络性能。
具体地, 在 S110中, 源节点获取无线中继网络中各节点的能量价格, 以 及各节点与邻居节点之间链路的链路信息,其中所述能量价格确定为使得节点 的剩余能量越少, 该节点的能量价格越高。
该源节点可以是网络侧设备, 该网络设备包括但不限于基站、无线网络控 制器、 无线网络子系统等; 源节点也可以是用户设备, 该用户设备包括但不限 于移动电话、 便携式计算机、 个人数字助理、 便携式游戏机和便携式多媒体机 等; 或者源节点也可以是其它通信设备。
源节点可以从自身的存储器中获取所需的各节点的能量价格和链路信息 , 或以本领域公知的方法从各节点中获取所需的能量价格和链路信息。 当然, 源 节点可以先从自身的存储器中获取所需的各节点的能量信息,或以本领域公知 的方法从各节点中获取所需的能量信息 ,然后基于能量信息计算所需的能量价 格, 从而获得所需的能量价格。
例如源节点可以通过广播发送请求消息,各节点可以响应该请求消息, 以 将自身的能量信息 /能量价格以及与邻居节点之间链路的链路信息提供给源节 点, 当然各节点可以分别地将能量信息 /能量价格和链路信息提供给源节点。 该请求消息可以是专门定义的消息,也可以是现有消息的扩展, 该请求消息还 可以是其它现有的用于请求传输路径的控制消息,利用这些控制消息的保留字 段来承载需要传送给源节点的能量信息 /能量价格和链路信息。
为了延长网络的使用寿命,必须对剩余能量少的节点的能量定一个高一点 的价格,反之对剩余能量多的节点的能量定一个低一点的价格, 即各节点的能 量价格确定为使得节点的剩余能量越少该节点的能量价格越高,节点的剩余能 量越多该节点的能量价格越低, 由此能够均衡节点能量的消耗。
在本发明实施例中,各节点的能量价格可以确定为与节点的初始总能量与 剩余能量的比值的幂函数成正比。优选地,各节点的能量价格可以确定为与节 点的初始总能量与剩余能量的比值的一阶或二阶幂函数成正比。 例如, 节点的 能量价格 可以如下式所示:
Em
P, = Po m = 2 ( 1 ) 式中, £ 表示中继第 j个节点(包括中继节点和源节点)的初始总能量, £ 表示数据传输前第 j个节点的剩余能量, ?。为第 j个节点的初始能量价格, m为 1或 2。
由此,在本发明的一个实施例中, 获取无线中继网络中各节点的能量价格 包括: 获取各节点的初始总能量和剩余能量, 并计算出各节点的能量价格; 或 者直接获取各节点的能量价格。
在本发明实施例中, 链路信息是与路径上相邻节点之间的链路有关的信 息。 该链路信息可以包括链路的复信道衰落系数或信道增益、 链路带宽、 链路 两端节点及其邻居节点。当然该链路信息也可以包括源节点与目的节点链路以 及中继节点与目的节点链路这两个链路的复信道衰落系数或信道增益以及链 路带宽。通过链路信息可以知道该链路的相关参数,也可以知道该链路的传输 在 S120中, 源节点根据各节点的能量价格以及链路信息, 分别确定每个 节点在被选择作为中继节点的情况下,基于该节点的能量价格的目标函数值最 小时所对应的功率分配。
在本发明实施例中,基于某个节点的能量价格的目标函数可以是关于该节 点和源节点的能量价格的线性函数,也可以是关于该节点和源节点的能量价格 的二次函数、 幂函数等。 优选地, 基于某个节点的能量价格的目标函数是关于 该节点和源节点的能量价格的线性函数。例如, 该目标函数可以是关于源节点 和该节点所消耗的能量成本总和的函数,其中节点的能量成本是该节点所消耗 的能量与该节点的能量价格的乘积。
另一方面, 在一些情况下, 对于选择不同的中间节点作为中继节点而言, 源节点消耗的功率和能量价格几乎不变, 或改变很小, 此时, 基于某个节点的 能量价格的目标函数也可以是仅关于节点能量价格的线性函数,也可以是仅关 于该节点能量价格的二次函数、幂函数等。例如,如果数据传输速率要求很高, 那么对于源节点而言, 源节点都将以最大功率进行数据传输, 而不论选择哪个 中间节点作为中继节点,此时源节点可以基于仅关于假定被选择作为中继节点 的该节点的能量价格的目标函数来确定功率分配。由于中继节点和源节点釆用 目标函数值最小时的功率分配, 由此提高了节点的能量利用效率。
在 S130中, 源节点基于各节点的功率分配以及能量价格, 将与各节点在 功率分配时的目标函数值中的最小值所对应的节点和功率分配分别确定为用 于数据传输的中继节点和功率分配。
在本发明实施例中,源节点可以首先基于所确定的各节点在被选择作为中 继节点时的功率分配, 分别计算出各节点在功率分配时的目标函数值, 然后再 从所有目标函数值中选取最小值, 将与该最小值所对应的节点确定为中继节 点, 同时与该节点对应的功率分配确定为用于数据传输的功率分配。 当然, 源 节点也可以先计算出一个节点在功率分配时的目标函数值,然后与其它节点在 功率分配时的目标函数值进行比较, 直至找到最小的目标函数值, 由此确定中 继节点的选择和功率分配。此外, 也可以用本领域公知的其它方法来确定最小 的目标函数值, 由此确定中继节点的选择和功率分配。
需要说明的是,对于某一节点而言, 该节点在功率分配时的目标函数值已 经是关于该节点的能量价格的目标函数的最小值, 因此,对于源节点确定的各 节点在功率分配时的目标函数值中的最小值,该最小值即为对于所有中间节点 而言在各种功率情况下目标函数的最小值的最小值。
由于本发明实施例中的能量价格确定为使得节点的剩余能量越少 ,该节点 的能量价格越高, 由此源节点优先考虑剩余能量较多的节点作为中继节点,从 而对于整个无线中继网络而言具有均衡消耗各节点能量的优点; 另一方面, 由 于中继节点和源节点釆用目标函数值最小时的功率分配,由此提高了节点的能 量利用效率。 因此, 本发明实施例兼顾了节点协作传输中能量利用效率的提高 和节点能量消耗的平衡,从而能够有效地延长无线中继网络的使用寿命,提高 网络性能。
下面将参考图 2 详细说明无线中继网络的中继节点选择与功率分配的方 法。
图 2 示出了适用于本发明的基于解码转发协议的协作传输方案。 如图 2 所示, 4叚定无线中继网络由一个源节点 S、 一个目的节点 D以及 K个分布在 不同位置的中继节点 R(t)(A = n)构成。 中继集合以 Ω表示, 且 Ω中的每个中 继可以协作源节点 S的数据传输。假定在每个数据块传输期间,信道条件保持 稳定。 如图 2 (c) 所示, 协作传输机制基于时分复用, 分配给数据块的传输 时隙长度为 Γ , 且被分为两个阶段, 每个阶段的长度为 Γ/2。 在阶段 1 (如图 2 (a)所示), 源节点向所有中继和目的节点广播数据。 在阶段 2 (如图 2 (b) 所示) , 源节点 S会从中继集合 Ω中选择一个最优中继 R。pi进行协作传输。 即 被选择的中继对接收到的信号进行解调和信道解码,再对估计得到的信号重新 信道编码,调制后发送到目的节点。目的节点对两个阶段收到的信号进行合并, 得到最终的估计值。
由此, 有两个问题需要得到解决。 第一, 如何从中继集合 Ω中选择最优的 中继 R。pi。第二,在所需数据传输速率 /¾恒定的情况下, 源节点 S和中继 R。pi的 发射功率应该设定为多少。
½表示源节点 S 待发送的数据符号, 。, ^,!^^分别表示 S→D链 路, S→R(W链路以及 R )→JD链路的复信道衰落系数。 此外, 以 W表示中继网络 的传输带宽。 不失一般性, 假定 S→D链路, S→RW链路以及 R )→JD链路上的 高斯白噪声满足 nSD,nSR(k),nR(k)D -CN( ,a2)。 此外, 分别以
Figure imgf000010_0001
、 ASMk) = hS 2 R(k)/a2和 4 。 = (nD/a2表示 S→ D链路、 S→ R(k)链路以及 → D链路 上每增加单位发射功率所增加的信噪比。
假定源节点的数据块的所需传输速率为 /¾ (比特 /秒), 源节点需要从中继集 合 Ω中选择一个机会中继 实现协作传输并决定源节点 S和中继节点 的 发射功率 ,¾ 。 在第一个阶段, 源节点 S向目的节点 D和 Ω中的中继节点 以功率 广播符号 xs,于是可以得到目的节点 D和中继 Rw接收到的符号如下 所示:
(2)
然后, 中继 R(w对接收到的信号进行解调, 解码, 对估计得到的符号重新 编码, 调制, 在第二个阶段以 ^)发射功率进行发射。
在目的节点 (D), 通过对来自源节点和中继 的信号进行最大比合并后 得到最后的数据。整个链路的可达速率由 S→ R(k)链路以及 S D和 → D链路 的信噪比 (Signal to Noise Rate, 简称为 "SNR" ) 的最小值决定。 即如下式 所示:
< ^log2 (1 + min{/ls , ASDps + ^(klDpR(k) }) ( 4 ) 根据(4)式, 为了保证数据传输速率 /4,我们可以得到建立有效的 SRW 链路的源节点 S的发射功率的下界 ^。w, 即:
1
ΡΓ =Ί ^ (2d) (5) 此外, 不失一般性, 我们假定源节点和 Ω中所有中继节点的最大发射功率 满足 =ρ^ =:. = P^K) = Pmax
为了选择中继节点且确定功率分配, 可以将用户看成一个买家,通过向源 节点和中继节点购买能量, 完成数据块的传输, 并在保持传输速率 /¾的同时尽 可能降低消耗的成本。源节点 (S)和 Ω中所有中继节点都可以看成卖家,根据自 身剩余的能量的多少对能量进行定价。在完成数据块传输的时隙内, 源节点和 中继节点所消耗的能量分别为 = /2和 )=¾^/2 , 于是可以得到成本函 数如下所示:
。導) = (PsPs + pR(k)PR(k)) ( 6 )
Figure imgf000011_0001
式(6) 中, ps 、 分别为源节点 (S)和中继节点 RW的能量价格, 并且 假设节点的定价策略满足式 ( 1 ), 即各节点的能量价格可以确定为与节点的初 始总能量与剩余能量的比值的一阶或二阶幂函数成正比。
以 表示当中继 WW被选择时取得最小成本的最优功率分配解, 于 是可以得到最优的中继节点如下所示:
Rpt = arg min Cs,R (^Ά)) ( 7 ) 由此, 求解中继节点 的最优功率分配 (; ί ,ρ )问题可以通过数学建模 确定为一个典型的线性规划问题, 式(8)和(9)定义了问题的优化目标和需 满足的约束条件:
(p , ) = arg min PsPs + PRk PRk) ( 8 )
Figure imgf000012_0001
下面将参考图 3描述根据式(8)和(9) 的最优功率分配 的求解 过程。
首先, 为了描述方便定义三个相关函数, 如式( 10 )、( 11 )和( 12 )所示:
w
f (X y) =— log2 (1 + λ3Γ>χ十 ^{k)Dy) (10)
2
hl{x) = ^-{22^w-\-AR{klDx) ( 11 ) 入
h (x) = - —if iw 12) 如图 3所示, 直线 S,.(,=i.2,3)分别为不同传输速率 /6取值下的信噪比 (SNR) 等值线 = 22 -1, 图中阴影区域为矩形 ABCD与 S,的右上半平 面的交集, 由此可见阴影区域为式(8) 定义的优化问题的可行域。
由图 3可见, /6越大,直线 位置越靠上, 阴影区域即可行域的面积越小。 定义两个比值参数 η、 = ps/p ) , η2 = ¾D/ W.D,直线 C,和 C2分别为当; /,≥ η2和 < η2 时的成本等值 2 由图 4可见, 直线 ς和 C2越靠下, 成 本 c5W越低。 则容易知道, 从下往上移动直线 ς和 c2, 与可行域阴影区域的 第一个交点即为最优的功率分配解 ( , ; ))。
当4>/( Anax) 或者 T≥; 时, 由图 3 可见, 可行域的面积为零, 这 意味着不存在满足式(8) 的有效解, 因此, 在这种情况下, R(A')将不可能为 用户所选择。
当 /¾</( w,o)时, 由图 3可见, 此时可行域为整个矩形 ABCD, 最佳功率 分配点为 C, 但是由于 w = o, 这意味着中继 R(w将不可能为用户所选择。 当 / ,o)≤/¾≤/(n x), 且 T< 时, 由图 3 可见, 此时阴影部分的 面积不为零, 于是可以得到最佳的功率分配解。 在此情况下进行如下讨论:
A: 当; 时
在这种情况下, 如图 3所示, 此时成本等值线^的斜率的绝对值大于信噪 比 (SNR)等值线 的斜率的绝对值, 这表明源节点 S的能量价格过高, 用户消 耗源节点的能量要尽可能的少。 具体地, 当 / T, )< ¾≤/ , )时, 信噪 比(SNR)等值线为 S , 最佳功率分配点 位于线段 AB 之上; 当
Figure imgf000013_0001
< 时, SNR等值线为 S2 , 最佳功率分配点 位于线段 AC 之上。 于是可以得到最优功率分配向量如式(13 )所示:
Figure imgf000013_0002
f(pl ,0)≤Ih ≤ f(pslO P^)
B: 当;;^^时
在这种情况下,如图 3所示, 此时成本等值线 的斜率的绝对值小于信噪 比 (SNR)等值线 Si的斜率, 当 /(i o) < ih < /(n x)时, SNR等值线为 , 最 佳功率分配点如 所示, 位于线段 BD之上; 当/ ^,ο)≤/¾≤/ χ,ο)时, SNR 等值线为&, 最佳功率分配点如 4所示, 位于线段 CD之上。 于是可以得到最 优功率分配向量如式(14)所示:
Figure imgf000013_0003
于是, 当无线中继网络中某个通信设备(设为源节点)需要发送数据速率 需求为 4的业务时, 源节点获取无线中继网络中各节点的能量价格, 以及源节 点与目的节点和中间节点与目的节点这两个链路的信道增益。
4叚设每个中间节点被选择作为中继节点, 那么对于每个中间节点而言, 源 节点获取源节点与目的节点链路的信道增益 。= ^/σ2、 中继节点与目的节点 链路的信道增益 4«d= «dA 2、 源节点的能量价格/ ¾、 中继节点的能量价格 pR(k 无线中继网络的传输带宽 W以及数据速率需求 /6。 此外, 源节点计算其 与邻居节点所需的满足 /6的最小功率,即得到建立有效的 S→RW链路中源节点
S 的最小发射功率 ^ , 即;^ = (22 6/ -1)/ ) , 并且源节点还根据自身能力得 到其最大的发送功率 ;½ax。 由此可以根据式( 13 )和式( 14 )直接确定各节点 在被选择作为中继节点时的功率分配。
接着, 源节点根据各节点的功率分配以及能量价格, 基于式(7 )确定最 优的中继节点,由此确定与该中继节点对应的功率分配作为用于数据传输的功 率分配。
由于本发明实施例中的能量价格确定为使得节点的剩余能量越少,该节点 的能量价格越高, 由此源节点优先考虑剩余能量较多的节点作为中继节点,从 而对于整个无线中继网络而言具有均衡消耗各节点能量的优点; 另一方面, 由 于中继节点和源节点釆用目标函数值最小时的功率分配,由此提高了节点的能 量利用效率。 因此, 本发明实施例兼顾了节点协作传输中能量利用效率的提高 和节点能量消耗的平衡,从而能够有效地延长无线中继网络的使用寿命,提高 网络性能。 此外, 通过上述参考图 3对求解过程进行分析可知, 本发明实施例 能够通过分布式计算容易地得到功率分配的闭式解,由此还具有耗费计算资源 少、 实现代价低的优点。 因此, 根据本发明实施例的方法还具有良好的实用性 能和低成本的优势。
下面将参考图 4 来描述根据本发明另一实施例的无线中继网络的中继节 点选择与功率分配的方法。
如图 4所示,根据本发明另一实施例的无线中继网络的中继节点选择与功 率分配的方法 200包括:
S210,获取无线中继网络中各节点的能量价格, 以及各节点与邻居节点之 间链路的链路信息, 其中所述能量价格确定为使得节点的剩余能量越少, 该节 点的能量价格越高;
S220,根据各节点的能量价格以及链路信息,确定无线中继网络的各节点 中能够被选择作为中继节点的候选节点;
S230,根据各候选节点的能量价格以及链路信息,分别确定每个候选节点 在被选择作为中继节点的情况下,源节点和该候选节点所消耗的能量成本总和 最小时所对应的功率分配;
S240,基于各候选节点的功率分配以及能量价格,将与各候选节点在功率 分配时的能量成本总和中的最小值所对应的候选节点和功率分配分别确定为 用于数据传输的中继节点和功率分配。
在本发明实施例中, 源节点在获取能量价格以及链路信息之后,对无线中 继网络中的各节点进行初选, 淘汰不能被选择作为中继节点的节点,得到可能 作为中继节点的候选节点。 然后再对于各候选节点而言,基于能量价格的目标 函数分别地确定各候选节点被选择作为中继节点时的功率分配,再基于确定的 功率分配以及能量价格,确定各候选节点分别在功率分配时的能量成本总和中 的最小值, 将该最小值所对应的候选节点确定为中继节点, 同时与该候选节点 对应的功率分配确定为用于数据传输的功率分配。
本发明实施例一方面通过基于能量价格的目标函数来确定中继节点的选 择和功率的分配,由于本发明实施例中的能量价格确定为使得节点的剩余能量 越少, 该节点的能量价格越高, 由此源节点优先考虑剩余能量较多的节点作为 中继节点, 从而对于整个无线中继网络而言具有均衡消耗各节点能量的优点; 并且由于中继节点和源节点釆用能量成本总和最小时的功率分配,由此提高了 节点的能量利用效率。 因此, 本发明实施例兼顾了节点协作传输中能量利用效 率的提高和节点能量消耗的平衡,从而能够有效地延长无线中继网络的使用寿 命, 提高网络性能。 另一方面, 本发明实施例通过对无线中继网络中各节点进 行筛选,去除不能被选择作为中继节点的节点,从而能够避免对这些节点进行 后续的计算处理, 能够大大节省计算资源, 提供系统处理速度, 从而进一步提 高无线中继网络性能。
在 S220中, 根据各节点的能量价格以及链路信息, 源节点可以基于链路 有效性、数据传输需求、 能量成本节省准则等多种方法来确定无线中继网络的 各节点中能够被选择作为中继节点的候选节点。
例如, 源节点可以计算其与邻居节点所需的满足 /6的最小发射功率 ^ , 即 w = (22V -l)/ flW , 并且源节点还根据自身能力得到其最大的发送功率 naX。 此时, 可以将计算得到的源节点最小发射功率 ^与其最大的发送功率 nax进行比较, 当 ^≥ 时, 源节点与该节点建立的 →^^)链路不是有效链 路, 不能进行有效的数据传输, 即该节点不可能被选择作为中继节点。
又例如, 根据各节点的能量价格以及链路信息, 源数据先计算出函数值 X max, Pmax)和 ps W, 0), 然后再将上述函数值与待发送数据块要求的传输速 率 4进行比较, 由此确定能够被选择作为中继节点的候选节点。 如图 3所示, 当^ > /( xx)时, SNR等值线 S位于整个矩形区域上方, 可行域的面积为 零, 这意味着数据传输速率要求太高, 此时该节点不可能被用户选择作为候选 节点; 当 /¾ </( w,o)时, SNR等值线 S位于整个矩形区域下方, 此时可行域为 整个矩形 ABCD, 最佳功率分配点为 C, 但是此时中继节点的功率为 w = o , 这意味不需要该节点, 由此该节点也不可能被用户选择作为候选节点。
再例如,源节点可以分别计算出直接传输和通过中间节点进行传输所耗费 的成本,如果通过中间节点进行传输所耗费的能量成本更大, 那么完全没有必 要通过该中间节点进行协作传输,由此也可以对无线中继网络中的各节点进行 筛选, 确定能够被选择作为中继节点的候选节点。
当然, 源节点也可以基于上述其中一种方法或几种方法的组合, 或基于本 领域普通技术人员公知的一些方法来确定无线中继网络的各节点中能够被选 择作为中继节点的候选节点, 由此能够有效地延长无线中继网络的使用寿命, 并进一步提高无线中继网络的性能。
此外, 方法 200的其它操作和 /或步骤可以参考上述方法 100中的相应部 分, 为避免重复, 在此不再赘述。
为了验证本专利策略在兼顾提高能量利用效率和平衡节点能量消耗方面 的特性,发明人进行了如下的仿真实验,将根据本发明实施例的最小能量成本 ( Minimum Cost, 简称为 "MIC" )策略与现有技术中的最小能量消耗( MIE ) 策略, 最大剩余能量(MARE )策略以及最大剩余能量效率(MAEE )策略进 行了比较。 在下面的仿真实验中, 设定的无线中继网络考虑如下场景, 在一个 矩形区域内均匀分布 25个节点,相邻节点间距为 50米, 节点之间的信道为叠 加高斯白噪声的瑞利衰落信道, 不失一般性,假定所有信道的噪声功率谱密度 AT。= 1(T14(W/HZ)。 设定参数时隙长度? = 10-3 (s) , 带宽 = IM (HZ), 每个节点的初 始能量为 5(J), 最大发射功率为 0.1(W)。 假定每个时隙内, 都只有一个随机选 择的源节点发送信息,目的节点分别考虑随机选择和固定为中间节点这两种情 况。 目的节点为中间节点的情况类似于 UE通过协作接入基站, 其它情况为 UE之间的通信。
图 5为将目的节点设定为中间节点,数据传输速率设定为 2.5M (bps), 网络 运行时间 r = iooo (s)时,各种策略下除目标节点之外的各个节点的剩余能量分布 对比, 图中横轴表示节点索引号, 纵轴表示剩余能量焦耳(J ) 。 由图可见, MIE 策略可实现每次传输所需能量最小, 但不能平衡每个节点的能量消耗; MARE策略和 MAEE策略可以实现平衡每个节点的能量消耗, 但能量利用效 率不高。 与其它策略相比, MIC 策略可实现提高能量利用效率和平衡各节点 的能量消耗的有效折衷, 因而有利于实现整体网络寿命的延长。
图 6 示出了在给定无线中继网络中分别釆用根据本发明实施例的方法和 现有方法的情况下, 能量利用率对比的示意图, 其中以每焦耳 (J ) 能量可以 传输的比特数作为能量利用率衡量的标准, 横轴表示数据传输速率 (bps (比 特 /秒)), 纵轴表示能量利用率 (bps/J )。 由图 6可见, 本文提出的 MIC策略 的能量利用率与能量利用率最高的 MIE策略接近, 并高于基于 MARE策略和 MAEE策略的能量利用率。
为了更直观地观察各种策略对延长无线中继网络寿命所起的作用,发明人 在数据传输速率分别取不同值的情况下,对釆取不同策略的无线中继网的网络 寿命进行了评价。 图 7示出了目的节点为随机选择时的网络寿命对比示意图, 图 8示出了目的节点固定为中央节点时的网络寿命对比示意图。这里的网络寿 命定义为网络从开始工作到第一个节点消耗完能量所需要的时间。由图 7和图 8所示, 釆用 MIC策略的网络寿命明显长于釆用其他策略的网络寿命, 特别 在目的节点固定为中央节点时, MIC 策略的优越性表现的更为明显, 这是由 于这种情况下, 网络中节点的数据传输负担不均衡, 因而能够更好地体现 MIC 策略在兼顾提高能量利用效率和平衡节点能量消耗方面的综合优势。例如, 当 数据传输速率为 1M (bps)时, 釆用 MIC策略的网络的寿命比釆用直接传输的网 络的寿命要长 10倍以上, 即使与性能最接近的 MAEE策略相比, 寿命也要长 20%以上。 择与功率分配的方法,兼顾了节点协作传输中能量利用效率的提高和节点能量 消耗的平衡, 从而能够有效地延长无线中继网络的使用寿命, 提高网络性能。
上文详细描述了根据本发明实施例的无线中继网络的中继节点选择与功 率分配的方法, 下面将结合图 9和图 10详细描述根据本发明实施例的用于无 线中继网络的中继节点选择与功率分配的通信设备。 率分配的通信设备 300的结构示意图。
该通信设备 300 包括获取模块 310、 第一确定模块 320和第二确定模块 330, 其中, 获取模块 310用于获取无线中继网络中各节点的能量价格, 以及 各节点与邻居节点之间链路的链路信息,其中所述能量价格确定为使得节点的 剩余能量越少, 该节点的能量价格越高; 第一确定模块 320用于根据各节点的 能量价格以及链路信息, 分别确定每个节点在被选择作为中继节点的情况下, 基于该节点的能量价格的目标函数值最小时所对应的功率分配;第二确定模块 330用于基于各节点的功率分配以及能量价格, 将与各节点在功率分配时的目 标函数值中的最小值所对应的节点和功率分配分别确定为用于数据传输的中 继节点和功率分配。
获取模块 310、 第一确定模块 320和第二确定模块 330的上述以及其它操 作和 /或功能可以参考上述方法 100和 /或 200中的相应部分, 为了避免重复, 在此不再赘述。
根据本发明实施例的通信设备通过基于能量价格的目标函数来确定中继 节点的选择和功率的分配, 由于该能量价格确定为使得节点的剩余能量越少, 该节点的能量价格越高,由此源节点优先考虑剩余能量较多的节点作为中继节 点,从而对于整个无线中继网络而言具有均衡消耗各节点能量的优点; 另一方 面, 由于中继节点和源节点釆用目标函数值最小时的功率分配, 由此提高了节 点的能量利用效率。 因此, 本发明实施例兼顾了节点协作传输中能量利用效率 的提高和节点能量消耗的平衡, 从而能够有效地延长无线中继网络的使用寿 命, 提高网络性能。
在本发明实施例中,获取模块 310还可以用于获取无线中继网络中各节点 的能量价格, 以及各节点与邻居节点之间链路的链路信息, 其中所述能量价格 确定为与节点的初始总能量和剩余能量的比值的幂函数成正比。在本发明另一 实施例中, 获取模块 310还可以用于获取无线中继网络中各节点的能量价格, 以及各节点与邻居节点之间链路的链路信息,其中所述能量价格确定为与节点 的初始总能量和剩余能量的比值的一阶或二阶幂函数成正比。此外,在本发明 再一实施例中,第一确定模块 320还可以用于根据各节点的能量价格以及链路 信息, 分别确定每个节点在被选择作为中继节点的情况下, 源节点和该节点所 消耗的能量成本总和最小时所对应的功率分配。
图 10示出了根据本发明再一实施例的用于无线中继网络的中继节点选择 与功率分配的通信设备 400的结构示意图。
该通信设备 400包括获取模块 410、第三确定模块 440、第一确定模块 420 和第二确定模块 430 , 其中, 获取模块 410用于获取无线中继网络中各节点的 能量价格, 以及各节点与邻居节点之间链路的链路信息, 其中所述能量价格确 定为使得节点的剩余能量越少, 该节点的能量价格越高; 第三确定模块 440 用于根据各节点的能量价格以及链路信息,确定无线中继网络的各节点中能够 被选择作为中继节点的候选节点;第一确定模块 420用于根据各候选节点的能 量价格以及链路信息, 分别确定每个候选节点在被选择作为中继节点的情况 下, 源节点和该候选节点所消耗的能量成本总和最小时所对应的功率分配; 第 二确定模块 430用于基于各候选节点的功率分配以及能量价格,将与各候选节 点在功率分配时的能量成本总和中的最小值所对应的候选节点和功率分配分 别确定为用于数据传输的中继节点和功率分配。
获取模块 410、第三确定模块 440、第一确定模块 420和第二确定模块 430 的上述以及其它操作和 /或功能可以参考上述方法 100和 /或 200中的相应部分, 为了避免重复, 在此不再赘述。
根据本发明实施例的通信设备通过基于能量价格的目标函数来确定中继 节点的选择和功率的分配, 由于该能量价格确定为使得节点的剩余能量越少, 该节点的能量价格越高,由此源节点优先考虑剩余能量较多的节点作为中继节 点,从而对于整个无线中继网络而言具有均衡消耗各节点能量的优点; 并且由 于中继节点和源节点釆用能量成本总和最小时的功率分配,由此提高了节点的 能量利用效率。 因此, 本发明实施例兼顾了节点协作传输中能量利用效率的提 高和节点能量消耗的平衡,从而能够有效地延长无线中继网络的使用寿命,提 高网络性能。 另一方面,根据本发明实施例的通信设备通过对无线中继网络中 各节点进行筛选, 去除不能被选择作为中继节点的节点,从而能够避免对这些 节点进行后续的计算处理, 能够大大节省计算资源, 提供系统处理速度, 从而 进一步提高无线中继网络性能。
本领域普通技术人员可以意识到,结合本文中所公开的实施例中描述的各 方法步骤和单元, 能够以电子硬件、 计算机软件或者二者的结合来实现, 为了 清楚地说明硬件和软件的可互换性,在上述说明中已经按照功能一般性地描述 了各实施例的步骤及组成。这些功能究竟以硬件还是软件方式来执行,取决于 技术方案的特定应用和设计约束条件。本领域普通技术人员可以对每个特定的 应用来使用不同方法来实现所描述的功能,但是这种实现不应认为超出本发明 的范围。
结合本文中所公开的实施例描述的方法或步骤可以用硬件、处理器执行的 软件程序, 或者二者的结合来实施。 软件程序可以置于随机存储器(RAM )、 内存、 只读存储器(ROM )、 电可编程 ROM、 电可擦除可编程 ROM、 寄存器、 硬盘、 可移动磁盘、 CD-ROM、 或技术领域内所公知的任意其它形式的存储介 质中。 本发明并不限于此。在不脱离本发明的精神和实质的前提下, 本领域普通技术 人员可以对本发明的实施例进行各种等效的修改或替换,而这些修改或替换都 应在本发明的涵盖范围内。

Claims

权 利 要 求
1、 一种无线中继网络的中继节点选择与功率分配的方法, 其特征在于, 包括:
获取无线中继网络中各节点的能量价格,以及各节点与邻居节点之间链路 的链路信息, 其中所述能量价格确定为使得节点的剩余能量越少, 该节点的能 量价格越高;
根据各节点的能量价格以及链路信息,分别确定每个节点在被选择作为中 继节点的情况下,基于该节点的能量价格的目标函数值最小时所对应的功率分 配;
基于各节点的功率分配以及能量价格,将与各节点在功率分配时的目标函 数值中的最小值所对应的节点和功率分配分别确定为用于数据传输的中继节 点和功率分配。
2、 根据权利要求 1所述的方法, 其特征在于, 所述获取无线中继网络中 各节点的能量价格, 以及各节点与邻居节点之间链路的链路信息, 其中所述能 量价格确定为使得节点的剩余能量越少, 该节点的能量价格越高, 包括: 获取无线中继网络中各节点的能量价格,以及各节点与邻居节点之间链路 的链路信息,其中所述能量价格确定为与节点的初始总能量和剩余能量的比值 的幂函数成正比。
3、 根据权利要求 2所述的方法, 其特征在于, 所述获取无线中继网络中 各节点的能量价格, 以及各节点与邻居节点之间链路的链路信息, 其中所述能 量价格确定为使得节点的剩余能量越少, 该节点的能量价格越高, 包括: 获取无线中继网络中各节点的能量价格,以及各节点与邻居节点之间链路 的链路信息,其中所述能量价格确定为与节点的初始总能量和剩余能量的比值 的一阶或二阶幂函数成正比。
4、 根据权利要求 1至 3中任一项所述的方法, 其特征在于, 所述获取无 线中继网络中各节点的能量价格包括:
获取各节点的初始总能量和剩余能量, 并计算出各节点的能量价格; 或者 直接获取各节点的能量价格。
5、 根据权利要求 1至 3中任一项所述的方法, 其特征在于, 所述根据各 节点的能量价格以及链路信息,分别确定每个节点在被选择作为中继节点的情 况下, 基于该节点的能量价格的目标函数值最小时所对应的功率分配, 包括: 根据各节点的能量价格以及链路信息,分别确定每个节点在被选择作为中 继节点的情况下,源节点和该节点所消耗的能量成本总和最小时所对应的功率 分配。
6、 根据权利要求 5所述的方法, 其特征在于, 还包括: 根据各节点的能 量价格以及链路信息,确定无线中继网络的各节点中能够被选择作为中继节点 的候选节点,
其中, 所述根据各节点的能量价格以及链路信息, 分别确定每个节点在被 选择作为中继节点的情况下,源节点和该节点所消耗的能量成本总和最小时所 对应的功率分配, 包括: 根据各候选节点的能量价格以及链路信息, 分别确定 每个候选节点在被选择作为中继节点的情况下,源节点和该候选节点所消耗的 能量成本总和最小时所对应的功率分配;
所述基于各节点的功率分配以及能量价格,将与各节点在功率分配时的目 标函数值中的最小值所对应的节点和功率分配分别确定为用于数据传输的中 继节点和功率分配, 包括: 基于各候选节点的功率分配以及能量价格, 将与各 候选节点在功率分配时的能量成本总和中的最小值所对应的候选节点和功率 分配分别确定为用于数据传输的中继节点和功率分配。
7、 一种用于无线中继网络的中继节点选择与功率分配的通信设备, 其特 征在于, 包括:
获取模块, 用于获取无线中继网络中各节点的能量价格, 以及各节点与邻 居节点之间链路的链路信息,其中所述能量价格确定为使得节点的剩余能量越 少, 该节点的能量价格越高;
第一确定模块, 用于根据各节点的能量价格以及链路信息, 分别确定每个 节点在被选择作为中继节点的情况下,基于该节点的能量价格的目标函数值最 小时所对应的功率分配;
第二确定模块, 用于基于各节点的功率分配以及能量价格,将与各节点在 功率分配时的目标函数值中的最小值所对应的节点和功率分配分别确定为用 于数据传输的中继节点和功率分配。
8、 根据权利要求 7所述的通信设备, 其特征在于, 所述获取模块用于获 取无线中继网络中各节点的能量价格,以及各节点与邻居节点之间链路的链路 信息 ,其中所述能量价格确定为与节点的初始总能量和剩余能量的比值的幂函 数成正比。
9、 根据权利要求 8所述的通信设备, 其特征在于, 所述获取模块用于获 取无线中继网络中各节点的能量价格,以及各节点与邻居节点之间链路的链路 信息 ,其中所述能量价格确定为与节点的初始总能量和剩余能量的比值的一阶 或二阶幂函数成正比。
10、 根据权利要求 7至 9中任一项所述的通信设备, 其特征在于, 所述第 一确定模块用于根据各节点的能量价格以及链路信息,分别确定每个节点在被 选择作为中继节点的情况下,源节点和该节点所消耗的能量成本总和最小时所 对应的功率分配。
11、 根据权利要求 10所述的通信设备, 其特征在于, 所述通信设备还包 括: 第三确定模块, 用于根据各节点的能量价格以及链路信息, 确定无线中继 网络的各节点中能够被选择作为中继节点的候选节点,
其中, 第一确定模块用于根据各候选节点的能量价格以及链路信息, 分别 确定每个候选节点在被选择作为中继节点的情况下,源节点和该候选节点所消 耗的能量成本总和最小时所对应的功率分配;
第二确定模块用于基于各候选节点的功率分配以及能量价格,将与各候选 节点在功率分配时的能量成本总和中的最小值所对应的候选节点和功率分配 分别确定为用于数据传输的中继节点和功率分配。
PCT/CN2011/071283 2010-05-06 2011-02-25 无线中继网络的中继节点选择与功率分配的方法和设备 WO2011137680A1 (zh)

Priority Applications (2)

Application Number Priority Date Filing Date Title
EP11777101A EP2538726A4 (en) 2010-05-06 2011-02-25 METHOD AND APPARATUS FOR SELECTING RELAY N UDS AND POWER ASSIGNMENT IN A WIRELESS RELAY NETWORK
US13/622,285 US20130016652A1 (en) 2010-05-06 2012-09-18 Method and device for relay node selection and power allocation in wireless relay network

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201010164382.3 2010-05-06
CN201010164382.3A CN102238685B (zh) 2010-05-06 2010-05-06 无线中继网络的中继节点选择与功率分配的方法和设备

Related Child Applications (1)

Application Number Title Priority Date Filing Date
US13/622,285 Continuation US20130016652A1 (en) 2010-05-06 2012-09-18 Method and device for relay node selection and power allocation in wireless relay network

Publications (1)

Publication Number Publication Date
WO2011137680A1 true WO2011137680A1 (zh) 2011-11-10

Family

ID=44888748

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2011/071283 WO2011137680A1 (zh) 2010-05-06 2011-02-25 无线中继网络的中继节点选择与功率分配的方法和设备

Country Status (4)

Country Link
US (1) US20130016652A1 (zh)
EP (1) EP2538726A4 (zh)
CN (1) CN102238685B (zh)
WO (1) WO2011137680A1 (zh)

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103139864A (zh) * 2012-12-28 2013-06-05 北京邮电大学 认知协作中继转发方法及系统
CN105375972A (zh) * 2015-10-19 2016-03-02 中国科学院信息工程研究所 全双工中继装置、全双工中继传输控制方法及系统
CN103188785B (zh) * 2011-12-31 2017-04-19 北京大唐高鸿数据网络技术有限公司 一种物联网无线中继接入策略中功率分配的优化方法
CN111212469A (zh) * 2020-01-17 2020-05-29 青岛理工大学 一种基于恒参信道能量收集的协作通信系统

Families Citing this family (25)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US11128489B2 (en) * 2017-07-18 2021-09-21 Nicira, Inc. Maintaining data-plane connectivity between hosts
CN103517438A (zh) * 2012-06-15 2014-01-15 中国移动通信集团广东有限公司 协同通信系统中功率的分配方法和装置
CN102883370B (zh) * 2012-09-07 2015-03-04 浙江工业大学 基于无线传感器网络的电力线监测系统的分布式数据传输方法
CN103298084B (zh) * 2013-05-17 2016-04-06 山东大学 一种基于能效准则的协作多中继选择与功率分配方法
CN104010341B (zh) * 2014-06-06 2018-03-02 电子科技大学 一种用于高效协同组播通信中的中继选择和功率控制方法
CN104320839B (zh) * 2014-10-22 2017-12-29 浙江工业大学 多源多中继无线网络功率最小化的中继选择方法
CN105744625A (zh) 2014-12-12 2016-07-06 索尼公司 用于无线通信的装置和方法
CN104684042B (zh) * 2015-03-13 2019-02-01 深圳酷派技术有限公司 物联网中的数据传输方法、系统、物联网设备、终端
CN104768201B (zh) * 2015-03-13 2018-07-27 深圳酷派技术有限公司 物联网中的数据传输方法、系统、物联网设备、终端
CN104936251B (zh) * 2015-04-28 2018-08-03 广西师范大学 一种基于最优功率分配的安全协作中继选择方法和系统
CN105375955B (zh) * 2015-10-26 2018-07-17 西安电子科技大学 一种信能同传中继网络中的协作传输方法
CN105517049B (zh) * 2015-12-07 2019-01-18 华南理工大学 一种无线中继节点工作量的分配方法
US9887747B2 (en) 2016-02-29 2018-02-06 King Fahd University Of Petroleum And Minerals Low complexity relay selection and power allocation scheme for cognitive MIMO buffer-aided decode-and-forward relay networks
CN106454896B (zh) * 2016-10-14 2019-06-18 北京邮电大学 一种软件定义无线网中的基于能效的流表更新方法和装置
CN107148083B (zh) * 2017-03-25 2020-07-31 广西师范大学 基于价格机制的数据与能量协作方法
CN107508628B (zh) * 2017-06-26 2020-10-02 西安电子科技大学 一种射频能量收集中继网络中的协作传输方法
CN108566665B (zh) * 2018-03-12 2020-09-01 清华大学 一种中继选择方法和网络设备
CN109152056B (zh) * 2018-08-07 2020-10-09 清华大学 基于叠加编码的接入回传全双工通信方法及系统
CN109819509B (zh) * 2019-01-30 2021-09-10 重庆邮电大学 一种能量收集解码-转发中继系统的功率在线控制方法
CN109688557B (zh) * 2019-02-21 2020-10-23 中国联合网络通信集团有限公司 一种协作节点选择方法、装置
US11540171B2 (en) * 2019-07-12 2022-12-27 Qualcomm Incorporated Assisting communications of small data payloads with relay nodes
CN111629419B (zh) * 2020-04-27 2022-04-08 扬州大学 适用于af中继系统的传输方法
CN112953826B (zh) * 2020-11-22 2022-10-28 广州技象科技有限公司 一种物联网终端的数据跳传选择方法及装置
CN112566211B (zh) * 2020-12-11 2022-04-15 安徽大学 一种基于区块链智能合约的蜂窝小区中继协作通信方法
CN115707058A (zh) * 2021-08-10 2023-02-17 索尼集团公司 电子设备、用户设备、无线通信方法和存储介质

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1561509A (zh) * 2001-08-03 2005-01-05 霍尼韦尔国际公司 能量感知网络管理
CN101141388A (zh) * 2007-08-23 2008-03-12 武汉理工大学 一种Ad hoc网络中实现优化能量消耗的方法
WO2009057884A1 (en) * 2007-11-01 2009-05-07 Electronics And Telecommunications Research Institute Multi-path routing method in wireless sensor network
CN101534538A (zh) * 2009-04-09 2009-09-16 浙江工业大学 基于量子搜索思想的无线移动自组织网络路由控制系统
CN101577956A (zh) * 2009-06-15 2009-11-11 北京邮电大学 协作中继节点选择方法及系统

Family Cites Families (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7194463B2 (en) * 2002-05-28 2007-03-20 Xerox Corporation Systems and methods for constrained anisotropic diffusion routing within an ad hoc network
US7545765B2 (en) * 2003-04-11 2009-06-09 Telefonaktiebolaget Lm Ericsson (Publ) Multi-user diversity forwarding
US7853204B2 (en) * 2004-10-21 2010-12-14 Panasonic Corporation Method and system for identifying a relay mobile station in a wireless communication network

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1561509A (zh) * 2001-08-03 2005-01-05 霍尼韦尔国际公司 能量感知网络管理
CN101141388A (zh) * 2007-08-23 2008-03-12 武汉理工大学 一种Ad hoc网络中实现优化能量消耗的方法
WO2009057884A1 (en) * 2007-11-01 2009-05-07 Electronics And Telecommunications Research Institute Multi-path routing method in wireless sensor network
CN101534538A (zh) * 2009-04-09 2009-09-16 浙江工业大学 基于量子搜索思想的无线移动自组织网络路由控制系统
CN101577956A (zh) * 2009-06-15 2009-11-11 北京邮电大学 协作中继节点选择方法及系统

Cited By (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103188785B (zh) * 2011-12-31 2017-04-19 北京大唐高鸿数据网络技术有限公司 一种物联网无线中继接入策略中功率分配的优化方法
CN103139864A (zh) * 2012-12-28 2013-06-05 北京邮电大学 认知协作中继转发方法及系统
CN103139864B (zh) * 2012-12-28 2015-10-28 北京邮电大学 认知协作中继转发方法及系统
CN105375972A (zh) * 2015-10-19 2016-03-02 中国科学院信息工程研究所 全双工中继装置、全双工中继传输控制方法及系统
CN105375972B (zh) * 2015-10-19 2019-03-12 中国科学院信息工程研究所 全双工中继装置、全双工中继传输控制方法及系统
CN111212469A (zh) * 2020-01-17 2020-05-29 青岛理工大学 一种基于恒参信道能量收集的协作通信系统
CN111212469B (zh) * 2020-01-17 2023-04-28 青岛理工大学 一种基于恒参信道能量收集的协作通信系统

Also Published As

Publication number Publication date
CN102238685B (zh) 2014-08-20
US20130016652A1 (en) 2013-01-17
EP2538726A4 (en) 2013-03-06
EP2538726A1 (en) 2012-12-26
CN102238685A (zh) 2011-11-09

Similar Documents

Publication Publication Date Title
WO2011137680A1 (zh) 无线中继网络的中继节点选择与功率分配的方法和设备
Datsika et al. Green cooperative device–to–device communication: A social–aware perspective
Li et al. Control plane optimization in software-defined vehicular ad hoc networks
Iosifidis et al. Efficient and fair collaborative mobile internet access
Duan et al. Cooperative spectrum sharing: A contract-based approach
Yi et al. Cooperative communication-aware spectrum leasing in cognitive radio networks
JP5986324B2 (ja) デバイス・ツー・デバイスとセルラ通信のためのリソース共有方法と装置
US9253701B2 (en) System and method for device-to-device (D2D) assisted dynamic traffic control for cellular networks
Mishra et al. Efficient resource management by exploiting D2D communication for 5G networks
CN104640141B (zh) 一种多中继节点合作博弈的激励方法
TW200838202A (en) Inter-cell power control for interference management
CN103379502B (zh) 一种蜂窝网络中引入d2d技术的频谱资源分配方法
Syrivelis et al. Bits and coins: Supporting collaborative consumption of mobile internet
Zhang et al. On the study of fundamental trade‐offs between QoE and energy efficiency in wireless networks
Chen et al. Distributed best-relay selection for improving TCP performance over cognitive radio networks: A cross-layer design approach
CN101971579A (zh) 固定接入网中用于处理用户终端的接入的方法和装置
CN107249205B (zh) 一种资源分配方法、装置及用户终端
Pan et al. On the performance analysis and relay algorithm design in social-aware D2D cooperated communications
WO2015054900A1 (zh) 一种wlan的功率和信道联合配置的方法及装置
Avokh et al. Interference-aware multicast and broadcast routing in wireless mesh networks using both rate and channel diversity
Mastorakis et al. Maximizing energy conservation in a centralized cognitive radio network architecture
Su et al. Tac-U: A traffic balancing scheme over licensed and unlicensed bands for Tactile Internet
Xiao et al. Accelerating content delivery via efficient resource allocation for network coding aided D2D communications
Zhang et al. Selective spectrum leasing in internet of things via nash bargaining solutions
Aditya et al. Beyond the VCG mechanism: truthful reverse auctions for relay selection with high data rates, high base station utility and low interference in D2D networks

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 11777101

Country of ref document: EP

Kind code of ref document: A1

WWE Wipo information: entry into national phase

Ref document number: 2011777101

Country of ref document: EP

NENP Non-entry into the national phase

Ref country code: DE