CN103188758A - Energy saving method for wireless sensor network - Google Patents

Energy saving method for wireless sensor network Download PDF

Info

Publication number
CN103188758A
CN103188758A CN2013100979188A CN201310097918A CN103188758A CN 103188758 A CN103188758 A CN 103188758A CN 2013100979188 A CN2013100979188 A CN 2013100979188A CN 201310097918 A CN201310097918 A CN 201310097918A CN 103188758 A CN103188758 A CN 103188758A
Authority
CN
China
Prior art keywords
node
chain
data
link
base station
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
Application number
CN2013100979188A
Other languages
Chinese (zh)
Other versions
CN103188758B (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

Images

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 an energy saving method for a wireless sensor network, which is based on an alternated and linked energy-saving routing protocol (RPB). The energy saving method comprises the following steps of: firstly, establishing a link through a greedy algorithm; secondly, after the link is established, selecting an LEADER node through an appointed formula; and thirdly, adjusting the transmitting power of each sensor node to ensure that the transmitting power can only be heard by the nearest neighbor, and then, entering a data transmission stage, wherein a token mechanism is adopted in the data transmission stage. The advantages of a link protocol and sleeping schedule are combined, the problems of long link formation and network node distribution nonuniformity caused when parts of nodes are dead are avoided through a minimum distance linking and LEADER node selecting strategy, the energy consumption of the nodes is reduced to the maximum extent on the basis that the complexity of an algorithm is not increased, and the life cycle of the wireless sensor network is prolonged.

Description

A kind of power-economizing method of radio sensing network
Technical field
The invention belongs to the mobile communication technology field, particularly a kind of power-economizing method of radio sensing network.
Background technology
Radio sensing network (wireless sensor networks, WSNs) constitute by being deployed in a large amount of small sensor node in monitored area at random, perception in real time and gather the numerous information of surrounding enviroment, and communicate information to terminal by modes such as MANET, data fusion.In radio sensing network, because the finite energy that carries of node itself, and the restriction of condition such as the microprocessor computing capability is limited, discomfort is fit to do complicated calculating.
Simultaneously, wireless sensor network also has following characteristics: the node that is deployed in the monitored area it is generally acknowledged that motionless or fine motion, node can be adjusted through-put power, node according to communication distance can be by the signal strength signal intensity indication RSSI(Received Signal Strength Indication that receives) or other modes record other nodes or base station to the distance of oneself.
At wireless sensor node finite energy problem, for the life cycle of prolonging wireless sensor network, the These characteristics of combining wireless sensing network, the researcher has proposed the algorithm of a lot of energy efficients, according to whether layering can be summed up as plane and level two classes.PEGASIS(Power-Efficient GatheringinSensorInformationSystem wherein) the chain type agreement is the improvement agreement that is based upon on the LEACH sub-clustering algorithm basis, generate a strand of being formed by all nodes by greedy algorithm, serve as LEADER node (namely merging the whole network data responsible node that data is mail to the base station later on) in turn by the node in the chain then.This way can reduce the power consumption of node to the full extent.GAF(geographical adaptive fidelity) agreement is that the geographical position with node is the algorithm of foundation, by surveyed area being 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 the same cell can enter sleep to save energy.The deficiency that above-mentioned algorithm exists is mainly reflected in: the neighbours that added chain among the PEGASIS can not be visited again, so long-chain is inevitable between adjacent node, and the strategy of the in turn elected LEADER node of node can cause away from the node of base station dead too early.GAF then requires node to be equipped with extras such as GPS and obtains the node geographical location information, obviously can increase the manufacturing cost of wireless sensor node.
Summary of the invention
The objective of the invention is to improve the problems referred to above that algorithm exists in order to solve existing energy-conservation route chain type agreement, by improving the deficiency of chain type agreement, and to redundant node implementation dormancy crop rotation strategy, reduce node energy consumption in the wireless sensor network further, thereby prolong the life cycle of network.
Technical scheme of the present invention is: a kind of power-economizing method of radio sensing network: the energy-saving routing protocol RPB based on crop rotation and chain type comprises the steps:
The first step: set up link by greedy algorithm;
Second step: link establishment finishes, and chooses the LEADER node by following formula:
Q i = w 1 × E i + w 2 × 1 d BS ( i )
Wherein, w 1And w 2Be weighted value, can freely choose, satisfy w 1+ w 2=1; E iBe the dump energy of node i, d BS (i)Be the distance of node i to the base station, the message that this node becomes LEADER is broadcasted to whole network in the base station behind the node that calculates maximum Q value;
The 3rd step: each sensor node adjustment self transmitting power enters data transfer phase then in order to have only nearest-neighbors just can hear, data transfer phase uses token token mechanism.
Preferred version: the detailed process of the first step is as follows:
Step 1: base station broadcast hello message, each node are replied the base station, back respectively and each node obtains global information;
Step 2: begin mode link setup with greedy algorithm from distal-most end, namely begin to seek from the own nearest neighbor node that does not add chain from distal-most end, and ask it to add in chain;
Step 3: the node i of receiving the chain request is sought the minimum neighbor node j of distance in the node that adds chain, establishing these two euclidean distance between node pair is d Ijd ThresholdA value relevant with the perception radius r of node transducer;
If d Ij≤ d Threshold, then node i informs that node j will take over its work in next round, node i arranges timer and enters dormancy then, and replys to the node that oneself transmits into the chain request;
If d IjD Threshold, then node i will be by adding in the chain with mode that j directly links to each other, and reply to the node that oneself transmits into the chain request;
Step 4: continue to seek the nearest node that does not add chain after the node that transmits into the chain request to node i is received response message; When node energy is about to exhaust, leave certain dump energy and can before next data transmitting period begins, notify neighbours in order to ensure node, establishing node least residue energy is E r=2 * E BS, E wherein BSFor the LEADER node sends the energy that a secondary data consumes to the base station, when node energy smaller or equal to E r, node no longer enters sleep, and notifies the node k that is taken over job, if do not have dump energy greater than E around the node k rNode take over its work in next round, then node k also no longer enters sleep, each is taken turns and all participates in link establishment and transfer of data.
Preferred version: the detailed process in the 3rd step comprises the steps:
Step 5: distal-most end node END at first obtains token, along the data chain data is passed toward the LEADER node direction then;
Step 6: continue to hand down after the node of receiving data merges the data sent and self-collected data and pass, (namely there are two or more other nodes to link to each other with this node by direct-connected mode and need send data to this node when running into the node of in-degree more than or equal to 2, as Fig. 3 node C2), then this node is passed to another end node to token earlier;
Step 7: in-degree has been collected more than or equal to 2 node and has been merged and continued after the data of all branches data along the transmission of LEADER node direction, last LEADER node collect all data with the same manner and merge after send to the base station.
Preferred version: step 1 detailed process comprises the steps: described global information, comprise that node ID, survival condition, node are to the distance of base station, when a node receives that other nodes send to the information of base station, can record global information by the mode of key-value pair.
Preferred version: base station broadcast farthest node END ID and from farthest node END begins to set up link from the base station; The END node is sought the own nearest node that does not add chain of distance in record, allow destination node add in the chain by sending a request message, wherein, request message contains the current node number that has added incoming link, when listening to this message, upgrade other nodes the link information of oneself, if the message information that listens to and self record information are not inconsistent, can obtain current link by the mode of inquiry neighbor node.
Preferred version: the detailed process of step 3 comprises the steps: by emulation experiment, shows and can choose d ThresholdScope is 0 to r.
Preferred version: the detailed process in the 3rd step comprises the steps: by emulation experiment, shows and can choose d Threshold=2r5.
Beneficial effect of the present invention: the present invention combines the advantage of chain type agreement and dormancy dispatching, and going into chain and LEADER node by minimum range chooses and causes network node problem pockety when strategy has avoided formation long-chain and part of nodes dead, on the basis that does not increase algorithm complex, reduce the consumption of node energy to greatest extent, prolonged the life cycle of wireless sensor network.
Description of drawings
Fig. 1 link establishment process;
The chain that Fig. 2 is built up by the RPB agreement;
The transmission course 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, node is replied the base station, back and is namely obtained the whole network information, arrive the distance of base station etc. as node ID, survival condition, node, can record the ID of every other node and these nodes by the mode of key-value pair from the distance of oneself this moment when a node receives that other nodes send to the information of base station.
Step 2: base station broadcast farthest node (END) ID and from farthest node (END) begins to set up link from the base station, the END node is sought the own nearest node that does not add chain of distance in record, add in the chain by destination node by sending data volume request message seldom, wherein, request message contains the current node number that has added incoming link, when listening to this message, upgrade other nodes the link information of oneself, if the message information that listens to and self record information are not inconsistent, can obtain current link by the mode of inquiry neighbor node.
Step 3: (i＞1) the individual node of supposing that i-1 is arranged is in chain, node i is the node that does not add chain of close node, node i is when receiving the request message that node sends, in adding the individual node of chain, seek from own nearest node, be assumed to be node j, distance is d between node i and the node j Ij
This moment, node i compared d ThresholdAnd d Ij, (d ThresholdRelevant with the perception radius r of node transducer, by emulation experiment, show and can choose d Threshold=2r5, this value also can be chosen by the user, and this value is more big, and one to enter the node of dormancy in taking turns more many, but the network coverage is more low):
If 1. d IjD Threshold, then node i will add replying of incoming link by adding in the chain with mode that j directly links to each other, simultaneously the node that sends request message being made, and node i continues to seek in adding the node of chain from own nearest node then.
If 2. d Ij≤ d Threshold, node i tells node j oneself to take over node j work in next round to node j transmission message so, simultaneously the node i of sending request message is made refusal and adds replying of incoming link.Then node i set timer go forward side by side sleep and guaranteeing before next round is set up link, wake up (under the situation that does not have great deal of nodes to add or withdraw from each to take turns and set up the time that link and data send be more stable, therefore can after the first round finish, record and announce the time span of node dormancy by the base station), and node continues to seek node nearest except node i in not adding the node of chain.
Near if 3. d node j Ij≤ d ThresholdNode (just epicycle enters the node of sleep) have 2 or more than, these nodes that enter sleep in epicycle can be waken up all in next round and taken over job so, and (these nodes are taken turns not dormancy in next round with oneself being labeled as this, distance are arranged not less than d near no matter ThresholdNode can not enter dormancy), wake up at third round node j then, these nodes enter sleep again, so analogize.
Step 4: when node energy is about to exhaust, leaves certain dump energy and can notify neighbours before next data transmitting period begins in order to ensure node, establishing node least residue energy is E r=2 * E BS, E wherein BSFor node sends the energy that a secondary data consumes to the base station as LEADER, when node energy smaller or equal to E r, node no longer enters sleep, and notifies the node (being assumed to be k) of being taken over job, if do not have dump energy greater than E around the k node rNode take over its work in next round, then node k also no longer enters sleep, each is taken turns and all participates in link establishment and transfer of data.
Its link establishment process as shown in Figure 1, N0 at first sends the request that adds incoming link to N1, whether N1 receive and search in the data of message after the message in the chain except N0 from oneself node close to more, confirm N0 be in the chain behind own nearest node, in self record, search self to N0 apart from d 01, check in d 01D ThresholdSo N1 adds incoming link by the mode that directly links to each other with N0, N1 sends the request that adds incoming link to N2 then, N2 receive in self record, search after the message self arrive N1 apart from d 12, check in d 12≤ d Threshold, the dump energy of detection oneself records dump energy greater than E then rSo, do not add incoming link and notify N1 to take over its work in next round, timer is set then and enters dormancy.N1 seeks time near concurrent discrepancy chain of the node N3 request that does not add chain in notified back in the table of oneself, the treatment step of N3 is identical with N1.After N3 adds incoming link, find N4 and transmit into the chain request.N4 receives and finds in the link information that it carries after the message from own nearest node N0, in self record, search self to N0 apart from d 04So N4 adds incoming link by the mode that directly links to each other with N0, at the link information of receiving after N4 sends acknowledge message and renewal to N1 again after the affirmation message of N0.
The chain that is made of this algorithm is (node that does not add the band " * " of chain among the figure is the node that epicycle enters sleep, and the node of band "+" is the node that next round will enter sleep) as shown in Figure 2.
Second step: link establishment finishes, and chooses the LEADER node by following formula:
Each node can be learnt global link information by monitoring after link establishment finished, and chose the LEADER node by following formula then
Q i = w 1 × E i + w 2 × 1 d BS ( i )
Wherein, w 1And w 2Be weighted value, can freely choose, satisfy w 1+ w 2=1.Since from the base station more away from, the energy that expends be distance square or biquadratic, therefore w is generally arranged 2W 1, E iBe the dump energy of node i, d BS (i)Be node i to the distance of base station, the base station is broadcasted the message that this node becomes LEADER in (when wherein node energy information can be in each transfer of data incidentally or base station oneself estimate) behind the node that calculates maximum Q value to whole network.
The 3rd step: each sensor node adjustment self transmitting power enters data transfer phase then in order to have only nearest-neighbors just can hear, data transfer phase uses token token mechanism, and the scheme that this step is used is prior art.
Step 5: each sensor node adjustment self transmitting power enters data transfer phase then in order to have only nearest-neighbors just can hear.
Step 6: data transfer phase uses the Token(token) mechanism, Token is very little, and therefore power consumption is less in transmission course, and its transmission course is as shown in Figure 3.END node C0 at first obtains token, along the data chain data are passed to C1 then, after merging, the data that C1 sends C0 and self-collected data pass to C2, then C2 with token pass to end node C4(link setup during the stage certain node send request to the node i of not going into chain, and node i is by adding chain with the direct-connected mode of the nearest neighbours j that adds chain, then node becomes end node, and node j then becomes in-degree more than or equal to 2 node).C2 collects the later and self-collected data fusion of data of C4 and C3 in the same way, along the LEADER node direction data is passed to C5 then.
Step 7:LEADER node collect all data with the same manner and merge after send to the base station.So far one take turns data collection end, take turns the node that enters dormancy at this and wake up at this moment, the node of being taken over job is set timer and is gone forward side by side into sleep, and agreement is restarted the 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 suppose r=8m at this paper, the different node sums of each scene are carried out 500 minor nodes respectively broadcast sowing simulation at random and be taken at a mean number (result is unified to round) of taking turns the inside working node downwards, obtain data such as following table:
Table 1 50m * 50m scene lower node broadcasts sowing simulation at random
Figure BDA00002962370300081
Figure BDA00002962370300091
When all nodes are all devoted oneself to work in taking turns one, i.e. its maximum area coverage rate correspondence 25,50,100, individual node is respectively 86.6%, 98.2%, and 99.97%
Table 2 100m * 100m scene lower node broadcasts sowing simulation at random
Figure BDA00002962370300092
All devote oneself to work in taking turns one when all nodes, namely 50,100,150,200 nodes of its maximum area coverage rate correspondence are respectively 63.39%, 86.6%, 95.09%, 98.2%.
As seen, along with d ThresholdIncrease, the node that can enter sleep in a certain the wheel increases relatively, but its area coverage will reduce relatively.Under the situation that guarantees certain area coverage, by the data of analytical table 1 and table 2, select d ThresholdIt is more reasonable that=2r/5 seems, can certainly set concrete value according to user's request.
Combining with wireless sensor network node of the present invention is by intensive characteristics of broadcasting sowing, the node that some sensing range is complete by other nodes or the overwhelming majority covers is carried out dormancy crop rotation scheduling strategy, and change the strategy of choosing that node adds the condition of chain and LEADER node, can realize reducing node energy consumption further, thereby for realizing under the prerequisite that guarantees certain coverage rate that reducing the node power consumption to greatest extent provides a solution, not high to real-time, node broadcasts sowing comparatively intensive and needs constantly the occasion of monitoring objective muchly, monitors as agricultural, environmental monitoring, advantages such as geology monitoring are apparent in view.

Claims (7)

1. the power-economizing method of a radio sensing network, the energy-saving routing protocol RPB based on crop rotation and chain type is characterized in that: may further comprise the steps:
The first step: set up link by greedy algorithm;
Second step: link establishment finishes, and chooses the LEADER node by following formula:
Q i = w 1 × E i + w 2 × 1 d BS ( i )
Wherein, w 1And w 2Be weighted value, can freely choose, satisfy w 1+ w 2=1; E iBe the dump energy of node i, d BS (i)Be the distance of node i to the base station, the message that this node becomes LEADER is broadcasted to whole network in the base station behind the node that calculates maximum Q value;
The 3rd step: each sensor node adjustment self transmitting power enters data transfer phase then in order to have only nearest-neighbors just can hear, data transfer phase uses token token mechanism.
2. the power-economizing method of a kind of radio sensing network according to claim 1, it is characterized in that: the detailed process of the first step is as follows:
Step 1: base station broadcast hello message, each node are replied the base station, back respectively and each node obtains global information;
Step 2: begin mode link setup with greedy algorithm from distal-most end, namely begin to seek from the own nearest neighbor node that does not add chain from distal-most end, and ask it to add in chain;
Step 3: the node i of receiving the chain request is sought the minimum neighbor node j of distance in the node that adds chain, establishing these two euclidean distance between node pair is d Ijd ThresholdA value relevant with the perception radius r of node transducer;
If d Ij≤ d Threshold, then node i informs that node j will take over its work in next round, node i arranges timer and enters dormancy then, and replys to the node that oneself transmits into the chain request;
If d IjD Threshold, then node i will be by adding in the chain with mode that j directly links to each other, and reply to the node that oneself transmits into the chain request;
Step 4: continue to seek the nearest node that does not add chain after the node that transmits into the chain request to node i is received response message; When node energy is about to exhaust, leave certain dump energy and can before next data transmitting period begins, notify neighbours in order to ensure node, establishing node least residue energy is E r=2 * E BS, E wherein BSFor the LEADER node sends the energy that a secondary data consumes to the base station, when node energy smaller or equal to E r, node no longer enters sleep, and notifies the node k that is taken over job, if do not have dump energy greater than E around the node k rNode take over its work in next round, then node k also no longer enters sleep, each is taken turns and all participates in link establishment and transfer of data.
3. the power-economizing method of a kind of radio sensing network according to claim 1 and 2 is characterized in that: the detailed process in the 3rd step comprises the steps:
Step 5: distal-most end node END at first obtains token, along the data chain data is passed toward the LEADER node direction then;
Step 6: continue to hand down after the node of receiving data merges the data sent and self-collected data and pass, when running into the node of in-degree more than or equal to 2, then this node is passed to another end node to token earlier;
Step 7: in-degree has been collected more than or equal to 2 node and has been merged and continued after the data of all branches data along the transmission of LEADER node direction, last LEADER node collect all data with the same manner and merge after send to the base station.
4. the power-economizing method of a kind of radio sensing network according to claim 2, it is characterized in that: step 1 detailed process comprises the steps: described global information, comprise that node ID, survival condition, node are to the distance of base station, when a node receives that other nodes send to the information of base station, can record global information by the mode of key-value pair.
5. according to the power-economizing method of claim 2 or 4 described a kind of radio sensing networks, it is characterized in that: base station broadcast farthest node END ID and from farthest node END begins to set up link from the base station; The END node is sought the own nearest node that does not add chain of distance in record, allow destination node add in the chain by sending a request message, wherein, request message contains the current node number that has added incoming link, when listening to this message, upgrade other nodes the link information of oneself, if the message information that listens to and self record information are not inconsistent, can obtain current link by the mode of inquiry neighbor node.
6. the power-economizing method of a kind of radio sensing network according to claim 5, it is characterized in that: the detailed process of step 3 comprises the steps: by emulation experiment, shows and can choose d ThresholdScope is 0 to r.
7. the power-economizing method of a kind of radio sensing network according to claim 6, it is characterized in that: the detailed process of step 3 comprises the steps: by emulation experiment, shows and can choose d Threshold=2r5.
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 true CN103188758A (en) 2013-07-03
CN103188758B 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)

