CN103249109A - Irregular cellular automata-based energy-saving routing method of wireless sensor network - Google Patents

Abstract

The invention discloses an irregular CA (cellular automata)-based energy-saving routing method of a wireless sensor network and belongs to the technical field of communication networks. The method comprises the following steps: step 1, abstracting the wireless sensor network to be a model based on an irregular cellular automata; step 2, periodically broadcasting hello message by a cellular node to perform routing maintenance; step 3, when a node C in a working state receives the hello message sent by a neighboring node N, detecting whether the neighboring node N is already in a neighboring table or not; and step 4, judging whether the self-surplus energy of the node C is larger than an average surplus energy of the surplus energy sum of the node C and other neighboring nodes or not. According to the invention, an energy efficient mechanism is added in an AODV (Ad hoc On-demand Distance Vector) routing protocol based the irregular CA model to balance the energy consumption among the nodes so as to avoid network partition caused by over early death of an individual node, and accordingly, the network energy proportionality is improved, and the network lifetime is prolonged.

Description

Energy-saving routing method based on the radio sensing network of irregular cellular automata

Technical field

The invention belongs to the communication network technology field, be specifically related to the energy-saving routing method based on the radio sensing network of irregular cellular automata.

Background technology

(Wireless sensor networks WSN) because it has exclusive advantages such as low-power consumption, low cost, self organization ability, is widely used in the every field of social life radio sensing network.Because sensing node often is disposed in circumstance complication or the unattended operation zone, be not easy to change battery, energy therefore how to save sensor node becomes primary emphasis problem in the WSN research to prolong its operating time.

In the prior art, representative WSN energy-saving routing protocol mainly contains: least energy consumption route, based on route and the balancing energy route of sub-clustering.

The main thought of least energy consumption route is to make up the minimum path of (being the sink node) energy consumption from the source node to the aggregation node, because transmission energy consumption and transmission range are proportional, therefore reducing transmission range just can reduce the transmission energy consumption.

Comprise low power consumption adaptive collection bunch laminated devices agreement (Low Energy Adaptive Clustering Hierarchy based on Routing Protocol comparatively classical in the route of sub-clustering, LEACH) and on its basis centralized sub-clustering algorithm (the Low Energy Adaptive Clustering Hierarchy Centralized that optimizes, LEACH-C) and agreement (the HybridEnergy-Efficient Distributed Clustering such as sub-clustering agreement of fixed tuft radius, HEED), the thought minimizing by sub-clustering reduces node energy consumption to the data that the sink node sends.The basic thought of balancing energy route is by transmitting the route bag according to node energy level separately, increase the modes such as dormancy time of node, energy consumption between the balanced node avoids network to cut apart, individual nodes is the problem of death too early, prolongs the life span of network.

Yet in the prior art, the least energy consumption route is frequent selects identical shortest path, can cause that the energy of part of nodes exhausts too early in the path, problems such as network is cut apart, network energy is unbalanced occur.Existing clustering route protocol almost all is placed on all centers of gravity on the research about the sub-clustering algorithm, and has ignored the research that is better than non-sub-clustering network for the network that how just can make sub-clustering.There are some researches show to have only when each bunch interior nodes is poured into the informational capacity of bunch head before bunch hair is to the data of aggregation node much smaller than sub-clustering, the WSN of sub-clustering just may have absolute advantage at aspect of performance than the WSN of non-sub-clustering.The energy-saving routing protocol based on irregular cellular Automation Model that the present invention proposes belongs to energy equalizing routing protocol.

In recent years, cellular automata (Cellular Automata, CA) model because simple in structure, be convenient to realize on computers and can be with the advantages such as global property of simple rule-revealing complexity, become the important tool of research WSN power saving.Cellular Automation Model is the system that a kind of room and time all disperses, and all cellulars in the system are observed identical state transition rules, and the state of cellular was determined jointly by a last moment self and neighbours' state.CA mechanism is changed between dormancy and operating state according to certain state transition rules by dormancy dispatching strategy envoy point, to reduce node energy consumption.Yet; usually the routing algorithm based on the CA model all uses " life recreation " as state transition rules; but according to the interstitial content of neighbor node work/resting state next state constantly that decides self; do not consider the dump energy grade situation of node itself and neighbor node, this may cause the unbalanced of dump energy between node.In addition, normally used regular CA has stipulated that cyberspace is latticed, has therefore limited node distribution situation in the network.

