CN106131879B - Wireless sensor network gateway node Poewr control method based on N strategy - Google Patents
Wireless sensor network gateway node Poewr control method based on N strategy Download PDFInfo
- Publication number
- CN106131879B CN106131879B CN201610662291.XA CN201610662291A CN106131879B CN 106131879 B CN106131879 B CN 106131879B CN 201610662291 A CN201610662291 A CN 201610662291A CN 106131879 B CN106131879 B CN 106131879B
- Authority
- CN
- China
- Prior art keywords
- node
- strategy
- period
- time
- gateway node
- 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.)
- Active
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W24/00—Supervisory, monitoring or testing arrangements
- H04W24/06—Testing, supervising or monitoring using simulated traffic
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W52/00—Power management, e.g. TPC [Transmission Power Control], power saving or power classes
- H04W52/02—Power saving arrangements
- H04W52/0203—Power saving arrangements in the radio access network or backbone network of wireless communication 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)
- Mobile Radio Communication Systems (AREA)
Abstract
The present invention discloses a kind of wireless sensor network gateway node Poewr control method based on N strategy, belongs to sensor network technology field.Comprising steps of scene description, problem sums up, and the tradeoff formula of derived data packet average waiting time E (T) and node average energy consumption E (P) derive optimal sleeping time N*Expression formula, for instructing practical application.The method that present invention difference extends node life cycle with previous wireless sensor network, for special application scenarios, source practical application, scene setting is careful, reasonable, it proceeds from the reality primary study gateway node, the gateway node dormancy method for proposing a kind of N strategy, the relationship for comprehensively considering node dormancy and business have real directive significance.
Description
Technical field
The invention belongs to sensor network technology fields, more specifically to a kind of wireless sense network based on N strategy
Network diagram artis Poewr control method.
Background technique
IDATE report display, since two thousand six global " interconnection of object object " business year compound increasing based on wireless sense network
Long rate is up to 49%.Wireless sense network industry will develop into next high-tech market with trillion dollars industry size.
In short, the technologies such as breadth of microchip fabrication technology, wireless communication technique are constantly progressive, and wireless sense network is contained into after 21 century
Huge commercial value and application potential will bring far-reaching influence to human being's production and sphere of life.
Wireless sense network is by much there is the finite energy node of perception, calculating and communication capacity to form.Currently, it is low at
This wireless sense network has been applied to many existing and tentative plan fields, such as smart grid, environmental monitoring, battlefield prison
Depending on health care and smart home etc., the increasingly concern by academia and industrial circle.
Wireless sense network problem usually has an important goal --- extend network lifetime.In most cases,
The battery of all nodes cannot be supplemented and be replaced.Once node energy exhausts, which will fail, this will affect network
Operation, or even network is made to occur dividing and shortening network lifetime.Therefore, the deployment of wireless sense network and the choosing of each algorithm
It takes and requires to extend the life span of whole network to the maximum extent from energy conservation, save the great expense incurred redeployed.
Network lifetime is as one of most important index of wireless sense network, but when researcher is not to network survivability
Between carry out unified definition.The normal use that just will affect entire wireless sense network, network survivability are exhausted for a node energy
Time can be defined as network and bring into operation into network this period of time that the 1st node energy exhaust, and can also be defined as
The network operation the 1st node data into network cannot reach this period of time when Sink node.Some other is applied,
Network lifetime can be defined as network and bring into operation to this period of a part of node (such as half node) failure.?
In wireless sense network, since node mostly uses battery to power greatly, finite energy, once node energy exhausts, which will
Failure, this will affect the operation of network, even results in network and occurs dividing and shortening network lifetime.Therefore, wireless to pass
Each algorithm of sense net requires to extend the life span of whole network to the maximum extent from energy conservation.
In order to extend the life span of network, many algorithms of wireless sense network are using various transmission strategies (such as routing, function
Rate control and scheduling etc.).It is one of topology control research direction of wireless sense network that its interior joint, which sends power control mechanism, it
The transmission power of each node mainly in regulating networks, under the premise of meeting network connectivity, the single-hop of balanced node can
Up to neighbours' number, unnecessary communication link between node is rejected, the optimization network structure an of data forwarding is formed, to reach
Optimize the purpose of life span.Wireless sensor network gateway is as the core hinge element in wireless sense network, life span
The importance of problem more highlights.
Chinese Patent Application No. 201510577650.7 publication date on September 11st, 2015, discloses a kind of tool of a title
There is the wireless sense network optimization method for survival time of mobile Sink node, comprising the following steps: 1) network startup after, Sink node
Broadcast message inquiry packet, receives the location coordinate information of sensing node, and be added in the sensing node information table of Sink node；
2) Sink node analysis constraint condition establishes the network lifetime Optimized model that data transmission delay and hop count are limited；3)
Sink node solves network lifetime Optimized model using modified genetic algorithm, calculates network lifetime, Sink node
Movement routine and on each stop place the residence time optimal case.When this method provides a kind of raising network survivability
Between, reduce the wireless sense network life span optimization side with mobile Sink node that node energy consumption and node abandon data volume
Method.
Chinese invention patent number 201110047275.7 publication date on 2 28th, 2011, discloses a title and wirelessly passes
The random dormancy scheduling routing method of sensor network, specific method are one pseudo-random number sequence of each node maintenance.The ordered series of numbers
It is that the seed being randomly generated with each node is generated by the same Pseudo-Random Number.Then, node is with the random number sequence
Column determine oneself random suspend mode scheduling in the secondary network operation period.By broadcasting oneself in netinit
Seed, node and one hop neighbor can know mutual pseudo-random number sequence by calculating, thus learn mutual suspend mode with
Recovery time.When node needs to send data, by calculating the recovery time of oneself neighbour, first is delivered a packet to
The node waken up.This method makes node work in turn by a kind of mechanism of random dormancy scheduling, complete to reach reduction and equilibrium
The purpose of network energy consumption.
Chinese Patent Application No. 201510122208.5, discloses a kind of nothing of a title at publication date on March 19th, 2015
The link dormant method of line sensor multihop network chain topology, it is assumed that k-th node is in business data transmission in link
When, all nodes before the node are all in working condition, and all nodes after the node are all in periodically stopping
Dormancy wake-up states；Node intrinsic suspend mode delay time be T2, i.e., node in period T2 without business data transmission then into
Enter periodical dormancy awakening state；When k-th node completes the transmission of business datum, it is rounded the node and its forward direction K/i
A node delay period T3 enters back into periodical dormancy awakening state；Other nodes enter periodical suspend mode according to normal condition
Wake-up states；Wherein 1≤i≤k.This method can make that business number frequently occurs in a certain regional area short time in a link
According to when, can achieve the purpose that fast wake-up link, thus the real-time and reliability of lifting system.
Generally speaking, when the public material of application number 201510577650.7 considers the wireless sense network existence of gateway node
Between problem, but do not account for gateway node suspend mode institute can bring significantly improve.The disclosure of application number 201110047275.7
Material considers that a kind of mechanism of random dormancy scheduling makes node work in turn, but does not fully consider the pass of suspend mode and business
System.The public material of application number 201510122208.5 considers the periodic suspend mode of node and wake-up problem, but without deeply
Consider the practical problems such as closed-down period and starting period, does not also provide the relationship of suspend mode and business.
Summary of the invention
Node dormancy and business are not fully considered for existing wireless sensor network gateway node Poewr control method
The problems such as relationship bring performance improvement, node delay suspend mode, node delay unlatching, low complexity algorithm practical application, this hair
It is bright to propose a kind of wireless sensor network gateway node Poewr control method based on N strategy, comprehensively considering node dormancy and industry
The relationship of business increases node delay suspend mode, the practical problem that node delay is opened, assists low complex degree iterative algorithm, maximize
Wireless sensor network performance.
To solve the above problems, the technical solution adopted in the present invention is as follows:
A kind of wireless sensor network gateway node Poewr control method based on N strategy, comprising the following steps:
Step 1: scene description；
Consider the gateway node in a wireless sense network, is modeled as the Vacation Queue Model of a M/G/1, data packet
The Poisson distribution for obeying that parameter is λ is reached, an independent identically distributed general process is regarded in the packet forwarding of each data as, when service
Between note at B, be desired for hB, variance isWhen gateway node work, node is in the busy period, is denoted as B, is desired for hB, side
Difference isTransmission power is PON, definition closed-down period is D, is desired for hD, variance isTransmission power is PCD, define suspend mode
Phase is V, is desired for hV, variance isTransmission power is PSL, the definition starting period is S, is desired for hS, variance isHair
Penetrating power is PST, definitionWithRespectively indicate busy period, closed-down period, dormant period and the total Sojourn times of data packet
Between Laplace transform, closed-down period do not have data packet reach probability can be defined as suspend mode probabilityAccording to
The feature without memory of poisson arrival can obtain the length for the closed-down period that is effectively averaged:
Define the average length of time between at the time of two adjacent queues of E (C) expression are empty:Wherein: ρ=λ hB, ρS=λ hS, number
According to the Laplace transform of the average waiting time of packetIt can be expressed as:
Wherein s is Laplace operator, then inverse Laplace transformation, enables s=0, can obtain average waiting time:
Step 2: problem sums up；
Firstly, comprehensively considering the power situation in node each period, the mean power of gateway node is defined:
Then, this parameter of the index N of sleeping time is investigated, is derived corresponding to the energy consumption for fixed node most
Excellent sleeping time N*；
Step 3: the tradeoff formula of derived data packet average waiting time E (T) and node average energy consumption E (P), for referring to
Lead practical application；
Firstly, it is as follows to rewrite average waiting time:
It is as follows to continue rewriting mean power:
Eliminate suspend mode Probability pv, provide the tradeoff of data packet average waiting time E (T) Yu node average energy consumption E (P)
Formula:
Step 4: deriving optimal sleeping time N*Expression formula, for instructing practical application；
, theoretically there is a smallest time delay and total energy consumption, by optimal in the relevant parameter of given starting period distribution
Change method finds out this optimal solution N*:
This optimal solution N*Existing necessary condition is:
Further, comprising the following steps:
It is 0 that closed-down period, which is arranged, suspend mode Probability pvThe dormancy method of=1, N strategy is equivalent to the dormancy method of one 1 strategy:
hS=E [S]/N
Derive the mean power under the strategy are as follows:
Further, comprising the following steps:
It is 0 that closed-down period, which is arranged, talks about suspend mode Probability pvThe dormancy method of=1, N strategy is equivalent to the suspend mode side of one 1 strategy
Method:
hS=E [S]/N
Derive the average waiting time under the strategy:
Further, further comprising the steps of:
It is 0 that closed-down period, which is arranged, suspend mode Probability pvThe dormancy method of=1, N strategy is equivalent to the dormancy method of one 1 strategy:
hS=E [S]/N
Derive the tradeoff formula of average waiting time E (T) and node average energy consumption E (P) under the strategy:
Wherein:
Further, further comprising the steps of:
Derive the exact expression of the node average waiting time under N=1 situation:
Wherein:
The utility model has the advantages that
Compared to the prior art, the invention has the benefit that
(1) method that present invention difference extends node life cycle with previous wireless sensor network, weight of proceeding from the reality
Point research gateway node, proposes a kind of gateway node dormancy method of N strategy, comprehensively considers the relationship tool of node dormancy and business
There is the directive significance of reality；
(2) present invention is directed to special application scenarios, and source practical application, scene setting is careful, reasonable, more has practice to refer to
Lead meaning；
(3) present invention is from practical engineering application angle, after increasing the closed-down period and waking up nodes that consider node dormancy
The starting period that can start service, node power consumption is reduced again while guaranteeing service delay；
(4) the node dormancy method proposed by the invention based on N strategy, at the same N can according to the property of data packet from
Dynamic adjustment, it is more adaptable, by accurate mathematical computations and theory deduction, the optimal node sleep time is obtained, for referring to
Lead practice；
(5) a kind of method of the invention in order to be more advantageous to engineer application, and provide suboptimum, and mathematically derive
The relational expression of node power consumption and business residence time utilizes analysis network performance；
(6) present invention derives the variance characteristic of egress average waiting time, because in actual application process, we
Sometimes more can relational system maximum delay characteristic because this may will greatly affect the laser propagation effect of data；
(7) Poewr control method of the invention, algorithm design are reasonable, it is easy to accomplish.
Detailed description of the invention
Fig. 1 is present system scene framework schematic diagram.
Fig. 2 is gateway node dormancy period schematic diagram of the present invention.
Specific embodiment
In order to make the objectives, technical solutions, and advantages of the present invention clearer, with reference to the accompanying drawings and embodiments, right
The present invention is further elaborated.It should be appreciated that the specific embodiments described herein are merely illustrative of the present invention, and
It is not used in the restriction present invention.
Embodiment one
Step 1: scene description；
As shown in Figure 1, wireless sense network is made of numerous nodes, wherein most crucial hinge element is exactly gateway node,
Therefore, Yao Tigao network performance reduces system energy consumption, and most straightforward approach is exactly to study the dormancy strategy of gateway node.However,
Node dormancy then means no longer to work during suspend mode, is no longer participate in cooperation, and the data packet of arrival will be deposited in the slow of node
In depositing, it is detained for quite a long time, until node is waken up, devotes oneself to work again, but virtually increases data packet in this way
In the residence time of this node, and then influence whether the average delay of whole system.Present invention difference and previous wireless biography
Feel the method that network extends node life cycle, primary study gateway node of proceeding from the reality proposes a kind of gateway section of N strategy
Point dormancy method, the relationship for comprehensively considering node dormancy and business have real directive significance.
In other words, simultaneously energy saving is using the time delay of sacrificial system as cost to node dormancy.If reducing node
Energy consumption, then just will increase system average delay；Conversely, to increase node energy consumption, it can also improve the average delay of system.Cause
This, there is an urgent need to it is proposed that a kind of good strategy, is capable of the relationship of adjust automatically node energy consumption and average delay, different numbers
According to using cannot strategy, have better adaptability.
The present invention is directed to special application scenarios, and source practical application, scene setting is careful, reasonable, more there is practical advice
Meaning.It is contemplated that the gateway node in a wireless sense network, is modeled as the Vacation Queue Model of a M/G/1, data packet
Arrival obey parameter be λ Poisson distribution, each data packet forwarding (service) regard an independent identically distributed general mistake as
Journey, service time is remembered into B, is desired for hB, variance is
From practical engineering application angle, can start to take after increasing the closed-down period and waking up nodes that consider node dormancy
The starting period of business.As shown in Fig. 2, having data packet etc. pending in queue in other words when gateway node work (sending data packet)
When sending, node is in the busy period, because node is busy to also mean that data are serviced, the busy period is equivalent to service time, all remember
Make B, is desired for hB, variance isTransmission power is PON.Once queue is sky, do not have data to send in other words, it is traditional
Dormancy strategy is exactly suspend mode immediately, but in fact very unreasonable in this way.On the one hand, practical application is not met, when immediately closing needs
Between, it can also injure equipment itself；On the other hand, if could be used without the strategy of data suspend mode at once, because the arrival of data is
Poisson arrival has randomness, it is likely that data arrival is just had within next minimum period, and equipment is closed at this time
Service cannot be provided, in this case this data packet when postpone a meeting or conference it is very big, to also influence whether whole average delay.
Therefore, as an important innovative point of the invention, we define the closed-down period that can be adjusted ourselves, and study closing
Phase is the relationship of system average delay, has very important practical advice meaning.
Present invention difference and other dormancy strategies, using the strategy of time-delay closing, once it does not need to service in system
Data, do not immediately close off service, but wait for a period of time, this period is exactly closed-down period.Definition closed-down period is D,
It is desired for hD, variance isTransmission power is PCD.If not new data reach and require to service in closed-down period, system into
Enter dormant period；If there are new data to reach in closed-down period and requiring to service, the system phase down phase, the period of service is reentered,
Continue to service, sends data packet.How the gateway node in sleep period to be waken up, depends on it is using which kind of wake-up strategy, often
Seeing has Single Vacation strategy and Multiple Vacations strategy.Single Vacation strategy refers to, gateway node with one pre-set consolidate
It fixes time and has a holiday, this strategy is the simplest, does not also need to monitor whether that there are also business to reach during the absence of, but reduces
The effect of energy consumption is limited.Multiple Vacations strategy is improved on the basis of Single Vacation strategy, if once having a holiday end,
It is to be sent without data packet inside node queue, then node will continue to have a holiday, energy consumption is greatly reduced in this way, still
Also increase average delay.In practical application, we generally require the compromise for reaching energy consumption and average delay, and need energy
The difference enough required for different data packet service delay adjusts Energy Saving Strategy, the energy consumption reducing effect being optimal.Therefore,
We select a kind of node dormancy strategy based on N strategy, after node enters dormant period, only as of the data packet in queue
After number reaches pre-set quantity N, node can be just waken up, because the numerical value of N can be easily modified, this
Algorithm flexibility ratio is very high, can easily realize the compromise of energy consumption and average delay.
Likewise, difference and other node dormancy strategies, from practical engineering application angle, our defining nodes from
After sleep period is waken up, it could formally enter the busy period by a starting period.This is obviously more in line with reality, and different
Node situation is different, and the starting period is also inconsistent, can more simulate actual system behavior.Definition dormant period is V, is desired for hV, side
Difference isTransmission power is PSL.The definition starting period is S, is desired for hS, variance isTransmission power is PST。
In order to be more convenient it is the performances such as expectation and the variance for analyzing average delay below, we are defined
WithRespectively indicate busy period, closed-down period, the Laplace transform of dormant period and data packet total residence time.In this case, exist
The probability that closed-down period does not have data packet to reach can be defined as
In fact, pvAlso the probability that node is jumped to dormant period by closed-down period is represent, we are defined as suspend mode probability.Root
According to the feature without memory of poisson arrival, we can obtain the length for the closed-down period that is effectively averaged:
The average length E (C) of a circulation defined below indicates being averaged between at the time of two adjacent queues are empty
Time span:
Wherein: ρ=λ hB, ρS=λ hS。
Next, the Laplace transform of the average waiting time of our data packetsIt is had a holiday according to classical
Theory, residence time should the times including the waiting time of data packet in the queue and data coating service.
Inverse Laplace transformation is carried out to formula (2), enables s=0, while combinatorial formula (1), we can obtain averagely funny
Stay the time:
According to the decomposition theorem in classical queuing theory, the first two section in formula (5) is the warp without vacation policy
Average latency in allusion quotation queuing theory M/G/1 model, third part are the additional time delay considered after vacation policy, this part
It is the object of our primary studies.
Step 2: problem sums up；
For the energy saving dormancy strategy of gateway node described in step 1, we are to acquisition node energy consumption and mean time
The performance compromise prolonged, it is necessary to which the parameter of node energy consumption and average delay is investigated in definition.
Comprehensively consider the power situation in node each period, we can define the mean power of gateway node:
The mean power E (P) of this gateway node be investigate system energy efficiency a core index, behind we examined with it
The tradeoff of energy consumption and time delay is examined, the compromise of derived data packet average waiting time E (T) and node average energy consumption E (P) are attempted
Relational expression.
For the average delay parameter of system, data packet average waiting time defined in step 1 is an important parameter,
Because of present invention difference and other dormancy strategies, the probability of closed-down period is proposed, the length setting of closed-down period also influences whether data
Packet average delay, and then influence node average energy consumption.
In addition, the performance compromise in order to preferably accomplish adjustment node energy consumption and average delay, we investigate sleeping time
Index: this parameter of N, it is intended to derive sleeping time N optimal corresponding to the energy consumption for fixed node*。
Step 3: the tradeoff formula of derived data packet average waiting time E (T) and node average energy consumption E (P), for referring to
Lead practical application；
Firstly, we to rewrite formula (5) as follows:
Observation can learn that E (T) is suspend mode Probability pvMonotone increasing convex function, give a closed-down period distribution, when
The expectation h of closed-down periodDWhen increase, suspend mode Probability pvReduce, average waiting time E (T) also and then reduces.In other words, average funny
Staying time E (T) is closed-down period expectation hDMonotonic decreasing function.
Formula (3) is updated to formula (6) for we and abbreviation can obtain:
It can be found that average energy consumption E (P) is suspend mode Probability pvMonotonic decreasing function, be closed-down period expectation hDDullness pass
Increasing function.
Suspend mode Probability p is eliminated below with formula (7) and formula (8)v, provide data packet average waiting time E (T) and section
The tradeoff formula of point average energy consumption E (P):
We can use the compromise that formula (9) intuitively sees average waiting time E (T) Yu node average energy consumption E (P)
Relationship, and engineer application is instructed accordingly.The present invention is in order to be more advantageous to engineer application, and a kind of method for providing suboptimum, is used in combination
Mathematical method derives the relational expression of node power consumption and business residence time, utilizes analysis network performance.
Step 4: deriving optimal sleeping time N*Expression formula, for instructing practical application；
Node dormancy method based on N strategy of the invention, N are can voluntarily to be adjusted according to Packet Delay degrees of tolerance
Parameter, in fact, N is exactly the control parameter of node dormancy time.According to the adjustment of N, suitable dormancy time is obtained,
So as to adjust the energy consumption of system.
By analysis, the relevant parameter of starting period distribution is given, theoretically there is a smallest time delay and total energy consumption,
By optimal method, we can find out this optimal solution N*:
It is emphasized that this optimal solution N*Existing condition is to meet:
This optimal solution N is explained further*Physical significance, as N > N*When, it is necessary to node dormancy strategy is used, and is worked as
N≤N*When, it does not need using node dormancy strategy.Node dormancy method based on N strategy proposed by the invention, while N can
It is more adaptable with according to the property adjust automatically of data packet, by accurate mathematical computations and theory deduction, obtain optimal
The node sleep time is used for Guiding Practice.
Embodiment two
A kind of method that the present embodiment proposes suboptimum simplifies mathematical expression book, is more advantageous to practical implementation.
Specifically, it is 0 that closed-down period, which is arranged, in we, such words suspend mode Probability pv=1.It is proposed that N strategy stop
Dormancy method is equivalent to the dormancy method of one 1 strategy, under this special case:
hS=E [S]/N (12)
We can derive the mean power under the hypothesis:
Likewise, we can derive the average waiting time under the hypothesis:
Further, our combinatorial formulas (13) and formula (14), can obtain average waiting time E (T) under the hypothesis
With the tradeoff formula of node average energy consumption E (P):
Wherein:
Embodiment three
In actual application process, we sometimes more can relational system maximum delay characteristic because this may
It will greatly affect the laser propagation effect of data, therefore, the present embodiment puts forth effort on the variance for attempting to derive node average waiting time
Characteristic.
We use inverse Laplace transformation to formula (4), attempt the variance characteristic for deriving node average waiting time, by
Accurate mathematic(al) representation cannot be provided in excessively complexity.Fortunately we can derive that the node under N=1 situation is average
The exact expression of residence time, for judging the performance of node, Guiding Practice.
Wherein:The variance that the present invention derives egress average waiting time is special
Property because in actual application process, we sometimes more can relational system maximum delay characteristic because this may
The laser propagation effect of strong influence data.
The foregoing is merely illustrative of the preferred embodiments of the present invention, is not intended to limit the invention, all in essence of the invention
Made any modifications, equivalent replacements, and improvements etc., should all be included in the protection scope of the present invention within mind and principle.
Claims (5)
1. a kind of wireless sensor network gateway node Poewr control method based on N strategy, which is characterized in that including following step
It is rapid:
Step 1: scene description；
Consider the gateway node in a wireless sense network, is modeled as the Vacation Queue Model of a M/G/1, the arrival of data packet
The Poisson distribution that parameter is λ is obeyed, an independent identically distributed general process, service time note are regarded in the packet forwarding of each data as
At B, it is desired for hB, variance isWhen gateway node work, node is in the busy period, is denoted as B, is desired for hB, variance isTransmission power is PON, definition closed-down period is D, is desired for hD, variance isTransmission power is PCD, define dormant period be
V is desired for hV, variance isTransmission power is PSL, the definition starting period is S, is desired for hS, variance isTransmission power
For PST, definitionWithRespectively indicate busy period, closed-down period, the drawing of dormant period and data packet total residence time
Laplace transform can be defined as suspend mode probability in the probability that closed-down period does not have data packet to reachIt is arrived according to Poisson
The feature without memory reached can obtain the length for the closed-down period that is effectively averaged:
Define the average length of time between at the time of two adjacent queues of E (C) expression are empty:Wherein: ρ=λ hB, ρS=λ hS, number
According to the Laplace transform of the average waiting time of packetIt can be expressed as:
Wherein s is Laplace operator, then inverse Laplace transformation, enables s=0, can obtain average waiting time:
Step 2: problem sums up；
Firstly, comprehensively considering the power situation in node each period, the mean power of gateway node is defined:
Then, this parameter of the index N of sleeping time is investigated, is derived optimal corresponding to the energy consumption for fixed node
Sleeping time N*；
Step 3: the tradeoff formula of derived data packet average waiting time E (T) and node average energy consumption E (P), for instructing reality
Border application；
Firstly, it is as follows to rewrite average waiting time:
It is as follows to continue rewriting mean power:
Eliminate suspend mode Probability pv, provide the tradeoff formula of data packet average waiting time E (T) Yu node average energy consumption E (P):
Step 4: deriving optimal sleeping time N*Expression formula, for instructing practical application；
, theoretically there is a smallest time delay and total energy consumption, by optimization side in the relevant parameter of given starting period distribution
Method finds out this optimal solution N*:
This optimal solution N*Existing necessary condition is:
2. gateway node Poewr control method according to claim 1, which comprises the following steps:
It is 0 that closed-down period, which is arranged, suspend mode Probability pvThe dormancy method of=1, N strategy is equivalent to the dormancy method of one 1 strategy:
hS=E [S]/N
Derive the mean power under the strategy are as follows:
3. gateway node Poewr control method according to claim 1, which comprises the following steps:
It is 0 that closed-down period, which is arranged, talks about suspend mode Probability pvThe dormancy method of=1, N strategy is equivalent to the dormancy method of one 1 strategy:
hS=E [S]/N
Derive the average waiting time under the strategy:
4. gateway node Poewr control method according to claim 1, which is characterized in that further comprising the steps of:
It is 0 that closed-down period, which is arranged, suspend mode Probability pvThe dormancy method of=1, N strategy is equivalent to the dormancy method of one 1 strategy:
hS=E [S]/N
Derive the tradeoff formula of average waiting time E (T) and node average energy consumption E (P) under the strategy:
Wherein:
5. gateway node Poewr control method according to claim 1, which is characterized in that further comprising the steps of:
Derive the exact expression of the node average waiting time under N=1 situation:
Wherein:
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610662291.XA CN106131879B (en) | 2016-08-12 | 2016-08-12 | Wireless sensor network gateway node Poewr control method based on N strategy |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610662291.XA CN106131879B (en) | 2016-08-12 | 2016-08-12 | Wireless sensor network gateway node Poewr control method based on N strategy |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN106131879A CN106131879A (en) | 2016-11-16 |
| CN106131879B true CN106131879B (en) | 2019-10-18 |
Family
ID=57258205
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201610662291.XA Active CN106131879B (en) | 2016-08-12 | 2016-08-12 | Wireless sensor network gateway node Poewr control method based on N strategy |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN106131879B (en) |
Families Citing this family (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108390737B (en) * | 2018-01-30 | 2020-10-16 | 西安电子科技大学 | Single satellite link performance analysis method based on intermittent service capability model |
| CN111130414B (en) * | 2020-01-03 | 2021-09-14 | 沈机（上海）智能系统研发设计有限公司 | Motor average current smoothing method and system and motor current sampling equipment |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102781027A (en) * | 2012-07-18 | 2012-11-14 | 上海大学 | Intelligent processing method for abnormal gateway in network activity period of wireless sensor |
| CN103945511A (en) * | 2014-04-09 | 2014-07-23 | 周开宇 | Control method and sensor node with sensors turned on and off in time-sharing mode |
| CN103987055A (en) * | 2014-05-27 | 2014-08-13 | 北京农业信息技术研究中心 | Wireless sensor network node deployment and power supply method |
| CN104038997A (en) * | 2014-06-25 | 2014-09-10 | 中国电子科技集团公司第七研究所 | Method and system for activating energy efficiency of wireless sensor network nodes |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US9172517B2 (en) * | 2013-06-04 | 2015-10-27 | Texas Instruments Incorporated | Network power optimization via white lists |
-
2016
- 2016-08-12 CN CN201610662291.XA patent/CN106131879B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102781027A (en) * | 2012-07-18 | 2012-11-14 | 上海大学 | Intelligent processing method for abnormal gateway in network activity period of wireless sensor |
| CN103945511A (en) * | 2014-04-09 | 2014-07-23 | 周开宇 | Control method and sensor node with sensors turned on and off in time-sharing mode |
| CN103987055A (en) * | 2014-05-27 | 2014-08-13 | 北京农业信息技术研究中心 | Wireless sensor network node deployment and power supply method |
| CN104038997A (en) * | 2014-06-25 | 2014-09-10 | 中国电子科技集团公司第七研究所 | Method and system for activating energy efficiency of wireless sensor network nodes |
Also Published As
| Publication number | Publication date |
|---|---|
| CN106131879A (en) | 2016-11-16 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Liu et al. | Toward QoI and energy-efficiency in Internet-of-Things sensory environments | |
| Cao et al. | Swarm intelligence-based performance optimization for mobile wireless sensor networks: survey, challenges, and future directions | |
| Qiu et al. | A packet buffer evaluation method exploiting queueing theory for wireless sensor networks | |
| Jiang et al. | Design strategy for optimizing power consumption of sensor node with Min (N, T) policy M/G/1 queuing models | |
| Rashed et al. | CBHRP: A cluster based routing protocol for wireless sensor network | |
| John et al. | Energy saving cluster head selection in wireless sensor networks for internet of things applications | |
| CN106131879B (en) | Wireless sensor network gateway node Poewr control method based on N strategy | |
| CN103702384B (en) | Application-oriented clustering routing method of wireless sensor network | |
| CN102833812B (en) | Hybrid service-oriented wireless sensor network energy effective access method | |
| Prakash et al. | Energy and congestion-aware load balanced multi-path routing for wireless sensor networks in ambient environments | |
| Zhang et al. | Maximum throughput under admission control with unknown queue-length in wireless sensor networks | |
| Chang et al. | Slot assignment for TDMA MAC in industrial wireless sensor network | |
| Jiang et al. | Design framework to optimize power consumption and latency delay for sensor nodes using min (N, T) policy M/G/1 queuing models | |
| CN106211291A (en) | Radio sensing network gateway node Poewr control method based on Multiple Vacations | |
| Zhu et al. | A mobile agent-based clustering data fusion algorithm in wsn | |
| CN103402276A (en) | System and method for efficiently transmitting mass sensing data of internet of things | |
| Zebbane et al. | Exploiting node redundancy for maximizing wireless sensor network lifetime | |
| Navimipour | Control the Topology and Increase the Tolerance of Heterogeneous Wireless Sensor Networks. | |
| Barat et al. | Energy management in a cooperative energy harvesting wireless sensor network | |
| Okhovvat et al. | Joint time and energy-optimal approach to allocate task to actors in wireless sensor actor networks | |
| Lu et al. | ASHEED: Attention-shifting mechanism for depolarization of cluster head energy consumption in the smart sensing system | |
| Zheng et al. | Tradeoff between utility and lifetime in energy-constrained wireless sensor networks | |
| Zuo et al. | Energy-efficient low-delay TDMA scheduling algorithm for industrial wireless mesh networks | |
| Liu et al. | Optimal power consumption control of sensor node based on (N, D)-policy discrete-time queues | |
| Udenze | SMDP-MAC: Event driven Media Access Control for Wireless 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 | ||
| TA01 | Transfer of patent application right | ||
| TA01 | Transfer of patent application right |
Effective date of registration: 20190919 Address after: Park Road in Jiangning District of Nanjing city and Jiangsu province 210000 No. 18 Applicant after: Nanjing Nanyou Network Technology Co., Ltd. Address before: 241000 Anhui Province, Wuhu city Jinghu District Jinghu green century city residence of Eaton 3-2-1602 Applicant before: Liang Guang Jun |
|
| GR01 | Patent grant | ||
| GR01 | Patent grant |