CN107172676A - A kind of route selection method for wireless sensor network based on node redundancy degree and graph coloring algorithm - Google Patents
A kind of route selection method for wireless sensor network based on node redundancy degree and graph coloring algorithm Download PDFInfo
- Publication number
- CN107172676A CN107172676A CN201710261031.6A CN201710261031A CN107172676A CN 107172676 A CN107172676 A CN 107172676A CN 201710261031 A CN201710261031 A CN 201710261031A CN 107172676 A CN107172676 A CN 107172676A
- Authority
- CN
- China
- Prior art keywords
- node
- mrow
- network
- msubsup
- wireless sensor
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
- H04W40/04—Communication route or path selection, e.g. power-based or shortest path routing based on wireless node resources
- H04W40/10—Communication route or path selection, e.g. power-based or shortest path routing based on wireless node resources based on available power or energy
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
- H04W40/12—Communication route or path selection, e.g. power-based or shortest path routing based on transmission quality or channel quality
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- 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
A kind of route selection method for wireless sensor network based on node redundancy degree and graph coloring algorithm, comprises the following steps：The first step, first, find the redundant node in network, defines by surroundings nodes coverage rate up to 90% and the above, as redundant node；Using the thought of Monte Carlo, m × n point is taken at random in the region of m × n areas, the number fallen in the point of wanted zoning is the area in required region；Second step, utility function is set up, the foundation of maximum feasible collection is searched as graph theory, strive searching dump energy is more, link communication quality is good and transmission range is near node as the node of next-hop by foundations of utility function；3rd step, using graph theory greedy algorithm find maximum feasible collection come determine route.The present invention takes into account network energy harmony and routing availability, overall balanced, the extension Network morals of energy expenditure.
Description
Technical field
The present invention considers from the many-side such as wireless sensor network node degree of communication, channel quality, with topological credit
The coloring greedy algorithm of branch-graph theory calculates path weights, on the basis of analysis network redundancy, finds sensor network
Maximum feasible transmission path, the route transmission technical field belonged in wireless communication technology.
Background technology
Internet of Things has a extensive future, and has turned into the study hotspot that all circles pay attention in recent years.Wireless sensor network be by
It is deployed in all kinds of monitored areas a large amount of sensor nodes and is in communication with each other the multihop self-organizing network to be formed, is Internet of Things bottom frame
The important technology form of structure.The research of wireless sensor network mainly experienced two stages:It is small that 1st stage mainly laid particular stress on design
The node device of type；2nd stage (at this stage) paid close attention to the research of network problem itself.Because sensor node generally exists
Run in rugged environment, human footmarks as little as cause the energy not change in time, therefore energy efficiency is wireless sensor network
Important issue.
The achievement in research of domestic and international wireless sensor network routing Design is concentrated mainly on following several respects：First, from energy
The different energy of amount efficiency angle design is used and optimal routing plan, reduces node energy consumption；Secondly, from network organization framework angle
Degree, flexible arrangement routing framework is carried out using different distributions or clustering etc., lifts network efficiency；In addition, from reduction network
Interference, lifting spectrum efficiency or power system capacity angle, design various optimal routes.I.e. according to different environment and system requirements,
From the different angles such as reliability, security, validity, different routing policies are selected, a variety of different roads can be designed
By algorithm and system architecture.
The content of the invention
In order to overcome the energy expenditure of existing wireless sensor network route selection method overall harmonious poor, network
The shorter deficiency of life cycle, the invention provides a kind of energy expenditure it is overall balanced, it is extension Network morals based on
The route selection method for wireless sensor network of node redundancy degree and graph coloring algorithm.
The technical solution adopted for the present invention to solve the technical problems is：
A kind of route selection method for wireless sensor network based on node redundancy degree and graph coloring algorithm, the selecting party
Method comprises the following steps：
The first step, first, find the redundant node in network, defines by surroundings nodes coverage rate up to 90% and the above,
As redundant node；Using the thought of Monte Carlo, take m × n point at random in the region of m × n areas, fall to be calculated area
The number of the point in domain is the area in required region；
Second step, utility function is set up, the foundation of maximum feasible collection is searched as graph theory, the collection of sensor node is combined into N,
RiFor the unit bandwidth transmission rate of i-th link, diFor the transmission range of the link, EiFor purpose residue energy of node, then imitate
It is as follows with function
Wherein α, beta, gamma is the weight coefficient chosen, strives finding that dump energy is more, link by the foundation of utility function
Good communication quality and the near node of transmission range as next-hop node；
3rd step, using graph theory greedy algorithm find maximum feasible collection to determine route, process is as follows：
3.1st, by set a little be defined as G；
3.2nd, a bit of weights U (i) maximums is found out in G, S is designated as；
3.3rd, S is incorporated to set MWis；
3.4th, S neighbor node is deleted from G；
3.5th, repeat step (3.2), (3.3), (3.4), until G is empty set；
3.6th, MWis is maximum feasible collection.
The present invention technical concept be：For routing algorithm for wireless sensor present Research, the present invention considers to combine
Energy efficiency and network interferences factor, propose the route selection method based on network redundancy and graph coloring algorithm.The algorithm is selected
Select the minimum path of energy expenditure to be transmitted, and effectively utilize the energy of each node in network, allow energy expenditure as far as possible
It is overall balanced, to extend Network morals.Because sensor node is typically more than quantity and random distribution, easily produce very
Many redundant nodes.In conventional routing strategy, redundant node causes its dump energy higher, caused without being often used
Energy dissipation.Meanwhile, the energy of redundant node is done sth. in advance depleted and is absorbed in influence of the dormancy to overall network and little.Cause
This, the present invention will first look for network redundancy node, and preferentially they are used.In addition, for non-redundant node, then needing
The amount of energy expenditure and the harmony of consumption are taken into account, when redundant node mortality, system uses to enter based on graph coloring method
Row node is selected, to keep network normal operation.Coloring greedy algorithm in graph theory is incorporated into routing policy selection by the present invention
In, using its suboptimization thought and mathematics labeling method, select suitable routing policy.Algorithm is integrally proceeded in two phases, i.e., first
First find redundant node and complete transmission, hereafter further determine that node-routing according to graph coloring method.
Beneficial effects of the present invention are mainly manifested in：Network energy harmony and routing availability are taken into account, energy expenditure is whole
Body is balanced, extends Network morals.
Brief description of the drawings
Fig. 1 is nodal test scope coverage diagram.
Fig. 2 is wireless sensor network node random distribution figure.
Fig. 3 is the schematic diagram of maximum route feasible set.
Embodiment
The invention will be further described below in conjunction with the accompanying drawings.
1~Fig. 3 of reference picture, a kind of wireless sensor network Route Selection side based on node redundancy degree and graph coloring algorithm
Method, pays the utmost attention to redundant node and looks for optimal path in maximum feasible concentration, in optimal routing procedure is searched for, including following step
Suddenly：
The first step, first, find the redundant node in network, defines by surroundings nodes coverage rate up to 90% and the above,
As redundant node；Using the thought of Monte Carlo, take m × n point at random in the region of m × n areas, fall to be calculated area
The number of the point in domain is the area in required region.As shown in figure 1, to calculate the area that A is covered by neighbor node B, C,
Then calculate the number in the point of A, B intersecting area, be designated as SAB, similarly A, C intersect area be designated as SAC, B, C intersect area and are designated as
SBC, A, B, C intersect area and are designated as SABC.The area S ' that then A is covered by B, CAA=SAB+SAC-SABC.Then A is by surroundings nodes coverage rate
PA=S 'A/SA。
Second step, utility function is set up, be used as graph theory to search the foundation of maximum feasible collection.The collection of sensor node is combined into N,
RiFor the unit bandwidth transmission rate of i-th link, diFor the transmission range of the link, EiFor purpose residue energy of node, then imitate
It is as follows with function
Wherein α, β, γ are the weight coefficient chosen.Strive finding that dump energy is more, link by the foundation of utility function
Good communication quality and the near node of transmission range as next-hop node；
3rd step, using graph theory greedy algorithm find maximum feasible collection to determine route, process is as follows：
3.1st, by set a little be defined as G.
3.2nd, a bit of weights U (i) maximums is found out in G, S is designated as.
3.3rd, S is incorporated to set MWis.
3.4th, S neighbor node is deleted from G.
3.5th, repeat step (3.2), (3.3), (3.4), until G is empty set.
3.6th, MWis is maximum feasible collection.
The present embodiment is verified by emulation testing to suggested plans.Be illustrated in figure 2 in the range of 100 × 100 with
100 sensor nodes of machine distribution, wherein by redundant arithmetic detection, red solid node is redundant node.Fig. 3 is shown
Randomly select after start node, the maximum feasible collection searched is as link.
Claims (1)
1. a kind of route selection method for wireless sensor network based on node redundancy degree and graph coloring algorithm, it is characterised in that：
The system of selection comprises the following steps：
The first step, first, find the redundant node in network, defines by surroundings nodes coverage rate up to 90% and the above, is
Redundant node；Using the thought of Monte Carlo, take m × n point at random in the region of m × n areas, fall in wanted zoning
The number of point is the area in required region；
Second step, utility function is set up, the foundation of maximum feasible collection is searched as graph theory, the collection of sensor node is combined into N, RiFor
The unit bandwidth transmission rate of i-th link, diFor the transmission range of the link, EiFor purpose residue energy of node, then effectiveness letter
Number is as follows
<mrow>
<mi>U</mi>
<mrow>
<mo>(</mo>
<mi>i</mi>
<mo>)</mo>
</mrow>
<mo>=</mo>
<mfrac>
<mrow>
<msubsup>
<mi>R</mi>
<mi>i</mi>
<mi>&alpha;</mi>
</msubsup>
<msubsup>
<mi>E</mi>
<mi>i</mi>
<mi>&beta;</mi>
</msubsup>
</mrow>
<msubsup>
<mi>d</mi>
<mi>i</mi>
<mi>&gamma;</mi>
</msubsup>
</mfrac>
<mo>-</mo>
<mo>-</mo>
<mo>-</mo>
<mrow>
<mo>(</mo>
<mn>1</mn>
<mo>)</mo>
</mrow>
</mrow>
Wherein α, beta, gamma is the weight coefficient chosen, strives finding that dump energy is more, link communication by the foundation of utility function
The node that quality is good and transmission range is near as next-hop node；
3rd step, using graph theory greedy algorithm find maximum feasible collection to determine route, process is as follows：
3.1st, by set a little be defined as G；
3.2nd, a bit of weights U (i) maximums is found out in G, S is designated as；
3.3rd, S is incorporated to set MWis；
3.4th, S neighbor node is deleted from G；
3.5th, repeat step (3.2), (3.3), (3.4), until G is empty set；
3.6th, MWis is maximum feasible collection.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710261031.6A CN107172676B (en) | 2017-04-20 | 2017-04-20 | Wireless sensor network routing method based on node redundancy and graph coloring algorithm |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710261031.6A CN107172676B (en) | 2017-04-20 | 2017-04-20 | Wireless sensor network routing method based on node redundancy and graph coloring algorithm |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN107172676A true CN107172676A (en) | 2017-09-15 |
| CN107172676B CN107172676B (en) | 2020-05-05 |
Family
ID=59813928
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201710261031.6A Active CN107172676B (en) | 2017-04-20 | 2017-04-20 | Wireless sensor network routing method based on node redundancy and graph coloring algorithm |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN107172676B (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108303497A (en) * | 2018-01-19 | 2018-07-20 | 深圳市晟达机械设计有限公司 | Air pollution surveillance system |
| CN110505657A (en) * | 2018-05-16 | 2019-11-26 | 中南大学 | Method of data capture based on matrix fill-in technology in a kind of wireless sensor network |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JPH10149347A (en) * | 1996-11-20 | 1998-06-02 | Toshiba Corp | Resource allocation method and device therefor |
| CN101860798A (en) * | 2010-05-19 | 2010-10-13 | 北京科技大学 | Repeated game-based multicast routing algorithm in cognitive wireless network |
| CN102645208A (en) * | 2012-04-01 | 2012-08-22 | 燕山大学 | Vision measurement location and correction system based on dynamic routing mechanism |
| CN103391555A (en) * | 2013-07-16 | 2013-11-13 | 任炬 | Novel node distribution method for maximizing service lives of clustering wireless sensor networks |
-
2017
- 2017-04-20 CN CN201710261031.6A patent/CN107172676B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JPH10149347A (en) * | 1996-11-20 | 1998-06-02 | Toshiba Corp | Resource allocation method and device therefor |
| CN101860798A (en) * | 2010-05-19 | 2010-10-13 | 北京科技大学 | Repeated game-based multicast routing algorithm in cognitive wireless network |
| CN102645208A (en) * | 2012-04-01 | 2012-08-22 | 燕山大学 | Vision measurement location and correction system based on dynamic routing mechanism |
| CN103391555A (en) * | 2013-07-16 | 2013-11-13 | 任炬 | Novel node distribution method for maximizing service lives of clustering wireless sensor networks |
Non-Patent Citations (2)
| Title |
|---|
| 孙泽宇；伍卫国；王换招；邢萧飞；陈衡: "概率模型下的一种优化覆盖算法", 《软件学报》 * |
| 韩丽霞；王宇平；兰绍江: "基于有序划分编码的图着色算法", 《电子学报》 * |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108303497A (en) * | 2018-01-19 | 2018-07-20 | 深圳市晟达机械设计有限公司 | Air pollution surveillance system |
| CN110505657A (en) * | 2018-05-16 | 2019-11-26 | 中南大学 | Method of data capture based on matrix fill-in technology in a kind of wireless sensor network |
Also Published As
| Publication number | Publication date |
|---|---|
| CN107172676B (en) | 2020-05-05 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN103987055B (en) | A kind of wireless sensor network node deployment and method of supplying power to | |
| CN103916942A (en) | LEACH protocol improvement method capable of lowering energy consumption | |
| CN107730099A (en) | A kind of space planning method for establishing model | |
| CN102984265A (en) | Water environment monitoring method based on internet of things | |
| Rathore et al. | Towards Trusted Green Computing for Wireless Sensor Networks: Multi Metric Optimization Approach. | |
| CN102300281B (en) | Routing method for monitoring bridge state based on wireless sensor network | |
| CN107172722A (en) | A kind of sewage intelligent monitor system | |
| CN106254155A (en) | The reparation Enhancement Method of the covering performance of a kind of wireless sensor network and device | |
| CN101562862A (en) | Routing method for balancing energy of wireless sensor network | |
| CN106792750A (en) | A kind of node deployment method based on guiding particle cluster algorithm | |
| CN107172676A (en) | A kind of route selection method for wireless sensor network based on node redundancy degree and graph coloring algorithm | |
| CN206317985U (en) | Floating platform for the unmanned collection of comprehensive marine information | |
| Agarwal et al. | Network lifetime enhanced tri‐level clustering and routing protocol for monitoring of offshore wind farms | |
| CN107426680A (en) | Towards the wireless sensor network data collection system of building monitoring | |
| CN106131916A (en) | A kind of wireless network method for routing foundation based on ant group algorithm | |
| CN202648697U (en) | Base station type soil moisture content remote real-time monitoring system | |
| CN107197495A (en) | A kind of Secure Routing Algorithm for Wireless Sensor Networks based on multiple attribute decision making (MADM) | |
| CN107292440A (en) | A kind of container liner Route optimization method theoretical based on BA scales-free networks | |
| CN107612806A (en) | Energy of wireless sensor network based on mobile sink node perceives the method for data capture with path architecture | |
| CN107911803A (en) | A kind of bridge health monitoring system based on wireless sensor network | |
| CN102413471B (en) | Networking method of wireless grid sensor based on link stability estimation | |
| CN106255131A (en) | Sensor network anchor point system of selection based on wireless charging | |
| CN106658633A (en) | Method for establishing micro-power wireless multi-hop link | |
| CN107318144A (en) | It is a kind of to reduce the water sound sensor network Routing Protocol of residue of network organization energy | |
| CN108271168A (en) | A kind of wireless sensor network coverage optimization algorithm based on Dijkstra methods |
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 |