CN110212941A - A kind of cluster-dividing method based on event driven heterogeneous nodes - Google Patents
A kind of cluster-dividing method based on event driven heterogeneous nodes Download PDFInfo
- Publication number
- CN110212941A CN110212941A CN201910491167.5A CN201910491167A CN110212941A CN 110212941 A CN110212941 A CN 110212941A CN 201910491167 A CN201910491167 A CN 201910491167A CN 110212941 A CN110212941 A CN 110212941A
- Authority
- CN
- China
- Prior art keywords
- node
- cluster head
- nodes
- cognitive nodes
- cluster
- 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
- H04B—TRANSMISSION
- H04B1/00—Details of transmission systems, not covered by a single one of groups H04B3/00 - H04B13/00; Details of transmission systems not characterised by the medium used for transmission
- H04B1/38—Transceivers, i.e. devices in which transmitter and receiver form a structural unit and in which at least one part is used for functions of transmitting and receiving
- H04B1/40—Circuits
-
- 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/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
- 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)
- Mobile Radio Communication Systems (AREA)
Abstract
The present invention relates to a kind of cluster-dividing methods based on event driven heterogeneous nodes, belong to cognitive radio technology field.The present invention is the following steps are included: S1: detecting the cognitive nodes around the back end activation of event；S2: the cognitive nodes being activated select cluster head according to the average distance of the back end of residue energy of node value and node to the event that detects；S3: cluster head sends data packet and activates cluster head to the cognitive nodes between Sink node；S4:Sink node establishes the routing table from cluster head to Sink node and selects the smallest routing of energy consumption.The present invention can effectively reduce the amount of redundant information of network, improve network energy utilization rate, and the final network that improves can run round.
Description
Technical field
The invention belongs to cognition wireless electrical domains, are related to a kind of cluster-dividing method based on event driven heterogeneous nodes.
Background technique
Although the cognitive function of sensor node brings many benefits to CRSN, but also node energy consumption increase,
Process performance requires to improve, and then results in the rising of WSN lower deployment cost.To solve this problem, researcher proposes cognition
The heterogeneous cognition wireless sensor network (heterogeneous CRSN, HCRSN) of node and sensor node separation.At this
In kind HCRSN, since cognitive nodes are only responsible for undertaking frequency spectrum perception and convergence relay function, do not need to carry out data perception, because
And can dispose according to a certain percentage, cognitive nodes deployment quantity is greatly reduced, and then greatly reduce being deployed to for network
This.
In HCRSN, cognitive nodes and sensor node are separated from each other and undertake different function, but simultaneously again must be close
Coordinate common data of completing and transmits work reliably to transmit data grouping in radio environment.Sub-clustering is a kind of effectively management
Topology and the method for improving power system capacity and stability.CRSN is divided into multiple structures by cluster head management, cluster by cluster algorithm
Head serves as central entity in corresponding cluster, and to realize the data transmission of high efficient and reliable, therefore cluster algorithm is important in HCRSN
One of study a question.
Not the problem of sub-clustering clustering algorithm in current existing WSN does not account for dynamic spectrum access, therefore they are not applicable
In HCRSN, and node all in CRSN routing algorithm is all the cognition sensor node of homogeneity, therefore the clustering routing of CRSN
Algorithm can not be different to two class performances in HCRSN node carry out sub-clustering.Therefore, event driven can be suitable for by designing one kind
The clustering route protocol of HCRSN reduces network energy consumption, has realistic meaning.
Summary of the invention
In view of this, being solved the present invention provides a kind of cluster-dividing method based on event driven heterogeneous nodes with solving
Cognitive radio sensor network cluster algorithm problem certainly based on event driven heterogeneous nodes.
In order to achieve the above objectives, the invention provides the following technical scheme:
Cluster-dividing method based on event driven heterogeneous nodes, comprising the following steps:
S1: the cognitive nodes around the back end activation of event are detected；
S2: the cognitive nodes being activated are flat according to the back end of residue energy of node value and node to the event that detects
Distance selection cluster head；
S3: cluster head sends data packet and activates cluster head to the cognitive nodes between Sink node；
S4:Sink node establishes the routing table from cluster head to Sink node and selects the smallest routing of energy consumption.
Further, in step sl, back end sends packet and activates cognitive nodes, and same cognitive nodes can exist
In within the scope of the communications of multiple back end.Therefore partial data node is only needed to send control package informatin activation cognition section
Point.Back end generates a random number after being activated, and control packet is sent if the random number that node generates is less than T, greatly
It is not sent then in T, wherein T is threshold value.
Further, in step s 2, the cognitive nodes being activated form candidate cluster head set and recognize after the completion of set building
Know that the average distance of back end of the node according to self rest energy and to the event that detects makes whether it serves as candidate cluster
First decision.
Further, in step s3, when event generation area farther out from Sink node when, data packet is needed through multi-hop side
Formula is transferred to Sink node.And in addition to cluster head and auxiliary sensing node, remaining cognitive nodes is still in sleep state, it is therefore desirable to
By the cognitive nodes activation between cluster head and Sink node.Cluster head sends a request packet REQ, packet in communication range
In include the information such as cluster head dump energy, ID and coordinate.Receive REQ information cognitive nodes calculate its to Sink node and
The distance of cluster head, if meeting condition:
a)d(Si, Sink) and < d (CH, Sink)；
b)d(CH,Si)+d(Si, Sink) and < δ d (CH, Sink).
Then the cognitive nodes become qualified node.Cognitive nodes as qualified node continue in the communication range of oneself
Request packet is sent, until REQ information is transferred to Sink node.
Further, in step s 4, Sink node, can be according to the coordinate information of qualified node after receiving REQ message
It establishes different routing tables and calculates energy consumption.Then that the smallest routing of selection energy consumption, and final determination result is broadcasted entirely
Net.After receiving result information, become the data to be received such as cognitive nodes of relay node, otherwise enters under sleep state waiting
One time event occurs.
The beneficial effects of the present invention are: the present invention is driven in the present invention based on event compared with WSN and CRSN cluster algorithm
The cluster algorithm of ejector half heterogeneous nodes can be suitable for event driven heterogeneous cognition wireless sensor network.Event activates number
The cognitive nodes around packet information activation are sent according to node, then by back end, process is as shown in Figure 2.It is activated
Cognitive nodes form candidate cluster head set, and cognitive nodes campaign for cluster head, process according to self information in candidate cluster head set
As shown in Figure 3.
After the completion of cluster-leader selected, remaining cognitive nodes is still in sleep state, it is therefore desirable to by cluster head and Sink node
Between cognitive nodes activation, the node being activated is referred to as qualified node.Its process is as shown in Figure 4.Finally passed through by Sink node
It calculates the energy consumption of each item routing and selects that the smallest routing of energy consumption.
Detailed description of the invention
In order to keep the purpose of the present invention, technical scheme and beneficial effects clearer, the present invention provides following attached drawing and carries out
Illustrate:
Fig. 1 is the flow diagram of the embodiment of the present invention；
Fig. 2 is event driven isomery cognition wireless sensor network illustraton of model；
Fig. 3 is that the cluster head of the embodiment of the present invention determines flow chart；
Fig. 4 is the qualified node activation schematic diagram of the embodiment of the present invention；
Fig. 5 is the qualified node routing table schematic diagram of the embodiment of the present invention.
Specific embodiment
Below in conjunction with attached drawing, a preferred embodiment of the present invention will be described in detail.
The present invention is directed to event driven heterogeneous cognition wireless sensor network sub-clustering problem, proposes a kind of based on heterogeneous
The cognition wireless sensor network low energy adaptability cluster algorithm of node.Compared with traditional same-structured network, heterogeneous network
Network lower deployment cost can be saved.It is as shown in Figure 2 based on the heterogeneous network model of event driven cognitive nodes and back end.
The present invention is based on the cluster algorithm process of event driven heterogeneous nodes is as shown in Figure 1.Consider that two class nodes coexist
Network scenarios, cluster head selects from cognitive nodes.First it is detected that the cognitive nodes around the back end activation of event.Institute
Candidate cluster head is formed by the cognitive nodes being activated, cognitive nodes are according to residue energy of node value and section in candidate cluster head set
The average distance put to the back end for the event that detects selects cluster head.Then activate cluster head to the cognition section between Sink node
Point finally establishes the routing table from cluster head to Sink node by Sink node and selects the smallest routing of energy consumption.
As shown in Figure 1, the cluster algorithm based on event driven heterogeneous nodes, method includes the following steps:
S1: the cognitive nodes around the back end activation of event are detected；
S2: the cognitive nodes being activated are flat according to the back end of residue energy of node value and node to the event that detects
Distance selection cluster head；
S3: cluster head sends data packet and activates cluster head to the cognitive nodes between Sink node；
S4:Sink node establishes the routing table from cluster head to Sink node and selects the smallest routing of energy consumption.
Back end sends packet and activates cognitive nodes, and same cognitive nodes can be present in the logical of multiple back end
Believe in transmission range.Therefore partial data node is only needed to send control package informatin activation cognitive nodes.Back end quilt
A random number is generated after activation, and control packet is sent if the random number that node generates is less than T, is not sent greater than T, wherein T
For threshold value.
The cognitive nodes being activated form candidate cluster head set, and after the completion of set building, cognitive nodes are according to self residual
The average distance of energy and the back end to the event that detects makes its decision for whether serving as candidate cluster head.Process such as Fig. 3
It is shown.
When event generation area farther out from Sink node when, data packet needs to be transferred to Sink node by multi-hop mode.
And in addition to cluster head and auxiliary sensing node, remaining cognitive nodes is still in sleep state, it is therefore desirable to by cluster head and Sink node
Between cognitive nodes activation.Cluster head sends a request packet REQ in communication range, includes cluster head residual energy in packet
The information such as amount, ID and coordinate.The cognitive nodes for receiving REQ information calculate it to Sink node and the distance of cluster head, if full
Sufficient condition:
a)d(Si, Sink) and < d (CH, Sink)；
b)d(CH,Si)+d(Si, Sink) and < δ d (CH, Sink).
Then the cognitive nodes become qualified node.Cognitive nodes as qualified node continue in the communication range of oneself
Request packet is sent, until REQ information is transferred to Sink node.Process is as shown in Figure 4.
Sink node can establish different routing tables simultaneously according to the coordinate information of qualified node after receiving REQ message
Calculate energy consumption.Then that the smallest routing of selection energy consumption, and final determination result is broadcasted into the whole network.Receive result information
Afterwards, become the data to be received such as cognitive nodes of relay node, otherwise enter sleep state and wait event generation next time.Process
As shown in Figure 5.
Finally, it is stated that preferred embodiment above is only used to illustrate the technical scheme of the present invention and not to limit it, although logical
It crosses above preferred embodiment the present invention is described in detail, however, those skilled in the art should understand that, can be
Various changes are made to it in form and in details, without departing from claims of the present invention limited range.
Claims (5)
1. a kind of cluster-dividing method based on the heterogeneous node of event driven, it is characterised in that: the event driven isomery cognition
Specific step is as follows for network clustering method of wireless sensor:
S1: the cognitive nodes around the back end activation of event are detected；
S2: the cognitive nodes being activated are according to the average departure of the back end of residue energy of node value and node to the event that detects
From selection cluster head；
S3: cluster head sends data packet and activates cluster head to the cognitive nodes between Sink node；
S4:Sink node establishes the routing table from cluster head to Sink node and selects the smallest routing of energy consumption.
2. the cluster-dividing method according to claim 1 based on event driven heterogeneous nodes, it is characterised in that: in step S1
In, back end sends packet and activates cognitive nodes.And the communication that same cognitive nodes can be present in multiple back end passes
In defeated range.Therefore partial data node is only needed to send control package informatin activation cognitive nodes.Back end is activated
A random number is generated afterwards, control packet is sent if the random number that node generates is less than T, is not sent greater than T, and wherein T is threshold
Value.
3. the cluster-dividing method according to claim 2 based on event driven heterogeneous nodes, it is characterised in that: in step S2
In, the cognitive nodes that are activated form candidate cluster head set, after the completion of set building, cognitive nodes according to self rest energy and
Average distance to the back end for the event that detects makes its decision for whether serving as candidate cluster head.
4. the cluster-dividing method according to claim 3 based on event driven heterogeneous nodes, it is characterised in that: in step S3
In, when event generation area farther out from Sink node when, data packet needs to be transferred to Sink node by multi-hop mode.And in addition to
Cluster head and auxiliary sensing node, remaining cognitive nodes is still in sleep state, it is therefore desirable to by recognizing between cluster head and Sink node
Know that node activates.Cluster head sends a request packet REQ in communication range, includes cluster head dump energy, ID in packet
With the information such as coordinate.The cognitive nodes for receiving REQ information calculate it to Sink node and the distance of cluster head, if meeting item
Part:
a)d(Si, Sink) and < d (CH, Sink)；
b)d(CH,Si)+d(Si, Sink) and < δ d (CH, Sink).
Then the cognitive nodes become qualified node.Cognitive nodes as qualified node continue to send in the communication range of oneself
Request packet, until REQ information is transferred to Sink node.
5. the cluster-dividing method according to claim 4 based on event driven heterogeneous nodes, it is characterised in that: in step S4
In, Sink node can establish different routing tables according to the coordinate information of qualified node and calculate energy after receiving REQ message
Consumption.Then that the smallest routing of selection energy consumption, and final determination result is broadcasted into the whole network.After receiving result information, become
Otherwise the data to be received such as the cognitive nodes of relay node enter sleep state and wait event generation next time.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910491167.5A CN110212941B (en) | 2019-06-06 | 2019-06-06 | Event-driven heterogeneous node-based clustering method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910491167.5A CN110212941B (en) | 2019-06-06 | 2019-06-06 | Event-driven heterogeneous node-based clustering method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN110212941A true CN110212941A (en) | 2019-09-06 |
| CN110212941B CN110212941B (en) | 2021-01-12 |
Family
ID=67791302
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910491167.5A Active CN110212941B (en) | 2019-06-06 | 2019-06-06 | Event-driven heterogeneous node-based clustering method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110212941B (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111405513A (en) * | 2020-03-19 | 2020-07-10 | 北京工商大学 | Event-driven water quality sensor network route optimization algorithm |
Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101888671A (en) * | 2010-02-10 | 2010-11-17 | 上海交通大学 | Energy-efficient target tracking method |
| CN102595546A (en) * | 2011-12-29 | 2012-07-18 | 上海交通大学 | Wireless sensor actuator network data collecting and clustering method based on event driving |
| CN102665251A (en) * | 2012-05-25 | 2012-09-12 | 重庆大学 | WSN (Wireless Sensor Network) distributed-type non-uniform clustering method |
| CN104994558A (en) * | 2015-07-14 | 2015-10-21 | 重庆邮电大学 | Event driven based clustering routing method in cognitive radio sensor network |
| CN106376048A (en) * | 2016-11-03 | 2017-02-01 | 中国矿业大学(北京) | Event-driven coal mine underground wireless sensor network system |
| CN106550422A (en) * | 2016-11-08 | 2017-03-29 | 华中科技大学 | A kind of wireless sensor network clustering routing based on harmonic search algorithm |
| CN107396419A (en) * | 2017-08-03 | 2017-11-24 | 扬州大学 | A kind of multiple mobile node method of data capture based on optimization k means |
| CN109041161A (en) * | 2018-09-05 | 2018-12-18 | 重庆邮电大学 | Cognitive radio sensor network low energy adaptability cluster-dividing method based on heterogeneous nodes |
-
2019
- 2019-06-06 CN CN201910491167.5A patent/CN110212941B/en active Active
Patent Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101888671A (en) * | 2010-02-10 | 2010-11-17 | 上海交通大学 | Energy-efficient target tracking method |
| CN102595546A (en) * | 2011-12-29 | 2012-07-18 | 上海交通大学 | Wireless sensor actuator network data collecting and clustering method based on event driving |
| CN102665251A (en) * | 2012-05-25 | 2012-09-12 | 重庆大学 | WSN (Wireless Sensor Network) distributed-type non-uniform clustering method |
| CN104994558A (en) * | 2015-07-14 | 2015-10-21 | 重庆邮电大学 | Event driven based clustering routing method in cognitive radio sensor network |
| CN106376048A (en) * | 2016-11-03 | 2017-02-01 | 中国矿业大学(北京) | Event-driven coal mine underground wireless sensor network system |
| CN106550422A (en) * | 2016-11-08 | 2017-03-29 | 华中科技大学 | A kind of wireless sensor network clustering routing based on harmonic search algorithm |
| CN107396419A (en) * | 2017-08-03 | 2017-11-24 | 扬州大学 | A kind of multiple mobile node method of data capture based on optimization k means |
| CN109041161A (en) * | 2018-09-05 | 2018-12-18 | 重庆邮电大学 | Cognitive radio sensor network low energy adaptability cluster-dividing method based on heterogeneous nodes |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111405513A (en) * | 2020-03-19 | 2020-07-10 | 北京工商大学 | Event-driven water quality sensor network route optimization algorithm |
| CN111405513B (en) * | 2020-03-19 | 2022-02-08 | 北京工商大学 | Event-driven water quality sensor network route optimization method |
Also Published As
| Publication number | Publication date |
|---|---|
| CN110212941B (en) | 2021-01-12 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Liu et al. | Intelligent data fusion algorithm based on hybrid delay-aware adaptive clustering in wireless sensor networks | |
| KR101394357B1 (en) | Wireless sensor network system and method managing cluster thereof | |
| CN104885520B (en) | Base station is supported to enter and exit suspend mode in a wireless communication system | |
| Tseng et al. | Fully power-aware and location-aware protocols for wireless multi-hop ad hoc networks | |
| CN103369578B (en) | Group generation and maintenance method in wireless self-organizing network environment | |
| Hamzeloei et al. | A TOPSIS based cluster head selection for wireless sensor network | |
| Cheng et al. | Full-duplex for multi-channel cognitive radio ad hoc networks | |
| CN104618907A (en) | ZigBee networking realizing method based on two-dimensional code | |
| Shang et al. | An energy efficient localized topology control algorithm for wireless multihop networks | |
| CN101835099B (en) | Large-scale sensor network routing method based on cluster and RREP broadcast | |
| CN103139073B (en) | A kind of cognitive routing method based on Ad Hoc network form | |
| Lai et al. | Energy-efficient fault-tolerant mechanism for clustered wireless sensor networks | |
| CN104378730A (en) | Access system for M2M service in cellular wireless communication system | |
| Khan et al. | Group owner election in Wi-Fi direct | |
| CN108366438B (en) | Generating cluster networking method and generating cluster network for large-scale self-organizing wireless communication | |
| CN106658632A (en) | Wireless self-organizing network-based electric automobile charging method | |
| CN105049347A (en) | Routing method of DTN (Delay Tolerant Network) based on social network task distribution model | |
| CN110212941A (en) | A kind of cluster-dividing method based on event driven heterogeneous nodes | |
| TW201410056A (en) | Method and system for hierarchical clustering of wireless sensor networks | |
| CN109874162A (en) | The hybrid Design of Routing Protocol optimization method of high-altitude high-speed mobile node ad hoc network | |
| Xu et al. | Study on WSN topology division and lifetime | |
| Cheng et al. | An adaptive cluster-based routing mechanism for energy conservation in mobile ad hoc networks | |
| CN101867988A (en) | Centralized self-adaptation network manager node selection algorithm in Ad Hoc network | |
| Liu et al. | Connectivity of two nodes in cognitive radio ad hoc networks | |
| Sheu et al. | A stable clustering algorithm based on battery power for mobile 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 |