In the WSN energy-saving routing protocol of the rule-based cellular Automation Model of routine, network node is used four-tuple A={L according to distributed in grid _d, QN, f} representation element cellular automaton A, then node C _{I, j}Neighbours N _{I, j}:

$N_{i,j}=\{(k,l)\∈c|\sqrt{{(k-i)}^2+{(l-j)}^2}\≤R_c\}$

Integer d represents the dimension in cellular space, and in two-dimentional cellular space, the most frequently used state transition rules is " life recreation " rule." life recreation " (S23/B3) in, cellular has two kinds of possible states (dead and existence), neighbours' type be a mole type, namely the neighbours of each cellular are made up of eight cellulars on every side.Why being referred to as " life recreation ", is because the life and death in next moment of cellular is depended on the quantity of cellular that live or in the dust in adjacent 8 grids.Yet, the rule cellular Automation Model has stipulated that network is latticed, limited the node distribution situation, and if dividing too small meeting, grid makes the cellular that occurs many spaces in the CA model even the neither one neighbours occur, on the other hand, if grid is excessive, can cause a more than cellular in the grid.

Summary of the invention

The objective of the invention is to solve the problem of the energy-conservation and balancing energy in the radio sensing network, a kind of energy-saving routing method of the radio sensing network based on irregular cellular automata has been proposed, compare with the energy-saving routing protocol based on cellular Automation Model of routine, aspect balancing energy, improve to some extent, and abstract model is pressed close to real network scenarios more.The present invention also verifies its validity by network simulation.

In order to realize purpose of the present invention, used following technical scheme: a kind of energy-saving routing method of the radio sensing network based on irregular cellular automata may further comprise the steps:

Step 1. with radio sensing network abstract be model based on irregular cellular automata;

Step 2. cellular node periodic broadcasting hello packet is safeguarded route, comprises the dump energy of self in the hello packet of transmission;

When step 3. is received the hello packet that neighbor node N sends as in running order node C, check that neighbor node N whether in neighbor table, if do not exist, is inserted into neighbor node N in the neighbor table; If, the dump energy information of neighbor node N in the renewal neighbor table;

Whether the dump energy of step 4. decision node C self is greater than the average residual energy of node C and neighbor node dump energy summation thereof, if, then keep operating state, enter the radio sensing network routing procedure based on irregular cellular automata of next cycle; Otherwise when node C entered resting state, sleepflag was set to 0 with the operating state sign, opened the dormancy time timer;

When step 5. reached the timing time of regulation when the dormancy time timer, operating state sign sleepflag was set to 1 again, entered the radio sensing network routing procedure based on irregular cellular automata of next cycle.

As a kind of preferred version: step 1 is specially: determine cellular node C in the cellular space of cellular automata _{I, j}Neighbor node N _{I, j}, the operating state collection of cellular node, and state transition rules function f, namely $Q_{i,j}^{(t+1)}=f\left(N_{i,j}^{\left(t\right)}\right).$

As a kind of preferred version: be specially the neighbor node of determining cellular node in the cellular space of cellular automata by the Thiessen polygon method in the step 1.

As a kind of preferred version: the operating state collection of determining the cellular node in the step 1 is specially: establishing Q is the limited discrete state collection of cellular, with the 00 low energy level state of representing to sleep, 01 expression sleep high-energy level state, 10 expression work low energy level states, 11 expression work high-energy level states, namely $Q=\{Q_{i,j}\∈\{\mathrm{00,01,10,11}\left\}\right|(i,j)\∈C\}.$

As a kind of preferred version: determine in the step 1 that the state transition rules function f is specially:

(1) existence rule:

If $Q_{i,j}^{\left(t\right)}=10,$ $Q_{i,j}^{(t+1)}=00$

If $Q_{i,j}^{\left(t\right)}=11,$ $Q_{i,j}^{(t+1)}=11$

(2) sleep rule:

If $Q_{i,j}^{\left(t\right)}=00,$ $Q_{i,j}^{(t+1)}=\left\{\begin{array}{c}10,\mathrm{sleepflag}=1\\ 00,\mathrm{sleepflag}=0\end{array}\right.$

If $Q_{i,j}^{\left(t\right)}=01,$ $Q_{i,j}^{(t+1)}=\left\{\begin{array}{c}11,\mathrm{sleepflag}=1\\ 01,\mathrm{sleepflag}=0\end{array}\right..$

As a kind of preferred version: also comprise step 6, use NS2 network simulation instrument that the energy-saving routing method based on the radio sensing network of irregular cellular automata is carried out emulation experiment.

Beneficial effect of the present invention is, the energy-saving routing method based on the radio sensing network of irregular cellular automata that the present invention proposes uses irregular cellular Automation Model, make when setting up network model node distribution can be not limited to latticed among the regular CA, and random distribution neatly; When formulating state transition rules, dump energy is also considered wherein, and with network abstract be irregular CA model, make that the node distribution is more flexible, more press close to live network; In based on the AODV Routing Protocol (Ad hoc on-demand distance vector routing) of irregular CA model, add energy efficient mechanism, energy consumption between balanced each node, the network of avoiding the too early death of individual nodes to cause is cut apart, improve the balancing energy of network, prolonged network lifetime.

Description of drawings

Fig. 1 is regular cellular automata mole type neighbours schematic diagram;

Fig. 2 is for determining the Thiessen polygon area schematic at node p place by the Thiessen polygon rule;

Fig. 3 is for adding the flow chart of irregular cellular Automation Model Routing Protocol;

Fig. 4 is a concrete network diagram;

Fig. 5 is that concrete network is abstract in irregular cellular Automation Model schematic diagram;

Fig. 6 is that concrete network is abstract in regular cellular Automation Model schematic diagram;

Fig. 7 is hello packet form schematic diagram;

Fig. 8 sets up the process schematic diagram for the node neighbor table;

Fig. 9 is 20 residue energy of node schematic diagrames;

Figure 10 is 50 residue energy of node schematic diagrames;

Figure 11 is that 20 meshed network energy consume schematic diagram;

Figure 12 is that 50 meshed network energy consume schematic diagram;

Figure 13 is the network lifetime schematic diagram.

Embodiment

In embodiment is set forth, will contrast regular cellular Automation Model and irregular cellular Automation Model, and the AODV energy-saving routing protocol of rule-based CA will be made an explanation.

Irregular cellular automata (Irregular Cellular Automata, ICA) divide the space by the Thiessen polygon method and determine the cellular neighbours, by the perpendicular bisector structure Thiessen polygon of point on the plane with the some line by model.As shown in Figure 2, p, a, b, c, d, e are points discrete on the plane, connect p and a respectively, b, and c, d, e, and make the perpendicular bisector of each bar line segment, perpendicular bisector intersects the polygon a ' b ' c ' d ' e ' f ' that forms and is Thiessen polygon.In the point set S of n point, connect p _ip _j, p _i∈ S, i ≠ j does Perpendicular bisector, comprise P _iThiessen polygon V (p _i) common factor of n-1 half-plane being divided by perpendicular bisector forms V (p _i) represent H (p wherein with following formula _ip _jExpression half is flat

V(p _i)=H(p _ip _l)∩H(p _ip ₂)∩...∩H(p _ip _n)

Thiessen polygon has following characteristics:

A. each Thiessen polygon only comprises a node

If b. node q (x, y)

And p _iIn same Thiessen polygon, p then _iWith the distance of q less than p _jWith the distance of q, p here _jBe other any points among the point set S, that is:

${[{(x-x_i)}^2+{(y-y_i)}^2]}^{\frac{1}{2}}<{[{(x-x_j)}^2+{(y-y_j)}^2]}^{\frac{1}{2}}$

In ICA, neighbours' number of each cellular is not quite similar, in communication distance, according to the definite neighbor node of Thiessen polygon method.The pixel cellular automaton is the same, and irregular cellular automata also needs to formulate the state transition method that state transition rules comes the regulation cellular.Cellular determines that by the state in the t-1 moment self and its neighbours' state each cellular is followed identical transformation rule, the conversion operating state in cycle at t state constantly.

Based on the energy-saving routing method algorithm flow chart of the radio sensing network of irregular cellular automata as shown in Figure 3, the step specific explanations is as follows:

Step 1. with network abstract be model based on irregular cellular automata, comprise cellular node C in the cellular space of determining cellular automata _{I, j}Neighbor node N _{I, j}, the operating state collection of cellular node, and state transition rules function f,

And set up route according to the radio sensing network energy-saving routing method based on irregular cellular automata.Concrete regulation is as follows:

1. cellular space nodes neighbours' determines.In traditional CA model, if dividing too small meeting, grid makes the cellular that occurs many spaces in the CA model even the neither one neighbours occur; On the other hand, if grid is excessive, can cause a more than cellular in the grid.ICA makes when setting up network model node distribution can be not limited to the latticed of rule, and can be neatly at random distribution.(with network abstract for ICA be prior art, but when using ICA, do not mention traditional CA in the shortcoming on the grid partition problem) in irregular CA, neighbours' number of each cellular is not quite similar, and in communication distance, determines its neighbor node according to the Thiessen polygon method.Be example with concrete network among Fig. 4, network that this is concrete is abstract respectively in Fig. 5 and Fig. 6 is irregular cellular Automation Model and regular cellular Automation Model, has compared CA and ICA.As shown in Figure 5, if with its abstract be the ICA model, use node p, a, b, c, d, e represents sensor node, distinguishes connected node p and node a, b, c, d, e determines the Thiessen polygon zone at p place according to the Thiessen polygon structure method of preamble introduction.In like manner, connected node a, b, c, d, the node around e and their also can obtain the Thiessen polygon zone A at their places, B, C, D, E.The node that polygon comprises within the communication range that adjoins with polygon P is the neighbor node of p, therefore can determine a, b, and c, d, e become the neighbor node of p.If with its abstract be the CA model; In Fig. 6, if the grid representation cellular space that with dashed lines is constituted, P has 5 neighbor nodes, and if the network model cellular space of using the grid representation that solid line constitutes, then P not have the neighbor node of surviving.(ICA makes up by the Thiessen polygon method and belongs to prior art)

2. the operating state collection of cellular node.Q is the limited discrete state collection of cellular, usually represent resting state and operating state with 0 and 1, because the state transition rules of cellular Automation Model does not use traditional life game rule among the present invention, and the foundation of residue energy of node state as the state conversion, therefore in the present invention, propose a kind ofly to represent the method for expressing of node state with multidigit, the state that each expression is dissimilar.Specifically comprise two in the present embodiment: the first bit representation sleep/operating state, the second bit representation dump energy state.Like this with the 00 low energy level state of representing to sleep, 01 expression sleep high-energy level state, 10 expression work low energy level states, 11 expression work high-energy level states.Be limited to present embodiment, the low energy level is lower than average level with dump energy and embodies, and high-energy level embodies with being higher than average level.Therefore in the present embodiment, Compare with traditional node state collection definition, the state set definition of using in the present embodiment is more flexible.

3. node state transformation rule function f.The cellular node determines the next operating state of oneself constantly according to neighbor table according to state transition rules f.In in the past about the research based on cellular Automation Model, normally used state transition rules is " life recreation ", why being referred to as " life recreation ", is because the life and death in next moment of cellular is depended on the quantity of cellular that live or in the dust in adjacent 8 grids.

The equivalent description of life rule is as follows:

(1) existence rule: if $Q_{i,j}^{\left(t\right)}=1,Q_{i,j}^{(t+1)}=\left\{\begin{array}{c}1,N_{i,j}^{\left(t\right)}=\mathrm{2,3}\\ 0,N_{i,j}^{\left(t\right)}\&NotEqual;\mathrm{2,3}\end{array}\right.$

(2) wake rule up: if $Q_{i,j}^{\left(t\right)}=0,Q_{i,j}^{(t+1)}=\left\{\begin{array}{c}1,N_{i,j}^{\left(t\right)}=3\\ 0,N_{i,j}^{\left(t\right)}\&NotEqual;3\end{array}\right.$

Yet be the CA model of state transition rules with " life recreation ", according to the node number of neighbor node work/resting state next state constantly that decides self, do not consider the dump energy grade situation of node itself and neighbor node, this may cause the unbalanced of dump energy between node.Therefore present embodiment is also considered dump energy wherein when formulating state transition rules, and the basic thought based on the energy-saving routing method of the radio sensing network of irregular cellular automata of proposition is to add energy efficient mechanism in based on the AODV agreement of CA model.

Present embodiment specified states transformation rule f,

As follows:

(3) existence rule:

If $Q_{i,j}^{\left(t\right)}=10,$ $Q_{i,j}^{(t+1)}=00$

First of node state is 1, and the expression node is current in running order.When second of state was 0, the current energy level of expression node was low.Therefore,

Show that node is in " work low energy level " state constantly at t, i.e. energy＜avr_energy, then this node is at next (t+1 is constantly) constantly, and the state of node is converted to " sleep low energy level " state, namely

(node for being in low energy level is converted into sleep state from operating state, can reach energy-conservation purpose.）

If $Q_{i,j}^{\left(t\right)}=11,$ $Q_{i,j}^{(t+1)}=11$

When second of state is 1, show the current energy level height of node.Therefore

Show that node is in " work high-energy level " state constantly at t, i.e. energy 〉=avr_energy, then this node is at next (t+1 is constantly) constantly, and the state of node remains unchanged, namely

(for the node that is in high-energy level, if current operating state is abundant because of its energy, still keep operating state constantly at next.）

When node entered resting state, sleepflag was set to 0 with the operating state sign, opened the SleepTimer timer.When the SleepTimer timer reached the timing time of regulation, operating state sign sleepflag was set to 1 again.Wherein, operating state sign sleepflag represents dormancy/operating state, and SleepTimer is used for recording the time of node dormancy.

(4) sleep rule:

If $Q_{i,j}^{\left(t\right)}=00,$ $Q_{i,j}^{(t+1)}=\left\{\begin{array}{c}10,\mathrm{sleepflag}=1\\ 00,\mathrm{sleepflag}=0\end{array}\right..$

It is 0 that first of node current state is 0, the second, and the expression node is in " sleep low energy level " state constantly at t, namely

If operating state sign sleepflag is 1, then this node is converted to " work low energy level " state at the state in next moment (t+1 constantly), namely Otherwise node still remains resting state in next moment (t+1 constantly), namely

If $Q_{i,j}^{\left(t\right)}=01,$ $Q_{i,j}^{(t+1)}=\left\{\begin{array}{c}11,\mathrm{sleepflag}=1\\ 01,\mathrm{sleepflag}=0\end{array}\right.$

It is 1 that first of node current state is 0 second, and the expression node is in " sleep high-energy level " state constantly at t, namely

If operating state sign sleepflag is 1, then this node is converted to " work high-energy level " state at the state in next moment (t+1 constantly), namely Otherwise node still remains resting state in next moment (t+1 constantly), namely

In state transition rules, variable energy represents dump energy, and avr_energy represents the average residual energy of this node and neighbor node.Avr_energy is defined as:

$\mathrm{avr}\_\mathrm{energy}=\frac{1}{N+1}(E+\underset{n\&Element;N}{\mathrm{\&Sigma;}}{E}_n)$

Wherein, E represents the dump energy of this node, E _nThe dump energy of representing the neighbor node of this node, N is the neighbor node number of this node.

Variable sleepflag is whether decision node is converted to operating state from resting state sign.SleepTimer is a duration timer at random, and this duration sends the cycle less than hello packet, and is in running order to guarantee taking turns when carrying out state transition rules node at each.

Step 2. cellular node periodic broadcasting hello packet is safeguarded route, in order to make node utilize hello packet to set up neighbor table, the dump energy that needs to comprise self in the hello packet that sends, Fig. 7 is the form of hello packet, basis at the hello packet form of original AODV Routing Protocol has increased the dump energy field, the dump energy of representing this node C, the dump energy here are energy poor of primary power and consumption in operation.

Next step 3. is exactly node executing state transformation rule periodically, determines next operating state constantly, switches between dormancy and operating state, to save energy.Shown in Figure 8 is the process of setting up of neighbor table, when in running order node C receives the hello packet that neighbor node N sends, check that neighbor node N is whether in neighbor table, if do not exist, newfound neighbor node is inserted in the middle of the neighbor table, ID and the dump energy of neighbor node is recorded in the neighbor table; If, the dump energy information of neighbor node N in the renewal neighbor table.

Step 4. node calculates the average residual energy according to dump energy and the self rest energy of each neighbor node in the neighbor table: Judge the energy level of self.Whether the dump energy of judging this node self is greater than the average residual energy of this node and neighbor node dump energy summation thereof, if, the dump energy that node is described is higher than average level, can the maintenance operating state, enter the radio sensing network routing procedure based on irregular cellular automata of next cycle; Otherwise, show that the dump energy of node less than the average residual energy, then makes node enter resting state, to save energy.When node entered resting state, sleepflag was set to 0 with the operating state sign, the expression resting state, and open the SleepTimer timer, to the dormancy time timing of node.

When step 5. reaches the timing time of regulation when the SleepTimer timer, show that dormancy time is full, operating state sign sleepflag is set to 1 again, and expression enters operating state, enters the radio sensing network routing procedure based on irregular cellular automata of next cycle.SleepTimer is a duration timer at random, and this duration sends the cycle less than hello packet, and is in running order to guarantee taking turns when carrying out state transition rules node at each.

Can also comprise step 6 here, use NS2 network simulation instrument that the energy-saving routing method based on the radio sensing network of irregular cellular automata is carried out emulation experiment.

In order to verify validity of the present invention, (Energy-efficient AODV Routing Protocol Using Cellular Automata AODV-ECA) has carried out emulation to the energy-saving routing method based on the radio sensing network of irregular cellular automata to have used NS2 network simulation instrument.Specifically from the angle of network lifetime, energy consumption and balancing energy AODV-ECA and the traditional AODV Routing Protocol based on CA are compared, relevant simulation parameter setting is shown in following table (table 1).

Table 1

The scene of 20 and 50 nodes has been simulated in emulation respectively, and node is distributed in the zone of 1000m*1000m immediately.

Fig. 9, Figure 10 are respectively the dump energies that has each node in the simulating scenes of 20 nodes, 50 nodes.As can be seen from the figure compare with the AODV-CA agreement, residue energy of node is more in the AODV-ECA agreement.Because the AODV-CA agreement is not considered the energy grade of node, in the AODV-CA agreement, the dump energy of the next-hop node that may occur selecting seldom, working on may deplete energy and dead, and meanwhile, the more node of dump energy is not utilized efficiently.Under the identical condition of primary power, use the AODV-ECA agreement can improve the harmony of energy.As can be seen from Figure 9, use the AODV-ECA agreement, the difference between the minimum node of the node that dump energy is maximum and dump energy is residue energy of node 0.344J, and is 0.525J in the scene of using the AODV-CA agreement.Same, in Figure 10, use the AODV-ECA agreement, the difference between the minimum node of the node that dump energy is maximum and dump energy is that residue energy of node is 0.566J, and is 0.581J in the scene of using the AODV-CA agreement.Therefore use the AODV-ECA agreement can improve the harmony of energy.

Figure 11, Figure 12 are the total power consumption situations of network.From figure, can obviously find out the conserve energy of AODV-ECA agreement, and its advantage is more obvious along with the increase of simulation time.At the emulation initial stage, the gap that network energy consumes is also little, and As time goes on, AODV-ECA has saved energy consumption to the full extent.

High-energy high efficiency and balancing energy make that the network lifetime of use AODV-ECA agreement is elongated.Figure 13 is to use the scene network lifetime situation of three kinds of different agreements.Here, network lifetime is defined as the simulation time that first dead node occurs.According to shown in Figure 13, AODV-ECA has the longest network lifetime as can be seen.

Also demonstrating clear superiority based on the energy-saving routing method of the radio sensing network of irregular cellular automata aspect energy efficient and the balancing energy as can be seen by simulation result, prolonged network lifetime, meanwhile, because it has used irregular cellular Automation Model, therefore when setting up network model, also have more flexibility.

Those of ordinary skill in the art will appreciate that embodiment described here is in order to help reader understanding's implementation method of the present invention, should to be understood that protection scope of the present invention is not limited to such special statement and embodiment.Those of ordinary skill in the art can make various other various concrete distortion and combinations that do not break away from essence of the present invention according to these technology enlightenments disclosed by the invention, and these distortion and combination are still in protection scope of the present invention.

Claims (6)

1. based on the energy-saving routing method of the radio sensing network of irregular cellular automata, it is characterized in that, may further comprise the steps:

Step 1. with radio sensing network abstract be model based on irregular cellular automata;

Step 2. cellular node periodic broadcasting hello packet is safeguarded route, comprises the dump energy of self in the hello packet of transmission;

When step 3. is received the hello packet that neighbor node N sends as in running order node C, check that neighbor node N whether in neighbor table, if do not exist, is inserted into neighbor node N in the neighbor table; If, the dump energy information of neighbor node N in the renewal neighbor table;

Whether the dump energy of step 4. decision node C self is greater than the average residual energy of node C and neighbor node dump energy summation thereof, if, then keep operating state, enter the radio sensing network routing procedure based on irregular cellular automata of next cycle; Otherwise when node C entered resting state, sleepflag was set to 0 with the operating state sign, opened the dormancy time timer;

When step 5. reached the timing time of regulation when the dormancy time timer, operating state sign sleepflag was set to 1 again, entered the radio sensing network routing procedure based on irregular cellular automata of next cycle.

2. the energy-saving routing method of the radio sensing network based on irregular cellular automata according to claim 1, it is characterized in that: step 1 is specially: determine cellular node C in the cellular space of cellular automata _{I, j}Neighbor node N _{I, j}, the operating state collection of cellular node, and state transition rules function f, namely

3. the energy-saving routing method of the radio sensing network based on irregular cellular automata according to claim 1 and 2 is characterized in that: be specially the neighbor node of determining cellular node in the cellular space of cellular automata by the Thiessen polygon method in the step 1.

4. the energy-saving routing method of the radio sensing network based on irregular cellular automata according to claim 3, it is characterized in that: the operating state collection of determining the cellular node in the step 1 is specially: establishing Q is the limited discrete state collection of cellular, with the 00 low energy level state of representing to sleep, 01 expression sleep high-energy level state, 10 expression work low energy level states, 11 expression work high-energy level states, namely

Q={Q _i,j∈{OO,Ol,1O，11}|(i,j)∈C}。

5. the energy-saving routing method of the radio sensing network based on irregular cellular automata according to claim 4 is characterized in that: determine in the step 1 that the state transition rules function f is specially:

(1) existence rule:

If

If

(2) sleep rule:

If

If

6. the energy-saving routing method of the radio sensing network based on irregular cellular automata according to claim 1, it is characterized in that: also comprise step 6, use NS2 network simulation instrument that the energy-saving routing method based on the radio sensing network of irregular cellular automata is carried out emulation experiment.

Images