Cited By (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN104009913A (en) * 2014-04-10 2014-08-27 浙江工商大学 Broadcasting method based on distance and energy balance in mobile Ad Hoc network
CN105050077A (en) * 2015-05-27 2015-11-11 东南大学 Clustering chained wireless sensor network data transmission method
CN105337830A (en) * 2015-10-15 2016-02-17 中国石油天然气集团公司 Data transmission network and data transmission method
CN107635205A (en) * 2017-08-03 2018-01-26 魔玛智能科技（上海）有限公司 The numbering distribution method and communication construction of a kind of MANET
CN108650697A (en) * 2018-05-04 2018-10-12 南京大学 A kind of data routing method in long range threadiness wireless sensor network

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20100172258A1 (en) * 2009-01-02 2010-07-08 Samsung Electronics Co., Ltd. Method and apparatus for routing packet
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

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20100172258A1 (en) * 2009-01-02 2010-07-08 Samsung Electronics Co., Ltd. Method and apparatus for routing packet
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

Cited By (9)

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

Also Published As

Publication number Publication date
CN103188758B (en) 2015-09-02

Similar Documents

Publication Publication Date Title
CN102149160B (en) Energy perception routing algorithm used for wireless sensing network
Anastasi et al. Energy conservation in wireless sensor networks: A survey
CN101013926B (en) Method and system for network communication of wireless sensor
Rani et al. Multi-hop routing in wireless sensor networks: an overview, taxonomy, and research challenges
Misra et al. Policy controlled self-configuration in unattended wireless sensor networks
CN103228021B (en) A kind of monitoring of protected crop growth parameter(s) and control method performing network based on wireless senser
CN104038965A (en) Opportunistic routing method capable of efficiently utilizing energy, for mobile wireless sensor network
Tseng et al. Fully power-aware and location-aware protocols for wireless multi-hop ad hoc networks
CN102970723B (en) With the Uneven Cluster routing algorithm of local cluster reconstruction
CN104539374A (en) Hybrid networking method based on water surface sensor network-underwater sound sensor network
KR20100113140A (en) Method for controlling a wake up rate of nodes operating within a multi-hop communication system
CN107222900B (en) Wireless sensor network node cooperation method based on dynamic chain
CN103188758A (en) Energy saving method for wireless sensor network
CN107205254B (en) Mobile sink node access and interference rejection method and system based on tight delay constraint
Liu et al. An improved energy efficient unequal clustering algorithm of wireless sensor network
Coutinho et al. A joint anypath routing and duty-cycling model for sustainable underwater sensor networks
Zorbas et al. Collision-free sensor data collection using lorawan and drones
CN103237364B (en) A kind of integrated wireless sensor network data collection mechanism
Padyal et al. Continuous neighbour discovery approach for improvement of routing performance in WSN
Al Sawafi et al. Toward hybrid RPL based IoT sensing for smart city
CN110177351A (en) A kind of efficient data transfer method for low duty ratio wireless sensor network
CN105101334A (en) Cooperative networking method of multi-WBAN coexisting network
Karunanithy et al. An Efficient Distributed Clustering and Gradient based Routing Protocol for Wireless Sensor Networks.
Watteyne Energy-efficient self-organization for wireless sensor networks
Kumar et al. Improved data gathering protocol for WSN

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
CF01 Termination of patent right due to non-payment of annual fee

Granted publication date: 20150902

Termination date: 20190325