CN103826282B - Set based on dump energy divides multi-hop routing method - Google Patents
Set based on dump energy divides multi-hop routing method Download PDFInfo
- Publication number
- CN103826282B CN103826282B CN201410061028.6A CN201410061028A CN103826282B CN 103826282 B CN103826282 B CN 103826282B CN 201410061028 A CN201410061028 A CN 201410061028A CN 103826282 B CN103826282 B CN 103826282B
- Authority
- CN
- China
- Prior art keywords
- cluster head
- hop
- node
- weights
- distance
- 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.)
- Expired - Fee Related
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
Landscapes
- Mobile Radio Communication Systems (AREA)
Abstract
Multi-hop routing method is divided the present invention relates to a kind of set based on dump energy, including：Step 1, multiple regions are divided into by wireless sensor network；All nodes in wireless sensor network are divided into multiple first sets with same node point number by step 2 by closest principle；Step 3, the position distribution according to first set in wireless sensor network, generation has the second set of multiple cluster heads；Step 4, is that each cluster head assigns a weights；Step 5, is that each cluster head determination in second set is preceding to cluster head；Step 6, is that each cluster head in second set determines next-hop cluster head；Step 7, there is the first distance between the corresponding cluster head of member in each first set, there is second distance between the member and Sink node, according to the magnitude relationship between the first distance and second distance, determine that the member is corresponding cluster head or is communicated with Sink node.The present invention improves the performance and life cycle of network.
Description
Technical field
The present invention relates to wireless routing algorithmic technique field, more particularly to a kind of set based on dump energy divides many
Jump method for routing.
Background technology
The finite energy of wireless sensor network, therefore energy problem is wireless sensor network（WSNs）Core in
Heart problem.The Routing Protocol of one efficient low-power consumption can effectively reduce the energy ezpenditure of network, extend the life cycle of WSNs,
Therefore routing algorithm turns into the study hotspot of domestic and international WSNs.
The Routing Protocol of WSNs can be divided into plane road by and hierarchy routing, hierarchical routing algorithm is with comparing in WSN
Extensive routing algorithm.LEACH algorithms are a Clustering Routings for comparative maturity proposing earliest, are also most generation
The hierarchy routing algorithm of table.Many clustering route protocols such as SEP, PEGASIS, LEACH-C (LEACH-centralized)
All grow up on the basis of LEACH with the agreement such as LEACH-F (LEACH-fixed).But there is certain deficiency in it,
The random selection cluster head in turn of LEACH agreements, and cluster head and base station direct communication, cause cluster head skewness, and single-hop is led to
Letter causes huge energy consumption.
The content of the invention
It is an object of the invention to provide a kind of network route construction more rationally, be effectively reduced network energy consumption, prolong
The set based on dump energy of network lifecycle long divides multi-hop routing method.
In order to solve the above technical problems, as one aspect of the present invention, there is provided a kind of set based on dump energy
Multi-hop routing method is divided, including：Step 1, multiple regions are divided into by wireless sensor network；Step 2, by wireless senser
All nodes in network are divided into multiple first sets with same node point number by closest principle；Step 3, root
Position distribution according to first set in wireless sensor network, generation has the second set of multiple cluster heads；Step 4, is every
Individual cluster head assigns a weights；Step 5, is that each cluster head determination in second set is preceding to cluster head；Step 6, is second set
Each interior cluster head determines next-hop cluster head；Step 7, has the between the corresponding cluster head of member in each first set
One distance, has second distance between the member and Sink node, according to the magnitude relationship between the first distance and second distance,
Determine that the member is corresponding cluster head or is communicated with Sink node.
Further, wireless sensor network is square, is distinguished as eight.
Further, step 2 also includes：Random selection is waited with the same number of the first of first set in all nodes
Select node；The near node of multiple distance measurements is randomly choosed in the node in addition to the first both candidate nodes to be saved as the second candidate
Point, wherein, the second both candidate nodes are relative's nodes of the first both candidate nodes；First both candidate nodes and the second both candidate nodes composition are waited
Select node set.
Further, step 3 presses at least one mode and determines candidate's cluster head：（1）If there is one in region to belong to
The both candidate nodes of both candidate nodes set a, then both candidate nodes are added into second set as candidate's cluster head；（2）If area
There are two both candidate nodes for belonging to both candidate nodes set, then an addition will be randomly choosed in two both candidate nodes in domain
Second set is used as candidate's cluster head；（3）If having more than three both candidate nodes for belonging to both candidate nodes set in region, then
Second set as candidate's cluster head is added using randomly choosing two in more than three both candidate nodes；（4）If do not had in region
Belong to the both candidate nodes of both candidate nodes set, then skip over the region.
Further, the weights in step 4 are directly proportional to the node energy of the cluster head, and with the distance of Sink node into anti-
Than.
Further, the weights in step 4 are calculated according to following formula：
Wherein,
W is weights；
Ei is the present energy of node；
Emax is the primary power of node；
Dmax is in all nodes and the maximum distance of Sink node；
D (i, sink) is the distance of node and Sink node.
Further, in step 5：If the distance between cluster head i and Sink node are Disink, cluster head j and Sink node
The distance between be Djsink, the distance between cluster head i and cluster head j be Dij, if meeting following condition, cluster head j is cluster head i
Forward direction cluster head：
Dij 2+Disink 2＞ Djsink 2
Djsink 2+Disink 2＞ Dij 2。
Further, step 6 determines next-hop cluster head by following at least one modes：
（1）If a cluster head has before more than two to cluster head, the two forward direction cluster heads nearest apart from the cluster head are found out, and
Larger that of weights is selected as its interim next-hop cluster head；If the weights of the temporary parent are more than the weights of the cluster head,
Using the interim next-hop cluster head as next-hop cluster head, otherwise using Sink node as next-hop cluster head；
（2）If a cluster head has two forward direction cluster heads, the larger forward direction cluster head of selection weights is interim next-hop cluster
It is first；If the weights of the interim next-hop cluster head are more than the weights of the cluster head, using the interim next-hop cluster head as next-hop cluster
Head, otherwise using Sink node as next-hop cluster head；
（3）If comparing the weights of the cluster head and forward direction cluster head to cluster head before a cluster head only one of which, if this is preceding to cluster head
Weights it is larger, then by this it is preceding to cluster head be next-hop cluster head, otherwise using Sink node as next-hop cluster head；
（4）If forward direction cluster head is zero, using Sink node as next-hop cluster head.
Cluster head the invention enables election is optimal, and multihop routing is set up between cluster head and base station, between reduction node
Communication distance, the balanced energy ezpenditure of network greatly enhances the performance and life cycle of network.
Brief description of the drawings
Fig. 1 diagrammatically illustrates the zoning plan of wireless sensor network；
Fig. 2 diagrammatically illustrates Matlab emulation cluster head number of variations comparison diagrams；
Fig. 3 diagrammatically illustrates Matlab emulation life cycle comparison diagrams.
Specific embodiment
Embodiments of the invention are described in detail below, but the present invention can be defined by the claims and cover
Multitude of different ways is implemented.
The application is based on not enough above, it is proposed that a kind of set based on dump energy divides multi-hop routing method, institute
Having sensor node to be divided into several by closest principle has the set of same node point number so that cluster head distribution is more equal
It is even；Cluster head and base station（Sink node）Between establish multi-hop communication path further according to weights size, can so avoid cluster head with
The huge energy consumption that telecommunication is caused between base station.Compared with traditional LEACH algorithms, the LEACH- after the application improvement
ECM algorithms cause that network route construction is more reasonable, the balanced energy ezpenditure of network, greatly enhance the performance of network
And life cycle.
Fig. 1 to Fig. 3 is refer to, multi-hop routing method, bag are divided the invention provides a kind of set based on dump energy
Include：
Step 1, multiple regions are divided into by wireless sensor network.Fig. 1 is refer to, it is in the embodiment shown in fig. 1, excellent
Selection of land, the wireless sensor network is square, described to be distinguished as eight.In this embodiment, by square mesh along right
Linea angulata, neutrality line are divided into eight regions, and mark sequence number 1-8.
Step 2, all nodes in the wireless sensor network are divided into multiple by closest principle has
The first set of same node point number.In one embodiment, there are 100 nodes in the network, so, can be by this 100
Node division is 20 has 5 first sets of node respectively.
Step 3, according to position distribution of the first set in the wireless sensor network, generation has multiple clusters
First second set.For example, with multiple cluster heads the can be selected according to this 20 set eight distributions in region in a network
Two set.Especially, the maximum node of energy is elected as final cluster head in second set.
Step 4, is that each described cluster head assigns a weights.Wherein, the bigger cluster head of weights is more qualified serves as relaying
Cluster head.
Step 5, is that each cluster head determination in the second set is preceding to cluster head.
Step 6, is that each cluster head in the second set determines next-hop cluster head.
Step 7, has the first distance between the corresponding cluster head of member in each described first set, the member with
There is second distance, according to the magnitude relationship between the described first distance and the second distance, it is determined that should between Sink node
Member is corresponding cluster head or is communicated with the Sink node.So, to member in cluster（Member in first set）
For, if the distance of member and cluster head is more than the distance with Sink in cluster, with Sink direct communications.If because member in cluster
Directly communicated with cluster head, then both increased the energy consumption of member in cluster, also increase the energy consumption of cluster head.
All the sensors node in network is divided into several by the present invention by closest principle has same node point
Several set, some candidate's cluster head set are selected according to set distribution in a network, and energy is selected in candidate's cluster head set
Maximum point is cluster head.Between cluster head and base station multi-hop communication path is established further according to weights size.The present invention program causes net
Network route construction is more reasonable, is effectively reduced the energy ezpenditure of network, and then extend Network morals.
Cluster head the invention enables election is optimal, and multihop routing is set up between cluster head and base station, between reduction node
Communication distance, the balanced energy ezpenditure of network greatly enhances the performance and life cycle of network.
Preferably, step 2 also includes：The same number of first with the first set is randomly choosed in all nodes
Both candidate nodes；The near node of multiple distance measurements is randomly choosed in the node in addition to first both candidate nodes to be waited as second
Node is selected, wherein, second both candidate nodes are relative's nodes of first both candidate nodes；First both candidate nodes and institute
State the composition both candidate nodes set of the second both candidate nodes.For example, by taking 100 networks of node as an example, can first in 100 nodes with
Machine selects 20 nodes for the first both candidate nodes, selects 4 closest node conducts successively in remaining 80 nodes
Relative's node of first both candidate nodes（That is the second both candidate nodes）, so divide after set in node compare in position
It is close.
Preferably, step 3 presses at least one mode and determines candidate's cluster head：
（1）If there are the both candidate nodes for belonging to the both candidate nodes set, then by this in the region
Both candidate nodes add the second set as candidate's cluster head；
（2）If there are two both candidate nodes for belonging to the both candidate nodes set, then by this two in the region
One is randomly choosed in both candidate nodes and adds the second set as candidate's cluster head；
（3）If there are more than three both candidate nodes for belonging to the both candidate nodes set, then by this in the region
Two are randomly choosed in more than three both candidate nodes and adds the second set as candidate's cluster head；
（4）If not belonging to the both candidate nodes of the both candidate nodes set in the region, then skip over the region.
Preferably, the weights in step 4 are directly proportional to the node energy of the cluster head, and with the distance of Sink node into
Inverse ratio.
Preferably, the weights in step 4 are calculated according to following formula：
Wherein,
W is weights；
Ei is the present energy of node；
Emax is the primary power of node；
Dmax is in all nodes and the maximum distance of Sink node；
D (i, sink) is the distance of node and Sink node.
Preferably, in step 5：If the distance between cluster head i and Sink node are Disink, cluster head j and Sink node it
Between distance be Djsink, the distance between cluster head i and cluster head j be Dij, if meeting following condition, cluster head j is cluster head i
Forward direction cluster head：
Dij 2+Disink 2＞ Djsink 2
Djsink 2+Disink 2＞ Dij 2。
Preferably, step 6 determines next-hop cluster head by following at least one modes：
（1）If cluster head described in has before more than two to cluster head, the two forward direction clusters nearest apart from the cluster head are found out
Head, and larger that of weights is selected as its interim next-hop cluster head；If the weights of the temporary parent are more than the power of the cluster head
Value, then using the interim next-hop cluster head as next-hop cluster head, otherwise using Sink node as next-hop cluster head；
（2）If cluster head described in has two forward direction cluster heads, the larger forward direction cluster head of selection weights is interim next
Jump cluster head；If weights of the weights of the interim next-hop cluster head more than the cluster head, using the interim next-hop cluster head as next
Cluster head is jumped, otherwise using Sink node as next-hop cluster head；
（3）If to cluster head before cluster head only one of which described in, comparing the weights of the cluster head and forward direction cluster head, if this it is preceding to
The weights of cluster head are larger, then by this it is preceding to cluster head be next-hop cluster head, otherwise using Sink node as next-hop cluster head；
（4）If forward direction cluster head is zero, using Sink node as next-hop cluster head.
The preferred embodiments of the present invention are the foregoing is only, is not intended to limit the invention, for the skill of this area
For art personnel, the present invention can have various modifications and variations.It is all within the spirit and principles in the present invention, made any repair
Change, equivalent, improvement etc., should be included within the scope of the present invention.
Claims (8)
1. a kind of set based on dump energy divides multi-hop routing method, it is characterised in that including：
Step 1, multiple regions are divided into by wireless sensor network；
Step 2, all nodes in the wireless sensor network is divided into by closest principle multiple with identical
The first set of interstitial content；
Step 3, according to position distribution of the first set in the wireless sensor network, generation has multiple cluster heads
Second set；
Step 4, is that each described cluster head assigns a weights；
Step 5, is that each cluster head determination in the second set is preceding to cluster head；
Step 6, is that each cluster head in the second set determines next-hop cluster head；
Step 7, has the first distance, the member and Sink between the corresponding cluster head of member in each described first set
There is second distance between node, according to the magnitude relationship between the described first distance and the second distance, the member is determined
It is corresponding cluster head or is communicated with the Sink node.
2. method according to claim 1, it is characterised in that the wireless sensor network is square, the region
It is eight.
3. method according to claim 1, it is characterised in that step 2 also includes：
The same number of first both candidate nodes with the first set are randomly choosed in all nodes；
The near node of multiple distance measurements is randomly choosed in the node in addition to first both candidate nodes to be saved as the second candidate
Point, wherein, second both candidate nodes are relative's nodes of first both candidate nodes；
First both candidate nodes and second both candidate nodes composition both candidate nodes set.
4. method according to claim 3, it is characterised in that step 3 presses at least one mode and determines candidate's cluster head：
(1) if having the both candidate nodes for belonging to the both candidate nodes set in the region, then by a candidate
Node adds the second set as candidate's cluster head；
(2) if having two both candidate nodes for belonging to the both candidate nodes set in the region, then by two candidates
One is randomly choosed in node and adds the second set as candidate's cluster head；
(3) if having more than three both candidate nodes for belonging to the both candidate nodes set in the region, then by this three
Two are randomly choosed in above both candidate nodes and adds the second set as candidate's cluster head；
(4) if not belonging to the both candidate nodes of the both candidate nodes set in the region, then skip over the region.
5. method according to claim 1, it is characterised in that the node energy of weights in step 4 and the cluster head
It is directly proportional, and is inversely proportional with the distance of Sink node.
6. method according to claim 1, it is characterised in that the weights in step 4 are calculated according to following formula：
Wherein,
W is weights；
EiIt is the present energy of node；
EoIt is the primary power of node；
dmaxIt is the maximum distance in all nodes with Sink node；
d(i,sink)It is node and the distance of Sink node.
7. method according to claim 1, it is characterised in that in step 5：
If the distance between cluster head i and Sink node are Disink, the distance between cluster head j and Sink node are Djsink, cluster
The distance between first i and cluster head j are Dij, if meeting following condition, cluster head j is the forward direction cluster head of cluster head i：
Dij 2+Disink 2＞ Djsink 2
Djsink 2+Disink 2＞ Dij 2。
8. method according to claim 1, it is characterised in that step 6 determines next-hop cluster by following at least one modes
It is first：
(1) if cluster head described in has before more than two to cluster head, the two forward direction cluster heads nearest apart from the cluster head are found out, and
Larger that of weights is selected as its interim next-hop cluster head；If the weights of the temporary parent are more than the weights of the cluster head,
Using the interim next-hop cluster head as next-hop cluster head, otherwise using Sink node as next-hop cluster head；
(2) if cluster head described in has two forward direction cluster heads, the larger forward direction cluster head of selection weights is interim next-hop cluster
It is first；If the weights of the interim next-hop cluster head are more than the weights of the cluster head, using the interim next-hop cluster head as next-hop cluster
Head, otherwise using Sink node as next-hop cluster head；
(3) if to cluster head before cluster head only one of which described in, comparing the weights of the cluster head and forward direction cluster head, if this is preceding to cluster head
Weights it is larger, then by this it is preceding to cluster head be next-hop cluster head, otherwise using Sink node as next-hop cluster head；
(4) if forward direction cluster head is zero, using Sink node as next-hop cluster head.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410061028.6A CN103826282B (en) | 2014-02-24 | 2014-02-24 | Set based on dump energy divides multi-hop routing method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410061028.6A CN103826282B (en) | 2014-02-24 | 2014-02-24 | Set based on dump energy divides multi-hop routing method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN103826282A CN103826282A (en) | 2014-05-28 |
| CN103826282B true CN103826282B (en) | 2017-06-30 |
Family
ID=50761051
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201410061028.6A Expired - Fee Related CN103826282B (en) | 2014-02-24 | 2014-02-24 | Set based on dump energy divides multi-hop routing method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN103826282B (en) |
Families Citing this family (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104394565A (en) * | 2014-11-07 | 2015-03-04 | 南昌大学 | Clustering multi-hop routing method based on maximum and minimum distance method |
| CN107071849B (en) * | 2017-06-20 | 2020-08-04 | 海信集团有限公司 | Method and device for electing cluster head node |
| CN107328916B (en) * | 2017-08-11 | 2020-05-08 | 中国化学工程重型机械化有限公司 | Effective soil environment monitoring system |
| CN110896542B (en) * | 2019-11-22 | 2021-09-28 | 江南大学 | Heterogeneous network construction method under random multi-SINK mode |
Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102802175A (en) * | 2012-02-24 | 2012-11-28 | 东北电力大学 | Energy-consumption-based routing optimization algorithm for wireless sensor network |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| KR20120102179A (en) * | 2011-03-01 | 2012-09-18 | 울산대학교 산학협력단 | Network system and routing method thereof |
-
2014
- 2014-02-24 CN CN201410061028.6A patent/CN103826282B/en not_active Expired - Fee Related
Patent Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102802175A (en) * | 2012-02-24 | 2012-11-28 | 东北电力大学 | Energy-consumption-based routing optimization algorithm for wireless sensor network |
Non-Patent Citations (2)
| Title |
|---|
| 基于最优簇首和多跳机制的高效分簇路由协议的设计与实现;何国圆;《中国优秀硕士学位论文全文数据库信息科技辑》;20100515(第5期);35-43 * |
| 无线传感器网络的LEACH算法改进与仿真研究;顾明霞;《计算机仿真》;20100930;第27卷(第9期);139-141 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN103826282A (en) | 2014-05-28 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Sharma et al. | Heterogeneity consideration in wireless sensor networks routing algorithms: a review | |
| CN102026331B (en) | Distributed multi-jump energy-saving communication method in wireless sensor network | |
| CN104602302B (en) | It is a kind of based on cluster structured ZigBee-network balancing energy method for routing | |
| CN103916942A (en) | LEACH protocol improvement method capable of lowering energy consumption | |
| CN104883676B (en) | Cooperative Security communication means under a kind of multiple no-manned plane environment | |
| Saxena et al. | Clustering based energy efficient algorithm using max-heap tree for MANET | |
| CN103826282B (en) | Set based on dump energy divides multi-hop routing method | |
| CN102497679A (en) | Static clustering algorithm for wireless sensor network | |
| CN103200643A (en) | Distributed fault-tolerant topology control method based on dump energy sensing | |
| Shang et al. | An energy efficient localized topology control algorithm for wireless multihop networks | |
| CN107969008A (en) | A kind of software definition Sensor Network concentrated route computational methods | |
| Jan et al. | Moving Towards Highly Reliable and Effective Sensor Networks. | |
| Shang | A multi-hop routing algorithm based on integrated metrics for wireless sensor networks | |
| Khan et al. | Performance of agro-sensors: Assessment of optimality in routing protocols of MANET in wireless sensor networks | |
| Al Sharah et al. | Trade-off between Energy Consumption and Transmission Rate in Mobile Ad-Hoc Network | |
| CN103813406B (en) | Layering chain tree route method based on region division | |
| Ortiz et al. | Smart routing mechanism for green ZigBee-based wireless sensor networks | |
| Kumar et al. | Improved data gathering protocol for WSN | |
| CN106488507A (en) | The Uneven Cluster sensor network energy cavity avoiding method of routing overhead shunting | |
| Chen et al. | Interference-free clustering protocol for large-scale and dense wireless sensor networks | |
| Zhao et al. | Dynamic cluster-based routing for wireless sensor networks | |
| Kakkar | TOPSIS optimized Dual-Hop Routing Protocol for Homogeneous Wireless Sensor Networks with Grid-Based Clustering | |
| Ji et al. | Semi-structure routing and performance analysis for cognitive radio networks | |
| Nanda et al. | Cost effective modleach-a* search algorithm for shortest path routing in wireless sensor networks | |
| Grover et al. | AOMDV with multi-tier multi-hop clustering in wireless sensor networks |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| CB03 | Change of inventor or designer information |
Inventor after: Yu Guicai Inventor after: Long Chengzhi Inventor after: Lin Huan Inventor after: Xiang Mantian Inventor after: Huang Caihai Inventor before: Long Chengzhi Inventor before: Lin Huan Inventor before: Xiang Mantian Inventor before: Huang Caihai |
|
| CB03 | Change of inventor or designer information | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20170630 Termination date: 20210224 |
|
| CF01 | Termination of patent right due to non-payment of annual fee |