CN109688557B - Cooperative node selection method and device - Google Patents
Cooperative node selection method and device Download PDFInfo
- Publication number
- CN109688557B CN109688557B CN201910130365.9A CN201910130365A CN109688557B CN 109688557 B CN109688557 B CN 109688557B CN 201910130365 A CN201910130365 A CN 201910130365A CN 109688557 B CN109688557 B CN 109688557B
- Authority
- CN
- China
- Prior art keywords
- candidate
- node
- candidate node
- nodes
- cooperative
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
- 238000010187 selection method Methods 0.000 title description 8
- 230000008901 benefit Effects 0.000 claims abstract description 37
- 238000000034 method Methods 0.000 claims abstract description 35
- 241000854291 Dianthus carthusianorum Species 0.000 claims description 27
- 238000012216 screening Methods 0.000 claims description 6
- 238000012163 sequencing technique Methods 0.000 claims description 6
- 238000005265 energy consumption Methods 0.000 abstract description 14
- 230000004083 survival effect Effects 0.000 abstract description 5
- 230000002035 prolonged effect Effects 0.000 abstract description 3
- 238000010586 diagram Methods 0.000 description 6
- 230000005540 biological transmission Effects 0.000 description 2
- 230000008859 change Effects 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 230000008569 process Effects 0.000 description 2
- 238000004891 communication Methods 0.000 description 1
- 230000003247 decreasing effect Effects 0.000 description 1
- 238000005562 fading Methods 0.000 description 1
- 230000001788 irregular Effects 0.000 description 1
- 239000000126 substance Substances 0.000 description 1
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W4/00—Services specially adapted for wireless communication networks; Facilities therefor
- H04W4/06—Selective distribution of broadcast services, e.g. multimedia broadcast multicast service [MBMS]; Services to user groups; One-way selective calling services
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
- H04W40/04—Communication route or path selection, e.g. power-based or shortest path routing based on wireless node resources
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
- H04W40/04—Communication route or path selection, e.g. power-based or shortest path routing based on wireless node resources
- H04W40/10—Communication route or path selection, e.g. power-based or shortest path routing based on wireless node resources based on available power or energy
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
- H04W40/12—Communication route or path selection, e.g. power-based or shortest path routing based on transmission quality or channel quality
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
- H04W40/20—Communication route or path selection, e.g. power-based or shortest path routing based on geographic position or location
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/24—Connectivity information management, e.g. connectivity discovery or connectivity update
- H04W40/32—Connectivity information management, e.g. connectivity discovery or connectivity update for defining a routing cluster membership
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W52/00—Power management, e.g. TPC [Transmission Power Control], power saving or power classes
- H04W52/02—Power saving arrangements
- H04W52/0203—Power saving arrangements in the radio access network or backbone network of wireless communication networks
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W84/00—Network topologies
- H04W84/18—Self-organising networks, e.g. ad-hoc networks or sensor networks
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D30/00—Reducing energy consumption in communication networks
- Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Multimedia (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The application discloses a method and a device for selecting a cooperative node, wherein the method comprises the following steps: broadcasting a cooperation request message to each candidate node in a pre-established candidate set; receiving candidate node data returned by each candidate node in the candidate set, wherein the candidate node data comprises candidate node residual energy, channel gain, the distance from the candidate node to the source node and the candidate node centrality; calculating the benefit value of each candidate node in the candidate set according to the candidate node data; and selecting the cooperative nodes from the candidate set according to the benefit value of each candidate node. The method and the device have the advantages that the network connectivity is guaranteed, meanwhile, the energy consumption in the balanced network is taken as a target, the rights and interests of each candidate node in the candidate set are calculated by using the residual energy of the candidate nodes, the channel gain, the distance from the candidate nodes to the source node and the candidate node center degree, and then the cooperative node is selected according to each candidate node. The energy consumption of the nodes can be reduced to the maximum extent, and the survival time of the network can be prolonged.
Description
Technical Field
The invention belongs to the technical field of wireless sensor networks, and particularly relates to a cooperative node method and device.
Background
In the wireless sensor network, the routing is responsible for grouping and forwarding data collected by the nodes to the sink node, but the energy efficiency is directly related to the survival time of the wireless sensor network due to the limited energy in the sensor network. The energy consumption of the nodes is reduced, an optimal route is found between the source node and the destination node, data are transmitted on the optimal path, and the energy in the network can be effectively balanced. In an actual application scenario, if a suitable cooperative node cannot be selected, the cooperation between nodes is poor, and a large amount of energy consumption is caused.
The currently common energy-saving routing methods mainly include: a flooding routing method and an ordered distribution routing method.
The basic idea of the flooding routing method is that a source node sends a message to all neighbor nodes, and each neighbor node forwards the message to a destination node. Although the flooding routing method can transmit the message to the destination node at the fastest speed, a large number of message copies are easy to generate, and a large amount of energy is wasted. The basic idea of the ordered distribution routing method is that the factors such as power consumption, QoS and grouping priority are comprehensively considered, and a multipath transmission method is adopted, so that the network robustness is better. Although this method can ensure the fault tolerance of the network, when the network size is large, maintaining the operation of the multipath network causes huge energy consumption. Current energy-efficient routing methods either generate a large number of message copies or incur significant energy costs to maintain the operation of a multi-path network. .
Disclosure of Invention
The application provides a route discovery method and a device aiming at the problems that a large number of message copies are generated or huge energy consumption is brought by maintaining the operation of a multi-path network in the current energy-saving routing method.
The application provides a cooperative node selection method, which comprises the following steps:
broadcasting a cooperation request message to a pre-established candidate set;
receiving candidate node data returned by each candidate node in a candidate set, wherein the candidate node data comprises candidate node residual energy, channel gain, the distance from the candidate node to a source node and candidate node centrality;
calculating the benefit value of each candidate node in the candidate set according to the candidate node data;
and selecting cooperative nodes from the candidate set according to the benefit value of each candidate node.
Optionally, the step of calculating the benefit value of each candidate node in the candidate set according to the candidate node data includes:
passing through a formula according to the candidate node data
Calculating a benefit value for each candidate node in the candidate set, wherein,
the energy remaining for the candidate node is,
in order to obtain the gain of the channel,
as distance of the candidate node from the source node, CiAnd the candidate node centrality is obtained.
Optionally, before the step of broadcasting the cooperation request message to the pre-established candidate set, the method further includes:
and establishing the candidate set according to the nodes with the signal-to-noise ratios larger than or equal to a preset signal-to-noise ratio threshold, wherein the number of the candidate nodes in the candidate set is larger than or equal to N, and N is the number of the antennas of the source node.
Optionally, the step of selecting a cooperative node from the candidate set according to the benefit value of each candidate node includes:
and sequencing each candidate node in the candidate set according to the descending order of the benefit values, screening N candidate nodes sequenced at the front, and determining the N candidate nodes as cooperative nodes, wherein N is the number of antennas of the source node.
Optionally, after the step of selecting a cooperative node from the candidate set according to the benefit value of each candidate node, the method further includes:
judging whether the self residual energy is lower than a preset energy threshold value or not;
and if so, sending an indication message to the base station so that the base station reselects the cluster head node.
The present application further provides a cooperative node selection apparatus, including:
a broadcasting module, configured to broadcast a collaboration request message to a pre-established candidate set;
the receiving module is used for receiving candidate node data returned by each candidate node in the candidate set, wherein the candidate node data comprises candidate node residual energy, channel gain, the distance from the candidate node to the source node and candidate node centrality;
the calculation module is used for calculating the benefit value of each candidate node in the candidate set according to the candidate node data;
and the selection module is used for selecting the cooperative node from the candidate set according to the benefit value of each candidate node.
Optionally, the calculation module is specifically configured to:
passing through a formula according to the candidate node data
Calculating a benefit value for each candidate node in the candidate set, wherein,
the energy remaining for the candidate node is,
in order to obtain the gain of the channel,
as distance of the candidate node from the source node, CiAnd the candidate node centrality is obtained.
Optionally, the apparatus further comprises:
and the candidate set establishing module is used for establishing the candidate set according to the nodes with the signal-to-noise ratios larger than or equal to a preset signal-to-noise ratio threshold, wherein the number of the candidate nodes in the candidate set is larger than or equal to N, and N is the number of the antennas of the source node.
Optionally, the selecting module is specifically configured to:
and sequencing each candidate node in the candidate set according to the descending order of the benefit values, screening N candidate nodes sequenced at the front, and determining the N candidate nodes as cooperative nodes, wherein N is the number of antennas of the source node.
Optionally, the apparatus further comprises:
the judging module is used for judging whether the self residual energy is lower than a preset energy threshold value;
and if so, sending an indication message to the base station so that the base station reselects the cluster head node.
According to the cooperative node selection method, network connectivity is guaranteed, meanwhile, energy consumption in a balanced network is taken as a target, the rights and interests of each candidate node in a candidate set are calculated by using the residual energy of the candidate node, the channel gain, the distance from the candidate node to a source node and the candidate node center degree, and then the cooperative node is selected according to each candidate node. The energy consumption of the nodes can be reduced to the maximum extent, and the survival time of the network can be prolonged.
Drawings
Fig. 1 is a flowchart of a method for selecting a cooperative node according to a first embodiment of the present application;
fig. 2 is another flowchart of a method for selecting a cooperative node according to a first embodiment of the present disclosure;
fig. 3 is another flowchart of a method for selecting a cooperative node according to a first embodiment of the present application;
fig. 4 is a schematic structural diagram of a cooperative node selection apparatus according to a second embodiment of the present application;
fig. 5 is another schematic structural diagram of a cooperative node selection apparatus according to a second embodiment of the present application;
fig. 6 is another schematic structural diagram of a cooperative node selection apparatus according to a second embodiment of the present application.
Detailed Description
In order to make the technical solutions of the present invention better understood, the present invention will be described in further detail with reference to the accompanying drawings and specific embodiments.
The application provides a cooperative node selection method and device. The following detailed description is made with reference to the drawings of the embodiments provided in the present application, respectively.
A method for selecting a cooperative node provided in a first embodiment of the present application is as follows:
an execution subject of the embodiment of the present application is a cluster head node, and as shown in fig. 1, it shows a flowchart of a cooperative node selection method provided in the embodiment of the present application, and includes the following steps.
Step S101, broadcasting a cooperation request message to each candidate node in a pre-established candidate set.
The energy consumption of the nodes is reduced, an optimal route is found between the source node and the destination node, data are transmitted on the optimal path, and the energy in the network can be effectively balanced.
Generally, a wireless sensor network has a large number of nodes, and energy is limited and cannot directly communicate with a base station, so an effective routing protocol is needed, while a clustering routing protocol is one of the routing protocols, and is used for forming nodes in a neighboring area into a cluster and selecting cluster head nodes, wherein the nodes in the cluster transmit data to the cluster head nodes, and the cluster head nodes transmit the data to a next hop or directly transmit the data to the base station after fusing the data.
In an actual application scenario, if a suitable cooperative node cannot be selected, the cooperation between nodes is poor, and a large amount of energy consumption is caused. In order to improve the energy efficiency of the nodes and prolong the survival time of the network, the generation and the reception of data can be completed by utilizing the mutual cooperation among the antennas on the sensor nodes, the multipath fading can be effectively resisted, and the reliable communication with low energy consumption is realized. The cluster head nodes can select the cooperative nodes, so that a novel cooperative node selection method is provided by taking the cluster head nodes as an execution main body in order to effectively achieve the purpose of balancing network energy consumption.
Preferably, as shown in fig. 2, another flowchart of a method for selecting a cooperative node provided in an embodiment of the present application is shown, where before the step S101, the method further includes:
and step S105, adding nodes with the signal-to-noise ratio larger than or equal to a preset signal-to-noise ratio threshold value into the candidate set, wherein the number of the candidate nodes in the candidate set is larger than or equal to N, and N is the number of the antennas of the source node.
The SIGNAL-to-NOISE RATIO, known by the English name SNR or S/N (Signal-NOISE RATIO), is also known as the SIGNAL-to-NOISE RATIO. Refers to the ratio of signal to noise in an electronic device or system. The signal refers to an electronic signal from the outside of the device to be processed by the device, the noise refers to an irregular extra signal (or information) which does not exist in the original signal generated after passing through the device, and the signal does not change along with the change of the original signal.
In this step, the cluster head node first initializes the network, and establishes a candidate set of the cooperative node in advance. Setting a received signal-to-noise ratio threshold
When the signal-to-noise ratio of a certain node is greater than or equal to the preset signal-to-noise ratio threshold value, that is to say
And then adding the node into the candidate set. Signal to noise ratio threshold
The setting can be self-set according to the needs, and is not limited here. Otherwise, the node becomes a non-cooperative node and sends the information from the source node to the cluster head node. And keeping the number of the nodes in the candidate set to be more than or equal to N, wherein N is the number of antennas of the source node, and ensuring that the number of the cooperative nodes selected from the candidate set can correspond to the number of the antennas of the source node, namely selecting N cooperative nodes. If the number of nodes in the candidate set is less than N, the process ends.
In a preferred scheme, after the candidate set is created, each candidate node in the candidate set calculates the residual energy of each candidate node according to the currently consumed energy
Sum channel gain
Each candidate node's own residual energy
The value of the total energy of each candidate node by the consumed energy and the channel gain
Is the value detected at the time of information transmission.
In a preferred scheme, each candidate node in the candidate set calculates the residual energy of the candidate node
Sum channel gain
Then, the source node broadcasts a received signal strength indication signal to each candidate node in the candidate set, and each candidate node in the candidate set calculates the distance from the candidate node to the source node according to the received signal strength
Specifically, the nodes in the candidate set calculate their own distance to the source node
Then, step S101 is executed, and the cluster head node broadcasts a cooperation request message to each candidate node in the candidate set, so that the cluster head node selects a cooperation node.
Step S102, receiving candidate node data returned by each candidate node in the candidate set, wherein the candidate node data comprises candidate node residual energy, channel gain, distance from the candidate node to a source node and candidate node centrality.
Specifically, after each candidate node in the candidate set receives the cooperation request message of the cluster head node, the residual energy of the candidate node is obtained
Channel gain
Distance of candidate node to source node
And node centrality CiAnd sending the data to the cluster head node.
Step S103, calculating the benefit value of each candidate node in the candidate set according to the candidate node data.
Preferably, the step S103 includes: passing through a formula according to the candidate node data
Calculating a benefit value for each candidate node in the candidate set, wherein,
the energy remaining for the candidate node is,
in order to obtain the gain of the channel,
as distance of the candidate node from the source node, CiAnd the candidate node centrality is obtained.
Specifically, the cluster head node transmits the residual energy of the candidate node
Channel gain
Distance of candidate node to source node
And node centrality CiInto formulas
Calculating a benefit value Q of each candidate nodei. Benefit value Q of each candidate nodeiAnd candidate node residual energy
Proportional to the distance of the candidate node from the source node
Is inversely proportional to the square of.
And step S104, selecting cooperative nodes from the candidate set according to the benefit values of the candidate nodes.
Preferably, the step S104 includes: and sequencing each candidate node in the candidate set according to the descending order of the benefit values, screening N candidate nodes sequenced at the front, and determining the N candidate nodes as cooperative nodes, wherein N is the number of antennas of the source node.
Specifically, the cluster head node sorts each candidate node in the candidate set according to the decreasing order of the benefit values, and selects N candidate nodes sorted at the front to determine as the cooperative nodes. Because the number of the antennas of the source node is N, the number of the selected cooperative nodes is also N, so that the source node transmits data to each cooperative node.
Preferably, as shown in fig. 3, another flowchart of a method for selecting a cooperative node provided in the embodiment of the present application is shown, and after the step S104, the method further includes:
step S106, judging whether the self residual energy is lower than a preset energy threshold value, if so, executing step S107; if not, the process is ended.
Step S107, sending an indication message to the base station to enable the base station to reselect the cluster head node.
Specifically, after a period of time, if the cluster head node detects that the remaining energy of the cluster head node is lower than a preset energy threshold, an indication message is sent to the base station, so that the base station reselects the cluster head node for the entire network. The energy threshold may be set according to the need, and is not limited herein. And after the cluster head node is selected, returning to the step S105 to reselect the cooperative node.
In a preferred scheme, if the selected cooperative node detects that the self remaining energy is lower than the preset energy threshold, an indication message may also be sent to the base station, so that the base station reselects the cluster head node for the entire network, and further reselects the cooperative node.
The method includes the steps that firstly, a network is initialized, and a cluster head node establishes a candidate set of cooperative nodes by setting a signal-to-noise ratio threshold. The cluster head node broadcasts a cooperation request message to each candidate node in the candidate set, and the rights and interests of each candidate node are calculated by using the residual energy of the candidate node, the channel gain, the distance from the candidate node to the source node and the node centrality. And the cluster head node sorts the rights and interests of each candidate node according to the descending order of the benefit values, and selects N candidate nodes sorted in the front to determine as the cooperative nodes.
According to the cooperative node selection method, network connectivity is guaranteed, meanwhile, energy consumption in a balanced network is taken as a target, the rights and interests of each candidate node in a candidate set are calculated by means of the residual energy of the candidate nodes, channel gain, the distance from the candidate nodes to a source node and node centrality, and then the cooperative nodes are selected according to the candidate nodes. The energy consumption of the nodes can be reduced to the maximum extent, and the survival time of the network can be prolonged.
A cooperative node selection apparatus provided in a second embodiment of the present application is as follows:
in the foregoing embodiment, a method for selecting a cooperative node is provided, and correspondingly, an apparatus for selecting a cooperative node is also provided.
As shown in fig. 4, a schematic structural diagram of a cooperative node selection apparatus provided in an embodiment of the present application is shown, and includes the following modules.
A broadcasting module 11, configured to broadcast a cooperation request message to each candidate node in a pre-established candidate set;
a receiving module 12, configured to receive candidate node data returned by each candidate node in a candidate set, where the candidate node data includes candidate node residual energy, channel gain, a distance from the candidate node to a source node, and a candidate node centrality;
a calculating module 13, configured to calculate, according to the candidate node data, a benefit value of each candidate node in the candidate set;
and a selecting module 14, configured to select a cooperative node from the candidate set according to the benefit value of each candidate node.
Further, the calculation module is specifically configured to:
passing through a formula according to the candidate node data
Calculating a benefit value for each candidate node in the candidate set, wherein,
the energy remaining for the candidate node is,
in order to obtain the gain of the channel,
as distance of the candidate node from the source node, CiAnd the candidate node centrality is obtained.
Further, as shown in fig. 5, another schematic structural diagram of a cooperative node selection apparatus provided in an embodiment of the present application is shown, where the apparatus further includes:
a candidate set establishing module 15, configured to add a node with a signal-to-noise ratio greater than or equal to a preset signal-to-noise ratio threshold into the candidate set, where the number of candidate nodes in the candidate set is greater than or equal to N, and N is the number of antennas of the source node.
Further, the selection module is specifically configured to:
and sequencing each candidate node in the candidate set according to the descending order of the benefit values, screening N candidate nodes sequenced at the front, and determining the N candidate nodes as cooperative nodes, wherein N is the number of antennas of the source node.
Further, as shown in fig. 6, another schematic structural diagram of a cooperative node selection apparatus provided in an embodiment of the present application is shown, where the apparatus further includes:
the judging module 16 is used for judging whether the self residual energy is lower than a preset energy threshold value;
a sending module 17, configured to send an indication message to the base station if the node is a cluster node, so that the base station reselects the cluster node.
It will be understood that the above embodiments are merely exemplary embodiments taken to illustrate the principles of the present invention, which is not limited thereto. It will be apparent to those skilled in the art that various modifications and improvements can be made without departing from the spirit and substance of the invention, and these modifications and improvements are also considered to be within the scope of the invention.
Claims (8)
1. A method for cooperative node selection, comprising:
broadcasting a cooperation request message to each candidate node in a pre-established candidate set;
receiving candidate node data returned by each candidate node in a candidate set, wherein the candidate node data comprises candidate node residual energy, channel gain, the distance from the candidate node to a source node and candidate node centrality;
calculating the benefit value of each candidate node in the candidate set according to the candidate node data;
selecting cooperative nodes from the candidate set according to the benefit value of each candidate node;
the step of calculating the benefit value of each candidate node in the candidate set according to the candidate node data comprises:
passing through a formula according to the candidate node data
Calculating a benefit value for each candidate node in the candidate set, wherein,
the energy remaining for the candidate node is,
in order to obtain the gain of the channel,
as distance of the candidate node from the source node, CiAnd the candidate node centrality is obtained.
2. The method of claim 1, wherein before the step of broadcasting the collaboration request message to each candidate node in the pre-established candidate set, the method further comprises:
and adding nodes with the signal-to-noise ratio larger than or equal to a preset signal-to-noise ratio threshold value into the candidate set, wherein the number of the candidate nodes in the candidate set is larger than or equal to N, and N is the number of the antennas of the source node.
3. The method of claim 1, wherein the step of selecting a cooperative node from the candidate set according to the benefit value of each candidate node comprises:
and sequencing each candidate node in the candidate set according to the descending order of the benefit values, screening N candidate nodes sequenced at the front, and determining the N candidate nodes as cooperative nodes, wherein N is the number of antennas of the source node.
4. The method of claim 1, wherein after the step of selecting a cooperative node from the candidate set according to the benefit value of each candidate node, the method further comprises:
judging whether the self residual energy is lower than a preset energy threshold value or not;
and if so, sending an indication message to the base station so that the base station reselects the cluster head node.
5. A cooperative node selection apparatus, comprising:
the broadcasting module is used for broadcasting the cooperation request message to each candidate node in a pre-established candidate set;
the receiving module is used for receiving candidate node data returned by each candidate node in the candidate set, wherein the candidate node data comprises candidate node residual energy, channel gain, the distance from the candidate node to the source node and candidate node centrality;
the calculation module is used for calculating the benefit value of each candidate node in the candidate set according to the candidate node data;
a selecting module, configured to select a cooperative node from the candidate set according to the benefit value of each candidate node;
the calculation module is specifically configured to:
passing through a formula according to the candidate node data
Calculating a benefit value for each candidate node in the candidate set, wherein,
the energy remaining for the candidate node is,
in order to obtain the gain of the channel,
as distance of the candidate node from the source node, CiAnd the candidate node centrality is obtained.
6. The cooperative node selection apparatus as recited in claim 5, further comprising:
and the candidate set establishing module is used for adding nodes with signal-to-noise ratios larger than or equal to a preset signal-to-noise ratio threshold value into the candidate set, wherein the number of the candidate nodes in the candidate set is larger than or equal to N, and N is the number of the antennas of the source node.
7. The cooperative node selection apparatus according to claim 5, wherein the selection module is specifically configured to:
and sequencing each candidate node in the candidate set according to the descending order of the benefit values, screening N candidate nodes sequenced at the front, and determining the N candidate nodes as cooperative nodes, wherein N is the number of antennas of the source node.
8. The cooperative node selection apparatus as recited in claim 5, further comprising:
the judging module is used for judging whether the self residual energy is lower than a preset energy threshold value;
and if so, sending an indication message to the base station so that the base station reselects the cluster head node.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910130365.9A CN109688557B (en) | 2019-02-21 | 2019-02-21 | Cooperative node selection method and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910130365.9A CN109688557B (en) | 2019-02-21 | 2019-02-21 | Cooperative node selection method and device |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN109688557A CN109688557A (en) | 2019-04-26 |
| CN109688557B true CN109688557B (en) | 2020-10-23 |
Family
ID=66196665
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910130365.9A Active CN109688557B (en) | 2019-02-21 | 2019-02-21 | Cooperative node selection method and device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109688557B (en) |
Families Citing this family (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109922511A (en) * | 2019-04-29 | 2019-06-21 | 中国联合网络通信集团有限公司 | Cluster-head node selection method, node clustering method and cluster-head node selection device |
| WO2022067560A1 (en) * | 2020-09-29 | 2022-04-07 | 西门子股份公司 | Collaborative work method and system, mobile robot, computing device, and storage medium |
Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107333320A (en) * | 2017-06-30 | 2017-11-07 | 湖北工程学院 | Data forwarding method and device |
Family Cites Families (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102238685B (en) * | 2010-05-06 | 2014-08-20 | 华为技术有限公司 | Method and equipment for relay node selection and power distribution in wireless relay network |
| CN102104932B (en) * | 2010-12-14 | 2014-01-22 | 北京邮电大学 | Method for selecting cooperative nodes in LTE-A system, base station and cooperative node |
| WO2015096004A1 (en) * | 2013-12-23 | 2015-07-02 | Orange | A method for configuring a network comprising several nodes, a method for transmitting data in said network, and corresponding equipment and computer program |
| CN106851768B (en) * | 2016-12-30 | 2020-03-27 | 北京航空航天大学 | Self-adaptive cross-layer multiple access method and system for ensuring service quality |
| CN107295598B (en) * | 2017-08-08 | 2020-07-24 | 吉林大学 | Relay selection method suitable for energy and information simultaneous transmission network grouping |
| CN108495351A (en) * | 2018-04-19 | 2018-09-04 | 中国联合网络通信集团有限公司 | A kind of data transmission method and system |
| CN108834192B (en) * | 2018-04-28 | 2020-08-18 | 中国联合网络通信集团有限公司 | Routing method and server |
| CN108848540B (en) * | 2018-06-20 | 2020-09-15 | 中国联合网络通信集团有限公司 | Relay node selection method and system |
| CN108770036B (en) * | 2018-06-20 | 2020-10-02 | 中国联合网络通信集团有限公司 | Inter-cluster-head communication method and wireless sensor network routing device |
-
2019
- 2019-02-21 CN CN201910130365.9A patent/CN109688557B/en active Active
Patent Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107333320A (en) * | 2017-06-30 | 2017-11-07 | 湖北工程学院 | Data forwarding method and device |
Also Published As
| Publication number | Publication date |
|---|---|
| CN109688557A (en) | 2019-04-26 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US10735503B2 (en) | Content delivery in wireless wide area networks | |
| US9806953B2 (en) | Content delivery in wireless wide area networks | |
| KR100810662B1 (en) | Method and apparatus for discoverying route in a wireless network | |
| Deng et al. | Optimum transmission range for wireless ad hoc networks | |
| CN106454984B (en) | Routing method and device | |
| Wang | Power-aware dual-tree-based multicast routing protocol for mobile ad hoc networks | |
| US11778019B2 (en) | Content delivery in wireless wide area networks | |
| CN109688557B (en) | Cooperative node selection method and device | |
| JP2005236632A (en) | Radio network apparatus, radio network system and routing method | |
| CN110831006B (en) | Ad hoc network system and data transmission method thereof | |
| JP5252978B2 (en) | Route control method, communication system, and communication apparatus | |
| CN101729335A (en) | Wireless node | |
| CN109819496A (en) | A kind of marine more mobile heterogeneous platform short-distance networking methods | |
| CN110121185B (en) | Power distribution communication network route optimization method | |
| CN102137463A (en) | Energy-based multi-path routing method for wireless network | |
| Dziri et al. | Performance analysis of MIMO cooperative relays for wireless sensor networks | |
| CN115665860A (en) | Unmanned aerial vehicle ad hoc network resource allocation method based on migratory bird swarm characteristics | |
| Liu et al. | A region-based routing protocol for wireless mobile ad hoc networks | |
| Tan et al. | A distributed and dynamic data gathering protocol for sensor networks | |
| CN201355813Y (en) | Wireless node | |
| CN111106856B (en) | Cooperative relay network and transmission method thereof | |
| CN109495946B (en) | Data transmission method and device of wireless sensor network | |
| CN103220035A (en) | Cooperative communication transmission method | |
| Nasaruddin et al. | Relay selection-based energy efficiency of hybrid device-to-device-enabled 5G networks | |
| Yu et al. | Reliable flooding-based downlink transmissions for Industrial Wireless Sensor and Actuator Networks |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |