CN109922511A - Cluster-head node selection method, node clustering method and cluster-head node selection device - Google Patents
Cluster-head node selection method, node clustering method and cluster-head node selection device Download PDFInfo
- Publication number
- CN109922511A CN109922511A CN201910356556.7A CN201910356556A CN109922511A CN 109922511 A CN109922511 A CN 109922511A CN 201910356556 A CN201910356556 A CN 201910356556A CN 109922511 A CN109922511 A CN 109922511A
- Authority
- CN
- China
- Prior art keywords
- node
- cluster
- head
- dump energy
- indicate
- 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.)
- Pending
Links
Classifications
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D30/00—Reducing energy consumption in communication networks
- Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks
Abstract
The present invention provides a kind of cluster-head node selection method, node clustering method and cluster-head node selection device, belongs to wireless sensor network technology field.Cluster-head node selection method of the invention, comprising: receive the dump energy that each node is sent；Judge whether each node meets preset cluster head race condition according to the dump energy；If the node meets the cluster head race condition, the related data of the node is obtained；The related data includes: centrad, the history duration for serving as cluster head；Optimal node is selected as leader cluster node according to the related data and the dump energy.
Description
Technical field
The invention belongs to wireless sensor network technology fields, and in particular to a kind of cluster-head node selection method, node point
Cluster method and cluster-head node selection device.
Background technique
Sensor node in wireless sensor network is usually deployed under conditions of bad environments, and node passes through wireless
The mode of communication sends the data to base station.
In order to efficiently utilize the energy resource in network, invalid biography of (redundancy) data in network is reduced to the maximum extent
Defeated, researcher proposes the method for sub-clustering.It can be seen that leader cluster node due to undertaking more data from the working mechanism of cluster
The pretreatment works such as fusion and forwarding work, rate of energy dissipation be significantly larger than other nodes in cluster.
Currently used node clustering method mainly has: stratification clustering method and non-homogenized clustering method.
The basic thought of stratification clustering method is that node is found according to signal strength apart from nearest neighbor node, and
Constantly change signal strength, so that the signal that node is sent can only be monitored by the neighbor node nearest apart from itself.Utilize shape
At communication link so that message is eventually transferred to destination node.Although this method extends network lifetime, network
It needs to adjust topological structure constantly, causes a large amount of consumption of energy.
The basic thought of non-homogenized clustering method is to realize sub-clustering using the distance between cluster head and base station.From base station
The scale for the cluster being closer is smaller, larger from the farther away cluster of base station distance, so that network is cut into non-homogenized
Cluster.But this method, due to Node distribution unevenness, will lead to the cluster head close from base station can seriously consume energy, and node is caused to mention
Preceding death reduces the life span of network.
To sum up, current node clustering method or be that the cluster head close from base station can seriously consume energy, causes node to mention
It is preceding dead or be that network needs the moment to adjust topological structure, cause energy consumption larger.
Summary of the invention
The present invention is directed at least solve one of the technical problems existing in the prior art, providing one kind can be in network
Node energy consumption extends the cluster-head node selection method of network lifetime.
Solving technical solution used by present invention problem is a kind of cluster-head node selection method, comprising:
Receive the dump energy that each node is sent；
Judge whether each node meets preset cluster head race condition according to the dump energy；
If the node meets the cluster head race condition, the related data of the node is obtained；The related data
It include: centrad, the history duration for serving as cluster head；
Optimal node is selected as leader cluster node according to the related data and the dump energy.
Preferably, described that the step of whether each node meets preset cluster head race condition is judged according to the dump energy
Include:
According to the dump energy of each node, the energy benefits value P of each node is calculated according to the first formula；
Judge whether the energy benefits value of each node is greater than preset value, if so, the node meets cluster head
Race condition.
It is further preferred that first formula includes:
Wherein, P (Vi) indicate node ViEnergy benefits value, E (Vi) indicate node ViDump energy, EaveIndicate network
In all nodes dump energy average value.
It is further preferred that the preset value is 1.
It is further preferred that described select optimal node according to the related data and the dump energy of each node
Include: as the step of leader cluster node
The weight W of each node is calculated according to the second formula；
Select the smallest node of the weight as leader cluster node；
Wherein, the second formula includes:
Wherein, W (Vi) indicate node ViCentrad, dg (Vi) indicate node ViCentrad, T (Vi) indicate node ViLoad
Appoint the history duration of cluster head；TthrIndicate network operation total time, P (Vi) indicate node ViEnergy benefits value, alpha+beta+γ=1.
Solving technical solution used by present invention problem is a kind of node clustering method, including any one of the above
Cluster-head node selection method.
Preferably, the node clustering method includes:
The node self-test stage: each node voluntarily judges whether itself has cluster head function, if so, to cluster-head node selection
Device sends the dump energy of itself；
The cluster-head node selection stage: cluster-head node selection device cluster head as claimed in any of claims 1 to 5
Node selecting method selects leader cluster node.
Solving technical solution used by present invention problem is a kind of cluster-head node selection device, comprising:
Receiving unit, the dump energy sent for receiving each node；
Judging unit, for judging whether each node meets preset cluster head race condition according to the dump energy；
Data capture unit, for obtaining the related data of the node when the node meets cluster head race condition；
The related data includes: centrad, the history duration for serving as cluster head；
Selecting unit, for selecting optimal node conduct according to the related data and the dump energy of each node
Leader cluster node；
Preferably, the judging unit includes:
First computing module calculates the energy of each node according to the first formula for the dump energy according to each node
Measure benefit value P；
Judgment module, for judging whether the energy benefits value of each node is greater than preset value, if so, described
Node meets cluster head race condition.
Preferably, the selecting unit includes:
Second computing module, for calculating the weight W of each node according to the second formula；
Cluster head determining module, for selecting the smallest node of the weight as leader cluster node；
Wherein, the second formula includes:
Wherein, W (Vi) indicate node ViCentrad, dg (Vi) indicate node ViCentrad, T (Vi) indicate node ViLoad
Appoint the history duration of cluster head；TthrIndicate network operation total time, P (Vi) indicate node ViEnergy benefits value, alpha+beta+γ=1.
Detailed description of the invention
Fig. 1 is the flow chart of the cluster-head node selection method of the embodiment of the present invention 1；
Fig. 2 is the flow chart of the node clustering method of the embodiment of the present invention 2；
Fig. 3 is the block diagram of the cluster-head node selection device of the embodiment of the present invention 3.
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.
Embodiment 1:
As shown in Figure 1, can be used for cluster head in wireless sensor network the present embodiment provides a kind of cluster-head node selection method
The selection of node.
In the prior art, the node in wireless sensor network includes simplifying functional node and global function node.Wherein, smart
Simple functional node only has the partial function in global function node and (such as only has reception data function, without having forwarding number
According to function), it can not work as leader cluster node, namely do not have cluster head function.
Cluster-head node selection method provided in this embodiment is to select node as leader cluster node in global function node.?
That is the node in the present embodiment refers both to the node for having cluster head function.
Cluster-head node selection method provided in this embodiment can comprise the following steps that
S11, the dump energy that each node is sent is received.
Wherein, the residual energy magnitude at the dump energy finger joint point current time that node is sent.
It is understood that the dump energy of node and the vitality of node have direct relation, the dump energy of node is got over
It is more, then its can the time-to-live it is longer, the work that can be born is more.
S12, judge whether each node meets preset cluster head race condition according to dump energy.
In this step, the relatively large number of node of some dump energies is selected by preset cluster head race condition, with
Leader cluster node is selected from the node that these meet cluster head race condition in subsequent step, to reduce the processing in subsequent step
Workload.
Preferably, this step specifically includes:
S121, according to the dump energy of each node, the energy benefits value P of each node is calculated according to the first formula.
Preferably, the first formula includes:
Wherein, P (Vi) indicate node ViEnergy benefits value, E (Vi) indicate node ViDump energy, EaveIndicate network
In all global function nodes dump energy average value.
S122, judge whether the energy benefits value P of each node is greater than preset value, if so, node meets cluster head competition item
Part.
By the first formula in step S121 it is found that the energy benefits value of the node in the present embodiment is the residual energy of node
The ratio of amount and the residual energy magnitude average value of all nodes.The energy benefits value of node is bigger, then shows relative to other sections
The dump energy of point, the node is more.Specifically, for energy benefits value is 1, when the energy benefits value of node is less than 1
When, then show that the dump energy of the relatively large part of nodes of the dump energy of the node wants small；When the energy benefits value of node is greater than 1
When, then show that the dump energy of the relatively large part of nodes of the dump energy of the node is big.
It is understood that dump energy must be relatively other sections if a certain node is to become leader cluster node
The dump energy of point wants more.Therefore, in this step, by setting preset value, using the dump energy of node as parameter, from
It sends and select dump energy greater than the node of preset value as the node for meeting cluster head race condition in the node of dump energy, after
It is continuous directly to select leader cluster node in these nodes for meeting cluster head race condition.
If S13, node meet cluster head race condition, the related data of node is obtained.Related data includes: centrad,
Serve as the history duration of cluster head.
In this step, the related data of each node can be obtained in the information list of each node according to the pre-stored data.Wherein,
It is understood that need to only obtain the related data for meeting the global function node of cluster head race condition in this step.
S14, optimal node is selected as leader cluster node according to related data and dump energy.
Related data and dump energy in this step based on node calculate the weight of each node, true according to weight size
Determine leader cluster node.
Specific step S14 is included the next steps:
S141, the weight W that each node is calculated according to the second formula.
Preferably, the second formula includes:
Wherein, W (Vi) indicate node ViCentrad, dg (Vi) indicate node ViCentrad, T (Vi) indicate node ViLoad
Appoint the history duration of cluster head；TthrIndicate network operation total time, P (Vi) indicate node ViEnergy benefits value, alpha+beta+γ=1.
Weight selected leader cluster node in the present embodiment, in subsequent step S142 based on node.It is understood that
When selecting leader cluster node, centrad should be selected higher, dump energy is more (namely energy benefits value is higher), serves as cluster head
The shorter node of history duration (memory space for usually serving as the shorter node of cluster head history duration is more, computing capability compared with
By force).By the second formula it is found that the centrad of the weight of node and node, energy benefits value are negative correlation, cluster head is served as with node
History duration be to be positively correlated, therefore when selecting leader cluster node, directly select the lesser node of weight.
Wherein it is possible to understand, α, beta, gamma is coefficient, the specific value of three can be configured according to the actual situation or
Person adjusts, in the present embodiment with no restriction to this.
S142, select the smallest node of weight as leader cluster node.
By the second formula in step S141 it is found that the smallest node of weight is the centrad of integration node, serves as cluster head
History duration, three Parameters Calculations of energy benefits value go out node, the node be leader cluster node optimal selection.
In cluster-head node selection method provided in this embodiment, dump energy, centrad in conjunction with each node, and serve as
The history duration of cluster head selects node, with guarantee wireless sensor network connectivity while, to the maximum extent
Equalising network energy consumption extends network lifetime.
Embodiment 2:
As shown in Fig. 2, the present embodiment provides a kind of node clustering methods comprising the leader cluster node provided in embodiment 1
Selection method can be used for carrying out node clustering in wireless sensor.The node clustering method includes: node self-test stage and cluster
The head node choice phase.
Wherein it is understood that before carrying out node clustering, including initial phase: into wireless sensor network
Each node send cluster head competition message, open cluster head competition.
Specifically, the node clustering method of the present embodiment the following steps are included:
The node self-test stage:
S01, each node voluntarily judge whether itself has cluster head function.
Node in wireless sensor network includes simplifying functional node and global function node.Wherein, functional node is simplified
Only have the partial function (such as only having reception data function, without having forwarding data function) in global function node,
It can not work as leader cluster node, namely not have cluster head function.
During node clustering, only global function node can be used as cluster head point successively, therefore in the present embodiment, node
After receiving cluster head challenge message, self detection is first carried out, judge itself whether to have cluster head function (namely whether be Quan Gong
Energy node), if having cluster head function, can just apply competing cluster head.
S02, if so, node sends the dump energy of itself to cluster-head node selection device.
In this step, node sends itself to cluster-head node selection device after self detection determines there is cluster head
Dump energy, to show the wish and the current situation of node of node competition cluster head.
The cluster-head node selection stage:
Cluster-head node selection device selects leader cluster node.Specifically, cluster-head node selection device can be mentioned according in embodiment 1
The cluster-head node selection method of confession selects leader cluster node in the node for having cluster head function.Specifically, leader cluster node may include
Following steps:
S11, cluster-head node selection device receive the dump energy that each node is sent.
It is understood that the node in this step is to carry out the node after I detects myself through the node self-test stage,
It also is global function node.The residual energy magnitude at the dump energy finger joint point current time that node is sent.
S12, judge whether each node meets preset cluster head race condition according to dump energy.
If S13, node meet cluster head race condition, the related data of node is obtained.Related data includes: centrad,
Serve as the history duration of cluster head.
S14, optimal node is selected as leader cluster node according to related data and dump energy.
Related data and dump energy in this step based on node calculate the weight of each node, true according to weight size
Fixed optimal leader cluster node.
The specific steps in above-mentioned cluster-head node selection stage can refer to embodiment 1, repeat no more in the present embodiment to this.
Preferably, further comprising the steps of after selecting cluster head in node clustering method provided in this embodiment:
S21, leader cluster node information is sent to other each nodes.
S22, other nodes are sent to leader cluster node is added request.
Node is included in clustering architecture according to the request that each node is sent by S23, leader cluster node.
Leader cluster node is added in above-mentioned other nodes, forms clustering architecture, the concrete scheme communicated later can refer to existing
Technology is no longer described in detail this in the present embodiment.
It should be noted that the step of node clustering method provided in this embodiment is single sub-clustering, actual
In wireless sensor network operational process, it can be carried out according to certain period according to node clustering method provided in this embodiment
Again sub-clustering reselects cluster head, to guarantee balancing out for network energy under the premise of guaranteeing network connectivty
Consumption extends network lifetime.
Embodiment 3:
As shown in figure 3, the present embodiment provides a kind of cluster-head node selection devices, comprising: receiving unit, judging unit, number
According to acquiring unit and selecting unit.Wherein,
Receiving unit is used to receive the dump energy that each node is sent.
Judging unit is used to judge whether each node meets preset cluster head race condition according to dump energy.
Data capture unit is used for when node meets cluster head race condition, obtains the related data of node；Related data
It include: centrad, the history duration for serving as cluster head.
Selecting unit selects optimal node as cluster head section for the related data and dump energy according to each node
Point.
Preferably, judging unit includes: the first computing module and judgment module.Wherein,
First computing module is used for the dump energy according to each node, and the energy benefits of each node are calculated according to the first formula
Value P.
Judgment module, for judging whether the energy benefits value of each node is greater than preset value, if so, node meets cluster head
Race condition.
Preferably, selecting unit includes: the second computing module and cluster head determining module.Wherein,
Second computing module is used to calculate the weight W of each node according to the second formula.
Cluster head determining module is for selecting the smallest node of weight as leader cluster node.
Wherein, the second formula includes:
Wherein, W (Vi) indicate node ViCentrad, dg (Vi) indicate node ViCentrad, T (Vi) indicate node ViLoad
Appoint the history duration of cluster head；TthrIndicate network operation total time, P (Vi) indicate node ViEnergy benefits value, alpha+beta+γ=1.
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 cluster-head node selection method characterized by comprising
Receive the dump energy that each node is sent；
Judge whether each node meets preset cluster head race condition according to the dump energy；
If the node meets the cluster head race condition, the related data of the node is obtained；The related data includes:
Centrad, the history duration for serving as cluster head；
Optimal node is selected as leader cluster node according to the related data and the dump energy.
2. cluster-head node selection method according to claim 1, which is characterized in that described to be judged according to the dump energy
Whether each node, which meets the step of preset cluster head race condition, includes:
According to the dump energy of each node, the energy benefits value P of each node is calculated according to the first formula；
Judge whether the energy benefits value of each node is greater than preset value, if so, the node meets cluster head competition
Condition.
3. node clustering method according to claim 2, which is characterized in that first formula includes:
Wherein, P (Vi) indicate node ViEnergy benefits value, E (Vi) indicate node ViDump energy, EaveIndicate institute in network
There is the average value of the dump energy of node.
4. node clustering method according to claim 2, which is characterized in that the preset value is 1.
5. node clustering method according to claim 2, which is characterized in that the related data according to each node
Selecting optimal node as the step of leader cluster node with the dump energy includes:
The weight W of each node is calculated according to the second formula；
Select the smallest node of the weight as leader cluster node；
Wherein, the second formula includes:
Wherein, W (Vi) indicate node ViCentrad, dg (Vi) indicate node ViCentrad, T (Vi) indicate node ViServe as cluster
The history duration of head；TthrIndicate network operation total time, P (Vi) indicate node ViEnergy benefits value, alpha+beta+γ=1.
6. a kind of node clustering method, which is characterized in that selected including leader cluster node described in any one of claim 1 to 5
Selection method.
7. node clustering method according to claim 6 characterized by comprising
The node self-test stage: each node voluntarily judges whether itself has cluster head function, if so, to cluster-head node selection device
Send the dump energy of itself；
The cluster-head node selection stage: cluster-head node selection device leader cluster node as claimed in any of claims 1 to 5
Selection method selects leader cluster node.
8. a kind of cluster-head node selection device characterized by comprising
Receiving unit, the dump energy sent for receiving each node；
Judging unit, for judging whether each node meets preset cluster head race condition according to the dump energy；
Data capture unit, for obtaining the related data of the node when the node meets cluster head race condition；It is described
Related data includes: centrad, the history duration for serving as cluster head；
Selecting unit, for selecting optimal node as cluster head according to the related data and the dump energy of each node
Node.
9. node clustering device according to claim 8, which is characterized in that the judging unit includes:
First computing module calculates the energy dose-effect of each node according to the first formula for the dump energy according to each node
Beneficial value P；
Judgment module, for judging whether the energy benefits value of each node is greater than preset value, if so, the node
Meet cluster head race condition.
10. node clustering device according to claim 8, which is characterized in that the selecting unit includes:
Second computing module, for calculating the weight W of each node according to the second formula；
Cluster head determining module, for selecting the smallest node of the weight as leader cluster node；
Wherein, the second formula includes:
Wherein, W (Vi) indicate node ViCentrad, dg (Vi) indicate node ViCentrad, T (Vi) indicate node ViServe as cluster
The history duration of head；TthrIndicate network operation total time, P (Vi) indicate node ViEnergy benefits value, alpha+beta+γ=1.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910356556.7A CN109922511A (en) | 2019-04-29 | 2019-04-29 | Cluster-head node selection method, node clustering method and cluster-head node selection device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910356556.7A CN109922511A (en) | 2019-04-29 | 2019-04-29 | Cluster-head node selection method, node clustering method and cluster-head node selection device |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN109922511A true CN109922511A (en) | 2019-06-21 |
Family
ID=66978827
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910356556.7A Pending CN109922511A (en) | 2019-04-29 | 2019-04-29 | Cluster-head node selection method, node clustering method and cluster-head node selection device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109922511A (en) |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111629414A (en) * | 2020-05-26 | 2020-09-04 | 中国联合网络通信集团有限公司 | Routing method, device, terminal equipment and computer readable storage medium |
| CN112218259A (en) * | 2020-10-10 | 2021-01-12 | 北京瑞拓电子技术发展有限公司 | Novel rail transit integrated monitoring system |
| CN114223183A (en) * | 2019-08-20 | 2022-03-22 | 三菱电机株式会社 | Method for providing network cooperation for industrial communication system |
Citations (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101267404A (en) * | 2008-05-13 | 2008-09-17 | 北京科技大学 | An assister-based clustering method in Ad Hoc network |
| CN102036308A (en) * | 2010-12-09 | 2011-04-27 | 江南大学 | Energy balancing wireless sensor network clustering method |
| CN101835277B (en) * | 2010-02-09 | 2013-03-20 | 重庆理工大学 | Wireless sensor network topology control method based on LEACH-ANT algorithm |
| CN103533595A (en) * | 2013-10-28 | 2014-01-22 | 天津工业大学 | Multi-hop clustering routing algorithm (GEEMHCR) for wireless sensor networks |
| CN103973789A (en) * | 2014-05-07 | 2014-08-06 | 重庆邮电大学 | VANET clustering method combining historical credit of vehicle with current state of vehicle |
| CN104469879A (en) * | 2014-12-18 | 2015-03-25 | 武汉大学 | Dynamic k value clustering routing method |
| CN107071811A (en) * | 2017-04-18 | 2017-08-18 | 长春师范大学 | A kind of fault-tolerant Uneven Cluster algorithms of WSN based on fuzzy control |
| CN109510763A (en) * | 2019-01-03 | 2019-03-22 | 中国联合网络通信集团有限公司 | A kind of node cluster head electoral machinery and system |
| US20190098578A1 (en) * | 2017-09-26 | 2019-03-28 | King Fahd University Of Petroleum And Minerals | Node placement for pipeline monitoring |
| CN109688557A (en) * | 2019-02-21 | 2019-04-26 | 中国联合网络通信集团有限公司 | A kind of cooperative node selection method, device |
-
2019
- 2019-04-29 CN CN201910356556.7A patent/CN109922511A/en active Pending
Patent Citations (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101267404A (en) * | 2008-05-13 | 2008-09-17 | 北京科技大学 | An assister-based clustering method in Ad Hoc network |
| CN101835277B (en) * | 2010-02-09 | 2013-03-20 | 重庆理工大学 | Wireless sensor network topology control method based on LEACH-ANT algorithm |
| CN102036308A (en) * | 2010-12-09 | 2011-04-27 | 江南大学 | Energy balancing wireless sensor network clustering method |
| CN103533595A (en) * | 2013-10-28 | 2014-01-22 | 天津工业大学 | Multi-hop clustering routing algorithm (GEEMHCR) for wireless sensor networks |
| CN103973789A (en) * | 2014-05-07 | 2014-08-06 | 重庆邮电大学 | VANET clustering method combining historical credit of vehicle with current state of vehicle |
| CN104469879A (en) * | 2014-12-18 | 2015-03-25 | 武汉大学 | Dynamic k value clustering routing method |
| CN107071811A (en) * | 2017-04-18 | 2017-08-18 | 长春师范大学 | A kind of fault-tolerant Uneven Cluster algorithms of WSN based on fuzzy control |
| US20190098578A1 (en) * | 2017-09-26 | 2019-03-28 | King Fahd University Of Petroleum And Minerals | Node placement for pipeline monitoring |
| CN109510763A (en) * | 2019-01-03 | 2019-03-22 | 中国联合网络通信集团有限公司 | A kind of node cluster head electoral machinery and system |
| CN109688557A (en) * | 2019-02-21 | 2019-04-26 | 中国联合网络通信集团有限公司 | A kind of cooperative node selection method, device |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114223183A (en) * | 2019-08-20 | 2022-03-22 | 三菱电机株式会社 | Method for providing network cooperation for industrial communication system |
| CN111629414A (en) * | 2020-05-26 | 2020-09-04 | 中国联合网络通信集团有限公司 | Routing method, device, terminal equipment and computer readable storage medium |
| CN112218259A (en) * | 2020-10-10 | 2021-01-12 | 北京瑞拓电子技术发展有限公司 | Novel rail transit integrated monitoring system |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109922511A (en) | Cluster-head node selection method, node clustering method and cluster-head node selection device | |
| Ateya et al. | Energy-and latency-aware hybrid offloading algorithm for UAVs | |
| Kumar et al. | EEHC: Energy efficient heterogeneous clustered scheme for wireless sensor networks | |
| JP4218697B2 (en) | Multi-hop network handover method, mobile communication terminal, base station, and handover control program | |
| JP5067581B2 (en) | RADIO COMMUNICATION SYSTEM AND METHOD, AND DEVICE AND PROGRAM USED FOR THEM | |
| CN105165108B (en) | The method of the Mode change of user equipment and control user equipment | |
| Olule et al. | Rare: An energy-efficient target tracking protocol for wireless sensor networks | |
| CN109547351B (en) | Routing method based on Q learning and trust model in Ad Hoc network | |
| KR20090036178A (en) | Wireless sensor network system and method managing cluster thereof | |
| EP2482588A1 (en) | Method for performing a handover of a mobile device | |
| US20100130211A1 (en) | Handover determination apparatus and method in overlay wireless network environment | |
| CN112867146A (en) | Anchor point terminal determination, information transmission method, communication node and storage medium | |
| CN111083733B (en) | Congestion control method and system for wireless sensor network | |
| CN108459317B (en) | Positioning method and system, positioning server, core network equipment and base station | |
| CN103458487A (en) | Method for network code sensing cross-layer energy-saving routing in wireless sensor network | |
| Elbhiri et al. | Stochastic and Equitable Distributed Energy-Efficient Clustering (SEDEEC) for heterogeneous wireless sensor networks | |
| CN109951834A (en) | Bluetooth mesh method for routing based on the improved algorithm that floods | |
| Jain et al. | Development of energy efficient modified LEACH protocol for IoT applications | |
| Rahman et al. | Consistent data collection and assortment in the progression of continuous objects in IoT | |
| Yadav et al. | Sensor data fusion and clustering: a congestion detection and avoidance approach in wireless sensor networks | |
| JP4560533B2 (en) | Communication system, communication terminal, and communication means selection method | |
| CN102548034B (en) | Wireless automatic-energy-concentration corrosion monitoring sensor network for heavy and large reinforced concrete structure | |
| CN106686652B (en) | Wireless sensor network topology control method | |
| US20100003925A1 (en) | Insensitive area detecting method and apparatus for the same in radio communication system | |
| Sivakumar et al. | Identification of critical node for the efficient performance in Manet |
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 | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20190621 |
|
| RJ01 | Rejection of invention patent application after publication |