CN109688557A - A kind of cooperative node selection method, device - Google Patents
A kind of cooperative node selection method, device Download PDFInfo
- Publication number
- CN109688557A CN109688557A CN201910130365.9A CN201910130365A CN109688557A CN 109688557 A CN109688557 A CN 109688557A CN 201910130365 A CN201910130365 A CN 201910130365A CN 109688557 A CN109688557 A CN 109688557A
- Authority
- CN
- China
- Prior art keywords
- candidate
- candidate nodes
- node
- collection
- nodes
- 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.)
- Granted
Links
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
This application discloses a kind of cooperative node selection method and devices, this method comprises: each both candidate nodes broadcast collaboration request message into the candidate collection pre-established；The both candidate nodes data that each both candidate nodes in candidate collection return are received, both candidate nodes data include both candidate nodes dump energy, channel gain, the distance of both candidate nodes to source node and both candidate nodes centrad；The benefit value of each both candidate nodes in candidate collection is calculated according to both candidate nodes data；According to the benefit value of each both candidate nodes, cooperative node is selected from candidate collection.The application is while guaranteeing network connectivty, using the energy consumption in equalising network as target, the equity value of each both candidate nodes in candidate collection is calculated using both candidate nodes dump energy, channel gain, the distance of both candidate nodes to source node and both candidate nodes centrad, and then selects cooperative node according to each both candidate nodes.Node energy consumption can be reduced to greatest extent, extend network lifetime.
Description
Technical field
The invention belongs to wireless sensor network technology fields, and in particular to a kind of cooperative node method, apparatus.
Background technique
In wireless sensor network, routing is responsible for for the data that node acquires being grouped being forwarded to aggregation node, still
Due to finite energy in sensor network, energy efficiency is directly related to the life span of wireless sensor network.Reduce node
Energy consumption data are carried out on optimal path in source node to an optimal routing is found between destination node
Transmitting, being capable of energy in efficient balance network.In practical application scene, if can not select suitable cooperative node, section
Collaborative between point will be very poor, will cause a large amount of energy consumption.
Currently used energy-saving routing method mainly has: Flood routing method and orderly distribution method for routing.
The basic thought of Flood routing method is that source node transmits the message to all neighbor nodes, and each neighbor node is again
Forward messages to destination node.Although Flood routing method can send a message to destination node with prestissimo,
It is easy to produce a large amount of message copy, wastes a large amount of energy.Orderly the basic thought of distribution method for routing is to comprehensively consider
The factors such as power consumption, QoS and packet priority power using multi-path transmission method have preferable network robustness.Although this method
It can guarantee the fault-tolerance of network, but when network size is larger, safeguard that the operation of multi-path network can bring huge energy
Amount consumption.Current energy-saving routing method or it is to generate a large amount of message copy or is the operation for safeguarding multi-path network
Huge energy consumption can be brought.
Summary of the invention
The application is for current energy-saving routing method or is to generate a large amount of message copy or is maintenance multipath
The operation of network can bring the problem of huge energy consumption, provide a kind of routing discovering method and device.
The application provides a kind of cooperative node selection method, comprising:
To the candidate collection broadcast collaboration request message pre-established；
The both candidate nodes data that each both candidate nodes in candidate collection return are received, the both candidate nodes data include waiting
Select residue energy of node, channel gain, the distance of both candidate nodes to source node and both candidate nodes centrad；
The benefit value of each both candidate nodes in candidate collection is calculated according to the both candidate nodes data；
According to the benefit value of each both candidate nodes, cooperative node is selected from the candidate collection.
Optionally, the benefit value that each both candidate nodes in candidate collection are calculated according to the both candidate nodes data walks
Suddenly, comprising:
Pass through formula according to the both candidate nodes dataIt calculates each in the candidate collection
The benefit value of both candidate nodes, whereinFor both candidate nodes dump energy,For channel gain,It is arrived for both candidate nodes
The distance of source node, CiFor both candidate nodes centrad.
It is optionally, described to before the candidate collection broadcast collaboration request message step pre-established, further includes:
The candidate collection is established according to the node that signal-to-noise ratio is greater than or equal to preset snr threshold, wherein
The number of both candidate nodes in the candidate collection is greater than or equal to N, and N is the number of antennas of source node.
Optionally, the benefit value according to each both candidate nodes, selects cooperative node from the candidate collection
Step, comprising:
Each both candidate nodes in the candidate collection are ranked up according to the sequence of successively decreasing of benefit value, and the row of filtering out
The preceding N number of both candidate nodes of sequence are determined as cooperative node, and wherein N is the number of antennas of source node.
Optionally, the benefit value according to each both candidate nodes, selects cooperative node from the candidate collection
After step, further includes:
Judge whether self rest energy is lower than preset energy threshold；
If so, instruction message is sent to base station, so that the base station reselects leader cluster node.
The application also provides a kind of cooperative node selection device, comprising:
Broadcast module, for the candidate collection broadcast collaboration request message pre-established；
Receiving module, for receiving the both candidate nodes data of the return of each both candidate nodes in candidate collection, the candidate
Node data includes both candidate nodes dump energy, channel gain, the distance of both candidate nodes to source node and both candidate nodes centrad；
Computing module, for calculating the benefit of each both candidate nodes in candidate collection according to the both candidate nodes data
Value；
Selecting module, for the benefit value according to each both candidate nodes, the selection cooperation section from the candidate collection
Point.
Optionally, the computing module, is specifically used for:
Pass through formula according to the both candidate nodes dataIt calculates each in the candidate collection
The benefit value of both candidate nodes, whereinFor both candidate nodes dump energy,For channel gain,It is arrived for both candidate nodes
The distance of source node, CiFor both candidate nodes centrad.
Optionally, described device further include:
Candidate collection establishes module, and the node for being greater than or equal to preset snr threshold according to signal-to-noise ratio is built
Found the candidate collection, wherein the number of the both candidate nodes in the candidate collection is greater than or equal to N, and N is the antenna of source node
Number.
Optionally, the selecting module, is specifically used for:
Each both candidate nodes in the candidate collection are ranked up according to the sequence of successively decreasing of benefit value, and the row of filtering out
The preceding N number of both candidate nodes of sequence are determined as cooperative node, and wherein N is the number of antennas of source node.
Optionally, described device further include:
Judgment module, for judging whether self rest energy is lower than preset energy threshold；
Sending module is used for if so, instruction message is sent to base station, so that the base station reselects leader cluster node.
A kind of cooperative node selection method provided by the present application, while guaranteeing network connectivty, in equalising network
Energy consumption be target, utilize both candidate nodes dump energy, channel gain, the distance of both candidate nodes to source node and candidate
Node center degree calculates the equity value of each both candidate nodes in candidate collection, and then selects cooperation according to each both candidate nodes
Node.Node energy consumption can be reduced to greatest extent, extend network lifetime.
Detailed description of the invention
Fig. 1 is a kind of flow chart for cooperative node selection method that the application first embodiment provides；
Fig. 2 is a kind of another flow chart for cooperative node selection method that the application first embodiment provides；
Fig. 3 is a kind of another flow chart for cooperative node selection method that the application first embodiment provides；
Fig. 4 is a kind of structural schematic diagram for cooperative node selection device that the application second embodiment provides；
Fig. 5 is a kind of another structural schematic diagram for cooperative node selection device that the application second embodiment provides；
Fig. 6 is a kind of another structural schematic diagram for cooperative node selection device that the application second embodiment provides.
Specific embodiment
Technical solution in order to enable those skilled in the art to better understand the present invention, with reference to the accompanying drawing and specific embodiment party
Present invention is further described in detail for formula.
The application provides a kind of cooperative node selection method, device.Below in conjunction with embodiment provided by the present application
Attached drawing is described in detail one by one.
A kind of cooperative node selection method that the application first embodiment provides is as follows:
The executing subject of the embodiment of the present application is leader cluster node, as shown in Figure 1, it illustrates provided by the embodiments of the present application
A kind of flow chart of cooperative node selection method, includes the following steps.
Step S101, each both candidate nodes broadcast collaboration request message into the candidate collection pre-established.
The energy consumption for reducing node exists data in source node to an optimal routing is found between destination node
It is transmitted on optimal path, it being capable of energy in efficient balance network.
In general, wireless sensor network has great deal of nodes, and finite energy cannot be communicated directly with base station, just
Effective Routing Protocol is needed, and clustering route protocol is one of which, the node of adjacent domain is formed a cluster by it, and is selected
Data are first transmitted to leader cluster node by leader cluster node out, cluster interior nodes, and leader cluster node will relay to next-hop after data fusion
Or it is directly forwarded to base station.
In practical application scene, if can not select suitable cooperative node, the collaborative between node will be very poor, meeting
Cause a large amount of energy consumption.In order to improve node energy efficiency, extends network lifetime, can use on sensor node
Antenna between the generation and reception for cooperating to complete data, multipath fading can be effective against, that realizes low energy consumption can
By communication.Leader cluster node can carry out the selection of cooperative node, therefore, in order to effectively achieve the mesh of equalising network energy consumption
, using leader cluster node as executing subject, propose a kind of novel cooperative node selection method.
Preferably, as shown in Fig. 2, it illustrates a kind of the another of cooperative node selection method provided by the embodiments of the present application
Flow chart, before the step S101, further includes:
The node that signal-to-noise ratio is greater than or equal to preset snr threshold is added to the Candidate Set by step S105
In conjunction, wherein the number of the both candidate nodes in the candidate collection is greater than or equal to N, and N is the number of antennas of source node.
Signal-to-noise ratio, English name are called SNR or S/N (SIGNAL-NOISE RATIO), also known as signal to noise ratio.Refer to one
The ratio of signal and noise in electronic equipment or electronic system.Here signal refers to passing through from device external needs
The electronic signal that this equipment is handled, noise refer to by not existing random in the original signal generated after the equipment
Extra (or information), and this kind of signal does not change with the variation of original signal.
In this step, leader cluster node first initializes network, pre-establishes the candidate collection of cooperative node.If
Determine received signal to noise ratio threshold valueWhen the signal-to-noise ratio of some node is greater than or equal to preset snr threshold, i.e.,When, then the node is added in candidate collection.Snr thresholdIt can according to need and voluntarily set
It is fixed, it is not construed as limiting herein.Otherwise the node becomes non-cooperative nodes, will be sent to leader cluster node from the information of source node.It keeps
Interstitial content in candidate collection is greater than or equal to N, and N is the number of antennas of source node, guarantees the association selected from candidate collection
The number for making node can be corresponding with the number of antennas of source node, can select N number of cooperative node.If the node in candidate collection
Number is less than N, then process terminates.
In a preferred solution, after candidate collection creates, each both candidate nodes in candidate collection according to
Energy consumed by current, calculates the dump energy of itselfAnd channel gainThe residue of each both candidate nodes itself
EnergyFor each both candidate nodes itself gross energy subtract consumption energy value, channel gainFor information transmission
When the value that detects.
In a preferred solution, each both candidate nodes in candidate collection calculate the dump energy of itself
And channel gainLater, each both candidate nodes of the source node into candidate collection broadcast a received signal strength indicator letter
Number, each both candidate nodes in candidate collection calculate the distance for itself arriving source node according to the signal strength received
Specifically, the node in candidate collection calculates the distance that itself arrives source nodeLater, step S101 is executed,
Each both candidate nodes of the leader cluster node into candidate collection broadcast a cooperation request message, so that leader cluster node is to cooperative node
It is selected.
Step S102 receives the both candidate nodes data that each both candidate nodes in candidate collection return, the both candidate nodes
Data include both candidate nodes dump energy, channel gain, the distance of both candidate nodes to source node and both candidate nodes centrad.
Specifically, each both candidate nodes in candidate collection save candidate after the cooperation request message for receiving leader cluster node
Point dump energyChannel gainDistance of the both candidate nodes to source nodeAnd node center degree CiIt is sent to
Leader cluster node.
Step S103 calculates the benefit value of each both candidate nodes in candidate collection according to the both candidate nodes data.
Preferably, the step S103, comprising: pass through formula according to the both candidate nodes data
Calculate the benefit value of each both candidate nodes in the candidate collection, whereinFor both candidate nodes dump energy,For
Channel gain,For the distance of both candidate nodes to source node, CiFor both candidate nodes centrad.
Specifically, leader cluster node is by both candidate nodes dump energyChannel gainBoth candidate nodes are to source node
DistanceAnd node center degree CiIt is brought into formulaThe middle benefit for calculating each both candidate nodes
Value Qi.The benefit value Q of each both candidate nodesiWith both candidate nodes dump energyIt is directly proportional, source node is arrived with both candidate nodes
DistanceSquare be inversely proportional.
Step S104 selects cooperative node from the candidate collection according to the benefit value of each both candidate nodes.
Preferably, the step S104, comprising: to each both candidate nodes passing according to benefit value in the candidate collection
Subtract sequence to be ranked up, and filter out the preceding N number of both candidate nodes of sequence and be determined as cooperative node, wherein N is the day of source node
Line number mesh.
Specifically, leader cluster node arranges each both candidate nodes in candidate collection according to the sequence of successively decreasing of benefit value
Sequence selects the preceding N number of both candidate nodes of sequence and is determined as cooperative node.Because the number of antennas of source node is N, the association selected
Make node also and be N number of, each cooperative node is transferred data to source node.
Preferably, as shown in figure 3, it illustrates a kind of the another of cooperative node selection method provided by the embodiments of the present application
Flow chart, after the step S104, further includes:
Step S106, judges whether self rest energy is lower than preset energy threshold, if so, thening follow the steps
S107；If it is not, process terminates.
Step S107 sends instruction message to base station, so that the base station reselects leader cluster node.
Specifically, being preset after a cycle time if leader cluster node detects that self rest energy is lower than
Energy threshold when, then to base station send instruction message so that base station reselects leader cluster node to whole network.Energy threshold
It can according to need sets itself, be not construed as limiting herein.After the completion of cluster-head node selection, step S105 is returned again to, is selected again
Select cooperative node.
In a preferred solution, it is preset if the cooperative node selected detects that self rest energy is lower than
Energy threshold when, can also to base station send instruction message so that base station reselects leader cluster node to whole network, in turn
Reselect cooperative node.
The application first initializes network, and leader cluster node creates the time of cooperative node by setting snr threshold
Selected works close.Leader cluster node each both candidate nodes into candidate collection broadcast a cooperation request message, and surplus using both candidate nodes
Complementary energy, channel gain, the distance of both candidate nodes to source node and node center degree calculate the equity value of each both candidate nodes.
Leader cluster node is ranked up the equity value of each both candidate nodes according to the sequence of successively decreasing of benefit value, and it is preceding N number of to select sequence
Both candidate nodes are determined as cooperative node.
A kind of cooperative node selection method provided by the present application, while guaranteeing network connectivty, in equalising network
Energy consumption be target, utilize both candidate nodes dump energy, channel gain, the distance of both candidate nodes to source node and node
Centrad calculates the equity value of each both candidate nodes in candidate collection, and then selects cooperation section according to each both candidate nodes
Point.Node energy consumption can be reduced to greatest extent, extend network lifetime.
A kind of cooperative node selection device that the application second embodiment provides is as follows:
In the above-described embodiment, a kind of cooperative node selection method is provided, corresponding, the application also provides
A kind of cooperative node selection device.
As shown in figure 4, it illustrates a kind of structural schematic diagram of cooperative node selection device provided by the embodiments of the present application,
It comprises the following modules.
Broadcast module 11, for each both candidate nodes broadcast collaboration request message into the candidate collection pre-established；
Receiving module 12, for receiving the both candidate nodes data of the return of each both candidate nodes in candidate collection, the time
Selecting node data includes both candidate nodes dump energy, channel gain, the distance of both candidate nodes to source node and both candidate nodes center
Degree；
Computing module 13, for calculating the benefit of each both candidate nodes in candidate collection according to the both candidate nodes data
Value；
Selecting module 14 selects cooperation for the benefit value according to each both candidate nodes from the candidate collection
Node.
Further, the computing module, is specifically used for:
Pass through formula according to the both candidate nodes dataIt calculates each in the candidate collection
The benefit value of both candidate nodes, whereinFor both candidate nodes dump energy,For channel gain,It is arrived for both candidate nodes
The distance of source node, CiFor both candidate nodes centrad.
Further, as shown in figure 5, it illustrates a kind of the another of cooperative node selection device provided by the embodiments of the present application
One structural schematic diagram, described device further include:
Candidate collection establishes module 15, and the node for signal-to-noise ratio to be greater than or equal to preset snr threshold adds
Enter into the candidate collection, wherein the number of the both candidate nodes in the candidate collection is greater than or equal to N, and N is source node
Number of antennas.
Further, the selecting module, is specifically used for:
Each both candidate nodes in the candidate collection are ranked up according to the sequence of successively decreasing of benefit value, and the row of filtering out
The preceding N number of both candidate nodes of sequence are determined as cooperative node, and wherein N is the number of antennas of source node.
Further, as shown in fig. 6, it illustrates a kind of the another of cooperative node selection device provided by the embodiments of the present application
One structural schematic diagram, described device further include:
Judgment module 16, for judging whether self rest energy is lower than preset energy threshold；
Sending module 17 is used for if so, instruction message is sent to base station, so that the base station reselects cluster head section
Point.
It is understood that the principle that embodiment of above is intended to be merely illustrative of the present and the exemplary implementation that uses
Mode, however the present invention is not limited thereto.For those skilled in the art, essence of the invention is not being departed from
In the case where mind and essence, various changes and modifications can be made therein, these variations and modifications are also considered as protection scope of the present invention.
Claims (10)
1. a kind of cooperative node selection method characterized by comprising
Each both candidate nodes broadcast collaboration request message into the candidate collection pre-established；
The both candidate nodes data that each both candidate nodes in candidate collection return are received, the both candidate nodes data include candidate section
Point dump energy, channel gain, the distance of both candidate nodes to source node and both candidate nodes centrad；
The benefit value of each both candidate nodes in candidate collection is calculated according to the both candidate nodes data；
According to the benefit value of each both candidate nodes, cooperative node is selected from the candidate collection.
2. cooperative node selection method according to claim 1, which is characterized in that described according to the both candidate nodes data
Calculate the benefit value step of each both candidate nodes in candidate collection, comprising:
Pass through formula according to the both candidate nodes dataCalculate each candidate in the candidate collection
The benefit value of node, whereinFor both candidate nodes dump energy,For channel gain,It is saved for both candidate nodes to source
The distance of point, CiFor both candidate nodes centrad.
3. cooperative node selection method according to claim 1, which is characterized in that described to the candidate collection pre-established
In each both candidate nodes broadcast collaboration request message step before, further includes:
The node that signal-to-noise ratio is greater than or equal to preset snr threshold is added in the candidate collection, wherein institute
The number for stating the both candidate nodes in candidate collection is greater than or equal to N, and N is the number of antennas of source node.
4. cooperative node selection method according to claim 1, which is characterized in that described according to each both candidate nodes
Benefit value, from the candidate collection select cooperative node step, comprising:
Each both candidate nodes in the candidate collection are ranked up according to the sequence of successively decreasing of benefit value, and filters out sequence and exists
Preceding N number of both candidate nodes are determined as cooperative node, and wherein N is the number of antennas of source node.
5. cooperative node selection method according to claim 1, which is characterized in that described according to each both candidate nodes
Benefit value, from the candidate collection select cooperative node step after, further includes:
Judge whether self rest energy is lower than preset energy threshold；
If so, instruction message is sent to base station, so that the base station reselects leader cluster node.
6. a kind of cooperative node selection device characterized by comprising
Broadcast module, for each both candidate nodes broadcast collaboration request message into the candidate collection pre-established；
Receiving module, for receiving the both candidate nodes data of the return of each both candidate nodes in candidate collection, the both candidate nodes
Data include both candidate nodes dump energy, channel gain, the distance of both candidate nodes to source node and both candidate nodes centrad；
Computing module, for calculating the benefit value of each both candidate nodes in candidate collection according to the both candidate nodes data；
Selecting module selects cooperative node from the candidate collection for the benefit value according to each both candidate nodes.
7. cooperative node selection device according to claim 6, which is characterized in that the computing module is specifically used for:
Pass through formula according to the both candidate nodes dataCalculate each candidate in the candidate collection
The benefit value of node, whereinFor both candidate nodes dump energy,For channel gain,It is saved for both candidate nodes to source
The distance of point, CiFor both candidate nodes centrad.
8. cooperative node selection device according to claim 6, which is characterized in that described device further include:
Candidate collection establishes module, and the node for signal-to-noise ratio to be greater than or equal to preset snr threshold is added to institute
It states in candidate collection, wherein the number of the both candidate nodes in the candidate collection is greater than or equal to N, and N is the antenna number of source node
Mesh.
9. cooperative node selection device according to claim 6, which is characterized in that the selecting module is specifically used for:
Each both candidate nodes in the candidate collection are ranked up according to the sequence of successively decreasing of benefit value, and filters out sequence and exists
Preceding N number of both candidate nodes are determined as cooperative node, and wherein N is the number of antennas of source node.
10. cooperative node selection device according to claim 6, which is characterized in that described device further include:
Judgment module, for judging whether self rest energy is lower than preset energy threshold；
Sending module is used for if so, instruction message is sent to base station, so that the base station reselects leader cluster 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 true CN109688557A (en) | 2019-04-26 |
| CN109688557B 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) |
Cited By (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 (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102104932A (en) * | 2010-12-14 | 2011-06-22 | 北京邮电大学 | Method for selecting cooperative nodes in LTE-A system, base station and cooperative node |
| US20130016652A1 (en) * | 2010-05-06 | 2013-01-17 | Huawei Technologies Co., Ltd. | Method and device for relay node selection and power allocation in wireless relay network |
| US20160337875A1 (en) * | 2013-12-23 | 2016-11-17 | Orange | A method for configuring a network comprising several nodes, a method for transmitting data in said network, and corresponding equipment and computer program |
| CN106851768A (en) * | 2016-12-30 | 2017-06-13 | 北京航空航天大学 | The self adaptation cross-layer multiple access method and system of quality of service guarantee |
| CN107295598A (en) * | 2017-08-08 | 2017-10-24 | 吉林大学 | A kind of relay selection method for being applied to energy and information simultaneous interpretation network packet |
| CN107333320A (en) * | 2017-06-30 | 2017-11-07 | 湖北工程学院 | Data forwarding method and device |
| CN108495351A (en) * | 2018-04-19 | 2018-09-04 | 中国联合网络通信集团有限公司 | A kind of data transmission method and system |
| CN108770036A (en) * | 2018-06-20 | 2018-11-06 | 中国联合网络通信集团有限公司 | Communication means and wireless sensor network Routing Protocol between cluster head |
| CN108834192A (en) * | 2018-04-28 | 2018-11-16 | 中国联合网络通信集团有限公司 | A kind of method for routing and server |
| CN108848540A (en) * | 2018-06-20 | 2018-11-20 | 中国联合网络通信集团有限公司 | Relay node selecting method and system |
-
2019
- 2019-02-21 CN CN201910130365.9A patent/CN109688557B/en active Active
Patent Citations (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20130016652A1 (en) * | 2010-05-06 | 2013-01-17 | Huawei Technologies Co., Ltd. | Method and device for relay node selection and power allocation in wireless relay network |
| CN102104932A (en) * | 2010-12-14 | 2011-06-22 | 北京邮电大学 | Method for selecting cooperative nodes in LTE-A system, base station and cooperative node |
| US20160337875A1 (en) * | 2013-12-23 | 2016-11-17 | Orange | A method for configuring a network comprising several nodes, a method for transmitting data in said network, and corresponding equipment and computer program |
| CN106851768A (en) * | 2016-12-30 | 2017-06-13 | 北京航空航天大学 | The self adaptation cross-layer multiple access method and system of quality of service guarantee |
| CN107333320A (en) * | 2017-06-30 | 2017-11-07 | 湖北工程学院 | Data forwarding method and device |
| CN107295598A (en) * | 2017-08-08 | 2017-10-24 | 吉林大学 | A kind of relay selection method for being applied to energy and information simultaneous interpretation network packet |
| CN108495351A (en) * | 2018-04-19 | 2018-09-04 | 中国联合网络通信集团有限公司 | A kind of data transmission method and system |
| CN108834192A (en) * | 2018-04-28 | 2018-11-16 | 中国联合网络通信集团有限公司 | A kind of method for routing and server |
| CN108770036A (en) * | 2018-06-20 | 2018-11-06 | 中国联合网络通信集团有限公司 | Communication means and wireless sensor network Routing Protocol between cluster head |
| CN108848540A (en) * | 2018-06-20 | 2018-11-20 | 中国联合网络通信集团有限公司 | Relay node selecting method and system |
Non-Patent Citations (2)
| Title |
|---|
| 毛口龙: ""基于协作MIMO的WSNs能耗均衡路由算法"", 《传感器与微***》 * |
| 毛口龙: ""基于协作MIMO的WSN节能路由算法研究"", 《信息科技辑》 * |
Cited By (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 |
Also Published As
| Publication number | Publication date |
|---|---|
| CN109688557B (en) | 2020-10-23 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN105375955B (en) | A kind of cooperation transmission method in letter energy simultaneous interpretation junction network | |
| CN104507144B (en) | Wireless take can junction network joint relay selection and resource allocation methods | |
| CN105188106B (en) | A kind of energy cooperation method of the relay system of wireless energy transfer power supply | |
| CN102271377A (en) | Double-bounce multi-path route method of wireless sensor network based on energy collection technology | |
| CN105517096B (en) | A kind of relay selection method of more relaying amplification forward collaboration networks | |
| CN102438290B (en) | Wireless network routing method based on directive antenna | |
| Suraweera et al. | Semi-blind amplify-and-forward with partial relay selection | |
| CN105120503A (en) | High-energy-efficiency node cooperative transmission method in wireless sensor network | |
| CN109951834A (en) | Bluetooth mesh method for routing based on the improved algorithm that floods | |
| Biagi et al. | Geo-routing algorithms and protocols for power line communications in smart grids | |
| CN110932969B (en) | Advanced metering system AMI network anti-interference attack routing algorithm for smart grid | |
| CN109688557A (en) | A kind of cooperative node selection method, device | |
| CN101969322B (en) | Method for evaluating multi-time scale link of wireless sensor network | |
| He et al. | Optimizing information freshness in RF-powered multi-hop wireless networks | |
| Zhao et al. | Cluster-parent based rpl for low-power and lossy networks in building environment | |
| CN109819496A (en) | A kind of marine more mobile heterogeneous platform short-distance networking methods | |
| CN102118183A (en) | Power carrier communication method and device | |
| Gama et al. | Energy analysis for the distributed receiver‐based cooperative medium access control for wireless sensor networks | |
| Tan et al. | A distributed and dynamic data gathering protocol for sensor networks | |
| CN109699060A (en) | A kind of means of communication and device of wireless sensor network | |
| CN105554894B (en) | H2H and M2M terminal transmission power cooperative control method in mobile network | |
| Patel et al. | Energy aware and link quality based routing in wireless sensor networks under TinyOS-2. x | |
| CN114339933B (en) | Opportunistic routing method, device and system based on energy efficiency | |
| Sarasvathi et al. | A Multi Route Rank Based Routing Protocol for Industrial Wireless Mesh Sensor Networks | |
| Arjun et al. | Multi-objective geographic routing protocol for wireless ad-hoc 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 |