CN107040973A - A kind of collecting method based on wireless sensor network - Google Patents
A kind of collecting method based on wireless sensor network Download PDFInfo
- Publication number
- CN107040973A CN107040973A CN201710345923.4A CN201710345923A CN107040973A CN 107040973 A CN107040973 A CN 107040973A CN 201710345923 A CN201710345923 A CN 201710345923A CN 107040973 A CN107040973 A CN 107040973A
- Authority
- CN
- China
- Prior art keywords
- node
- message
- data
- broadcast
- transfer capability
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
- 238000000034 method Methods 0.000 title claims abstract description 81
- 238000012546 transfer Methods 0.000 claims abstract description 80
- 230000008447 perception Effects 0.000 claims description 129
- 238000012790 confirmation Methods 0.000 claims description 16
- 238000010276 construction Methods 0.000 claims description 12
- 230000005059 dormancy Effects 0.000 claims description 9
- 238000012544 monitoring process Methods 0.000 claims description 5
- 230000005540 biological transmission Effects 0.000 abstract description 11
- 241000854291 Dianthus carthusianorum Species 0.000 description 4
- 230000008569 process Effects 0.000 description 4
- 238000013481 data capture Methods 0.000 description 3
- 238000013480 data collection Methods 0.000 description 3
- 238000005265 energy consumption Methods 0.000 description 3
- 238000005516 engineering process Methods 0.000 description 3
- 238000012545 processing Methods 0.000 description 3
- 230000008859 change Effects 0.000 description 2
- 238000010586 diagram Methods 0.000 description 2
- 238000011160 research Methods 0.000 description 2
- 230000000284 resting effect Effects 0.000 description 2
- 230000002776 aggregation Effects 0.000 description 1
- 238000004220 aggregation Methods 0.000 description 1
- 230000006399 behavior Effects 0.000 description 1
- 230000008901 benefit Effects 0.000 description 1
- 238000004364 calculation method Methods 0.000 description 1
- 238000004891 communication Methods 0.000 description 1
- 239000000470 constituent Substances 0.000 description 1
- 238000013500 data storage Methods 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 239000003814 drug Substances 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 230000007613 environmental effect Effects 0.000 description 1
- 239000002689 soil Substances 0.000 description 1
- 239000007858 starting material Substances 0.000 description 1
- 230000003068 static effect Effects 0.000 description 1
- 230000009466 transformation Effects 0.000 description 1
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
- H04W40/22—Communication route or path selection, e.g. power-based or shortest path routing using selective relaying for reaching a BTS [Base Transceiver Station] or an access point
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W24/00—Supervisory, monitoring or testing arrangements
- H04W24/02—Arrangements for optimising operational condition
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W4/00—Services specially adapted for wireless communication networks; Facilities therefor
- H04W4/06—Selective distribution of broadcast services, e.g. multimedia broadcast multicast service [MBMS]; Services to user groups; One-way selective calling services
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
- H04W40/04—Communication route or path selection, e.g. power-based or shortest path routing based on wireless node resources
- H04W40/10—Communication route or path selection, e.g. power-based or shortest path routing based on wireless node resources based on available power or energy
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
- H04W40/12—Communication route or path selection, e.g. power-based or shortest path routing based on transmission quality or channel quality
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W84/00—Network topologies
- H04W84/18—Self-organising networks, e.g. ad-hoc networks or sensor networks
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D30/00—Reducing energy consumption in communication networks
- Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Multimedia (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
This disclosure relates to a kind of collecting method based on wireless sensor network, methods described considers a sensor node with receiving the distance and self rest energy of base station, and consider the number and transfer capability value of the candidate relay node of the node, and the transfer capability value of the node in data acquisition on the subsequent transmission path of this node, these factors are subjected to COMPREHENSIVE CALCULATING, it is used as the transfer capability value of the node, so as to accurately measure the node as the ability of both candidate nodes, and then this method can be consumed with efficient balance network energy, improve network lifetime.Methods described also contemplates influence of the quality of wireless channel to data acceptance rate, and next-hop via node is dynamically determined according to quality of wireless channel in node for data forwarding, is effectively reduced data retransmission times to improve data delivery rate and extend network lifetime.
Description
Technical field
This disclosure relates to which Data Collection and wireless sensor network field, are based particularly on the field of wireless sensor network
Perception data is efficient, automatic acquiring method.
Background technology
At present, with the deep development of the communication technology and computer technology, wireless sensor network (Wireless
Sensor Network, WSN) obtain rapid popularization and application.WSN is a kind of wireless network, including a large amount of static or mobile biographies
Sensor node (Sensor), the data that will be perceived and gather, is transferred to aggregation node (Sink in the way of self-organizing and multi-hop
) or base station (Base Station, BS) node.The sensor node disposed in WSN has numerous purposes, such as it is detectable including
The peripheries such as earthquake, electromagnetism, temperature, humidity, noise, luminous intensity, pressure, soil constituent, the size of mobile object, speed and direction
Diversified phenomenon in environment, therefore, WSN are widely used in agricultural particularly Chinese medicine plantation, environmental monitoring, medical treatment and protected
The fields such as strong, military affairs.
On the other hand, the data acquisition and transmission under slightly environment are especially disliked in WSN data acquisition and transmission in field etc.
It is faced with stern challenge.First, the energy (i.e. battery electric quantity) of sensor node is often limited and does not typically possess charging energy
Power, it needs to consume certain energy when sending and receiving data, so that can be rapid when facing mass data transmission demand
Exhaust energy and fail, and then influence the life cycle of whole WSN networks.Secondly, a sensor node is past in broadcast data
Toward the quality of wireless channel changed constantly is faced, the next-hop node determined in advance may be caused can not to normally receive data, entered
And need to transmit data again, energy expenditure is further increased, data transmission delay is extended, whole wireless sensing is shortened
The life cycle of device network.Again, in the field environment, people periodically collect biography often through mobile or fixed base stations (BS)
The data that sensor node is gathered, the position of each base station (BS) deployment may be different, and this leads to not use what is calculated in advance
Data routing policy, and then need the data routing policy and method of dynamic self-adapting.Therefore, how in the wild data are adopted for research
The collecting method of efficient dynamic self-adapting is realized under collection environment, to reduce data retransmission times, balanced energy consumption, prolong
Long network lifetime, with important application value and wide application prospect.
From existing achievement in research, the method for data capture of current Wireless Sensor Networks typically uses base
Method in sub-clustering and the method based on energy consumption balance.It is remote that network node is pressed distance by the method for data capture based on sub-clustering first
Some regions are closely divided into, a node are chosen in each area as cluster head, cluster head is responsible for the data of one's respective area interior nodes
Collect and by the data forwarding being collected into other cluster heads, and be ultimately forwarded to BS.The division in region is very tired in this method
Difficult, and cluster head faces substantial amounts of data acquisition and transformation task, its transmission faced interference is huge, is easily caused data re-transmission time
The shortcomings of number increases, energy expenditure is serious.The existing method based on energy consumption balance often only considered present node and surrounding is adjacent
The dump energy of node is occupied, the more node of dump energy in neighbor node is typically chosen, without considering data acquisition
The energy expenditure of other nodes in transmission path passed through, easily makes collecting method be absorbed in local optimum and shortens net
Network life cycle.
The content of the invention
In view of the above-mentioned problems, the disclosure provide firstly the collecting method based on wireless sensor network, the side
Quality of wireless channel, balancing energy are taken into full account in method data acquisition in the wild, the high efficient data capture of dynamic self-adapting is realized.
Methods described comprises the steps：
S1, the message received in channel；If the message is the first data request information of base station broadcast, step is performed
S3；If the message is the second data request information, step S2 is performed；If the message is perception data message, step is performed
S4；
Second data request information includes the forwarding of first data request information, present node and present node
Ability value；
S2, the second data request information set is set up, judge the second data in the second data request information set
Whether request message is effective, and the node in all effective second data request informations is added to the candidate relay on node
In node listing, step S3 is performed；
Node in the candidate relay list sorts according to the transfer capability value of node；
S3, judge whether present node has the perception data asked of data request information；If without what is asked
Perception data, performs step S6；Otherwise, step S7 is performed；
S4, judge present node whether in the candidate relay node list of the perception data message；If present node
In the candidate relay node list of the perception data message, step S5 is performed；
Whether S5, the candidate relay node list for judging present node are empty；If non-NULL, step S7 is performed；
S6, the second data request information for constructing and broadcasting present node；
S7, construction perception data message are simultaneously broadcasted；
The candidate relay node on perception data and present node that the perception data message is asked including base station
List.
For the above method, wherein, the step S7 also comprises the steps while perception data message is broadcasted：
S701, construction perception data message node on, set and start the corresponding broadcast of the perception data message
Timer；
S702, the confirmation message for monitoring perception data message；If listening to the confirmation message of perception data message, step is performed
Rapid S703；Otherwise, step S704 is performed；
S703, the stopping broadcast timer timing；
S704, judge whether the broadcast timer timing terminates；If the broadcast timer timing terminates；Perform step
S705；
S705, re-broadcast the perception data message and restart the broadcast timer；Return to step S702.
For the above method, wherein, the judgement in the step S2 comprises the steps：
The node for sending the second data request information is denoted as first node, the section of second data request information will be received
Point is denoted as Section Point；
If the distance between the Section Point and base station are more than the distance between the first node and base station, described
The second data request information that Section Point is received is considered as effective.
For the above method, wherein, the step S7 also comprises the steps before broadcast perception data message：
S711, the task timer started on present node；
S712, the task timer be in the termination time when, the candidate relay node list on present node is added
Enter into the perception data message of reception.
For the above method, wherein, the transfer capability value calculating method is as follows：
(I) node to calculating transfer capability value is the forwarding of the neighbor node, the then node of the node as base station
Ability value calculating formula is formula (1)；
(II) to calculate the node of transfer capability value not as turn of the neighbor node of the node of base station, the then node
It is formula (2) to send out ability value calculating formula；
In formula (1)：
E represents the dump energy of the node of transfer capability value to be calculated, and E represents the first of the node of transfer capability value to be calculated
Beginning gross energy；
D ' is after calculating the node of transfer capability value and being normalized as the distance between node of base station
Value, d ' ∈ [0,1.0]；
α represents the dump energy of the node of transfer capability value to be calculated weight shared in transfer capability value, α ∈ [0,
1.0]；
C represents transfer capability value, c ∈ [0,1.0]；
In formula (2)：
V represents the node of transfer capability value to be calculated；
evNode v dump energy is represented, E represents node v initial total energy；
d′vRepresent the distance between node v and base station be normalized after value；
α represents node v dump energy weight shared in transfer capability value, α ∈ [0,1.0]；
β represents the distance of node v and base station weight shared in transfer capability value, β ∈ [0,1.0]；
γ represents the discount factor of node v neighbor node transfer capability, γ ∈ [0,1.0]；
viRepresent the broadcast node corresponding to i-th of effective second data request information；
Represent the transfer capability value of the broadcast node corresponding to i-th of effective second data request information；
cvRepresent node v transfer capability value, cv∈ [0,1.0].
For the above method, wherein, the perception data message corresponding broadcast timer on sending node is set
Time span is more than its time span that corresponding task timer is set on a receiving node；
And the time span of the broadcast timer that is set on node of the perception data message or task timer with should
The transfer capability of node is related, and transfer capability is stronger, broadcast timer or the time span of task timer that the node is set
It is shorter.
For the above method, wherein, methods described also comprises the steps：
S0, when node be base station when, broadcast the first data request information.
For the above method, wherein, after step S0, also comprise the steps：
S0 ', the reception time that perception data message is set, disappear if not receiving the perception data within the reception time
Breath, then broadcast data stopping gathers message；
The data, which stop collection message, includes the dormancy time length for node.
For the above method, wherein, the message in the step S1 also includes the data and stops collection message；
When the message of reception stops gathering message for the data, then following step is performed：
S12, the broadcast data stop collection message, and the dormancy time then stopped by the data in collection message is long
Degree carries out dormancy.
The inventive method has compared with prior art to be had the advantage that：
1) the inventive method considers a sensor node and receives the distance and self rest energy of base station, and examines
Considered the number and transfer capability value of the candidate relay node of the node, and in data acquisition this node subsequent transmission
These factors are carried out COMPREHENSIVE CALCULATING by the transfer capability value of the node on path, as the transfer capability value of the node, so as to
Accurately to measure the node as the ability of both candidate nodes, and then this method can be consumed with efficient balance network energy, carried
High network lifetime.
2) the inventive method considers influence of the quality of wireless channel to data acceptance rate, in node for data forwarding according to
Quality of wireless channel is dynamically determined next-hop via node, is effectively reduced data retransmission times, so as to improve data delivery rate
And extend network lifetime.
Secondly, for the above method, the present invention proposes a kind of node of wireless sensor network, is specially：The section
Point carries out message broadcast or message sink using the above method.
Compared with prior art, the node in the invalid sensor network consider itself distance with base station, from
Accurate transfer capability value has been obtained on the basis of body dump energy, the candidate relay node number itself having, therefore can
With the energy expenditure of invalid sensor network of the efficient balance where it, network lifetime is improved.Node considers wireless channel
Influence of the quality to data acceptance rate, carrys out the dynamic via node for determining next-hop by using timer, efficiently reduces
Data retransmission times, so as to improve data delivery rate and extend network lifetime.
Brief description of the drawings
The method flow diagram of data acquisition is carried out in Fig. 1 embodiment of the present invention based on Sensor Network；
The wireless sensor network structural representation of field data collection in Fig. 2 embodiment of the present invention.
Embodiment
The present invention is directed to wireless sensor network interior joint finite energy, can be rapid when facing mass data transmission demand
Exhaust energy and fail, and then influence the life cycle of whole WSN networks, it is proposed that be suitable for use with the wireless sensing of field deployment
The method that device network carries out data acquisition.Methods described includes following key steps：
S1, the message received in channel；If the message is the first data request information, step S3 is performed；If described disappear
Cease for the second data request information, execution step S2；If the message is perception data message, step S4 is performed；
Second data request information includes the forwarding of first data request information, present node and present node
Ability value；
S2, the second data request information set is set up, judge the second data in the second data request information set
Whether request message is effective, and the node in all effective second data request informations is added to the candidate relay on node
In node listing, step S3 is performed；
Node in the candidate relay list sorts according to the transfer capability value of node；
S3, judge whether present node has the perception data asked of data request information；If without what is asked
Perception data, performs step S6；Otherwise, step S7 is performed；
S4, judge present node whether in the candidate relay node list of the perception data message；If present node
In the candidate relay node list of the perception data message, step S5 is performed；
Whether S5, the candidate relay node list for judging present node are empty；If non-NULL, step S7 is performed；
S6, the second data request information for constructing and broadcasting present node；
S7, construction perception data message are simultaneously broadcasted；
The candidate relay node on perception data and present node that the perception data message is asked including base station
List.
In this embodiment, methods described is described in data acquisition in the wild, and a node receives one and disappeared
Associative operation during breath.The node being related in methods described can be the sensor node for carrying out perception data collection, can also
It is base station.
In the process, if present node is base station, methods described also includes：Broadcast the first request message.It is preferred that
, the reception time of perception data message is set on base station, disappeared if not receiving the perception data within the reception time
Breath, then broadcast data stopping gathers message；The data, which stop collection message, includes the dormancy time length for node.
And for not being the node of base station, stop gathering message for the data when the message received, then perform following step：
S12, the broadcast data stop collection message, and then stopping the dormancy time length in collection message by data enters
Row dormancy.
Any one of foregoing or embodiments below method, wherein, second data request information includes node and base
The distance between stand.The distance is used for the transfer capability value of calculate node, may also be used for judging that a node receives the
Whether two data request informations are effective.Whether the second data request information received for judgement is effective, can use other sides
Method judges.
When carrying out judging whether the second data request information that a node is received is effective using distance, specifically, institute
Judgement is stated to comprise the steps：
The node for sending the second data request information is denoted as first node, the section of second data request information will be received
Point is denoted as Section Point；
If the distance between the Section Point and base station are more than the distance between the first node and base station, described
The second data request information that Section Point is received is considered as effective.
Node in candidate relay list can have the methods of a variety of determination priority, such as simple distance, residual energy
Amount, neighbor node number etc., provide a kind of preferred method here, and the node in the candidate relay list forwards energy according to it
Force value determines priority.
Any one of foregoing or embodiments below method, wherein, the transfer capability value calculating method is as follows：
(I) node to calculating transfer capability value is the forwarding of the neighbor node, the then node of the node as base station
Ability value calculating formula is formula (1)；
(II) to calculate the node of transfer capability value not as turn of the neighbor node of the node of base station, the then node
It is formula (2) to send out ability value calculating formula；
In formula (1)：
E represents the dump energy of the node of transfer capability value to be calculated, and E represents the first of the node of transfer capability value to be calculated
Beginning gross energy；
D ' is after calculating the node of transfer capability value and being normalized as the distance between node of base station
Value, d ' ∈ [0,1.0]；
α represents the dump energy of the node of transfer capability value to be calculated weight shared in transfer capability value, α ∈ [0,
1.0]；
C represents transfer capability value, c ∈ [0,1.0]；
In formula (2)：
V represents the node of transfer capability value to be calculated；
evNode v dump energy is represented, E represents node v initial total energy；
d′vRepresent the distance between node v and base station be normalized after value；
α represents node v dump energy weight shared in transfer capability value, α ∈ [0,1.0]；
β represents the distance of node v and base station weight shared in transfer capability value, β ∈ [0,1.0]；
γ represents the discount factor of node v neighbor node transfer capability, γ ∈ [0,1.0]；
viRepresent the broadcast node corresponding to i-th of effective second data request information；
Represent the transfer capability value of the broadcast node corresponding to i-th of effective second data request information；
CvRepresent node v transfer capability value, cv∈ [0,1.0].
It is preferred that, using present node with being recorded as the distance between node of base station in the second data request information,
To facilitate calculating.
Candidate relay list is determined using transfer capability value so that the inventive method is adopted without calculating optimal data in advance
Collect path.In the calculating process of transfer capability value, it is contemplated that node and the distance and self rest energy for receiving base station, and
Consider the number of the candidate relay node of the node, the transfer capability value of each candidate relay node, and data acquisition
These factors have been carried out COMPREHENSIVE CALCULATING by the transfer capability value of the node in journey on the subsequent transmission path of this node, thus can
Accurately to measure the node as the ability of candidate relay node.Calculation procedure, transmitted data amount needed for whole calculating process
It is all smaller with data storage amount, it is more suitably applied to resource-constrained sensor device.
It is preferred that, the transfer capability value of present node is recorded in the second data request information, waited with facilitating in construction
Choose when node listing, candidate relay node is sorted.
Any one of foregoing or embodiments below method, further controls to re-broadcast by setting broadcast timer
The time of perception data message, the step S7 also comprises the steps while perception data message is broadcasted：
S701, construction perception data message node on, set and start the corresponding broadcast of the perception data message
Timer；
S702, the confirmation message for monitoring perception data message；If listening to the confirmation message of perception data message, step is performed
Rapid S703；Otherwise, step S704 is performed；
S703, the stopping broadcast timer timing；
S704, judge whether the broadcast timer timing terminates；If the broadcast timer timing terminates；Perform step
S705；
S705, re-broadcast the perception data message and restart the broadcast timer；Return to step S702.
Any one of foregoing or embodiments below method, further by setting task timer to be received come control node
Perception data message sends the time, is the high node of current priority to ensure to forward the node of perception data message, i.e., described
Step S7 also comprises the steps before broadcast perception data message：
S711, the task timer started on present node；
S712, the task timer be in the termination time when, the candidate relay node list on present node is added
Enter into the perception data message of reception.
A kind of another aspect of the present disclosure, for any one of foregoing embodiments method, it is proposed that wireless sensor network
The node of network, the node broadcasts the message and received message using the above method.
Fig. 1 provides a kind of complete collecting method, and it includes aforementioned method steps.For the foregoing behaviour not provided
Make, if the invalid processing of the second data request information than receiving, disappears to abandon the second invalid request of data in Fig. 1
Breath, or do not handle.The operation not provided in the preceding method provided in these Fig. 1, can have other modes to handle, not
It is that must so be handled according to Fig. 1.
In one embodiment there is provided a kind of node, the node mainly using the method broadcast message shown in Fig. 1 and
Receive message.The node includes base station.According to Fig. 1, same node receives different messages, with different operations.By method
During applied to node, it is possible to distinguish the type of node, such as base station, the neighbor node of base station, be not base station neighbor node, no
The node of same type receives the message in its limit of power, then performs corresponding operation.But, dispose for convenience, and
During field work, do not cause data not gather because going wrong the node of some type, can preferably make each node
Ability with processing different messages.
The operation that different types of node may have, the major part in the operation are illustrated below according to node type
Embody in Fig. 1, for clarity, also including unexpressed content in Fig. 1.
1st, base station
(1.1) data request information of base station broadcast first.
(1.2) if the base station does not receive asked data in setting time, base station broadcast stops to the data
The message of collection.
(1.3) if the base station receives asked data, base station broadcast receives the confirmation message of requested data.
2nd, the neighbor node of base station
(2.1) if node receives the first data request information of base station broadcast, if the node is without the data asked,
Transfer capability value is then calculated, and constructs and broadcasts the second data request information；Wherein, second data request information includes institute
State the first data request information, present node mark, the distance of present node and base station, and present node transfer capability
Value.If the data that the node has been asked, construction is included to the perception data message of the data, base station is issued, base station is received
To after the perception data message, data are taken out, broadcast receives the confirmation message of requested data.
(2.2) if node receives perception data message, if it is not in the candidate relay node list of the perception data message
In, or the stored perception data message crossed perception data, then do not handle or abandon reception.If it is in the perception data
In the candidate relay node list of message, and the perception data in the perception data message is not stored, then store the perception
Data.Start task timer, when task timer is in the termination time, construction includes the perception data message of perception data
And broadcast.Start broadcast timer simultaneously, the confirmation message of the perception data message of the node broadcasts is monitored, if in snoop procedure
In, the broadcast timer timing terminates, then re-broadcasts the perception data message and restart the broadcast timer；Until
Listen to the confirmation message of the perception data message.Due to being the neighbor node of base station, its perception data message broadcasted
Receive object be base station, therefore can also arrange its broadcast perception data message there was only perception data.But in order to it is other not
Be the neighbor node of base station perception data form of message it is unified, the perception data message package containing the perception data asked and
Empty candidate relay node list.In this case, needed not distinguish between during node deployment whether be base station neighbor node.
(2.3) if node, which is received, stops collection message to the data, the message is broadcasted, into resting state.If node
Now there is the perception data message of the data, before resting state is entered, first stop and delete perception data message correspondence
Timer, then abandon the perception data message.
3rd, it is not the neighbor node of base station
(3.1) if node receives the second data request information, first, it is determined that whether second data request information receives
Cross.If receiving, abandon.If confiscating, judge whether second data request information is effective.If invalid, lose
Abandon；If effectively, setting up the second data request information set, judge that the second data in the second data request information set please
Ask message whether effective, and the node in all effective second data request informations is added to the candidate relay section on node
In point list.Secondly, judge the data itself whether asked, if not having, calculate the transfer capability value of itself, construction is certainly
Second data request information of body is simultaneously broadcasted.If the data asked, construct perception data message and broadcast.In broadcast
Meanwhile, the corresponding broadcast timer of the packet on starter node, the confirmation for monitoring the perception data message of the node broadcasts disappears
Breath, if in snoop procedure, the broadcast timer timing terminates, then re-broadcasts the perception data message and restart described
Broadcast timer；Until listening to the confirmation message of the perception data message.
(3.2) if node receives perception data message, corresponding operating is with (2.2).
(3.3) if node, which is received, stops collection message to the data, corresponding operating is with (2.3).
If node receive repetition the first data request information or repeat the second data request information or oneself
Second data request information of broadcast, then abandon these data request informations.
For any one of foregoing embodiments method, the present invention proposes a kind of wireless sensor network, the network
Including node, the node carries out message broadcast using the above method.
In example below disclosed method is illustrated with reference to accompanying drawing 1-2.
The value for the general parameter being related in this embodiment is as follows：α=0.4, β=0.2, γ=0.3, E=500.
In accordance with following principles during timer setting time span：
(I) the perception data message time span that corresponding broadcast timer is set on sending node be more than its
The time span that corresponding task timer is set on receiving node；
(II) and the broadcast timer that is set on node of the perception data message or task timer time span
Related to the transfer capability of the node, transfer capability is stronger, broadcast timer or the time of task timer that the node is set
Length is shorter.
In this embodiment：
If present node receives perception data message, on this node, the corresponding task timer of perception data message
Time span is set according to following formula：
(k-1)×τ (3)
In formula (3)：K is position of the present node in candidate relay node list, and k is the natural number more than or equal to 1；τ
For positive integer.
If present node sends perception data message, on this node, the corresponding broadcast timer of perception data message
Time span is set according to following formula：
(l-1)×τ+τ′ (4)
In formula (4)：τ is positive integer, and τ ' is less than τ positive integer, and l is present node in the position of candidate relay node list
Put.
By formula (3) if can be seen that present node in first position of candidate node list, i.e. k is 1, then should
The candidate relay node list of own node and the data asked are constituted perception data message by node, and broadcast the perception number
According to message, the broadcast timer corresponding to the perception data message is set.
In this embodiment, τ value 20 is set, τ ' value is 5.
According to Fig. 1 activity diagram, the process of the wireless sensor network gathered data in Fig. 2 is as follows：
The data request information of base station BS broadcast first, r is set to by first data request information.Due to distance factor, only
There is node v12, v13, v14And v15The first data request information r is have received, these nodes calculate itself section according to formula (1) respectively
The transfer capability value of point, the transfer capability value of these carryings is denoted as accordinglyWith
By node v12Dump energy be denoted asThis duration is 450, by node v12Normalizing is carried out with the distance of base station
Value after change processing is 0.05, i.e.,：Calculate node v12Transfer capability valueIt is as follows：
Similarly, can be with calculate node v13, v14And v15Transfer capability valueWithAssuming that calculating knot
It is respectively really
Node v12Construct the second data request informationAnd the second data of broadcast please
Seek messageSimilarly, node v13, v14And v15The second each new data request information is constructed respectivelyAnd the second data request information is broadcasted respectively
If node v12, v13, v14And v15The first data request information r is received again, then is abandoned, to avoid asking data
Ask the multiplicating of message to forward, it is to avoid network data broadcast storm, energy expenditure is also saved to a certain extent, so that
Be conducive to extending network lifetime.
Node v11Receive surrounding neighbours node v12And v15Second data request information of broadcast, by node v11Itself and base
The distance between stand and node v12It is compared with the distance between base station, decision node v12Second request of data of broadcast disappears
BreathEffectively；Similarly, decision node v15Second data request information of broadcastEffectively.
Node v11Effective second data request information is obtained respectivelyIn node v12、v15, according to node
v12、v15Transfer capability valueIt is ranked up construction candidate relay node list.In the present embodiment according to turn
Send out ability value order from big to small, and by node v11On candidate relay node list be denoted as It can also sort from small to large.
Node v11The transfer capability value of this node is calculated according to formula (2)If now node v11Dump energy
e11Value be 370, the distance between it is with base station be normalized after valueFor 0.1, then node v11Transfer capability valueIt is calculated as follows：
Node V11Construct and broadcast the second data request information
The node of other the second data request informations for receiving neighbor node broadcast, if it enters without the data asked
Row identical is operated, until final all nodes all calculate the transfer capability value of oneself, and surrounding neighbours node is determined
It is used as the dominance relation (having constructed candidate relay node list) of candidate relay node.
In this embodiment, node v7There are the data that base station is asked, the data are denoted as d7.As node v7Receive
After two data request informations, candidate relay node list is constructedIn this embodiment, candidate relay node listSpeciallyNode v7Perception data message is constructed, the perception data is disappeared
Breath is denoted as p7, the candidate relay node list being constructedIt is added to perception data message p7In, p7=((v12, v11, v10,
v8), d7)。
Node v7The constructed perception data message p of broadcast7, perception data message p7Middle candidate relay node list length
For 4, calculated according to formula (4) and start perception data message p7The value of corresponding broadcast timer is (4-1) × 20+5=
65。
As perception data message p7When corresponding broadcast timer is reduced to 0, then perception data message p is re-broadcast7,
And restart broadcast timer.
Because of the influence such as quality of wireless channel and stability, it is assumed that node v7Neighbor node in only node v3, v5, v11With
v84 nodes have received node v altogether7The perception data message p of broadcast7.Due to node v11And v8Judge the perception data message
For receive first and its packet candidate node listIn, therefore node v11And v8Respectively according to it in both candidate nodes
ListIn natural number position 2 and 4, set respectively the corresponding task timer of perception data message value be 20 Hes
60, and start timing.Due to node v3, v5Judge own node not in the perception data message p newly received7Listed time
Select node listingIn, therefore node V3, v5Abandon perception data message p7。
Node v11Middle perception data message p7Corresponding timer is reduced to 0 first, now, node v11It is preferred that first constructing simultaneously
Broadcast is directed to perception data message p7Confirmation message, reconstruct perception data message p11.Then by the candidate of own node
After node listing It is added to packet p11In, i.e. p11=((v15, v12), d7), broadcast sense
Primary data message p11, perception data message p is set11Corresponding broadcast timer, and start timing.
Node v7Receive to perception data message p7Confirmation message, stop and delete for perception data message p7It is wide
Timer is broadcast, while abandoning perception data message p7.In this embodiment, node v11Receive node v12Broadcast on perceive
Data-message p11Confirmation message when, stop and delete for perception data message p11Broadcast timer, while abandon perceive
Data-message p11.As perception data message p11In node v12When upper corresponding task timer is 0, construction includes data d7's
Perception data message p12And broadcast, while starting the corresponding broadcast timer of perception data message, base station receives the perception
Data-message p12, from perception data message p12Middle taking-up data, and broadcast to perception data message p12Confirmation message.Section
Point v12Stop and delete for perception data message p12Broadcast timer, while abandoning perception data message p12。
In this way, wireless sensor network can quickly remove the packet without forwarding, so as to reduce data
The number of transmissions, reduces energy expenditure, increases network lifetime.
The disclosure is described in detail above, used herein specific case principle of this disclosure and embodiment party
Formula is set forth, and the explanation of above example is only intended to help and understands disclosed method and its core concept；Meanwhile, it is right
In those skilled in the art, according to the thought of the disclosure, it will change in specific embodiments and applications, it is comprehensive
Upper described, this specification content should not be construed as limitation of this disclosure.
Claims (10)
1. a kind of collecting method based on wireless sensor network, it is characterised in that methods described passes through wireless senser
Each node in network realizes message broadcast or message sink, and then the forwarding by message among the nodes in the steps below
Realize data acquisition；
The step includes：
S1, the message received in channel；
If the message is the first data request information of base station broadcast, step S3 is performed；
If the message is the second data request information, step S2 is performed；
If the message is perception data message, step S4 is performed；
Second data request information includes the transfer capability of first data request information, present node and present node
Value；
S2, the second data request information set is set up, judge the second request of data in the second data request information set
Whether message is effective, and the node in all effective second data request informations is added to the candidate relay node on node
In list, step S3 is performed；
Node in the candidate relay list sorts according to the transfer capability value of node；
S3, judge whether present node has the perception data asked of data request information；
If without the perception data asked, performing step S6；Otherwise, step S7 is performed；
S4, judge present node whether in the candidate relay node list of the perception data message；
If present node is in the candidate relay node list of the perception data message, step S5 is performed；
Whether S5, the candidate relay node list for judging present node are empty；
If non-NULL, step S7 is performed；
S6, the second data request information for constructing and broadcasting present node；
S7, construction perception data message are simultaneously broadcasted；
The candidate relay node list on perception data and present node that the perception data message is asked including base station.
2. according to the method described in claim 1, it is characterised in that preferred, the step S7 is in broadcast perception data message
While, also comprise the steps：
S701, construction perception data message node on, set and start the corresponding broadcast timing of the perception data message
Device；
S702, the confirmation message for monitoring perception data message；
If listening to the confirmation message of perception data message, step S703 is performed；Otherwise, step S704 is performed；
S703, the stopping broadcast timer timing；
S704, judge whether the broadcast timer timing terminates；
If the broadcast timer timing terminates；Perform step S705；
S705, re-broadcast the perception data message and restart the broadcast timer；Return to step S702.
3. according to the method described in claim 1, it is characterised in that the judgement in the step S2 comprises the steps：
The node for sending the second data request information is denoted as first node, the node for receiving second data request information is remembered
Make Section Point；
If the distance between the Section Point and base station are more than the distance between the first node and base station, described second
The second data request information that node is received is considered as effective.
4. method according to claim 2, it is characterised in that the step S7 is before broadcast perception data message, also
Comprise the steps：
S711, the task timer started on present node；
S712, the task timer be in the termination time when, the candidate relay node list on present node is added to
In the perception data message of reception.
5. according to the method described in claim 1, it is characterised in that the transfer capability value calculating method is as follows：
(I) node to calculating transfer capability value is the transfer capability of the neighbor node, the then node of the node as base station
Value calculating formula is formula (1)；
(II) to calculate the node of transfer capability value not as the forwarding energy of the neighbor node, the then node of the node of base station
Force value calculating formula is formula (2)；
In formula (1)：
E represents the dump energy of the node of transfer capability value to be calculated, and E represents the initial total of the node of transfer capability value to be calculated
Energy；
D ' is the value after calculating the node of transfer capability value and being normalized as the distance between node of base station,
D ' ∈ [0,1.0]；
α represents the dump energy of the node of transfer capability value to be calculated weight shared in transfer capability value, α ∈ [0,1.0]；
C represents transfer capability value, c ∈ [0,1.0]；
In formula (2)：
V represents the node of transfer capability value to be calculated；
evNode v dump energy is represented, E represents node v initial total energy；
d′vRepresent the distance between node v and base station be normalized after value；
α represents node v dump energy weight shared in transfer capability value, α ∈ [0,1.0]；
β represents the distance of node v and base station weight shared in transfer capability value, β ∈ [0,1.0]；
γ represents the discount factor of node v neighbor node transfer capability, γ ∈ [0,1.0]；
viRepresent the broadcast node corresponding to i-th of effective second data request information；
Represent the transfer capability value of the broadcast node corresponding to i-th of effective second data request information；
cvRepresent node v transfer capability value, cv∈ [0,1.0].
6. method according to claim 4, it is characterised in that：
The perception data message time span that corresponding broadcast timer is set on sending node is more than it and is receiving section
The time span that corresponding task timer is set on point；
And the time span of the broadcast timer that is set on node of the perception data message or task timer and the node
Transfer capability it is related, transfer capability is stronger, and the broadcast timer or the time span of task timer that the node is set are shorter.
7. according to the method described in claim 1, it is characterised in that methods described also comprises the steps：
S0, when node be base station when, broadcast the first data request information.
8. method according to claim 7, it is characterised in that after step S0, also comprise the steps：
S0 ', the reception time that perception data message is set, if not receiving the perception data message within the reception time,
Then broadcast data stops collection message；
The data, which stop collection message, includes the dormancy time length for node.
9. method according to claim 8, it is characterised in that：
Message in the step S1 also includes the data and stops collection message；
When the message of reception stops gathering message for the data, then following step is performed：
S12, the broadcast data stop collection message, and then stopping the dormancy time length in collection message by the data enters
Row dormancy.
10. a kind of node of wireless sensor network, it is characterised in that：
Any described method of the node right to use 1- power 9 carries out message broadcast or message sink.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710345923.4A CN107040973B (en) | 2017-05-18 | 2017-05-18 | A kind of collecting method based on wireless sensor network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710345923.4A CN107040973B (en) | 2017-05-18 | 2017-05-18 | A kind of collecting method based on wireless sensor network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN107040973A true CN107040973A (en) | 2017-08-11 |
| CN107040973B CN107040973B (en) | 2018-02-23 |
Family
ID=59537136
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201710345923.4A Expired - Fee Related CN107040973B (en) | 2017-05-18 | 2017-05-18 | A kind of collecting method based on wireless sensor network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN107040973B (en) |
Cited By (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109212139A (en) * | 2018-10-26 | 2019-01-15 | 深圳美特优科技有限公司 | Compartmentalization air pollution situation intelligent monitoring and controlling device |
| CN109275170A (en) * | 2018-08-20 | 2019-01-25 | 全球能源互联网研究院有限公司 | A kind of charging method and system of wireless chargeable sensing network |
| CN109406751A (en) * | 2018-09-26 | 2019-03-01 | 东莞青柳新材料有限公司 | Regional plantation object soil quality high-precision real-time monitoring system |
| CN111885507A (en) * | 2020-06-19 | 2020-11-03 | 国网湖南省电力有限公司供电服务中心（计量中心） | Sensing method of dual-medium converged communication network |
| CN112042229A (en) * | 2018-05-11 | 2020-12-04 | 华为技术有限公司 | Data packet transmission method and equipment |
| CN112087768A (en) * | 2020-09-17 | 2020-12-15 | 东北石油大学 | Low-energy-consumption routing method for oil and gas pipeline Internet of things |
| CN113743818A (en) * | 2021-09-14 | 2021-12-03 | 江苏普汇智能制造科技有限公司 | Enterprise energy management system based on industrial internet platform |
| CN115665031A (en) * | 2022-12-27 | 2023-01-31 | 中南大学 | Three-dimensional irregular edge network perception data acquisition method, system and device |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104038965A (en) * | 2014-06-10 | 2014-09-10 | 南京邮电大学 | Opportunistic routing method capable of efficiently utilizing energy, for mobile wireless sensor network |
| CN104284387A (en) * | 2014-09-19 | 2015-01-14 | 南京邮电大学 | Clustering routing method for mobile sensor network |
-
2017
- 2017-05-18 CN CN201710345923.4A patent/CN107040973B/en not_active Expired - Fee Related
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104038965A (en) * | 2014-06-10 | 2014-09-10 | 南京邮电大学 | Opportunistic routing method capable of efficiently utilizing energy, for mobile wireless sensor network |
| CN104284387A (en) * | 2014-09-19 | 2015-01-14 | 南京邮电大学 | Clustering routing method for mobile sensor network |
Non-Patent Citations (1)
| Title |
|---|
| LU,JUNLING等: "《Signal power random fading based interference-aware routing for wireless sensor networks》", 《SOFT COMPUTING》 * |
Cited By (12)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112042229A (en) * | 2018-05-11 | 2020-12-04 | 华为技术有限公司 | Data packet transmission method and equipment |
| CN112042229B (en) * | 2018-05-11 | 2022-09-23 | 华为技术有限公司 | Data packet transmission method and equipment |
| CN109275170A (en) * | 2018-08-20 | 2019-01-25 | 全球能源互联网研究院有限公司 | A kind of charging method and system of wireless chargeable sensing network |
| CN109406751A (en) * | 2018-09-26 | 2019-03-01 | 东莞青柳新材料有限公司 | Regional plantation object soil quality high-precision real-time monitoring system |
| CN109212139A (en) * | 2018-10-26 | 2019-01-15 | 深圳美特优科技有限公司 | Compartmentalization air pollution situation intelligent monitoring and controlling device |
| CN111885507A (en) * | 2020-06-19 | 2020-11-03 | 国网湖南省电力有限公司供电服务中心（计量中心） | Sensing method of dual-medium converged communication network |
| CN112087768A (en) * | 2020-09-17 | 2020-12-15 | 东北石油大学 | Low-energy-consumption routing method for oil and gas pipeline Internet of things |
| CN112087768B (en) * | 2020-09-17 | 2022-04-29 | 东北石油大学 | Low-energy-consumption routing method for oil and gas pipeline Internet of things |
| CN113743818A (en) * | 2021-09-14 | 2021-12-03 | 江苏普汇智能制造科技有限公司 | Enterprise energy management system based on industrial internet platform |
| CN113743818B (en) * | 2021-09-14 | 2024-01-02 | 江苏普汇智能制造科技有限公司 | Enterprise energy management system based on industrial Internet platform |
| CN115665031A (en) * | 2022-12-27 | 2023-01-31 | 中南大学 | Three-dimensional irregular edge network perception data acquisition method, system and device |
| CN115665031B (en) * | 2022-12-27 | 2023-04-07 | 中南大学 | Three-dimensional irregular edge network perception data acquisition method and device |
Also Published As
| Publication number | Publication date |
|---|---|
| CN107040973B (en) | 2018-02-23 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN107040973B (en) | A kind of collecting method based on wireless sensor network | |
| Singh et al. | A Data Delivery Framework for Cognitive Information-Centric Sensor Networks in Smart Outdoor Monitoring 1 | |
| Tang et al. | A chain-cluster based routing algorithm for wireless sensor networks | |
| CN102149160B (en) | Energy perception routing algorithm used for wireless sensing network | |
| Hawbani et al. | LORA: Load-balanced opportunistic routing for asynchronous duty-cycled WSN | |
| Misra et al. | Policy controlled self-configuration in unattended wireless sensor networks | |
| Vidhyapriya et al. | Energy aware routing for wireless sensor networks | |
| CN103281769A (en) | Energy consumption balancing method of isomerism wireless sensor network unequal clustering | |
| CN102438298B (en) | Trusted energy-saving data convergence method for wireless sensor network | |
| CN103347294A (en) | Wireless sensor system and data collecting method | |
| Al-Turjman | Optimized hexagon-based deployment for large-scale ubiquitous sensor networks | |
| Sumathi et al. | Evaluation of energy efficient reactive routing protocols in QoS enabled routing for MANETS | |
| Gajjar et al. | FUCP: Fuzzy based unequal clustering protocol for wireless sensor networks | |
| Chao et al. | Energy-efficient multichannel MAC protocol design for bursty data traffic in underwater sensor networks | |
| Galluccio et al. | A MAC/Routing cross-layer approach to geographic forwarding in wireless sensor networks | |
| Bashir et al. | Coordinator assisted passive discovery for mobile end devices in IEEE 802.15. 4 | |
| Ravindran et al. | Energy consumption in cluster communication using mcsbch approach in WSN | |
| Atero et al. | A low energy and adaptive architecture for efficient routing and robust mobility management in wireless sensor networks | |
| Pal et al. | A distributed power control and routing scheme for rechargeable sensor networks | |
| Cheng et al. | Contention‐based geographic forwarding in asynchronous duty‐cycled wireless sensor networks | |
| CN112867169A (en) | Self-networking communication method and system for heterogeneous network of comprehensive pipe gallery | |
| Liu et al. | A sensor deployment optimization model of the wireless sensor networks under retransmission | |
| Rashwand et al. | A novel asynchronous, energy efficient, low transmission delay MAC protocol for wireless sensor networks | |
| Singh | Spatial correlation based MAC protocol for WSN | |
| Miller et al. | Ad hoc routing for multilevel power save protocols |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| 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: 20180223 |