CN103188758B - A kind of power-economizing method of radio sensing network - Google Patents

A kind of power-economizing method of radio sensing network Download PDF

Info

Publication number
CN103188758B
CN103188758B CN201310097918.8A CN201310097918A CN103188758B CN 103188758 B CN103188758 B CN 103188758B CN 201310097918 A CN201310097918 A CN 201310097918A CN 103188758 B CN103188758 B CN 103188758B
Authority
CN
China
Prior art keywords
node
chain
data
base station
link
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
Application number
CN201310097918.8A
Other languages
Chinese (zh)
Other versions
CN103188758A (en
Inventor
于秦
李梓佳
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
University of Electronic Science and Technology of China
Original Assignee
University of Electronic Science and Technology of China
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by University of Electronic Science and Technology of China filed Critical University of Electronic Science and Technology of China
Priority to CN201310097918.8A priority Critical patent/CN103188758B/en
Publication of CN103188758A publication Critical patent/CN103188758A/en
Application granted granted Critical
Publication of CN103188758B publication Critical patent/CN103188758B/en
Expired - Fee Related legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
    • Y02D30/00—Reducing energy consumption in communication networks
    • Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks

Landscapes

  • Mobile Radio Communication Systems (AREA)

Abstract

The invention discloses a kind of power-economizing method of radio sensing network, based on the energy-saving routing protocol RPB of crop rotation and chain type, comprise the following steps: the first step: set up link by greedy algorithm; Second step: link establishment is complete, LEADER node is chosen: the 3rd step: each sensor node adjustment its own transmission power is to only have nearest-neighbors just can hear by specifying formula, then enter data transfer phase, data transfer phase uses token token mechanism.Present invention incorporates the advantage of chain type agreement and dormancy dispatching, and by minimum range enter chain and LEADER node selection strategy avoid formed long-chain and part of nodes dead time cause network node problem pockety, the basis not increasing algorithm complex decreases the consumption of node energy to greatest extent, extends the life cycle of wireless sensor network.

Description

A kind of power-economizing method of radio sensing network
Technical field
The invention belongs to mobile communication technology field, particularly a kind of power-economizing method of radio sensing network.
Background technology
Radio sensing network (wireless sensor networks, WSNs) be made up of the minute sense device node that random placement is a large amount of in monitored area, can perception in real time and gather surrounding enviroment numerous information, and communicate information to terminal by the mode such as MANET, data fusion.In radio sensing network, due to the finite energy that node itself carries, and the restriction of the condition such as microprocessor computing capability is limited, discomfort is fit to do complicated calculating.
Meanwhile, wireless sensor network also has following feature: the node being deployed in monitored area it is generally acknowledged motionless or fine motion, node can adjust through-put power according to communication distance, node can record other nodes or the base station distance to oneself by signal strength signal intensity instruction RSSI (Received Signal Strength Indication) that receives or other modes.
For wireless sensor node finite energy problem, in order to the life cycle of prolonging wireless sensor network, the These characteristics of combining wireless sensing network, researcher proposes the algorithm of a lot of energy efficient, according to whether layering can be summed up as plane and level two class.Wherein PEGASIS (Power-Efficient Gathering in Sensor Information System) chain type agreement is based upon the improved protocol on LEACH cluster algorithm basis, generate a strand be made up of all nodes by greedy algorithm, then serve as LEADER node (being namely responsible for data to mail to the node of base station after merging whole network data) in turn by the node in chain.This way can reduce the power consumption of node to the full extent.The algorithm that GAF (geographicaladaptive fidelity) agreement is is foundation with the geographical position of node, by surveyed area is divided into virtual cell, node in each cell can be thought of equal value, therefore in a period of time, a cell only needs the collection of a node implementation data, and other nodes in same cell can enter sleep to save energy.The deficiency that above-mentioned algorithm exists is mainly reflected in: the neighbours having added chain in PEGASIS can not be accessed again, and therefore between adjacent node, long-chain is inevitable, and the strategy of node elected LEADER node in turn can cause the node premature death away from base station.GAF then requires that node is equipped with the extras such as GPS to obtain node geo-location information, obviously can increase the manufacturing cost of wireless sensor node.
Summary of the invention
The object of the invention is the problems referred to above existed to solve existing energy-efficient routing chain type agreement innovatory algorithm, by improving the deficiency of chain type agreement, and dormancy crop rotation strategy is carried out to redundant node, reduce wireless sensor network interior joint energy consumption further, thus extend the life cycle of network.
Technical scheme of the present invention is: a kind of power-economizing method of radio sensing network: based on the energy-saving routing protocol RPB of crop rotation and chain type, comprise the steps:
The first step: set up link by greedy algorithm, the detailed process of the first step is as follows:
Step 1: base station broadcast hello message, each node replys rear base station respectively and each node obtains global information;
Step 2: with the mode link setup of greedy algorithm from distalmost end, namely finds from oneself nearest neighbor node not adding chain, and asks it to add in chain from distalmost end;
Step 3: the node i receiving chain request is found apart from minimum neighbor node j in the node adding chain, if these two euclidean distance between node pair are d ij; d thresholdone relevant with the perception radius r of junction sensor is worth;
If d ij≤ d threshold, then node i advised nodes j will take over its work in next round, and then node i arranges timer and enters dormancy, and response is to the node oneself transmitting into chain request;
If d ij> d threshold, then node i is by by adding in chain with the mode that j is directly connected, and response is to the node oneself transmitting into chain request;
Step 4: continue to find the nearest node not adding chain after the node transmitting into chain request to node i receives response message; When node energy is about to exhaust, leaves certain dump energy in order to ensure node and neighbours can be notified before next data transmitting period starts, if node least residue energy is E r=2 × E bS, wherein E bSfor LEADER node sends the energy that a secondary data consumes to base station, when node energy is less than or equal to E r, node no longer enters sleep, and notice is by the node k taken over job, if do not have dump energy to be greater than E around node k rnode take over its work in next round, then node k also no longer enters sleep, and each is taken turns and all participates in link establishment and transfer of data;
Second step: link establishment is complete, choose LEADER node by following formula:
Q i = w 1 × E i + w 2 × 1 d BS ( i )
Wherein, w 1and w 2for weighted value, freely can choose, meet w 1+ w 2=1; E ifor the dump energy of node i, d bS (i)for node i is to the distance of base station, the message that this node becomes LEADER, after the node calculating maximum Q value, is broadcasted to whole network in base station;
3rd step: each sensor node adjustment its own transmission power is to only have nearest-neighbors just can hear, then enter data transfer phase, data transfer phase uses token token mechanism.
Preferred version: the detailed process of the 3rd step comprises the steps:
Then data are passed toward LEADER node direction along Data-Link by step 5: first distalmost end node END obtains token;
Step 6: the node receiving data continues to hand down after the data sent and the data that self gather being merged and passs, (namely there is other node two or more to be connected with this node by direct-connected mode when running into the node that in-degree is more than or equal to 2 and need to send data to this node, as Fig. 3 node C2), then this node first passes to another end node token;
Step 7: the node that in-degree is more than or equal to 2 collects and continues by data along the transmission of LEADER node direction after merging the data of all branches, and last LEADER node is collected all data in the same fashion and is sent to base station after merging.
Preferred version: step 1 detailed process comprises the steps: described global information, comprise node ID, survival condition, node to the distance of base station, when a node receive other nodes send to the information of base station time, can by the mode record global information of key-value pair.
Preferred version: base station broadcast farthest node END ID and set up link from from the node END farthest of base station; END node finds the node that do not add chain nearest apart from oneself in record, allow destination node add in chain by sending a request message, wherein, request message contains the current node number having added incoming link, other nodes listen are to upgrading oneself link information during this message, if the message information listened to and self record information are not inconsistent, can by inquiring that the mode of neighbor node obtains current ink.
Preferred version: the detailed process of step 3 comprises the steps: by emulation experiment, shows to choose d thresholdscope is 0 to r.
Preferred version: the detailed process of the 3rd step comprises the steps: by emulation experiment, shows to choose d threshold=2r/5.
Beneficial effect of the present invention: the advantage that present invention incorporates chain type agreement and dormancy dispatching, and by minimum range enter chain and LEADER node selection strategy avoid formed long-chain and part of nodes dead time cause network node problem pockety, the basis not increasing algorithm complex decreases the consumption of node energy to greatest extent, extends the life cycle of wireless sensor network.
Accompanying drawing explanation
Fig. 1 link establishment process;
The chain that Fig. 2 is built up by RPB agreement;
The transmitting procedure of Fig. 3 data.
Embodiment
Below in conjunction with embodiment and accompanying drawing, describe technical scheme of the present invention in detail.
The first step: set up link by greedy algorithm;
Step 1: base station broadcast hello message, after node response, namely base station obtains the whole network information, if node ID, survival condition, node are to the distance etc. of base station, now when a node receive other nodes send to the information of base station time, can by the ID of the every other node of mode record of key-value pair and these nodes distance from oneself.
Step 2: base station broadcast farthest node (END) ID and set up link from from the node (END) farthest of base station, END node finds the node that do not add chain nearest apart from oneself in record, add in chain by the request message sending data volume little by destination node, wherein, request message contains the current node number having added incoming link, other nodes listen are to upgrading oneself link information during this message, if the message information listened to and self record information are not inconsistent, can by inquiring that the mode of neighbor node obtains current ink.
Step 3: suppose there is i-1 (i > 1) individual node in chain, node i is the node also not adding chain near node, node i is when receiving the request message that node sends, find in the individual node adding chain from oneself nearest node, be assumed to be node j, the spacing of node i and node j is d ij.
Now node i compares d thresholdand d ij, (d htrelevant with the perception radius r of junction sensor, by emulation experiment, show to choose d threshold=2r/5, this value also can be chosen by user, and this value is larger, one take turns in enter the node of dormancy more, but the network coverage is lower):
If 1. d ij> d threshold, then node i is by by adding in chain with the mode that j is directly connected, and the node sending request message is made to the response adding incoming link simultaneously, and then node i continues to find in the node not adding chain from oneself nearest node.
If 2. d ij≤ d threshold, so node i will work at next round successor node j to node j transmission news node j oneself, the node i sending request message be made to the response refusing to add incoming link simultaneously.Then node i setting timer entering sleep and is guaranteed to wake up before next round sets up link that (when adding not having great deal of nodes or exit, each takes turns the time of setting up link and data transmission is more stable, therefore can be recorded by base station after the first round and announce the time span of node dormancy), and node continues to find node nearest except node i in the node not adding chain.
If 3. d near node j ij≤ d thresholdnode (namely epicycle enters the node of sleep) have 2 or more, so these nodes entering sleep in epicycle all can be waken up in next round and taken over job, and (oneself is labeled as this in next round and takes turns not dormancy by these nodes, and having no matter does not have distance to be less than d thresholdnode all can not enter dormancy), then wake up at third round node j, these nodes enter sleep again, so analogize.
Step 4: when node energy is about to exhaust, leaves certain dump energy in order to ensure node and can notify neighbours before next data transmitting period starts, if node least residue energy is E r=2 × E bS, wherein E bSfor LEADER node sends the energy that a secondary data consumes to base station, when node energy is less than or equal to E r, node no longer enters sleep, and notice (is assumed to be k), if do not have dump energy to be greater than E around k node by the node of taking over job rnode take over its work in next round, then node k also no longer enters sleep, and each is taken turns and all participates in link establishment and transfer of data.
Its link establishment process as shown in Figure 1, first N0 sends the request adding incoming link to N1, to search in the data of message after N1 receives message in chain whether except N0 from oneself more close to node, confirm N0 be in chain after oneself nearest node, in self record, search self distance d to N0 01, check in d 01> d thresholdso N1 adds incoming link by the mode be directly connected with N0, then N1 sends the request adding incoming link to N2, searches the distance d that self arrives N1 after N2 receives message in self record 12, check in d 12≤ d threshold, then detect the dump energy of oneself, record dump energy and be greater than E rso, do not add incoming link and notify that N1 will take over its work in next round, then timer be set and enter dormancy.In the table of oneself, find the secondary near node N3 concurrent discrepancy chain request not adding chain after N1 is notified, the treatment step of N3 is identical with N1.After N3 adds incoming link, find N4 and transmit into chain request.Find in its link information carried from oneself nearest node N0 after N4 receives message, in self record, search the distance d that self arrives N0 04so N4 adds incoming link by the mode be directly connected with N0, after receiving the acknowledge message of N0, N4 sends acknowledge message and the link information after upgrading to N1 again.
By this Algorithm constitution chain as shown in Figure 2 (node not adding the band " * " of chain in figure is the node that epicycle enters sleep, band "+" node be that next round will enter the node of sleep).
Second step: link establishment is complete, choose LEADER node by following formula:
After link establishment is complete, each node can learn global link information by monitoring, then chooses LEADER node by following formula
Q i = w 1 × E i + w 2 × 1 d BS ( i )
Wherein, w 1and w 2for weighted value, freely can choose, meet w 1+ w 2=1.Due to from base station more away from, the energy expended be distance square or biquadratic, therefore generally have w 2> w 1, E ifor the dump energy of node i, d bS (i)for node i is to the distance of base station, base station after the node calculating maximum Q value (wherein node energy information can in every data transfer time incidentally or base station oneself estimation), broadcast to whole network the message that this node becomes LEADER.
3rd step: each sensor node adjustment its own transmission power is to only have nearest-neighbors just can hear, then enter data transfer phase, data transfer phase uses token token mechanism, and the scheme that this step uses is prior art.
Step 5: each sensor node adjustment its own transmission power, to only have nearest-neighbors just can hear, then enters data transfer phase.
Step 6: data transfer phase uses Token (token) mechanism, and Token is very little, and therefore consume energy in transmitting procedure less, its transmitting procedure as shown in Figure 3.First END node C0 obtains token, then along Data-Link, data are passed to C1, C2 is passed to after the data that C0 sends by C1 and the data self gathered merge, then token is passed to end node C4 (during the link setup stage, certain node sends request to the node i not entering chain by C2, and node i adds chain by the mode that the neighbours j adding chain with nearest is direct-connected, then node becomes end node, and node j then becomes the node that in-degree is more than or equal to 2).After the data that C2 collects C4 and C3 in the same way and the data fusion self gathered, then along LEADER node direction, data are passed to C5.
Step 7:LEADER node is collected all data in the same fashion and is sent to base station after merging.So far one take turns Data Collection and terminate, take turns the node entering dormancy now wake up at this, entered sleep by the node sets timer of taking over job, agreement restarts next round transfer of data from step 2.
Emulation experiment:
The perception radius r of sensor node is determined by the performance of transducer own, all r=8m is supposed herein, carry out 500 minor nodes respectively to the different node total number of each scene to broadcast sowing at random and simulate and be taken at the mean number (result is unified to round) that takes turns the inside working node downwards, obtain data as following table:
Table 1 50m × 50m scene lower node broadcasts sowing simulation at random
Innerly all to devote oneself to work when all nodes are taken turns one, i.e. its maximum area coverage rate correspondence 25,50,100, individual node is respectively 86.6%, and 98.2%, 99.97%
Table 2 100m × 100m scene lower node broadcasts sowing simulation at random
Innerly all to devote oneself to work when all nodes are taken turns one, namely its maximum area coverage rate correspondence 50,100,150,200 nodes are respectively 63.39%, 86.6%, 95.09%, 98.2%.
Visible, along with d thresholdincrease, take turns the inner node that can enter sleep relatively increase a certain, but its area coverage will reduce relatively.When ensureing certain area coverage, by the data of analytical table 1 and table 2, select d threshold=2r/5 seems relatively more reasonable, can certainly set concrete value according to user's request.
Combining with wireless sensor network node of the present invention is by intensive feature of broadcasting sowing, node that is complete by other nodes to some sensing range or overwhelming majority covering carries out dormancy crop rotation scheduling strategy, and concept transfer adds the condition of chain and the Selection Strategy of LEADER node, can realize further reducing node energy consumption, thus be realize reducing node power consumption to greatest extent under the prerequisite of the certain coverage rate of guarantee to provide a solution, not high to real-time, node broadcasts sowing comparatively intensive and needs the occasion of monitoring objective muchly constantly, as agricultural monitoring, environmental monitoring, the advantages such as geology monitoring are obvious.

Claims (6)

1. a power-economizing method for radio sensing network, based on the energy-saving routing protocol RPB of crop rotation and chain type, is characterized in that: comprise the following steps:
The first step: set up link by greedy algorithm, detailed process is as follows:
Step 1: base station broadcast hello message, each node replys rear base station respectively and each node obtains global information;
Step 2: with the mode link setup of greedy algorithm from distalmost end, namely finds from oneself nearest neighbor node not adding chain, and asks it to add in chain from distalmost end;
Step 3: the node i receiving chain request is found apart from minimum neighbor node j in the node adding chain, if these two euclidean distance between node pair are d ij; d thresholdone relevant with the perception radius r of junction sensor is worth;
If d ij≤ d threshold, then node i advised nodes j will take over its work in next round, and then node i arranges timer and enters dormancy, and response is to the node oneself transmitting into chain request;
If d ij> d threshold, then node i is by by adding in chain with the mode that j is directly connected, and response is to the node oneself transmitting into chain request;
Step 4: continue to find the nearest node not adding chain after the node transmitting into chain request to node i receives response message; When node energy is about to exhaust, leaves certain dump energy in order to ensure node and neighbours can be notified before next data transmitting period starts, if node least residue energy is E r=2 × E bS, wherein E bSfor LEADER node sends the energy that a secondary data consumes to base station, when node energy is less than or equal to E r, node no longer enters sleep, and notice is by the node k taken over job, if do not have dump energy to be greater than E around node k rnode take over its work in next round, then node k also no longer enters sleep, and each is taken turns and all participates in link establishment and transfer of data;
Second step: link establishment is complete, choose LEADER node by following formula:
Q i = w 1 × E i + w 2 × 1 d BS ( i )
Wherein, w 1and w 2for weighted value, freely can choose, meet w 1+ w 2=1; E ifor the dump energy of node i, d bS (i)for node i is to the distance of base station, the message that this node becomes LEADER, after the node calculating maximum Q value, is broadcasted to whole network in base station;
3rd step: each sensor node adjustment its own transmission power is to only have nearest-neighbors just can hear, then enter data transfer phase, data transfer phase uses token token mechanism.
2. the power-economizing method of a kind of radio sensing network according to claim 1, is characterized in that: the detailed process of the 3rd step comprises the steps:
Then data are passed toward LEADER node direction along Data-Link by step 5: first distalmost end node END obtains token;
Step 6: the node receiving data continues to hand down after the data sent and the data that self gather being merged and passs, and when running into the node that in-degree is more than or equal to 2, then this node first passes to another end node token;
Step 7: the node that in-degree is more than or equal to 2 collects and continues by data along the transmission of LEADER node direction after merging the data of all branches, and last LEADER node is collected all data in the same fashion and is sent to base station after merging.
3. the power-economizing method of a kind of radio sensing network according to claim 1, it is characterized in that: step 1 detailed process comprises the steps: described global information, comprise node ID, survival condition, node to the distance of base station, when a node receive other nodes send to the information of base station time, can by the mode record global information of key-value pair.
4. the power-economizing method of a kind of radio sensing network according to claim 1 or 3, is characterized in that: base station broadcast farthest node END ID and set up link from from the node END farthest of base station;
END node finds the node that do not add chain nearest apart from oneself in record, allow destination node add in chain by sending a request message, wherein, request message contains the current node number having added incoming link, other nodes listen are to upgrading oneself link information during this message, if the message information listened to and self record information are not inconsistent, can by inquiring that the mode of neighbor node obtains current ink.
5. the power-economizing method of a kind of radio sensing network according to claim 4, is characterized in that: the detailed process of step 3 comprises the steps: by emulation experiment, shows to choose d thresholdscope is 0 to r.
6. the power-economizing method of a kind of radio sensing network according to claim 5, is characterized in that: the detailed process of step 3 comprises the steps: by emulation experiment, shows to choose d threshold=2r/5.
CN201310097918.8A 2013-03-25 2013-03-25 A kind of power-economizing method of radio sensing network Expired - Fee Related CN103188758B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201310097918.8A CN103188758B (en) 2013-03-25 2013-03-25 A kind of power-economizing method of radio sensing network

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201310097918.8A CN103188758B (en) 2013-03-25 2013-03-25 A kind of power-economizing method of radio sensing network

Publications (2)

Publication Number Publication Date
CN103188758A CN103188758A (en) 2013-07-03
CN103188758B true CN103188758B (en) 2015-09-02

Family

ID=48679645

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201310097918.8A Expired - Fee Related CN103188758B (en) 2013-03-25 2013-03-25 A kind of power-economizing method of radio sensing network

Country Status (1)

Country Link
CN (1) CN103188758B (en)

Families Citing this family (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN104009913B (en) * 2014-04-10 2017-01-25 浙江工商大学 Broadcasting method based on distance and energy balance in mobile Ad Hoc network
CN105050077B (en) * 2015-05-27 2019-01-18 东南大学 A kind of sub-clustering chain type wireless sensing network data transmission method
CN105337830B (en) * 2015-10-15 2019-06-11 中国石油天然气集团公司 Data transmission network and data transmission method
CN107635205B (en) * 2017-08-03 2020-02-18 魔玛智能科技（上海）有限公司 Numbering distribution method and communication architecture of ad hoc network
CN108650697B (en) * 2018-05-04 2020-09-01 南京大学 Data routing method in long-distance linear wireless sensor network

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102149160A (en) * 2011-04-20 2011-08-10 宁波职业技术学院 Energy perception routing algorithm used for wireless sensing network
CN102202372A (en) * 2011-06-15 2011-09-28 华北电力大学 Chain routing method of wireless sensor network based on fuzzy theory
CN102984780A (en) * 2012-11-19 2013-03-20 清华大学 Wireless sensor network data transmission method

Family Cites Families (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
KR101066291B1 (en) * 2009-01-02 2011-09-20 삼성전자주식회사 Packet routing method and apparatus

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102149160A (en) * 2011-04-20 2011-08-10 宁波职业技术学院 Energy perception routing algorithm used for wireless sensing network
CN102202372A (en) * 2011-06-15 2011-09-28 华北电力大学 Chain routing method of wireless sensor network based on fuzzy theory
CN102984780A (en) * 2012-11-19 2013-03-20 清华大学 Wireless sensor network data transmission method

Also Published As

Publication number Publication date
CN103188758A (en) 2013-07-03

Similar Documents

Publication Publication Date Title
Ullah et al. UAV-enabled healthcare architecture: Issues and challenges
CN102149160B (en) Energy perception routing algorithm used for wireless sensing network
CN103188758B (en) A kind of power-economizing method of radio sensing network
Anastasi et al. Energy conservation in wireless sensor networks: A survey
Feng Research on water-saving irrigation automatic control system based on internet of things
Yang et al. Integration of wireless sensor networks in environmental monitoring cyber infrastructure
Ba et al. Passive wake-up radios: From devices to applications
US20030143999A1 (en) Method and associated apparatus for distributed dynamic paging area clustering under heterogeneous access networks
CN203480672U (en) Environment monitoring system based on ZigBee wireless interconnection
Li et al. A data collection collar for vital signs of cows on the grassland based on LoRa
CN104320796A (en) Wireless sensor network data transmission method based on LEACH protocol
CN106559731A (en) A kind of sewage monitoring wireless sensor network
CN106060871A (en) Wireless networking and data forwarding method based on low power consumption and micro power
CN105722174A (en) Node link scheduling method of heterogeneous integrated power consumption information collection network
CN105430662A (en) Networking method of micro-power wireless communication network
Florita et al. Opportunistic LoRa-based gateways for delay-tolerant sensor data collection in urban settings
Agarwal et al. Network lifetime enhanced tri‐level clustering and routing protocol for monitoring of offshore wind farms
CN104581870A (en) Wireless sensor network based on energy acquisition and low-delay routing method thereof
Trullols-Cruces et al. Power saving trade-offs in delay/disruptive tolerant networks
Abdalkafor et al. Data aggregation techniques in wireless sensors networks (WSNs): Taxonomy and an accurate literature survey
JV et al. Exploring data collection on Bluetooth Mesh networks
CN104301903A (en) Wireless sensor network cluster selection protocol for survivability analysis and on basis of coverage
CN103237364B (en) A kind of integrated wireless sensor network data collection mechanism
CN102437600A (en) Energy self-supplying wireless sensor network node and data processing method
Jiang et al. SenSearch: GPS and witness assisted tracking for delay tolerant sensor networks

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
C14 Grant of patent or utility model
GR01 Patent grant
CF01 Termination of patent right due to non-payment of annual fee

Granted publication date: 20150902

Termination date: 20190325

CF01 Termination of patent right due to non-payment of annual fee