CN103686919B - A kind of self adaptation WSN routing algorithm inspired based on biology - Google Patents
A kind of self adaptation WSN routing algorithm inspired based on biology Download PDFInfo
- Publication number
- CN103686919B CN103686919B CN201410008371.4A CN201410008371A CN103686919B CN 103686919 B CN103686919 B CN 103686919B CN 201410008371 A CN201410008371 A CN 201410008371A CN 103686919 B CN103686919 B CN 103686919B
- Authority
- CN
- China
- Prior art keywords
- node
- data
- backbone network
- sink
- information
- 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
-
- 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
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention discloses a kind of self adaptation WSN routing algorithm inspired based on biology, belong to technology of wireless sensing network field.The method easily causes local optimum and route cavity problem for the greedy strategy that existing GPSR routing algorithm relies on, propose a kind of self adaptation WSN routing algorithm inspired based on biology, point two basic steps: 1) flood formula transmission data to find backbone network at Sink node place quadrant；2) backbone network found is utilized to send data.The building process of backbone network copies Physarum Polycephalum to look for food the formation strategy in path, i.e. by means of geographical location information, give routine weight value and build route backbone network.Node sends in data procedures, enters resting state without articulare, and requires that the energy differences of its all neighbor nodes is not more than Threshold, it is achieved that energy consumption balance, and then enhances network system vigorousness.Data retain this backbone network routing information after being sent completely, when this node sends data next time, can continue and use this backbone network, eliminate the time in pathfinding footpath again, improve data transmission efficiency, decrease energy expenditure.
Description
Technical field
The invention belongs to technology of wireless sensing network field, relate to a kind of self adaptation WSN routing algorithm inspired based on biology.
Background technology
WSN is the wireless network being made up of in the way of self-organizing and multi-hop substantial amounts of static or movement sensor, with collaboratively
Perception, gather, process and transmission network covers the information of perceived object in geographic area, and finally these information are sent to
The owner of network.Owing to transmission information energy consumption is the most relevant to distance, and along with communication distance increases, network is believed
Breath amount also increases considerably, and energy expenditure is increased dramatically.Therefore, must reduce and effectively transmit radius for reducing node energy consumption.
Radius reduces coverage area after reducing, and covers on a large scale to realize WSN, it is necessary to use the method for multi-hop relay to pass
Transmission of data, this is accomplished by corresponding Routing Protocol.One of route technology core technology having become WSN.And the route skill of advanced person
Art be unable to do without again the support of efficient routing algorithm, and therefore routing algorithm is conducted in-depth research by research worker.Gush in recent years
Existing substantial amounts of routing algorithm, GPSR routing algorithm is one of them.GPSR routing algorithm is a kind of directly use geographical position letter
The method that breath sets up routed path, it have employed greedy strategy to set up route, but it is easily absorbed in local optimum problem.Even if its
Modified version is supplemented and be have employed border forwarding strategy, still cannot solve the communication resource and utilize unbalanced, the problem that node easily lost efficacy,
This heavy damage connectedness of whole WSN, reduces the vigorousness of this algorithm, and frequently result in whole WSN cannot high-efficient and lasting
Operation.Therefore to consider these problems, its essence is also a multiple target combinatorial optimization problem.Natural science applied research
Progress is expected to provide feasible solution.Scientific research finds, the intelligent characteristic utilizing organism evolution to be embodied is to solve
The effective way of this multiple target combinatorial optimization problem.
Physarum Polycephalum is a kind of gelation fungus, and it can be stretched out " feeler " and go find out food source and finally obtain by cell membrane
Food, finally can form thickness and significantly look for food path network.During beginning, by colony inoculation on agar culture medium, and bacterium
Fall around accommodating food source, under hydrostatic pressure, bacterium colony Cytoplasmic streaming, and one way or another stretches out " feeler " and goes
Search of food source, after finding food source, these " feelers " just form path of looking for food between bacterium colony and food source, by this
Food is transported in path.And study discovery, food concentration in Cytoplasm forms positive feedback to path tube wall thickness of looking for food again, i.e.
The big duct wall of food concentration can be increasingly thicker, and then pipeline can be increasingly thicker, thus preserves, and the little pipeline of concentration more comes
The thinnest, finally trend towards withering away.Moreover, have between antibacterial and food source a plurality of look for food path time, at food source place
Under ground and antibacterial on-site Cytoplasm food concentration difference effect, short for path conduits of looking for food, flow is relatively big, and path is easily protected
Deposit, and path conduits length of looking for food, flow is little, and path also can tend to withering away.Therefore, the shape in path of getting up to look for food exactly is summed up
Becoming relevant with food concentration and path conduits length of looking for food, concentration is positive feedback, a length of negative feedback.
Wherein Pi and Pj represents that pressure, Lij represent the length between antibacterial and food source or food source, and Dij represents on-state rate, Qij
Represent Cytoplasm flow.All in all, its essence is to build one under the influence of Cytoplasm flow, path factor to have biography
The optimum that defeated path is shorter, efficiency of transmission is high, robustness is strong is looked for food path network, is also a multiple target combinatorial optimization problem.
The classical experiment of comparison that Recent study personnel utilize its characteristic to do has " walking labyrinth " experiment and " Tokyo Metro net " mould
Draft experiment.In " walking labyrinth " tests, research worker finds that many flosss bubble bacterium always can be found one to lead to and be positioned at labyrinth outlet
The shortest path of the food source at place；In " Tokyo Metro net " simulation experiment, research worker has copied shape such as east with one block of agar
The map in area, capital, and food source is disposed some positions, main cities on this map, in the geographical position, Tokyo of this figure
Place inoculates many flosss bubble bacterium strain, finds after cultivation after a while, and they can form one in obtaining cooking cycle and look for food
Path network, this network of looking for food has high similarity with Tokyo Metro net.Research worker passes through analytical calculation, show that it is good for
Strong property, transmittability, efficiency of transmission all tends to optimization.Therefore, GPSR routing algorithm is faced local optimum, route are empty
Hole and the communication resource utilize the problem such as unbalanced just can solve in the way of building, to copy Physarum Polycephalum, path of looking for food.
Summary of the invention
In view of this, it is an object of the invention to provide a kind of self adaptation WSN routing algorithm inspired based on biology, this route is calculated
Method is improved than GPSR routing algorithm, and this algorithm vigorousness is higher, and efficiency of transmission is higher, identical time tranfer data
Amount is bigger, does not has local optimum to occur, as long as and Source node-node transmission crosses data arrival Sink node, then from this Source
Node is remembered in Source node to the path backbone network of this Sink node, when again sending data, it is not necessary to repeat to find road
The process in footpath, just can obtain from this Source node to this Sink node backbone network, thus transmit data efficiently.
For reaching above-mentioned purpose, the present invention provides following technical scheme:
A kind of self adaptation WSN routing algorithm inspired based on biology, it is characterised in that: comprise the following steps:
S1: if Sink node is initial Source node, then initial Source directly forwards the data to Sink node；
S2: otherwise, if Sink node is not the neighbor node of initial Source node, then along from initial Source node to
The backbone network of Sink node forwards data.
Further, described S2 forwards data, wherein backbone network along from the backbone network of initial Source node to Sink node
Acquisition mode include following two: S21: inquire about initial Source node whether recorded from Source node to Sink save
The backbone network information of point, if there being this record information, continuous by this backbone network forwarding data；S22: during without this record information
Then need first to set up the cartesian coordinate system being relative coordinate initial point with initial Source node, then at Sink node place
Sinkend quadrant builds backbone network, and the backbone network recycling this structure forwards data.
Further, described backbone network builds by the following method: S22-11: initial Source node forward the first number according to time, first
Judging the quadrant at Sink node place, be designated as Sinkend quadrant, all nodes in Sinkend quadrant do not enter dormancy shape
State, restarts after cycle T；Search its neighbor node at Sinkend quadrant the most again, and inquire to all
Node for data forwarding；If not inquiring any nodal information, then show in Source communication range, at Sinkend quadrant
In there is no the neighbor node of Source node, at this moment initial Source node sends to its all neighbor nodes and restarts instruction,
Then use border forwarding strategy, find next-hop node, down hop to become initial Source node, send according still further to this algorithm
Data；S22-12: elected node receives data, and only receives first data being forwarded to this node, then by these data
Paths traversed information record, in data, relays to next node；Follow-up data is forwarded by this regular cyclic；
S22-13: for arriving the data of Sink node, if first in Sum data to be forwarded, then Sink node
Betterlink data before receiving, and preserve the Betterlink paths information in data, the most each path is jumped with one and is
Unit gives weights 1, for there being the path of intersection, is often repeated once, and this jumping routine weight value adds 1；Otherwise, then Sink node
Before reception after Betterlink data, need to by the routing information of this front Betterlink data each process be stored in
In Sink, original road routing information compares；If having the new routing information being different from original route, then by the difference of this new acquisition
The routing information new in original route information is saved in Sink node, simultaneously for identical path, corresponding Ge Tiao road, original path
Footpath weights add 1, and for different paths, it is respectively jumped routine weight value and is entered as 1, and its cross section is respectively jumped path and is repeated once, power
Value adds 1, and accumulates；If the routing information of this this front Betterlink data each process be stored in Sink
Original road routing information is identical, then explanation backbone network has been formed, and remaining data will forward along backbone network.
Further, the node beyond described Sinkend quadrant enters dormancy with cycle T, and the computational methods of cycle T are: this joint
Point is EDMax with energy maximum node difference in the current neighbor node forwarding back end, maximum energy needed for sending a secondary data
Amount is EMax, and needed for sending a secondary data, maximum duration is TMax, then T=(EDMax/EMax) * TMax.
Further, described utilize backbone network forward data method as follows: S22-21: after backbone network is formed, except backbone network with
Outer all nodes enter dormancy, restart instruction until receiving；S22-22: the current node forwarding data first inquires about it
In backbone network all of neighbor node can be worth EN, if can the maximum node of value with can the difference of value being less than of node of value minimum
Threshold value Threshold, then the path selecting routine weight value maximum forwards data；If the node of maximum can be worth and can be worth minimum
The difference that can be worth of node is not less than Threshold, then select the node that can be worth maximum as next-hop node；Described threshold value
Threshold implication is the minimum energy value that sensor node maintains normal work；S22-23: if currently forwarding the joint of data
Point at a time inquires about the energy value information less than neighbor node, shows that backbone network had lost efficacy；At this moment data are first forwarded by we
Preserve to the current node forwarding data, and currently forward the node of data to flood transmission activation instruction, activate Sinkend as
All nodes in limit, then according to this algorithm builds from the current node backbone network to Sink node forwarding data, then by number
According to being forwarded to Sink node.
The beneficial effects of the present invention is: routing algorithm vigorousness of the present invention is higher, and efficiency of transmission is higher, the identical time passes
Transmission of data amount is bigger, does not has local optimum to occur, as long as and Source node-node transmission crosses data arrival Sink node, then from this
Source node is remembered in Source node to the path backbone network of this Sink node, when again sending data, it is not necessary to repeat
Find the process in path, just can obtain from this Source node to this Sink node backbone network, thus transmit data efficiently.
Accompanying drawing explanation
In order to make the purpose of the present invention, technical scheme and beneficial effect clearer, the present invention provides drawings described below to illustrate:
Fig. 1 is this routing algorithm flow chart；
Fig. 2 is embodiment 2 program flow diagram；
Fig. 3 is two kinds of situations of the first jumping during initial Source node transmission data；
Fig. 4 is two kinds of backbone network topological diagrams.
Detailed description of the invention
Below in conjunction with accompanying drawing, the preferred embodiments of the present invention are described in detail.
Embodiment 1:
Embodiment 1 illustrates the process (such as Fig. 1) of this algorithm on the whole, specific as follows:
101: judge Sink node position, if Sink node is initial Source neighbor node, then directly data are forwarded
To Sink node；
Whether 102:Source node preserves the backbone network routing information from Source node to Sink node, if just had
Residue energy of node to be considered and routine weight value in data, and repeating process is forwarded by this backbone network；If instead Source
Node does not store this backbone network information, then need first to build backbone network, then presses backbone network and forwards data, considers joint simultaneously
Point dump energy and routine weight value；
103: set up cartesian coordinate system with Source node for relative coordinate initial point, it is judged that Sink node place quadrant, it is designated as
Sinkend quadrant, then make remaining quadrant interior nodes enter resting state, then Source node all neighbours joint in this quadrant
Point sends data.If there is not the neighbor node of Source in this quadrant, then activate all neighbor nodes of Source, use
Border forwarding strategy determines down hop.And data to be forwarded is forwarded to this elected node, this node becomes initial Source node,
This kind of situation is equivalent to from this elected node for data forwarding to Sink node.This is utilized for Source node again with this elected node
Algorithm forwards data；
104: sending in data procedures, if data are sent to certain node, this nodes records has from this node to Sink node
Backbone network, then send directly continue from the data of this node to Sink node and use this backbone network, be forwarded to Sink until data
Node, and record data forwarding paths；
105: node receives data, record path information, receiving the node after data becomes the current node forwarding data, and to
Neighbor node forwards data, until data arrive Sink node, record path information；
106:Sink node receives data, and analysis path information, until backbone network is formed, remaining data only need to be by backbone
Net forwards.
Embodiment 2:
Disclosure sets forth a kind of adaptive wireless sensor network (WSN) routing algorithm inspired based on biology, including following step
Rapid:
S1: if Sink node is initial Source node, then initial Source directly forwards the data to Sink node；
S2: otherwise, if Sink node is not the neighbor node of initial Source node, then along from initial Source node to
The backbone network of Sink node forwards data；
Further, the described backbone network forwarding data from initial Source node to Sink node, the acquisition process of this backbone network
It is:
S21: initial Source node judges whether to record in its current memory the backbone from Source node to Sink node
Net information, if there being this record information, continuous by this backbone network forwarding data；
S22: then need first to set up the Descartes being relative coordinate initial point with initial Source node during without this record information
Coordinate system, then the Sinkend quadrant at Sink node place builds backbone network, and the backbone network recycling this structure forwards data；
Further, described structure realizes by the following method from the backbone network of initial Source node to Sink node:
S22-11: initial Source node forward the first number according to time, first judge the quadrant at Sink node place, be designated as Sinkend
Quadrant, all nodes in Sinkend quadrant do not enter resting state, restart after cycle T.Exist the most again
Sinkend quadrant searches its neighbor node, and to all node for data forwarding inquired；If not inquiring any node letter
Breath, then show in Source communication range, does not has the neighbor node of Source node in Sinkend quadrant, at this moment at the beginning of
Beginning Source node sends to its all neighbor nodes and restarts instruction, then uses border forwarding strategy, finds down hop to save
Point, down hop becomes initial Source node, sends data according still further to this algorithm.
S22-12: elected node receives data, and only receives first data being forwarded to this node, then by this data institute
The routing information record of process, in data, relays to next node.Follow-up data is forwarded by this regular cyclic；
S22-13: for arriving the data of Sink node, if first in Sum data to be forwarded, then Sink
Node receives front Betterlink data, and preserves the Betterlink paths information in data, and the most each path is with one
Jumping and give weights 1 for unit, for there being the path of intersection, be often repeated once, this jumping routine weight value adds 1；Otherwise, then Sink
Node, need to be by the routing information of this front Betterlink data each process and guarantor before reception after Betterlink data
It is stored in original road routing information in Sink to compare.If having the new routing information being different from original route, then by this new acquisition
The routing information being different from original route information new is saved in Sink node, and simultaneously for identical path, original path is the most each
Jumping routine weight value and add 1, for different paths, it is respectively jumped routine weight value and is entered as 1, and its cross section is respectively jumped path and is repeated once,
Weights add 1, and accumulate；If the routing information of this front Betterlink data each process be stored in Sink
Original routing information is identical, then explanation backbone network has been formed, and remaining data will forward along backbone network；
Further, the described node after dormancy restarts after cycle T, and wherein the calculation of cycle T is:
S22-111: it is characterized in that cycle T determines that method is: this node is maximum with energy in the current neighbor node forwarding data
Node difference is EDMax, and sending ceiling capacity needed for a secondary data is EMax, and needed for sending a secondary data, maximum duration is TMax.
Then T=(EDMax/EMax) * TMax；
Further, described record or newly constructed backbone network is utilized in start node to forward data, it is achieved this data forwarding process
Step be:
S22-21: after backbone network is formed, all nodes in addition to backbone network enter dormancy, restart finger until receiving
Order；
What S22-22: the current node forwarding data first inquired about all of neighbor node in its backbone network can be worth EN, if can be worth
Big node turns less than threshold value Threshold, the then path selecting routine weight value maximum with the difference that can be worth of the node that can be worth minimum
Send out data；If the node that can be worth maximum is not less than Threshold with the difference that can be worth of the node that can be worth minimum, then select to be worth
Maximum node is as next-hop node；
S22-23: if currently forwarding the node of data at a time to inquire about the energy value information less than neighbor node, show backbone
Net had lost efficacy.At this moment we first forward the data to currently forward the node of data to preserve, and currently forward the node of data
Flood transmission activation instruction, activates all nodes in Sinkend quadrant, then according to this algorithm builds from currently forwarding data
Node to the backbone network of Sink node, then forward the data to Sink node；
Further, described with can value maximum node threshold value Threshold compared with the difference that can be worth that can be worth minimum node
Implication is:
S22-221: sensor node maintains the minimum energy value of normal work.
In conjunction with said process, depicting a possible flow chart of the present embodiment, such as Fig. 2, concrete lexical or textual analysis is as follows:
Step 201: algorithm brings into operation；
Step 202: the packet sum Sum that these needs of initial Source node statistics send；
Step 203: judge whether the current node forwarding data is initial Source node；
Step 204: accept step 203 meeting the current node forwarding data is initial Source node, meets again step 204
Middle Sink node is positioned at initial Source nodes neighbors node, then enter step 226, directly all of data forwarded portionwise
To Sink node；
Step 205: undertaking step 203,204 expression Sink node are not present in the neighbor node of Source node, Jin Erxu
Enter step 205, it is judged that whether Source preserves backbone network information；
Step 206: this step judge previous cycle the need of setting up cartesian coordinate system, and only Source node forward
First data first just need to set up coordinate system when jumping.Present node meets the current joint forwarding data when accepting step 203
Point is not initial Source node, and then enters step 211；And accept step 203,204,205 time meet currently forward number
According to node be initial Source node, Sink node is not at the neighbor node of Source node, and in Source node
Have no way of the Source node backbone network routing information to Sink node, enter step 207；
Step 207: according to described in step 206, step 207 needs to set up the flute card being relative coordinate initial point with Source node
That coordinate system, each node obtains respective geographical location information by GPS, determines the quadrant at Sink node place, is designated as Sinkend
Quadrant, remaining quadrant node enters resting state with cycle T；
Step 208: according to step 207, whether step 208 has the neighbor node of Source in needing to judge Sinkend quadrant.
Step 209: according to step 208, when having the neighbor node of Source node in meeting Sinkend quadrant (such as Fig. 3-a),
Enter step 209；
Step 210: according to step 208, when there is no the neighbor node of Source node in meeting Sinkend quadrant (such as Fig. 3-b),
Enter step 210；
Step 211: according to step 206, present node meets the current node forwarding data when accepting step 203 be not initial
Source node, and then enter in step 211, i.e. backbone network building process, during node for data forwarding, need to each still
The neighbor node not receiving data forwards data.
Step 212: step 212 shows that node receives the feature of data, node receives and only receives first and arrives this node
Data, then record the path of its process, be saved in the packet of forwarding；
Step 213: accept step 212, present node receives after data, need to inquire about its whether remain from present node to
The backbone network routing information of Sink node, if there is this information, then enters step 214, otherwise then enters step 203, and
Circulation above-mentioned steps；
Step 214: form later data forwarding process for backbone network after this step.Step 214 judges all numbers to be received
According to value whether the equalizing of neighbor node.Present node inquires about the energy value information of its all neighbor nodes, when meeting its neighbours joint
In point can the maximum node of value can be worth in can the minimum node of value can the difference of value be less than Threshold time, entrance step 216,
Otherwise then enter step 215；
Step 215: accept step 214, selects the node that can be worth maximum as down hop；
Step 216: accept step 214, selects the node leading to the routine weight value maximum of next node as down hop；
Step 217: step 217 need to judge that step 215 or step 216 forward whether the down hop of data is Sink node.
If meeting step 215 or step 216 forwarding the down hop of data to be Sink node, then enter step 218, otherwise enter
Step 219；
Step 218: accept step 217, it is judged that whether the current data forwarded are to utilize backbone network to forward, if meeting current
The data forwarded are to utilize backbone network to forward, then enter step 221, otherwise enter step 220；
Step 219: accept step 217, elected node receives data, and records its paths traversed information in current forwarding
In packet, enter back into step 214；
Step 220:Sink node only receives the data arrived at first, and preserves front Betterlink arrival Sink node
The routing information of data, in Sink node, enters step 222；
Step 221:Sink node receives data, Sum--, enters step 225, it is judged that whether Sum number is according to having sent；
Step 222: judge whether the new route letter that step 219 is stored in Sink node makes former Betterlink bar optimum
Routing information has updated, if there being new renewal, then enters step 223, otherwise then enters step 224；
Step 223: accept step 222, Sum--, represents that another number is according to being successfully sent to Sink node, subsequently into next
The forwarding of number evidence, enters step 203；
Step 224: accepting step 222, now backbone network forms (two kinds of possible backbone network path such as Fig. 4), is
Betterlink bar optimal path is constituted, and remaining data forwards along this backbone network, and the node beyond backbone network enters resting state,
Sum--, enters the forwarding of next data, enters step 203；
Step 226: accept step 204, directly total data is forwarded to Sink node, then terminates.
Finally illustrating, preferred embodiment above is only in order to illustrate technical scheme and unrestricted, although by above-mentioned
The present invention is described in detail by preferred embodiment, it is to be understood by those skilled in the art that can in form and
In details, it is made various change, without departing from claims of the present invention limited range.
Claims (3)
1. the self adaptation WSN routing algorithm inspired based on biology, it is characterised in that: comprise the following steps:
S1: if Sink node is initial Source node, then initial Source directly forwards the data to Sink node；
S2: otherwise, if Sink node is not the neighbor node of initial Source node, then along from initial Source node to
The backbone network of Sink node forwards data；
Described S2 forwards data, wherein the acquisition side of backbone network along from the backbone network of initial Source node to Sink node
Formula includes following two:
S21: inquire about whether initial Source node records the backbone network information from Source node to Sink node, if had
This record information is then continuous forwards data with this backbone network；
S22: then need first to set up the Descartes's seat being relative coordinate initial point with initial Source node during without this record information
Mark system, then the Sinkend quadrant at Sink node place builds backbone network, and the backbone network recycling this structure forwards number
According to；
Described backbone network builds by the following method:
S22-11: initial Source node forward the first number according to time, first judge the quadrant at Sink node place, be designated as Sinkend
Quadrant, all nodes in Sinkend quadrant do not enter resting state, restart after cycle T；The most again
Its neighbor node is searched at Sinkend quadrant, and to all node for data forwarding inquired；If not inquiring any joint
Dot information, then show, in Source communication range, do not have the neighbor node of Source node in Sinkend quadrant,
At this moment initial Source node sends to its all neighbor nodes and restarts instruction, then uses border forwarding strategy, looks for
To next-hop node, down hop becomes initial Source node, sends data according still further to this algorithm；
S22-12: elected node receives data, and only receives first data being forwarded to this node, then by this data institute warp
The routing information record crossed, in data, relays to next node；Follow-up data is forwarded by this regular cyclic；
S22-13: for arriving the data of Sink node, if first in Sum data to be forwarded, then Sink joint
Point receives front Betterlink data, and preserves the Betterlink paths information in data, and the most each path is with one
Jumping and give weights 1 for unit, for there being the path of intersection, be often repeated once, this jumping routine weight value adds 1；Otherwise, then Sink
Node before reception after Betterlink data, need to by the routing information of this front Betterlink data each process with
It is stored in original road routing information in Sink to compare；If there being the new routing information being different from original route, then this is new
The routing information being different from original route information new obtained is saved in Sink node, simultaneously for identical path, Yuan Youlu
Footpath is respectively jumped routine weight value and is added 1, and for different paths, it is respectively jumped routine weight value and is entered as 1, and its cross section is each
Jumping path is repeated once, and weights add 1, and accumulates；If the road of this this front Betterlink data each process
Footpath information is identical with being stored in original road routing information in Sink, then explanation backbone network has been formed, and remaining data will be along bone
Dry net forwards.
A kind of self adaptation WSN routing algorithm inspired based on biology the most according to claim 1, it is characterised in that: described
Node beyond Sinkend quadrant enters dormancy with cycle T, and the computational methods of cycle T are: this node with currently forward number
Being EDMax according to energy maximum node difference in the neighbor node of node, needed for sending a secondary data, ceiling capacity is EMax, sends out
Needed for sending a secondary data, maximum duration is TMax, then T=(EDMax/EMax) * TMax.
A kind of self adaptation WSN routing algorithm inspired based on biology the most according to claim 2, it is characterised in that: described utilization
The method of backbone network forwarding data is as follows:
S22-21: after backbone network is formed, all nodes in addition to backbone network enter dormancy, restart instruction until receiving；
What S22-22: the current node forwarding data first inquired about all of neighbor node in its backbone network can be worth EN, if can be worth
Big node is less than threshold value Threshold with the difference that can be worth of the node that can be worth minimum, then select the path that routine weight value is maximum
Forward data；If the node that can be worth maximum is not less than Threshold with the difference that can be worth of the node that can be worth minimum, then select
Maximum node can be worth as next-hop node；Described threshold value Threshold implication is that sensor node maintains normal work
Minimum energy value；
S22-23: if currently forwarding the node of data at a time to inquire about the energy value information less than neighbor node, show backbone network
Lost efficacy；At this moment we first forward the data to currently forward the node of data to preserve, and currently forward the node of data
Flood transmission activation instruction, activates all nodes in Sinkend quadrant, then according to this algorithm builds from currently forwarding number
According to node to the backbone network of Sink node, then forward the data to Sink node.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410008371.4A CN103686919B (en) | 2014-01-08 | 2014-01-08 | A kind of self adaptation WSN routing algorithm inspired based on biology |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410008371.4A CN103686919B (en) | 2014-01-08 | 2014-01-08 | A kind of self adaptation WSN routing algorithm inspired based on biology |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN103686919A CN103686919A (en) | 2014-03-26 |
| CN103686919B true CN103686919B (en) | 2016-08-10 |
Family
ID=50322881
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201410008371.4A Active CN103686919B (en) | 2014-01-08 | 2014-01-08 | A kind of self adaptation WSN routing algorithm inspired based on biology |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN103686919B (en) |
Families Citing this family (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104768200B (en) * | 2015-03-26 | 2018-06-15 | 重庆邮电大学 | A kind of stability WSN method for routing based on multipath forwarding strategy |
| CN107066705B (en) * | 2017-03-27 | 2020-11-03 | 东莞理工学院 | Group robot search algorithm and verification method based on multi-head folliculus foraging |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102083101A (en) * | 2011-01-25 | 2011-06-01 | 东南大学 | Information transmission method for cognitive radio sensor network |
| CN102711212A (en) * | 2012-04-19 | 2012-10-03 | 中国联合网络通信集团有限公司 | Routing method, device and system of wireless sensor network |
| CN102740394A (en) * | 2012-07-19 | 2012-10-17 | 济南普赛通信技术有限公司 | Center calculation wireless sensor network 2-node disjoint multipath routing algorithm |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US8630222B2 (en) * | 2011-02-24 | 2014-01-14 | The Hong Kong University Of Science And Technology | Delay-constrained and energy-efficient online routing for asynchronous sensor networks |
-
2014
- 2014-01-08 CN CN201410008371.4A patent/CN103686919B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102083101A (en) * | 2011-01-25 | 2011-06-01 | 东南大学 | Information transmission method for cognitive radio sensor network |
| CN102711212A (en) * | 2012-04-19 | 2012-10-03 | 中国联合网络通信集团有限公司 | Routing method, device and system of wireless sensor network |
| CN102740394A (en) * | 2012-07-19 | 2012-10-17 | 济南普赛通信技术有限公司 | Center calculation wireless sensor network 2-node disjoint multipath routing algorithm |
Also Published As
| Publication number | Publication date |
|---|---|
| CN103686919A (en) | 2014-03-26 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN104394566B (en) | A kind of low power consumption adaptive clustering and multi-hop wireless sensor network topology control method based on fuzzy decision | |
| CN109547351B (en) | Routing method based on Q learning and trust model in Ad Hoc network | |
| Hu et al. | An endocrine cooperative particle swarm optimization algorithm for routing recovery problem of wireless sensor networks with multiple mobile sinks | |
| US7609644B2 (en) | Ad hoc communications system | |
| Mohanty et al. | Distributed construction of minimum connected dominating set in wireless sensor network using two-hop information | |
| CN103906164B (en) | Maritime search and rescue wireless sensor network topology and topology control method | |
| Khan et al. | Q-learning based energy-efficient and void avoidance routing protocol for underwater acoustic sensor networks | |
| EP1665658B1 (en) | Hierarchical routing in ad-hoc networks | |
| CN112954769B (en) | Underwater wireless sensor network routing method based on reinforcement learning | |
| CN105101086B (en) | A kind of data transfer path system of selection based on traffic density distribution | |
| CN106131916A (en) | A kind of wireless network method for routing foundation based on ant group algorithm | |
| CN105517093A (en) | Energy-saving routing method based on network balance for use in wireless sensor network | |
| CN101577668A (en) | Wireless sensor network opportunistic routing protocol based on grid clustering | |
| CN103686919B (en) | A kind of self adaptation WSN routing algorithm inspired based on biology | |
| Sridhar et al. | An optimization of distributed Voronoi-based collaboration for energy-efficient geographic routing in wireless sensor networks | |
| CN108616893A (en) | A kind of topology control method of high energy efficiency | |
| Chaudhary et al. | Internet of underwater things: challenges, routing protocols, and ML algorithms | |
| CN102781060A (en) | Method for realizing routing in wireless network, forwarding node and wireless network | |
| US8521924B2 (en) | Method of context aware data-centric storage for wireless sensor networks | |
| CN109803342A (en) | A kind of unmanned plane method for self-organizing network routing towards balancing energy highly-reliable transmission | |
| Zhi et al. | An improved ant colony routing algorithm for WSNs | |
| Tewari et al. | Optimized hybrid ant colony and greedy algorithm technique based load balancing for energy conservation in WSN | |
| Pradeepa et al. | Energy efficient positioning of mobile base stations to improve wireless sensor network lifetime | |
| CN105246123A (en) | Improved CARP routing protocol | |
| CN104394554B (en) | A kind of prediction type low delay Geographic routing method |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant |