CN105898679B - It is a kind of based on the heterogeneous sensor method of data capture for representing node more and being merged with multilayer - Google Patents
It is a kind of based on the heterogeneous sensor method of data capture for representing node more and being merged with multilayer Download PDFInfo
- Publication number
- CN105898679B CN105898679B CN201610196665.3A CN201610196665A CN105898679B CN 105898679 B CN105898679 B CN 105898679B CN 201610196665 A CN201610196665 A CN 201610196665A CN 105898679 B CN105898679 B CN 105898679B
- Authority
- CN
- China
- Prior art keywords
- node
- data
- base station
- hop count
- perception
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Expired - Fee Related
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W4/00—Services specially adapted for wireless communication networks; Facilities therefor
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W4/00—Services specially adapted for wireless communication networks; Facilities therefor
- H04W4/30—Services specially adapted for particular environments, situations or purposes
- H04W4/38—Services specially adapted for particular environments, situations or purposes for collecting sensor information
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W52/00—Power management, e.g. TPC [Transmission Power Control], power saving or power classes
- H04W52/02—Power saving arrangements
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W52/00—Power management, e.g. TPC [Transmission Power Control], power saving or power classes
- H04W52/02—Power saving arrangements
- H04W52/0209—Power saving arrangements in terminal devices
-
- 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
Abstract
The invention discloses a kind of based on the heterogeneous sensor method of data capture for representing node more and merging with multilayer, and inventive method is divided into two component parts.1: for every a kind of perception data, multiple data cover set are formed in entire wireless sensor network, the difference in same data cover set between data is less than defined threshold values.In this way, each data cover set just can represent node with one to represent the perception value entirely gathered.This is the data volume that the reduction network of first level is transmitted；2: representing the data of node during routing to base station, the representative node of same class data can routing algorithm proposed according to the present invention be as much as possible converges on a paths, to make same class data carry out data fusion again, to reduce the data volume for needing to be transferred to base station again.Thus the method for the present invention can significantly improve network life.
Description
Technical field
The invention belongs to wireless network isomeric data assembling sphere, in particular to a kind of sensing number that can improve network life
According to collection method.
Background technique
Wireless sensor network be by it is a large amount of each other by multi-hop wireless link and the sensor node of communication with
The wireless network that the mode of self-organizing and multi-hop is constituted can widely apply to industry monitoring, agricultural, civilian, environmental monitoring,
Battlefield, ocean, the various particular surroundings such as fire and application in, it is considered to be the Key technology of following important internet of things
One of.How a most important problem present in wireless sensor network research can be by the data of network aware if being
It is transmitted to base again and can be improved the service life of network.The service life of network is the matter of utmost importance of wireless sensor network research.Thus, it mentions
Research out is also especially more, only introduces related research related to the present invention below.Its background technique is discussed below:
The energy consumption for reducing node, to just can be improved network life.The research for thus saving node energy becomes
An important research contents in wireless sensor network.An important method for saving energy is to reduce the section for participating in perception
Point quantity, only selects a part of node to participate in the monitoring of event or target from node.Following 2 mesh can be reached in this way
Mark: (1) only selecting a part of node to be perceived from event or target area, to reduce the number of nodes for participating in perception
Amount, in this way these nodes for being not involved in perception can enter sleep state, to save energy.(2) corresponding to reduce to thing
The perception of part or the small node of target apperception information content, and select the node high to event or target monitoring information quality can
The data volume for being sent to base station is reduced under the premise of not reducing to event and target monitoring quality, to improve network life.
In the method proposed, each node is sent to base station for the data of perception are independent, thus even if selection
Less node still suffers from biggish energy consumption in the case where monitoring event and environment.Thus document [Hung C C,
Peng W C, Lee W C.Energy-aware set-covering approaches for approximate data
collection in wireless sensor networks.IEEE Transactions on Knowledge and
Data Engineering, 2012；24 (11): 1993-2007.] a kind of method for representing node is proposed, this method is logical
Selection one value for being known as representing section in data cover set is crossed to come for approximate for the perception value for entirely gathering all nodes
Method.Thus, it and is not required to for each node perceived value to be sent to base station, thus represent nodal method can further reduce hair
It is sent to the data volume of base station, so as to save energy, but this requires application system that can tolerate certain data error range.
The method of another kind of important saving energy is data fusion.The node of wireless sensor network disposition is due to perception
Information between there are correlations, such as: after certain event occurs, while having multiple node perceiveds to event, thus do not have completely
It is necessary to which the node data of each perception event information is sent to base station, but by these node perceiveds before being sent to base station
Data carry out data fusion, and the data that only will accurately express event information extract, that is, send out again after data fusion
Toward base station.In this way, the data volume that node needs to send can be reduced, and information acquired in system is not reduced.
But it is existing research the problem is that: (1) represent in nodal method, only research can only handle single
The network of perception value, and the network of multiple perception values cannot be handled.(2) currently proposed representative node selecting method is all very multiple
Miscellaneous, the energy for needing to consume is very more；(3) each represent node be it is independent be sent to base station, so that energy consumption compares
Greatly.Fail to use Data fusion technique.Leading to current technology, there is also biggish improvements.Therefore, it is necessary to design one
Kind heterogeneous sensor method of data capture is to improve network life.
Summary of the invention
Technical problem to be solved by the invention is to provide a kind of based on the heterogeneous sensor for representing node more and merging with multilayer
Method of data capture should can be reduced the data of transmission based on the heterogeneous sensor method of data capture that node is merged with multilayer is represented more
Amount improves network life.
The technical solution of invention is as follows:
It is a kind of based on the heterogeneous sensor method of data capture for representing node more and being merged with multilayer, in wireless sensor network
In, each node can sense the different types of perception value such as multiclass perception value, such as temperature, humidity, air pressure, and multiclass perceives number
It is stated to be isomeric data；By following two methods to improve network life, i.e., the information of perception data is being met using need
Under the premise of asking, as far as possible network life is maximized:
Method 1: for every a kind of perception data, forming multiple data cover set in entire wireless sensor network,
Data cover set is denoted as DCS, and the difference of such perception data value of each data cover set interior nodes is less than application and sets
Fixed threshold values is equipped with a head node in each data cover set as representing node；
Method 2: for every a kind of perception data, the routing to base station is initiated to transmit such perception number from representing node
According to；The routing of same class perception data collects on a routed path as much as possible during routing to base station, passes through
Base station is transferred to after data fusion.
In method 1, the forming process for gathering head node is as follows:
Each node randomly chooses a number between 0~1, if being less than threshold value P (A) for the number of node A selection,
The node acts as set head node；Wherein the calculating of P (A) is as follows:
In formula, mod is remainder function；P is the probability that node is elected as set head node, according to the demand applied
It is previously set；γ is the wheel number that current circulation carries out；G is nearestWheel is not elected as the node set of set head node；
EavgAnd EARespectively indicate the average energy of node A and its neighbor node and the present energy of node A.
In method 1, the forming process of set member's node in data cover set is as follows:
(1) when initializing, each node is arranged that oneself to reach the hop count of every one kind DCS set head node be ∞, i.e., infinite
Greatly；
(2) corresponding any one set head node A, is broadcasted first, is broadcast the message as CMA, indicate creation set member
The message of node A；The broadcast message CM of node AAInclude 6 contents:
(a) ID for gathering head node, is denoted as CMA.h；
(b) ID of node A oneself, is set as CMA.ID；
(c) node reaches the hop count of set head node A
(d) value Δ of the limitation broadcast in certain hop count, is denoted as CMA.Δ；
(e) type of perception valueψ is the type of perception value,The type of table perception value
Sum；
(f) perception value for gathering head node A, is denoted as CMA.υ；
Set head node A broadcasts the broadcast message of the kth class perception value of oneself are as follows: CMA.h=A, CMA.ID=A, Indicate the distance broadcast of broadcast initiate node maximum hop count (8) its value is generally set to using related,
CMAψ=k, CMAυ=xA；xAIt is the specific value of perception value；Any node for receiving broadcast message, such as node B, if receiving
The broadcast packet arrived is CMA, successively proceed as follows:
(I) CM is read firstAψ compares the CM of oneself preservationAψ class data reach CMA.h[gather head node
ID] hop count ΗAWhether it is less than
If so, abandoning this broadcast message, any operation is not done, continues waiting for new message；
Set head node CM oneself is reached if it is not, then updatingA.h hop countAnd arrival is set
The set head node of kth class data is CMA.h, the next-hop for reaching set head node routing is CMA.ID, continue to grasp in next step
Make；
(II) by the CM of oneselfAψ class data perception value and set head node CMA.h perception value CMAThe value of υ carries out
Compare, ifThen B issues the addition message JM for participating in set head node A to set head node A,
And continue the operation of (III)；The process that message (JM) is added is fairly simple, is the prior art；Receive JM message
Section
Point forwards JM to set head node in Minimal routing method, thus final JM reaches set head node, gathers cephalomere
Point
Record each member node in data cover set；
D () is difference functions,It indicatesDifference, εkIndicate the difference threshold of kth class data perception value
Value,
For preset given value；
(III) if CMAΔ -1=0, then all operations terminate；Otherwise the node B for receiving message updates broadcast packet
Broadcast carries out next circulation outward again after content；Updated broadcast packet content are as follows: CMA.h=A, CMA.ID=B, CMA.Δ
=CMAΔ -1, CMAψ=k, CMAυ=xA。
Fail to become set head node in the first round, also fails to the node for enough becoming data cover set (set member)
A' automatically becomes set head node.
In method 2, using data fusion method for routing, after homogeneous data is merged, then from representing node to remittance
Poly- node sends data；
The data fusion method for routing, comprising the following steps:
Step S1: the hop count for oneself reaching base station is 0 by base station, and the jump that every class observed value reaches base station is arranged in each node
Number is ∞, thus sharedA ∞, then, base station is broadcasted outward, and the node for receiving broadcast message arrives oneself kth class perception value
Up to base station hop count compared with the hop count in broadcast packet, if the hop count in broadcast packet add 1 be less than oneself save kth class perception
Value reaches the hop count of base station, then adds 1 to replace the hop count saved with the hop count of broadcast packet, and then, oneself is reached base station by this node
Hop count similarly broadcasted so that each node obtain reach base station kth class perception value minimum hop count；
Step S2: when kth class set syncephalon node has data to need to be transferred to base station, using shortest route algorithm, successively
The node that selected distance base station nearly one is jumped is routed as relay node, transfers data to base station；
Step S3: the hop count that oneself kth class reaches base station is arranged the node for carrying out the routing of kth class data in step s 2
It is 0；Then, the node that hop count becomes 0 reaches the hop count of base station to external diffusion oneself, and method is similar with step S1, impacted
Node in range changes the hop count of the arrival base station of oneself, so that the routing of other homogeneous datas can be attracted to the road first created
By upper, so that the routing of a plurality of data can collect in a routing after carrying out data fusion, then it is sent to base station, needed for reducing
The data volume to be sent improves network life to reduce energy consumption.
In wireless sensor network, the information of multiple node perceiveds may be very close, if the information of node perceived
The range of difference is in specified threshold values, so that it may be represented with the perception information of a node and be existed with the difference with its perception information
The perception value of other nodes in threshold range.The data volume transmitted required for network can thus be reduced and improve network life.
It is further proposed in the present invention according to above principle and represents the isomeric data receipts that node is merged with multilayer more
Set method.In the present invention, as shown in Figure 1, not only node of the perception value in certain threshold range forms a set, the collection
The perception value that the perception value for closing all nodes represents node with one represents, it is only necessary to which the value of the node is sent to base station
?.
Compared with the prior art, the advantages of the present invention are as follows:
It is of the invention based on the heterogeneous sensor method of data capture for representing node more and being merged with multilayer, be distributed representative
Node selecting method, as long as it is random carry out representing node election from any one node complete, to make algorithm energy
Consume it is small, it is simple and effective；The case where being capable of handling multiple perception values；Data are sent to base station after being merged again, thus into one
Step reduces data volume, improves network life.
The previous research of comparison, improvement of the invention are as follows: (a) previous research is only capable of handling the feelings of single perception value
Condition.In actual network, sensing node is often equipped with multiple sensors part, for example a sensing node tends to simultaneously
The perception values such as sense temperature, humidity, air pressure.Thus the perception value of this isomery cannot be represented with a typical value, but be wanted
It is represented with the typical value of multiple and different types, thus, different typical values is used to the different perception values of isomery in the present invention
To represent；(b) it relaxes and needs suitably to select to represent node to reduce the deficiency of transmitted data on network in previous research.With
Toward method in if the typical value of selection is different, the number for representing node is not also identical, that is, needs to send base station to
Data packet number it is different.Thus often in order to select the complexity of suitable typical value and increasing method.The present invention relaxes
This constraint, it is only necessary to which the random specified value for not becoming the node in set is typical value.Because the present invention is also to generation
The data that table node sends base station to have carried out secondary data fusion, on the one hand greatly reduce the data for being transmitted to base station
Amount, and reduce the complexity of selection typical value.
Another important improvement of the invention is the method converged using routing when the value for representing node is sent to base station,
Making the routing of same type perception value can merge together, to carry out data fusion, can greatly reduce be transmitted in this way
The data volume of base station improves network life.As shown in Figure 1, route origin 1, route origin 2, the data of route origin 3 are finally all
It merges in a routing, so that these similar data carry out data fusion again to reduce the data volume of data transmission.And with
Past method is that each routing is all individually to be routed to base station, thus the side that its volume of transmitted data is very big thus of the invention
Method can greatly improve network life.By two kinds of improvement as above, the method for the present invention can simplify previous algorithm, expand
The scope of application of algorithm reduces the data volume for being transmitted to base station, improves network life.
Inventive method is divided into two component parts.1: for every a kind of perception data, in entire wireless sensor network
Multiple data cover set are formed, the difference in same data cover set between data is less than defined threshold values.In this way, each
A data cover set just can represent node with one to represent the perception value entirely gathered.This is the reduction net of first level
The data volume that network is transmitted；2: representing the data of node during routing to base station, the representative node meeting of same class data
Routing algorithm proposed according to the present invention is as much as possible to be convergeed on a paths, so that same class data be made to carry out number again
According to fusion, to reduce the data volume for needing to be transferred to base station again.Thus the method for the present invention can significantly improve the network longevity
Life.
Detailed description of the invention
Fig. 1 is based on representing the heterogeneous sensor data routing schematic diagram that node merges with multilayer more；
Fig. 2 is set forming process schematic diagram；
Fig. 3 is the forming process schematic diagram of routing；
Fig. 4 is the comparison diagram of the data volume undertaken in distinct methods lower node；
Fig. 5 is the comparison in the Energy Expenditure Levels of distinct methods lower node
Fig. 6 is that the ceiling capacity of network consumes comparison diagram；
Fig. 7 is that the ceiling capacity under different data related coefficient consumes comparison diagram；
Fig. 8 is the comparison diagram of distinct methods lower network residual energy dose rate.
Specific embodiment
To facilitate the understanding of the present invention, invention herein is done below in conjunction with Figure of description and preferred embodiment more complete
Face meticulously describes, but protection scope of the present invention is not limited to specific embodiment.
Unless otherwise defined, all technical terms used hereinafter are generally understood meaning phase with those skilled in the art
Together.Technical term used herein is intended merely to the purpose of description specific embodiment, and it is of the invention to be not intended to limitation
Protection scope.
Embodiment:
It is a kind of based on the heterogeneous sensor method of data capture for representing node more and being merged with multilayer such as Fig. 1-3, in wireless sensing
In device network, each node can sense the different types of perception value such as multiclass perception value, such as temperature, humidity, air pressure, multiclass
Perception data is known as isomeric data；By following two methods to improve network life, i.e., the information of perception data is being met
Under the premise of application demand, as far as possible network life is maximized:
Method 1: for every a kind of perception data, forming multiple data cover set in entire wireless sensor network,
Data cover set is denoted as DCS, and the difference of such perception data value of each data cover set interior nodes is less than application and sets
Fixed threshold values is equipped with a head node in each data cover set as representing node；
Method 2: for every a kind of perception data, the routing to base station is initiated to transmit such perception number from representing node
According to；The routing of same class perception data collects on a routed path as much as possible during routing to base station, passes through
Base station is transferred to after data fusion.
In method 1, the forming process for gathering head node is as follows:
Each node randomly chooses a number between 0~1, if being less than threshold value P (A) for the number of node A selection,
The node acts as set head node；Wherein the calculating of P (A) is as follows:
In formula, mod is remainder function；P is the probability that node is elected as set head node, according to the demand applied
It is previously set；γ is the wheel number that current circulation carries out；G is nearestWheel is not elected as the node set of set head node；
EavgAnd EARespectively indicate the average energy of node A and its neighbor node and the present energy of node A.
In method 1, the forming process of set member's node in data cover set is as follows:
(1) when initializing, each node is arranged that oneself to reach the hop count of every one kind DCS set head node be ∞, i.e., infinite
Greatly；
(2) corresponding any one set head node A, is broadcasted first, is broadcast the message as CMA, indicate creation set member
The message of node A；The broadcast message CM of node AAInclude 6 contents:
(a) ID for gathering head node, is denoted as CMA.h；
(b) ID of node A oneself, is set as CMA.ID；
(c) node reaches the hop count of set head node A
(d) value Δ of the limitation broadcast in certain hop count, is denoted as CMA.Δ；
(e) type of perception valueψ is the type of perception value,The type of table perception value
Sum；
(f) perception value for gathering head node A, is denoted as CMA.υ；
Set head node A broadcasts the broadcast message of the kth class perception value of oneself are as follows: CMA.h=A, CMA.ID=A, Indicate the distance broadcast of broadcast initiate node maximum hop count (8) its value is generally set to using related,
CMAψ=k, CMAυ=xA；xAIt is the specific value of perception value；Any node for receiving broadcast message, such as node B, if receiving
The broadcast packet arrived is CMA, successively proceed as follows:
(I) CM is read firstAψ compares the CM of oneself preservationAψ class data reach CMA.h[gather head node
ID] hop count ΗAWhether it is less than
If so, abandoning this broadcast message, any operation is not done, continues waiting for new message；
Set head node CM oneself is reached if it is not, then updatingA.h hop countAnd arrival is set
The set head node of kth class data is CMA.h, the next-hop for reaching set head node routing is CMA.ID, continue to grasp in next step
Make；
(II) by the CM of oneselfAψ class data perception value and set head node CMA.h perception value CMAThe value of υ carries out
Compare, ifThen B issues the addition message JM for participating in set head node A to set head node A, and continues the
(III) operation；The process that message (JM) is added is fairly simple, is the prior art；The node of JM message is received with Minimal routing
Method forwards JM to set head node, thus final JM is reached and gathered head node, in set head node record data cover set
Each member node；
D () is difference functions,It indicatesDifference, εkIndicate the difference threshold of kth class data perception value
Value is preset given value；
(III) if CMAΔ -1=0, then all operations terminate；Otherwise the node B for receiving message updates broadcast packet
Broadcast carries out next circulation outward again after content；Updated broadcast packet content are as follows: CMA.h=A, CMA.ID=B, CMA.Δ
=CMAΔ -1, CMAψ=k, CMAυ=xA。
Fail to become set head node in the first round, also fails to the node for enough becoming data cover set (set member)
A' automatically becomes set head node.
In method 2, using data fusion method for routing, after homogeneous data is merged, then from representing node to remittance
Poly- node sends data；
The data fusion method for routing, comprising the following steps:
Step S1: the hop count for oneself reaching base station is 0 by base station, and the jump that every class observed value reaches base station is arranged in each node
Number is ∞, thus sharedA ∞, then, base station is broadcasted outward, and the node for receiving broadcast message arrives oneself kth class perception value
Up to base station hop count compared with the hop count in broadcast packet, if the hop count in broadcast packet add 1 be less than oneself save kth class perception
Value reaches the hop count of base station, then adds 1 to replace the hop count saved with the hop count of broadcast packet, and then, oneself is reached base station by this node
Hop count similarly broadcasted so that each node obtain reach base station kth class perception value minimum hop count；
Step S2: when kth class set syncephalon node has data to need to be transferred to base station, using shortest route algorithm, successively
The node that selected distance base station nearly one is jumped is routed as relay node, transfers data to base station；
Step S3: the hop count that oneself kth class reaches base station is arranged the node for carrying out the routing of kth class data in step s 2
It is 0；Then, the node that hop count becomes 0 reaches the hop count of base station to external diffusion oneself, and method is similar with step S1, impacted
Node in range changes the hop count of the arrival base station of oneself, so that the routing of other homogeneous datas can be attracted to the road first created
By upper, so that the routing of a plurality of data can collect in a routing after carrying out data fusion, then it is sent to base station, needed for reducing
The data volume to be sent improves network life to reduce energy consumption.
To every a kind of perception data, the data that data cover set based algorithm proposed according to the present invention forms one by one are covered
Lid set, each set represent the value of this data cover set by being referred to as the perception value of covering set head node.Covering collection
After hop algorithm operation, every one kind data have multiple data cover set, and the node for arbitrarily possessing such perception value must belong to
Some set in such data cover set.Same algorithm, every one kind in such network are run to every a kind of perception value
Perception value all included by multiple data cover set.Then, each data cover set from the head node gathered initiate to
The routing of base station, in the present invention, the characteristic that there is similar routing can pool together for the routing of initiation, thus, in multiple collection
Syncephalon node is collected in routing procedure on Yi Tiaolu (routed path), it will be able to data fusion is carried out, to further subtract
It is transmitted to the data volume of base station required for few, to improve network life.
The forming process of set head node below all refers to the set cephalomere dot of kth class data cover set (DCS)
At process.Due to forming process and the kth class data cover of other class data cover set assemble process be it is similar, thus
It only needs to execute following process altogetherIt is secondary, it will be able to which that the perception value of classes all in network is formed into data cover set.
In the selection algorithm of set head node, each node randomly chooses a number between 0~1, such as node A
The number of fruit selection is less than threshold value P (A), then the node acts as set head node.Wherein the calculating of P (A) is as follows:
In formula, mod is remainder function, and p is the probability that node is elected as set head node, and γ is that current circulation carries out
Wheel number；G is nearestWheel is not elected as the node set of set head node.By formula (8) it is found that being elected to the section of cluster head
Point will can't be cluster head in next 1/p wheel circulation.EavgAnd EcRespectively indicate the flat of node A and its neighbor node
The present energy of equal energy and node A.
(2) forming process of set member's node
When starting, each node is arranged that oneself to reach the hop count of every one kind DCS set head node be ∞ by front
Operational set head node generate after, each become set head node node carry out subsequent operation:
The forming process of set member's node is discussed for gathering head node A below.Set head node A is carried out extensively first
It broadcasts, if broadcast message is CMA(message for indicating creation set member's node A).The broadcast message CM of node AAMain includes 6
Main contents: (a) gather the ID of head node, be denoted as CMA.h. the ID of (b) node A oneself, is set as CMA.ID. (c) node reaches collection
The hop count of syncephalon node A(d) value Δ of the limitation broadcast in certain hop count, is denoted as CMAThe type of Δ (e) data(f) perception value for gathering head node A, is denoted as CMA.υ.Set head node A in this way broadcasts oneself the
The broadcast message of k class perception value are as follows: CMA.h=A, CMA.ID=A,CMAψ=k, CMA.υ=xA.It is any to connect
The node of broadcast message, such as node B are received, if the broadcast packet received is CMA, successively proceed as follows:
(I) CM is read firstA.ψ, compare the CM of oneself preservationA.ψClass data reach CMA.h hop count ΗAWhether it is less thanSet head node CM oneself is reached if it is not, then updatingA.h hop countAnd it is arranged and arrives
Set head node up to kth class data is CMA.h, the next-hop for reaching set head node routing is CMA.ID, continue (II) behaviour
Make；Otherwise, this broadcast message is abandoned, does not do any operation.
(II) by the CM of oneselfAψ class data perception value and set head node CMA.h perception value CMAThe value of υ carries out
Compare, ifThen B issues the addition message (JM) for participating in set head node A to set head node A, and continues
The operation of (III).The process that message (JM) is added is fairly simple.The node of JM message is received in Minimal routing method to set
Head node forwards JM, thus final JM reaches set head node, set head node record each member of data cover set section
Point.
(III) if CMAΔ -1=0, then all operations terminate；Otherwise it is broadcasted outward again after updating the content of broadcast packet,
New broadcast packet content are as follows: CMA.h=A, CMA.ID=B, CMAΔ=CMAΔ -1, CMAψ=k, CMAυ=xA。
The forming process of data acquisition system member is as shown in Figure 2.If node A competition in become set head node, then node A to
Outer broadcast, after the node in broadcasting area receives the broadcast message of node A, if it find that oneself being the perception value belonged to A
Distance in error range, then to set head node A apply addition.At this moment set head node A is added in node P, B, G, J, D,
As the member (member) of DCS where node A, as shown in (1) of Fig. 2.Equally, node P, B, G, J, D, C are broadcasted outward again,
Make node N, E, K, H, S, I, O are added, as shown in (2) of Fig. 2.If settingThen 2 jump range interior nodes can be added
Gather the DCS where head node A.Equally, if F also competes as set head node, node F also does same operation,
To form DCSs shown in (3) of Fig. 2.
Routing procedure is as shown in figure 3, Routing Protocol is begun with similar to hop count diffusion protocol, it is therefore an objective to make node all
Know that oneself reaches the hop count of base station.But different with common hop count diffusion protocol is that each node hasClass perception value, together
Class perception value could merge, thus, the purpose of weight data fusion routing is intended to that similar perception value is made to converge to same routing
In order to data fusion.Thus each node is preservedClass perception value reaches the minimum hop count of base station, when just starting, thus,
The hop count for oneself reaching base station is 0 by base station.It is ∞ that each node, which is arranged every class observed value to reach the hop count of base station, thus sharedA ∞.Then, oneself kth class perception value is reached hop count and the broadcast of base station by broadcast outward, the node for receiving broadcast message
Hop count in packet compares, if the hop count in broadcast packet adds 1 to be less than the hop count that the kth class perception value that oneself is saved reaches base station,
Then 1 is added to replace the hop count saved with the hop count of broadcast packet.Then, this node carries out the hop count for oneself reaching base station same wide
It broadcasts.In this way, each node obtains reaching the minimum hop count of the kth class perception value of base station.We give tuple evidence by Fig. 3
Merge the establishment process of routing.If the type of data in network(1) of Fig. 3 gives after carrying out hop count broadcast, each
The minimum hop count of every class observed value of the arrival base station of nodes records, at this moment all class perception values of the same node reach base station
It is worth identical.Then, if set head node has data to be sent to base station, node according to data classification using it is such it is other most
Small hop count routing mechanism is routed to base station.At this moment track is routed as shown in (1) of Fig. 3.Unlike previous routing mechanism,
In heavy data fusion method for routing of the invention, the node in this routing sets the hop count that oneself kth class reaches base station to
0.The black as shown in (2) of Fig. 3 routes track.Then, the section that hop count becomes 0 node to external diffusion, in impacted range
The hop count of the arrival base station of point change oneself, as shown in (3) of Fig. 3.It is since this routes the hop count that upper node reaches base station
0, thus the routing of other homogeneous datas will be attracted in the routing created at first, so that the routing of a plurality of data can collect in one
Base station is sent in item routing.As shown in (4) of Fig. 3, the numerical value such as 4/4 in circle represents the hop count for reaching base station, and each circle has
Two-digit respectively indicates two class data to the hop count for reaching base station.
It include the routing of two class data in Fig. 3, solid line color is one kind, and the routing of dotted line is a kind of.Same class data
Routing will pool together as far as possible, to merge.And inhomogeneous data do not need then to converge.
Illustrate routing procedure by Fig. 3.(1) of Fig. 3 gives after carrying out the hop count broadcast of step S1, each node
The minimum hop count of every class observed value of the arrival base station of record, Fig. 3 are equipped with two class perception datas.At this moment the same node is all not
It is identical that the jumping figure value of base station is reached with perception data.Then, if there is set head node there are data to be sent to base station, then node according to
Base station is routed to using such other minimum hop routing mechanism according to the classification of data.At this moment rail is routed as shown in (1) of Fig. 3
Mark.Unlike previous routing mechanism, in method 2 of the invention, oneself kth class is reached base station by the node in this routing
Hop count be set as 0.The solid line as shown in (2) of Fig. 3 routes track.Then, hop count becomes 0 node to external diffusion, by shadow
The hop count that the node in range changes the arrival base station of oneself is rung, as shown in (3) of Fig. 3.It is reached since this routes upper node
The hop count of base station is 0, thus the routing of other homogeneous datas will be attracted in the routing first created, so that a plurality of data route
It can collect in a routing and be sent to base station.As shown in (4) of Fig. 3.
The method that method of the invention compares therewith is: (1) the 1st kind is directly sent out to base station after each node generates data
It send, referred to as immediate data collection method (direction data collection, DDC) is [referring to document: Liu in the present invention
A, Ren J, Li X, et al.Design principles and improvement of cost function based
energy aware routing algorithms for wireless sensor networks.Computer
Networks, 2012,56 (7): 1951-1967].2nd kind is document [Hung C C, Peng W C, Lee W C.Energy-
aware set-covering approaches for approximate data collection in wireless
Sensor networks.IEEE Transactions on Knowledge and Data Engineering, 2012；24
(11): 1993-2007.] method, each data cover collection shares the perception value for representing its set of node on behalf, and straight
It connects to base station report, this method is referred to as to represent node data collection method (R-node data collection, RNDC).This
Inventive method is MRRF.
From the experimental result of Fig. 4 and 5 can be seen that MRRF method proposed by the present invention can equalising network energy consumption,
Nearly base station area, for energy consumption much smaller than DDC and RNDC method, and in remote base station area, energy consumption is but higher than DDC
With RNDC method.The reason of causing this phenomenon is: MRRF method due to using represent node with merge again method for routing thus
So that the energy consumption of nearly base station area node is significantly less than other 2 methods.And in remote base station area, MRRF method use compared with
Big DCS is created with the energy consumption of maintenance so that node is spent on DCS much larger than other two kinds of methods, thus in remote base
The energy consumption for region MRRF method of standing is higher instead.But this takes full advantage of instead there is no the performance for reducing MRRF method
Network energy consumption, improves the capacity usage ratio of network.
From fig. 6, it can be seen that the method for the present invention, relative to other two kinds of methods, the ceiling capacity consumption of network is much smaller than it
Its two kinds of method.And the ceiling capacity consumption of network just determines network life, that is to say, that method of the invention can be substantially
The raising network life of degree.It is to represent node data collection method respectively, 1.6 times of the immediate data collection method lower network service life
To 3.2 times.
Fig. 7 gives the consumption comparison of the ceiling capacity under different data related coefficient, as can be seen from the figure: representing section
Point data collection method and the consumption of immediate data collection method lower network ceiling capacity are 2.12~3.73 times of the method for the present invention,
4.24~7.13 times.Illustrate that the method for the present invention can significantly reduce the energy consumption of node.
Fig. 8 gives the comparison of distinct methods lower network residual energy dose rate, it can be seen from the figure that the method for the present invention is off line
Network residual energy dose rate is only 10% or so, and other two kinds of methods are up to 70%, illustrate that the method for the present invention can efficiently use energy
Amount.
Claims (5)
1. it is a kind of based on the heterogeneous sensor method of data capture for representing node more and being merged with multilayer, in wireless sensor network,
Each node can sense multiclass perception value, which is characterized in that by following two methods to improve network life:
Method 1: for every a kind of perception data, multiple data cover set, data are formed in entire wireless sensor network
Covering set is denoted as DCS, and the difference of such perception data value of each data cover set interior nodes is less than application settings
Threshold values is equipped with a head node in each data cover set as representing node；Multiple data covers of multiclass perception value
It is mutually indepedent between set；
Method 2: for every a kind of perception data, the routing to base station is initiated to transmit such perception data from representing node；Together
The routing of a kind of perception data collects on a routed path as much as possible during routing to base station, the section collected
Point is the member node of any data covering set on the routed path or represents node, after the fusion of data multilayer
It is transferred to base station.
2. it is according to claim 1 based on the heterogeneous sensor method of data capture for representing node more and being merged with multilayer, it is special
Sign is, in method 1, the forming process for gathering head node is as follows:
Each node randomly chooses a number between 0~1, if being less than threshold value P (A) for the number of node A selection, the section
Point acts as set head node；Wherein the calculating of P (A) is as follows:
In formula, mod is remainder function；P is the probability that node is elected as set head node, prior according to the demand applied
Setting；γ is the wheel number that current circulation carries out；G is nearestWheel is not elected as the node set of set head node；EavgWith
EARespectively indicate the average energy of node A and its neighbor node and the present energy of node A.
3. it is according to claim 1 based on the heterogeneous sensor method of data capture for representing node more and being merged with multilayer, it is special
Sign is, in method 1, the forming process of set member's node in data cover set is as follows:
(1) when initializing, each node is arranged that oneself to reach the hop count of every one kind DCS set head node be ∞, i.e. infinity；
(2) corresponding any one set head node A, is broadcasted first, is broadcast the message as CMA, expression creation set member's node A
Message；The broadcast message CMA of node A includes 6 contents:
(a) ID for gathering head node, is denoted as CMA.h；
(b) ID of node A oneself, is set as CMA.ID；
(c) node reaches the hop count of set head node A
(d) value Δ of the limitation broadcast in certain hop count, is denoted as CMA.Δ；
(e) type of perception valueψ is the type of perception value,The type of table perception value is total
Number；
(f) perception value for gathering head node A, is denoted as CMA.υ；
Set head node A broadcasts the broadcast message of the kth class perception value of oneself are as follows: CMA.h=A, CMA.ID=A, Indicate that the maximum hop count of node, CM are initiated in the distance broadcast of broadcastAψ=k, CMAυ=xA；xAIt is the specific value of perception value；
Any node for receiving broadcast message, such as node B, if the broadcast packet received is CMA, successively proceed as follows:
(I) CM is read firstAψ compares the CM of oneself preservationAψ class data reach CMA.h hop count ΗAWhether it is less than
If so, abandoning this broadcast message, any operation is not done, continues waiting for new message；
Set head node CM oneself is reached if it is not, then updatingA.h hop countAnd it is arranged and reaches kth class
The set head node of data is CMA.h, the next-hop for reaching set head node routing is CMA.ID, continue to operate in next step；
(II) by the CM of oneselfAψ class data perception value and set head node CMA.h perception value CMAThe value of υ is compared,
IfThen B issues the addition message JM for participating in set head node A to set head node A, and continues (III)
Operation；The node of JM message is received in Minimal routing method to set head node forwarding JM, thus final JM reaches collection syncephalon
Node, set head node record each member node in data cover set；
D () is difference functions,It indicatesDifference, εkIndicate kth class data perception value difference threshold, be
Preset given value；
(III) if CMAΔ -1=0, then all operations terminate；Otherwise the node B for receiving message updates the content of broadcast packet
Broadcast carries out next circulation outward again afterwards；Updated broadcast packet content are as follows: CMA.h=A, CMA.ID=B, CMAΔ=
CMAΔ -1, CMAψ=k, CMAυ=xA。
4. it is according to claim 3 based on the heterogeneous sensor method of data capture for representing node more and being merged with multilayer, it is special
Sign is, fails to become set head node in the first round, also fails to the node for enough becoming data cover set (set member)
A' automatically becomes set head node.
5. according to claim 1-4 based on the heterogeneous sensor data collection side for representing node more and being merged with multilayer
Method, which is characterized in that in method 2, using data fusion method for routing, after homogeneous data is merged, then by representing section
Point sends data to aggregation node；
The data fusion method for routing, comprising the following steps:
Step S1: the hop count for oneself reaching base station is 0 by base station, and the hop count that every class observed value arrival base station is arranged in each node is
∞, thus it is sharedA ∞, then, base station is broadcasted outward, oneself kth class perception value is reached base by the node for receiving broadcast message
The hop count stood arrives compared with the hop count in broadcast packet if the hop count in broadcast packet adds 1 to be less than the kth class perception value that oneself is saved
Up to the hop count of base station, then 1 is added to replace the hop count saved with the hop count of broadcast packet, then, oneself is reached the jump of base station by this node
Number is similarly broadcasted, so that each node obtains reaching the minimum hop count of the kth class perception value of base station；
Step S2: it when kth class set syncephalon node has data to need to be transferred to base station, using shortest route algorithm, successively chooses
The node jumped apart from base station nearly one is routed as relay node, transfers data to base station；
Step S3: the node for carrying out the routing of kth class data in step s 2 sets 0 for the hop count that oneself kth class reaches base station；
Then, the node that hop count becomes 0 reaches the hop count of base station to external diffusion oneself, and the node in impacted range changes arriving for oneself
Up to the hop count of base station, so that the routing of other homogeneous datas can be attracted in the routing first created, so that a plurality of data route meeting
It collects in a routing after carrying out data fusion, then is sent to base station.
Priority Applications (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610196665.3A CN105898679B (en) | 2016-03-31 | 2016-03-31 | It is a kind of based on the heterogeneous sensor method of data capture for representing node more and being merged with multilayer |
| PCT/CN2016/090088 WO2017166539A1 (en) | 2016-03-31 | 2016-07-15 | Heterogeneous sensing data collection method based on multiple representative nodes and multilevel fusion |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610196665.3A CN105898679B (en) | 2016-03-31 | 2016-03-31 | It is a kind of based on the heterogeneous sensor method of data capture for representing node more and being merged with multilayer |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN105898679A CN105898679A (en) | 2016-08-24 |
| CN105898679B true CN105898679B (en) | 2019-09-20 |
Family
ID=57011727
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201610196665.3A Expired - Fee Related CN105898679B (en) | 2016-03-31 | 2016-03-31 | It is a kind of based on the heterogeneous sensor method of data capture for representing node more and being merged with multilayer |
Country Status (2)
| Country | Link |
|---|---|
| CN (1) | CN105898679B (en) |
| WO (1) | WO2017166539A1 (en) |
Families Citing this family (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107733875A (en) * | 2017-09-21 | 2018-02-23 | 深圳市盛路物联通讯技术有限公司 | A kind of data transmission method and system |
| CN110557185B (en) * | 2018-05-31 | 2022-08-19 | 成都鼎桥通信技术有限公司 | Method and device for determining operation mode of relay equipment |
| CN111800284B (en) * | 2019-04-08 | 2023-06-20 | 阿里巴巴集团控股有限公司 | Edge cloud node set selection method and device and electronic equipment |
| CN111417084B (en) * | 2020-03-26 | 2022-07-12 | 仲恺农业工程学院 | Method, system, medium and device for allocating agricultural condition acquisition tasks |
| CN114554566A (en) * | 2022-01-27 | 2022-05-27 | 哈尔滨海能达科技有限公司 | Routing method and device of wireless link, electronic equipment and storage medium |
| CN115714770B (en) * | 2022-09-23 | 2024-04-12 | 中南大学 | Cloud-edge collaborative data service network equalization calculation method |
| CN115695289B (en) * | 2023-01-03 | 2023-03-17 | 顺霆科技(无锡)有限公司 | Heterogeneous multi-hop expansion network |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101415011A (en) * | 2008-10-31 | 2009-04-22 | 北京工业大学 | Safety effective data polymerization method for wireless sensor network |
| CN101877827A (en) * | 2010-05-18 | 2010-11-03 | 浙江工业大学 | Building monitoring oriented wireless sensor network data acquisition method |
| CN101917750A (en) * | 2010-07-30 | 2010-12-15 | 南京工业大学 | Least effort delivering zone-spanned virtual cluster multi-hop routing method |
| CN102802175A (en) * | 2012-02-24 | 2012-11-28 | 东北电力大学 | Energy-consumption-based routing optimization algorithm for wireless sensor network |
| CN104411000A (en) * | 2014-12-15 | 2015-03-11 | 南昌航空大学 | Method for selecting cluster head of hierarchical routing protocol in wireless sensor network |
Family Cites Families (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| KR100943178B1 (en) * | 2007-12-17 | 2010-02-19 | 한국전자통신연구원 | Method for routing and allocating resources in wireless sensor network |
| CN201426183Y (en) * | 2009-05-22 | 2010-03-17 | 广东工业大学 | Cluster-based wireless sensor network routing system |
-
2016
- 2016-03-31 CN CN201610196665.3A patent/CN105898679B/en not_active Expired - Fee Related
- 2016-07-15 WO PCT/CN2016/090088 patent/WO2017166539A1/en active Application Filing
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101415011A (en) * | 2008-10-31 | 2009-04-22 | 北京工业大学 | Safety effective data polymerization method for wireless sensor network |
| CN101877827A (en) * | 2010-05-18 | 2010-11-03 | 浙江工业大学 | Building monitoring oriented wireless sensor network data acquisition method |
| CN101917750A (en) * | 2010-07-30 | 2010-12-15 | 南京工业大学 | Least effort delivering zone-spanned virtual cluster multi-hop routing method |
| CN102802175A (en) * | 2012-02-24 | 2012-11-28 | 东北电力大学 | Energy-consumption-based routing optimization algorithm for wireless sensor network |
| CN104411000A (en) * | 2014-12-15 | 2015-03-11 | 南昌航空大学 | Method for selecting cluster head of hierarchical routing protocol in wireless sensor network |
Non-Patent Citations (2)
| Title |
|---|
| 基于分簇路由的无线传感器网络数据融合算法研究;王康;《中国优秀硕士学位论文全文数据库-信息科技辑》;20150215;第27页、第30页以及图3-2和图3-5 * |
| 无线传感器网络定向扩散路由协议研究;万健，吴健荣，徐向华;《计算机工程与科学》;20090615;第31卷(第6期);第100-101页、图2和图4 * |
Also Published As
| Publication number | Publication date |
|---|---|
| WO2017166539A1 (en) | 2017-10-05 |
| CN105898679A (en) | 2016-08-24 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN105898679B (en) | It is a kind of based on the heterogeneous sensor method of data capture for representing node more and being merged with multilayer | |
| Bhushan et al. | E^ 2 SR^ 2 E 2 SR 2: An acknowledgement-based mobile sink routing protocol with rechargeable sensors for wireless sensor networks | |
| US8892704B2 (en) | Dynamic rule-based distributed network operation for wireless sensor networks | |
| CN1794732B (en) | Implementing method of IPv6 micro sensing routing appliance protocol stack system structure | |
| CN102148756B (en) | IPv6 over low power wireless personal area network (6LoWPAN) neighbor discovery-based tree routing method | |
| Tao et al. | Flow-balanced routing for multi-hop clustered wireless sensor networks | |
| CN102695237B (en) | Routing method for supporting random moving mobile sensing network | |
| CN108696903A (en) | A kind of LEACH algorithm optimization methods based on energy consumption balance | |
| CN103220747A (en) | Route designing method of cognitive radio mesh network | |
| CN108924786B (en) | Wireless sensor network data acquisition method facing environmental emergency | |
| CN104349418B (en) | Data through street is by transmission method towards in the wireless sensor network of accident | |
| CN109639588B (en) | Network congestion control routing method for aviation cluster | |
| CN103458487A (en) | Method for network code sensing cross-layer energy-saving routing in wireless sensor network | |
| Pavai et al. | Study of routing protocols in wireless sensor networks | |
| CN108366093A (en) | One kind being based on the distributed wireless ad hoc network of " virtual center " and " mobile agent " | |
| CN104411000A (en) | Method for selecting cluster head of hierarchical routing protocol in wireless sensor network | |
| CN104284386A (en) | Vertex-betweenness-based cluster head selection method in wireless sensor networks | |
| CN104869604A (en) | RPL-based layer type route establishment method of wireless sensor network | |
| CN108494688B (en) | A kind of Future Data network implementation approach of low-cost | |
| CN110198526A (en) | A kind of combustor fault diagnosis system based on Internet of Things | |
| CN108462983A (en) | Based on the Communication of Muti-robot System network-building method for improving ant colony AODV agreements | |
| Mehra et al. | Energy efficient self organising load balanced clustering scheme for heterogeneous WSN | |
| CN106161118A (en) | In a kind of wireless sense network, the k of balancing energy jumps cluster routing method | |
| Kushwaha et al. | M-EALBM: A modified approach energy aware load balancing multipath routing protocol in MANET | |
| WO2022121234A1 (en) | Data transmission method and device, storage medium and electronic device |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| CF01 | Termination of patent right due to non-payment of annual fee | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20190920 |