CN106656795B - A kind of wireless sensor and actor network clustering route selection method - Google Patents
A kind of wireless sensor and actor network clustering route selection method Download PDFInfo
- Publication number
- CN106656795B CN106656795B CN201610858661.7A CN201610858661A CN106656795B CN 106656795 B CN106656795 B CN 106656795B CN 201610858661 A CN201610858661 A CN 201610858661A CN 106656795 B CN106656795 B CN 106656795B
- Authority
- CN
- China
- Prior art keywords
- node
- path
- cluster
- data packet
- packet delivery
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/12—Shortest path evaluation
- H04L45/123—Evaluation of link metrics
-
- 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
-
- 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)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention discloses a kind of wireless sensor and actor network clustering route selection methods, comprising: selects leader cluster node based on fixed sub-clustering mode；Leader cluster node builds cluster and node is invited to enter cluster；When there is information to need to transmit, source node selects intermediary routing node based on the trunking mechanism of angle, forms at least one transmission path by source node to destination node.When forming mulitpath, different priority parameter values is distributed for mulitpath, and according to the data packet delivery fraction and path cost in path, the priority parameters in all paths are dynamically updated, data packet delivery fraction is selected greater than threshold value and the maximum path of priority parameters is transmission path.Reduce the unstable of time delay caused by multiple cluster and network by fixed sub-clustering；And selected by the routing node based on angle, it reduces routing node and selects the time；In addition, further increasing the real-time and reliability of information transmission by the Path selection based on dynamic priority parameter.
Description
Technical field
The present invention relates to a kind of wireless sensor and actor network clustering route selection methods, belong to wireless sensor execution
Device network field.
Background technique
Wireless sensor and actor network (Wireless Sensor and Actor Networks, WSANs) is wireless
Several actuator nodes are introduced on the basis of sensor network (Wireless Sensor Networks, WSNs), are formed complicated
Distributed sensing and control system.WSANs has easy deployment, low cost, low energy consumption, strong real-time, fault-tolerance high and clever
The features such as activity is strong, is usually used in the scenes such as environmental monitoring, smart home, smart city.The maximum feature and advantage of WSANs is
Actuator node in network can act on physical environment, so that it is interactive to achieve the purpose that change physical world.
In WSAN, network node is usually divided into several clusters, reaches the loss of communications and resource for reducing wireless network
The purpose of repetition and waste.Under normal conditions, cluster head is served as in turn by each sensor node, if current leader cluster node no longer meets
When serving as the condition of cluster head, need to re-start sub-clustering to network node.But node, which is exited or is added, leads to topology in network
Structure changes always, and multiple clustering process causes cluster head repeatedly to change with cluster member, not only bad for the steady of whole network
It is qualitative, and will increase the loss of energy, time delay is brought, and will affect normal data acquisition.
The process that WSAN network node carries out data transmission mainly includes three aspects: sensor node to leader cluster node,
Leader cluster node is to aggregation node, aggregation node to actuator node.Wherein, task allocation plan is sent directly to by aggregation node
Actuator node.During being sent to destination node by source node, it may be transmitted in a manner of single-hop or multi-hop.Number
According in transmission process, source node can be increased to data packet delivery fraction between destination node by the mutual collaboration between node, improve number
According to the accuracy and reliability of transmission.Therefore, the routing section with energy consumption, time delay and data packet delivery fraction for constraint condition need to be established
Point selection mechanism, the performance of whole improve data transfer.The energy consumption of internodal data transmission decide the energy of Route Selection at
This；The size of time delay directly affects the real-time of data transmission；The size of packet delivery fraction reflects the reliability of data transmission.
The judging quota that this patent selects time delay and energy consumption as routing node, while using the packet delivery fraction of data transmission as routing
Node selection gist.
Summary of the invention
Goal of the invention: in view of the deficiencies of the prior art, the object of the present invention is to provide one kind can be realized in WSAN node
Between quickly transmit the method for information.
Technical solution: to achieve the above object, the present invention adopts the following technical scheme:
A kind of wireless sensor and actor network clustering route selection method, includes the following steps:
(1) the sub-clustering mode based on fixed sub-clustering selects leader cluster node, and leader cluster node builds cluster and node is invited to enter cluster；
(2) when there is information to need to transmit, the source node for needing to transmit information is intermediate based on the selection of the trunking mechanism of angle
Routing node forms at least one transmission path by source node to destination node；
It (3) is each path configuration according to path cost in the case where source node to destination node forms mulitpath
Priority parameters initial value, and according to the data packet delivery fraction and path cost in path, dynamically update the priority in all paths
Parameter value selects data packet delivery fraction greater than threshold value and the maximum path of priority parameter value is transmission path.
The utility model has the advantages that wireless sensor and actor network clustering route selection method provided by the invention, on the one hand, be based on
The sub-clustering mode of fixed sub-clustering reduces the unstable of time delay caused by multiple cluster and network, improves the real-time of information transmission
Property；On the other hand, it is selected, is reduced by the number of selection node by the routing node based on angle, reduce routing node selection
Time；In addition, by the Path selection based on dynamic priority parameter, reduce as data packet delivery fraction it is too low caused by data
Time delay caused by retransmitting further improves the real-time and reliability of information transmission.
Detailed description of the invention
In order to make the content of the present invention more clearly understood, further details of theory is made to the present invention in conjunction with attached drawing
It is bright, in which:
Fig. 1 is overview flow chart of the invention；
Cluster head Fig. 2 of the invention selects flow chart；
Fig. 3 is of the invention to build cluster flow chart；
Fig. 4 is the node selection schematic diagram of the invention based on angle；
Fig. 5 is of the invention based on dynamic priority parameter path selection course schematic diagram.
Specific embodiment
The invention will be further described with attached drawing combined with specific embodiments below, but guarantor of the invention should not be limited with this
Protect range.
As shown in Figure 1, a kind of wireless sensor and actor network clustering route selection method disclosed by the embodiments of the present invention,
Mainly include the following steps:
Step 1: leader cluster node is selected based on fixed sub-clustering；Cluster head selects flow chart as shown in Figure 2.
Step 2: leader cluster node carries out building cluster, and node is invited to enter cluster；It is as shown in Figure 3 to build cluster flow chart.
Step 3: judging whether there is information and need to transmit, if so, then going to step 4；Conversely, then return step 3 continues to judge；
Step 4: the source node for needing to transmit information selects intermediary routing node based on the trunking mechanism of angle, is formed by source
Node to destination node transmission path.There may be multiple intermediary routing nodes in relay area, form mulitpath；Base
It is as shown in Figure 4 in the node selection schematic diagram of angle.
Step 5: being based on dynamic priority parameter, distribute different priority parameter values for mulitpath, and according to path
Data packet delivery fraction, time delay and energy consumption dynamically update the priority parameters in all paths, select data packet delivery fraction greater than threshold
Value and the maximum path of priority parameters are transmission path.
Specifically, based on dynamic priority parameter path selection course as shown in figure 5, mainly including the following steps:
A) one priority parameters P, the parameter P of the i-th paths are set for each path firstiInitial value are as follows:
Wherein, MjFor the j-th strip path cost selected in the region trunking mechanism based on angle, n is all paths
Number.According to energy consumption and Time Delay Model, path cost MiCost index as Path selection: MiWherein, T is indicated by source=T*E
Node is to the time delay in the data transmission procedure of destination node, and E is the energy consumption in data transmission procedure, and i is path number, is passed through
Energy consumption and time delay carry out overall merit path cost.
B) according to path cost from small to large sequence, successively carry out data transmission, and count data packet in transmission process
Delivery ratio γ.According to the size of each path priority parameters, by the priority parameters P in pathiAs data transmission in select
The probability that respective path carries out data transmission.
C) after transmission process statistics, to the priority parameters P in each pathiIt is updated.Increase data packet delivery fraction
The priority in the path greater than threshold value λ (such as 90%) reduces the priority that data packet delivery fraction is less than the path threshold value λ, thus
The probability that the path for keeping data transmission quality high is selected increases, and the i-th paths priority update process is shown below:
Pi=Pi+ΔP
Wherein, Δ P=Pi(γi-λ) (2)
D) after priority parameters update, the priority in all paths is normalized, is obtained:
Wherein, k is the node number that priority parameters increase.
E) hereafter, according to updated priority, selection data packet delivery fraction is greater than threshold value λ and priority parameters are maximum
The transmission of path progress data.
As shown in Fig. 2, being the cluster head selection flow diagram of the present embodiment, comprising:
Step 1: aggregation node (sink) issues n item and builds cluster message；
Step 2: judge that whether aggregation node issues the number for building cluster message more than 3 times, if so, error reporting is returned,
Cluster can not be built；Conversely, then going to step 3；
Step 3: sensor node (sensor), which receives to build after cluster message, makes response to aggregation node；
Step 4: judging whether the cluster head selection time is more than certain time interval T 0, if so, going to step 5；Conversely, then returning to step
Rapid 3, wait sensor node to make response；
Step 5: statistics aggregation node receives the number of sensor node response message, and calculates the number of two data transmission
According to precious delivery ratio；
Step 6: whether the number for judging the maximum sensor node of data packet delivery fraction is one, if then going to step 7；
Conversely, then going to step 8；
Step 7: selecting the maximum sensor node of data packet delivery fraction as leader cluster node (cluster)；
Step 8: a node is randomly choosed between the maximum multiple sensor nodes of data packet delivery fraction as cluster head section
Point；
Step 9: judging whether all areas select leader cluster node, if so, terminating cluster head election process；It is on the contrary.Then
Cluster message is built in return step 1, aggregation node retransmission.
As shown in figure 3, being that the present embodiment builds cluster flow chart, comprising:
Step 1: leader cluster node transmits into cluster to surrounding sensor node and invites；
Step 2: judging whether sensor node receives within time stipulated time T1 and invited into cluster, if so, going to step
3；Conversely, then going to step 8；
Step 3: sensor node response enters cluster invitation, and feeds back to leader cluster node；
Step 4: judging whether sensor node and leader cluster node belong to the same area, if so, going to step and 5；Conversely,
Then go to step 7；
Step 5: cluster head agrees to that the sensor node is added cluster where itself, and by the information of sensor node be added cluster at
In member's information table, it is transferred to step 6；
Step 6: cluster process is built in termination, into working stage；
Step 7: leader cluster node refuses cluster where itself is added in the sensor order, is transferred to step 6；
Step 8: judging that leader cluster node transmits into cluster and invites whether more than 3 times, if so, going to step 9；Conversely, then returning
Step 1, leader cluster node is retransmitted invites into cluster；
Step 9: leader cluster node gives up the sensor node of dont answer, is transferred to step 6；
As shown in figure 4, being the node selection schematic diagram based on angle of the present embodiment, the selection course of intermediate node is such as
Under:
When source node needs to send information to destination node, then using source node P and destination node as endpoint, connected with the two
Wiring is angular bisector, and using the maximum transmission distance of source node P as radius, the fan-shaped region that angle is w is the relaying of source node P
Region selects next-hop node in region, and more nodes is avoided to participate in the selection course of transfer routing node.With node P
For initial point, after the node Q of the condition of satisfaction is found in the relay area of P, with node Q for new initial point, the above behaviour is repeated
Make, construct the relay area of node Q and choose next-hop node, until information is transferred to destination node.In this way, source node with
Just a transmission paths s1 is formed between destination node.It is more to generate that there may be multiple selectable nodes in relay area
The set of transmission paths, source node to paths all between destination node constitutes path set S={ s1, s2 ..., sn }.
Claims (3)
1. a kind of wireless sensor and actor network clustering route selection method, characterized in that include the following steps:
(1) the sub-clustering mode based on fixed sub-clustering selects leader cluster node, and leader cluster node builds cluster and node is invited to enter cluster；Wherein cluster head
Node is the maximum sensor node of data packet delivery fraction, or there are multiple in the maximum sensor node of data packet delivery fraction
When, a node is randomly choosed between the maximum multiple sensor nodes of data packet delivery fraction as leader cluster node；
(2) when there is information to need to transmit, need to transmit the source node of information based on the intermediate routing of the trunking mechanism of angle selection
Node forms at least one transmission path by source node to destination node；
It (3) is that each path configuration is preferential according to path cost in the case where source node to destination node forms mulitpath
Grade initial parameter value, and according to the data packet delivery fraction and path cost in path, dynamically update the priority parameters in all paths
Value selects data packet delivery fraction greater than threshold value and the maximum path of priority parameter value is transmission path；Packet in the step (3)
Include following steps:
(3.1) one priority parameters P, the parameter P of the i-th paths are set for each pathiInitial value are as follows:
Wherein, MjFor the j-th strip path cost selected in the region trunking mechanism based on angle, n is the number in all paths；
(3.2) according to path cost sequence from small to large, successively carry out data transmission, and count in transmission process data packet and throw
Pass rate γ；According to the size of each path priority parameters, by the priority parameters P in pathiAs selection pair in data transmission
Answer the probability that path carries out data transmission；
(3.3) after counting, according to formula Pi=Pi+ΔPiUpdate the priority parameters P in each pathi, wherein Δ Pi=Pi
(γi- λ), γiFor the data packet delivery fraction of the i-th paths, λ is the threshold value of setting；
(3.4) priority in all paths is normalized, is obtained:
Wherein, k is the node number that priority parameters increase；
(3.5) according to updated priority, select data packet delivery fraction be greater than threshold value λ and the maximum path of priority parameters into
The transmission of row data.
2. a kind of wireless sensor and actor network clustering route selection method according to claim 1, characterized in that step
Suddenly the cost M of the i-th paths is calculated according to energy consumption and Time Delay Model in (3.1)i=T*E, wherein T is indicated by source node
To the time delay in the data transmission procedure of destination node, E is the energy consumption in data transmission procedure, and i is path number.
3. a kind of wireless sensor and actor network clustering route selection method according to claim 1, characterized in that step
Suddenly in (2) source node based on angle trunking mechanism selection intermediary routing node detailed process are as follows: with source node P and target section
Point is endpoint, and using the two connecting line as angular bisector, using the maximum transmission distance of source node P as radius, angle is the fan section of w
Domain is the relay area of source node P, and next-hop node is selected in region；Using node P as initial point, in the relay area of P
It after finding the node Q of the condition of satisfaction, with node Q for new initial point, repeats above operation, constructs the relay area of node Q simultaneously
Next-hop node is chosen, until information is transferred to destination node.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610858661.7A CN106656795B (en) | 2016-09-27 | 2016-09-27 | A kind of wireless sensor and actor network clustering route selection method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610858661.7A CN106656795B (en) | 2016-09-27 | 2016-09-27 | A kind of wireless sensor and actor network clustering route selection method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN106656795A CN106656795A (en) | 2017-05-10 |
| CN106656795B true CN106656795B (en) | 2019-10-18 |
Family
ID=58854550
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201610858661.7A Active CN106656795B (en) | 2016-09-27 | 2016-09-27 | A kind of wireless sensor and actor network clustering route selection method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN106656795B (en) |
Families Citing this family (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107995666B (en) * | 2017-12-12 | 2019-02-22 | 陕西师范大学 | A kind of data routing method towards mobile opportunistic network based on delivery ratio constraint |
| CN108712760B (en) * | 2018-03-29 | 2019-11-19 | 北京邮电大学 | High-throughput relay selection method based on random Learning Automata and fuzzy algorithmic approach |
| CN111432434A (en) * | 2020-03-13 | 2020-07-17 | 中国国家铁路集团有限公司 | Low-delay monitoring and detecting method and system for railway engineering |
| FR3112255A1 (en) * | 2020-07-01 | 2022-01-07 | Sagemcom Energy & Telecom Sas | PROCESS FOR SELECTING A COMMUNICATION ROUTE |
| CN113709843A (en) * | 2021-08-30 | 2021-11-26 | 河南大学 | Position-sensing-based layer cluster type wireless data center network routing method |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101483934A (en) * | 2008-12-19 | 2009-07-15 | 北京邮电大学 | Segmented adaptive multi-path routing mechanism having topology sensing capability |
| CN102036338A (en) * | 2010-12-22 | 2011-04-27 | 中国科学院计算技术研究所 | Sensor network real-time routing method based on data-driven link estimation |
| CN103228021A (en) * | 2013-01-05 | 2013-07-31 | 南京农业大学 | Method for monitoring and controlling growth parameters of facility crops based on wireless sensor executing network |
| CN105072661A (en) * | 2015-07-15 | 2015-11-18 | 国家电网公司 | Clustering multi-hop routing protocol of wireless sensor network |
Family Cites Families (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101325544B (en) * | 2008-07-21 | 2011-02-09 | 武汉理工大学 | Method for establishing multi-path route based on link multiple characteristic values in wireless sensor network |
| JP5448211B2 (en) * | 2009-03-23 | 2014-03-19 | 日本電気通信システム株式会社 | Wireless communication apparatus, wireless network system, data transfer method, and program |
| US8855050B2 (en) * | 2010-09-02 | 2014-10-07 | Weixiang Chen | Soft state framework for mobile WSN routing |
| CN104010339B (en) * | 2014-06-03 | 2017-10-31 | 西安电子科技大学 | A kind of WSN cluster-dividing methods based on packet loss rate measurement |
| US9813931B2 (en) * | 2014-07-29 | 2017-11-07 | University Of Ottawa | Adaptive packet preamble adjustment |
-
2016
- 2016-09-27 CN CN201610858661.7A patent/CN106656795B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101483934A (en) * | 2008-12-19 | 2009-07-15 | 北京邮电大学 | Segmented adaptive multi-path routing mechanism having topology sensing capability |
| CN102036338A (en) * | 2010-12-22 | 2011-04-27 | 中国科学院计算技术研究所 | Sensor network real-time routing method based on data-driven link estimation |
| CN103228021A (en) * | 2013-01-05 | 2013-07-31 | 南京农业大学 | Method for monitoring and controlling growth parameters of facility crops based on wireless sensor executing network |
| CN105072661A (en) * | 2015-07-15 | 2015-11-18 | 国家电网公司 | Clustering multi-hop routing protocol of wireless sensor network |
Non-Patent Citations (1)
| Title |
|---|
| 无线传感器网络LEACH协议的改进;王慧斌;《2006年通信理论与信号处理年会》;20060630;全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN106656795A (en) | 2017-05-10 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN106656795B (en) | A kind of wireless sensor and actor network clustering route selection method | |
| US10142909B2 (en) | Artificial intelligence-augmented, ripple-diamond-chain shaped rateless routing in wireless mesh networks with multi-beam directional antennas | |
| CN105791120B (en) | A kind of Efficient Routing Algorithm in opportunistic network | |
| CN106817738B (en) | Routing method based on alliance game | |
| Sumathi et al. | Energy optimization in manets using on-demand routing protocol | |
| CN111479306A (en) | Q-learning-based QoS (quality of service) routing method for self-organizing network | |
| CN102036338A (en) | Sensor network real-time routing method based on data-driven link estimation | |
| CN101478805A (en) | DTN network Anycast routing method based on opportunistic communication | |
| CN101965031B (en) | Maximum probability-based cognitive radio multi-path multicast routing method | |
| CN107302576A (en) | Adaptive service data distribution method based on opportunistic communication under car networking environment | |
| CN103634868B (en) | Mixing distribution method in opportunistic network and device | |
| CN108174412A (en) | A kind of RPL multi-path data transmission mechanisms of load balancing | |
| WO2017092560A1 (en) | Method and apparatus for generating routing information and determining transmission path | |
| CN115396975B (en) | Networking low-delay high-speed data transmission method for unmanned aerial vehicle cluster system | |
| CN101674220B (en) | Forwarding history-based asynchronous rooting algorithm | |
| Petkov et al. | Collision-free medium access based on traffic forecasting | |
| Dasgupta et al. | Congestion avoidance topology in wireless sensor network using Karnaugh map | |
| CN113938978B (en) | Heterogeneous wireless sensor path finding method based on reinforcement learning | |
| Li et al. | Localized delay‐bounded and energy‐efficient data aggregation in wireless sensor and actor networks | |
| Ji et al. | DAST: A QoS-aware routing protocol for wireless sensor networks | |
| JP5438614B2 (en) | Network reconstruction method and network system | |
| CN110167095A (en) | A kind of mobile Ad-Hoc algorithm network routing based on Fermat point | |
| Jerbi et al. | A routing protocol orphan-leach to join orphan nodes in wireless sensor network | |
| Dong et al. | Topology control mechanism based on link available probability in aeronautical ad hoc network | |
| Shao et al. | A spanning tree algorithm for data aggregation in wireless sensor 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 |