CN107197534A - A kind of ALOHA Protocol Design Methods collected suitable for environmental energy - Google Patents
A kind of ALOHA Protocol Design Methods collected suitable for environmental energy Download PDFInfo
- Publication number
- CN107197534A CN107197534A CN201710330247.3A CN201710330247A CN107197534A CN 107197534 A CN107197534 A CN 107197534A CN 201710330247 A CN201710330247 A CN 201710330247A CN 107197534 A CN107197534 A CN 107197534A
- Authority
- CN
- China
- Prior art keywords
- mrow
- msub
- sensor node
- neighbours
- 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.)
- Pending
Links
- 238000000034 method Methods 0.000 title claims abstract description 20
- 230000007613 environmental effect Effects 0.000 title claims abstract description 12
- 238000013461 design Methods 0.000 title claims abstract description 11
- 230000000694 effects Effects 0.000 claims description 7
- 230000008569 process Effects 0.000 claims description 7
- 230000005540 biological transmission Effects 0.000 description 12
- 101100172132 Mus musculus Eif3a gene Proteins 0.000 description 7
- 230000008859 change Effects 0.000 description 5
- 238000005516 engineering process Methods 0.000 description 4
- 230000007246 mechanism Effects 0.000 description 3
- 108700026140 MAC combination Proteins 0.000 description 2
- 238000009825 accumulation Methods 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 230000004044 response Effects 0.000 description 2
- 238000004088 simulation Methods 0.000 description 2
- 241000208340 Araliaceae Species 0.000 description 1
- 235000005035 Panax pseudoginseng ssp. pseudoginseng Nutrition 0.000 description 1
- 235000003140 Panax quinquefolius Nutrition 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000008901 benefit Effects 0.000 description 1
- 230000015556 catabolic process Effects 0.000 description 1
- 238000004891 communication Methods 0.000 description 1
- 238000006731 degradation reaction Methods 0.000 description 1
- 238000010586 diagram Methods 0.000 description 1
- 230000004069 differentiation Effects 0.000 description 1
- 235000013399 edible fruits Nutrition 0.000 description 1
- 238000005265 energy consumption Methods 0.000 description 1
- 235000008434 ginseng Nutrition 0.000 description 1
- 238000005259 measurement Methods 0.000 description 1
- 238000011160 research Methods 0.000 description 1
- 239000000523 sample Substances 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
- 230000009897 systematic effect Effects 0.000 description 1
- 238000012546 transfer Methods 0.000 description 1
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W74/00—Wireless channel access
- H04W74/08—Non-scheduled access, e.g. ALOHA
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W84/00—Network topologies
- H04W84/18—Self-organising networks, e.g. ad-hoc networks or sensor networks
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 ALOHA Protocol Design Methods collected suitable for environmental energy, is specially：Neighbours sensor node of the sink node broadcasts message to surrounding, the message includes contention probability；Active neighbours' sensor node is received after message, and a random number x between [0,1] is just generated at random；If x is less than contention probability, packet is sent；Otherwise, continue to keep reception state；By using Bayesian formula, sink nodes utilize the result of poll for several times, thus it is speculated that gone out the most probable active neighbours' sensor node number existed around sink nodes, so as to obtain the contention probability of agreement, network can have been made to reach optimum performance；It is also more fair with higher handling capacity simultaneously compared to other agreements, and reduce time delay.
Description
Technical field
The invention belongs to technology of wireless sensing network field, ALOHA Protocol Designs are more particularly to collected based on environmental energy
Method.
Background technology
ALOHA agreements are divided into CDMA slotted ALOHA and pure ALOHA two types.
(1) CDMA slotted ALOHA.
All nodes in network are slot synchronizations, and when some node has new packet to send, it can wait until next
Individual time slot starts and in the slot transmission.
If do not collided, the node is successfully transferred its packet, it is not necessary to consider to retransmit., should in the event of colliding
Node detects current collision after time slot terminates, and is retransmitted in follow-up each time slot with Probability p, until this
Packet is transferred out without collision.
(2) pure ALOHA
When some node has packets to send for the first time, send immediately.If producing collision, retransmitted with Probability p, with
Probability 1-p waits a time slot (the time required to one packet of transmission).Hereafter all with the next packet of Probability p transmission, or with
Probability 1-p waits next time slot.
Probability polling protocol
In the past based on proposing a kind of probability wheel in the research of the MAC protocol for wireless sensor networks of collection of energy in environment
Agreement is ask, specific protocol procedures are：It is not as poll in sensor node of the sink node broadcasts message to surrounding, this message
Agreement equally include some specific node ID number, but inform surrounding sensor node they can send the general of data
Rate, referred to as contention Probability pc.Active sensor node is received after probability poll groupings, and just random generation one is between [0,1]
Random number x.If x ＜ pc, then packet is sent；Otherwise, it may proceed to keep reception state, unless its dump energy connects
The power consumption of activity periods is all not enough to support.
This agreement is more like the modified version of CDMA slotted ALOHA agreement, is at least divided according to major class, this agreement belongs to random
Access protocol.And the optimal contention Probability p of maximize handling capacity is analyzed in probability polling protocolc=1/Nactive, wherein
NactiveIt is neighbor node quantity active around sink nodes, this conclusion reaches that maximal efficiency will expire with above CDMA slotted ALOHA
Sufficient is consistent.Z.A.Eu et al. is successively in the single-hop dynamic contention probability different with proposing two kinds under multi-hop WSNs scenes
Adjusted Option, to realize that the probability included in the packet that sink nodes are sent is exactly pc=1/Nactive：
" 1. and formula increase product formula is reduced " (Additive-Increase Multiplicative-Decrease, AIMD)：
Utilize plin(" and the formula increase " factor) and pmd(" the product formula is reduced " factor) is come to contention Probability pcIt is adjusted, what they studied
It is to work as p that scene, which is drawn a conclusion,lin=0.01 and pmdWhen=0.5, network has highest handling capacity.
2.ENAN：In the agreement of follow-up multi-hop version, p is utilizedc=1/nest,nest>=1 adjusts contention probability, wherein
nestIt is the active neighbor number (Estimated Number of Active Neighbors, ENAN) of sink nodes estimation.If
Adjacent node is in active state and can respond poll groupings, then it is assumed that it is active neighbor node.Node is only needed to
Estimation enlivens the quantity of neighbours, without knowing their identity, it is not required that being found with the big neighbours of energy expenditure
Mechanism.N in i-th of poll groupingsestValue depends on the result of (i-1) individual poll groupings：If just what a node rings
Should, nestKeep constant；If multiple active neighbors are responded, nestPlus 1, because it may be underestimated；If without node
Response, nestSubtract 1 (minimum value is 1), because it may be overestimated.Packet transmission result grader can be used for differentiation be by
In the bad caused packet loss of conflict or channel condition.
But two kinds of contention probability Adjusted Options are all too definitely in above-mentioned probability polling protocol, sink nodes can be because of certain
The conflict or idle just to p of one time slotcIt is adjusted.Even surrounding live-vertex number never became, pcCan not be correct
Ground converges to 1/Nactive, but ceaselessly fluctuating.
As seen from Figure 1 when the sensor node number of surrounding is more than or equal to 2, adjusted using above two contention probability
Perfect square case, an optimal pcThe probability for having more than 50% is no longer optimal in poll next time.With nodes convergence without
Thoroughly, this probability levels off to 1-1/e=0.632.
The content of the invention
The present invention is in order to solve the above technical problems, propose a kind of ALOHA Protocol Designs collected suitable for environmental energy
Method, the sending probability of each node is still determined by sink nodes；But active neighbours' sensor section around sink nodes
Points estimate that sink nodes speculate enlivening for surrounding most probable presence using the result of poll for several times using Bayesian formula
Neighbours' sensor node number, using active neighbours' sensor node number inverse be used as the sending probability in next message.
The technical solution adopted by the present invention is：A kind of ALOHA Protocol Design Methods collected suitable for environmental energy, specifically
For：Neighbours sensor node of the sink node broadcasts message to surrounding, the message includes contention probability；Active neighbours' sensing
Device node is received after message, and a random number x between [0,1] is just generated at random；If x is less than contention probability, data are sent
Packet；Otherwise, continue to keep reception state；
The inverse of active neighbours' sensor node number is used as the contention probability in message next time；
Active neighbours' sensor node number utilizes the knot of poll for several times by using Bayesian formula, sink nodes
Fruit determines.
Further, the determination process of active neighbours' sensor node number comprises the following steps：
If there are n active neighbours' sensor nodes around A1, sink node, the broadcasting packet of sink nodes is received
Afterwards, the probability that all active neighbours' sensor nodes do not send data is：
pidle=(1-pc)n
A2, set event AnN active neighbours' sensor nodes are indicated, event B represents that Num poll has NumidleIt is secondary
Free time, then have：
A3, by Bayesian formula, have：
A4、P(An| B) the n values corresponding to maximum are exactly the active neighbours' sensor node existed around sink nodes
Number.
Further, in addition to：When the energy of sensor node is not enough to the power consumption of activity periods of support, sensing
Device node enters charged state.
Beneficial effects of the present invention：The ALOHA agreements of suitable environment collection of energy proposed by the present invention；By using pattra leaves
This formula, sink nodes utilize the result of poll for several times, thus it is speculated that gone out around sink nodes the most probable live-vertex existed
Number, the contention probability of ALOHA agreements, can make network reach optimum performance obtained from；Simultaneously compared to other agreements, have
Higher handling capacity, it is also more fair, and reduce time delay.
Brief description of the drawings
Fig. 1 is optimal contention Probability p to be provided in an embodiment of the present inventioncAdjustment probability afterwards；
Fig. 2 is the topological schematic diagrames of the WSNs provided in an embodiment of the present invention based on collection of energy in environment；
Fig. 3 is handling capacity when node number provided in an embodiment of the present invention changes；
Fig. 4 is fairness when node number provided in an embodiment of the present invention changes；
Arrival time interval between packet when Fig. 5 is node number provided in an embodiment of the present invention change；
Fig. 6 is handling capacity when collection of energy speed provided in an embodiment of the present invention changes；
Fig. 7 is fairness when collection of energy speed provided in an embodiment of the present invention changes；
Arrival time interval between packet when Fig. 8 is collection of energy speed provided in an embodiment of the present invention change.
Embodiment
For ease of skilled artisan understands that the technology contents of the present invention, enter one to present invention below in conjunction with the accompanying drawings
Step explaination.
For ease of understanding, network model of the present embodiment based on following single-hop is illustrated to the technology contents of the present invention.
Energy accumulation model
Due to the inefficiency of collection of energy, using existing energy harvester, wireless sensor node far can not be met
Energy consumption during point work.Therefore, collection of energy sensor node has two states in each environment：
(i) charge：Node is without any operation in this condition, the energy that only accumulation storage is collected into；
(ii) it is active：In this state, node stores enough energy, can normally carry out transmitting-receiving operation, together
Shi Jixu collects energy from environment.
The application continues to use a kind of simple management scheme, as long as that is, node has enough ENERGY Esthreshold, can be with
Enliven duration tactive, node shifts to active state, and it enters charged state again afterwards.
The energy of required storage is referred to as energy threshold, can be expressed as Ethreshold=max (Prx,Ptx)tactive, wherein Ptx
And PrxIt is reception, the transmission power of node, t respectivelyactiveIt is to enliven duration in each wake-up period, t can be expressed asactive
=nindexttx, wherein ttxIt is grouped transmission time, nindexIt is n in systematic parameter, the present embodimentindexIt is set to 20.
Topological structure
Network topology structure：As shown in Fig. 2 being single-hop Star Network, a sink node and N number of sensor section are included
Point, each sensor node can be with sink node direct communications；
Sink nodes：Powered by power line, be the tidal data recovering point of network；
Sensor node：Each node possesses collection of energy and store function, and energy comes from the energy in environment.Institute
The data transfer for having node has identical priority.
The present invention proposes a kind of ALOHA Protocol Design Methods collected suitable for environmental energy, wherein the hair of each node
Probability is sent still to be determined by sink nodes.The fact that powered based on sink nodes by power line, it can hold as much as possible
Carry on a shoulder pole the energy expense of network.But active neighbours' sensor node number is estimated using Bayesian formula around sink nodes,
Sink nodes speculate active neighbours' sensor node number that surrounding most probable is present using the result of poll for several times, will be active
Neighbours' sensing node number inverse be used as the sending probability in next message；The technical scheme of the application is：A kind of applicable ring
The ALOHA agreements of border collection of energy, be specially：Neighbours sensor node of the sink node broadcasts message to surrounding, the message
Including contention probability；Active neighbours' sensor node is received after broadcasting packet, and just random generation one is between the random of [0,1]
Number x；If x is less than contention probability, packet is sent；Otherwise, continue to keep reception state；When sensor node energy not
When being enough to support the power consumption of activity periods, the sensor node enters charged state.
The inverse of active neighbours' sensor node sum is used as the contention probability in message next time around sink nodes；
Active neighbours' sensor node sum is by using Bayesian formula, and sink nodes utilize poll for several times
As a result determine；Specially：
For the handling capacity of maximization network, sink nodes wish to speculate as precisely as possible neighbours' sensing active around
Device nodes, the present invention uses Bayesian formula, and sink nodes speculate that surrounding most probable is present using the result of poll for several times
Active neighbor node number, can reach effect well in the case where surrounding neighbours sensor node number is more stable.
For convenience, it is assumed that Num contention probability of sink node statistics is pcTransmission process, without sensing
The number of times of device node response (i.e. channel idle) is Numidle.Initial time, sink nodes are for surrounding neighbours sensor node
The priori of number is that nodes are being uniformly distributed for [0, N], and wherein N is number of probes all around.
Consider that certain once sends situation, if n neighbours' sensor node is active, receive the broadcasting packet of sink nodes
Afterwards, the probability that all active neighbours' sensor nodes do not send data is：
pidle=(1-pc)n (1)
If event AnN active neighbours' sensor nodes are indicated, event B represents that Num poll has NumidleSecondary sky
In the spare time, have in theory：
By Bayesian formula, have：
Can be in the hope of the active most probable value of neighbours' sensor node number, i.e. P (A by formula (3)n| B) it is maximum
When, corresponding n values are exactly the most probable value of neighbours' sensor node number active around sink nodes；According to the n of determination
It is worth to the p in broadcasting packet next timec=1/n.
Below by way of selecting a small amount of number of nodes to be enumerated, to prove the validity of the application method.Assuming that
Sink nodes surroundings nodes sum is 10, has that several active neighbours' sensor nodes are unknown, what sink nodes were sent first strives
Use Probability pc=1/10.
If surrounding really enlivens neighbours' sensor node number for n, n ∈ [1,10], initial time, sink node broadcasts
Contention probability is 1/10, i.e., each node is sent with 1/10 probability, because collection of energy speed is a slow change in environment
The process of change, and the activity periods of sensor node are in millisecond rank, so assuming that statistics is transmitted across for 100 times in the present embodiment
Journey, in the process it is considered that surroundings nodes number is relatively stable.Similarly the present processes are equally applicable to multihop network
Scape, the method that each sink nodes are proposed according to the application is estimated to enliven the quantity of neighbor node around oneself, so as to obtain down
Contention probability in one message.
100 transmission process are emulated by matlab, the number of times for counting idle is as shown in table 1.
The idle number of times of the corresponding statistics of the node actual number of table 1
| Node actual number | The idle number of times of statistics |
| 1 | 91 |
| 2 | 83 |
| 3 | 77 |
| 4 | 61 |
| 5 | 64 |
| 6 | 58 |
| 7 | 40 |
| 8 | 45 |
| 9 | 39 |
| 10 | 34 |
The present invention wants that the effect reached is, it is unknown enliven neighbours' sensor node actual number in the case of, statistics
100 times transmission results, speculated by this result it is most probable around enliven neighbor node number, that is, enliven estimating for neighbor node
Count.
So that idle number of times is 91 as an example：
Consider a certain poll, if n neighbor node is active, n ∈ [1,10] receive the broadcasting packet of sink nodes
Afterwards, the probability that all nodes do not send data is：
pidle=(1-pc)n (4)
In the case of listing 10 kinds of node numbers according to above formula, the probability for once sending the free time is as shown in table 2, i.e., all sections
The data that point is not sent in the probability of data, table 2 round up reservation two-decimal：
The corresponding probability for once sending the free time of the live-vertex number of table 2
| Live-vertex number | Once send the Probability p of free timeidle |
| 1 | 0.90 |
| 2 | 0.81 |
| 3 | 0.73 |
| 4 | 0.66 |
| 5 | 0.59 |
| 6 | 0.53 |
| 7 | 0.48 |
| 8 | 0.43 |
| 9 | 0.39 |
| 10 | 0.35 |
If event AnIndicate that n are enlivened neighbor node, event B represents that Num poll has NumidleThe secondary free time, have：
By Bayesian formula, have：
According to formula above, calculate and obtain statistics 100 times, in the case of having 91 idle generations, node number correspondence
Estimated accurate probability it is as shown in table 3：
The corresponding estimated accurate probability of the node number of table 3
Obviously, most probable situation can be selected, that is, thinks that around active nodes only have 1.And according to priori statistical
The actual conditions of information, the active node number of surrounding is 1 really.
It is expected that process is not described in detail one by one, can be according to statistical result come estimated live-vertex number such as table 4 according to above-mentioned analysis
It is shown：
Table 4 is according to statistical result come estimated live-vertex number
| Node actual number | The idle number of times of statistics | It is expected that node number |
| 1 | 91 | 1 |
| 2 | 83 | 2 |
| 3 | 77 | 3 |
| 4 | 61 | 5 |
| 5 | 64 | 4 |
| 6 | 58 | 5 |
| 7 | 40 | 9 |
| 8 | 45 | 8 |
| 9 | 39 | 9 |
| 10 | 34 | 10 |
As seen from the above table, in the case of 10 kinds of nodes, 6 kinds all predict accurately, in prediction not exclusively correct situation,
Also it is more or less the same with actual neighbors node number.Understand that the contention probability Adjusted Option of the application is effective and feasible by demonstration
's.
Illustrate advantage of the technical scheme compared to other agreements below by way of MATLAB emulation.
Assuming that sink nodes receive the packet rate from neighbor node i for Ri, handling capacity refers to sink nodes and receives number
According to the speed of bag：
Fairness is using the fair exponential metrics of Jain's.
Fair index F is between 0 to 1.If the speed R of each sensor nodeiIt is identical, then F=1；If only
There is a neighbor node to send packet to sink nodes, then as N → ∞, F → 0.
Multiply the N number of EH sensor nodes of random placement, a sink node on 500 meters of region at 500 meters.Each data point
Group (sd) size be 100 bytes, poll groupings (sp) and confirm to be grouped (sack) it is 15 bytes.The transmission speed of sensor node
Rate (α) is 250kbps.
With reference to the tables of data and measurement experience of business energy harvester, average energy yield rate (λ) is changed to from 1mW
10mW.Power is 72.6mW (P when node receives datarx), transmission data power is 83.7mW (Ptx), table 5 summarizes emulation ginseng
Number.Each data point in simulation result of the present invention, is all to be obtained with different seeds by the emulation of 10 times 100 seconds.
MAC protocol simulation parameter table of the table 5 based on the WSNs of collection of energy in environment
When collection of energy rate is fixed as 2mW, the quantity of nodes is from when changing to 200 for 10, and five kinds of agreements are corresponding
Interval is respectively as shown in Fig. 3, Fig. 4, Fig. 5 arrival time between handling capacity, fairness and packet.
The handling capacity of CSMA agreements declines with the increase of nodes on the contrary after nodes are more than 60.Reason is when section
During points increase, the nodes increase of competition is participated in a time slot, and agreement does not have design conflicts avoidance mechanism, so that
Collision aggravation, the throughput degradation of network.Make the collection of energy speed of each node equal during due to emulation, so working as network
When nodes are more, there are some nodes synchronously to be charged, sent all the time, so that these nodes can not be sent always
Data, causing the fairness of agreement reduces.
The throughput ratio CSMA agreements of CSMA/CA agreements are high, because it adds collision avoidance mechanism, when there is great deal of nodes
In the presence of, conflict can be reduced by back-off scheme.And once node listens to channel busy and is put into charged state, reduce
Intercept the energy of channel consumption.But when nodes increase, fairness drastically declines, reason is that back off exponent maximum is
The rollback duration longer than other nodes has been arrived in+∞, some node random selections, and data transmission can not be carried out always.
The handling capacity of polling protocol does not just change substantially after nodes are more than 20, and handling capacity is always most
Small.Because the node most of the time, all in charged state, the time in reception state is very short, is selected at random during poll
The ID of node is selected, the node is very low just at the probability of reception state.
For probability polling protocol, handling capacity is just slightly below CSMA/CA, but than above-mentioned three kinds of MAC protocols fairness all
More preferably.
And proposed in the present invention it is a kind of suitable for environmental energy collect ALOHA agreements compared to other all agreements,
It is also more fair with higher handling capacity.Reason is that sink nodes pass through multiple statistical information, thus it is speculated that surrounding most probable
Live-vertex number, allow the sending probability p in ALOHA network is reached optimum performance.
When nodes are fixed as 100, collection of energy rate is from during 1mW changes to 10mW, network throughput, justice
Property and arrival time interval are as shown in Fig. 6, Fig. 7, Fig. 8.
Except CSMA, the handling capacity of other every kind of agreements all increases with the increase of average energy collection rate, because passing
Sensor node needs less time to collect energy, can more frequently be transmitted.But for CSMA, node is more
Continually transmission means more conflicts, so handling capacity is reduced with the increase of collection of energy speed on the contrary.
CSMA/CA handling capacity quite stable, but the back off time of node is not optimized, between node when keeping out of the way
Long gap is big, and fairness is relatively low.
For polling protocol, during average energy collection rate increase, the charging duration that node needs shortens, and poll is successful
Probability increase, so handling capacity increases with the increase of collection of energy speed.
For probability poll, contention probability is reduced with the increase of the quantity of active node, vice versa, thus compare
The collision being effectively prevented from.
And a kind of ALOHA agreements collected suitable for environmental energy proposed in the present invention are optimizing probability polling protocol
In contention probability, compared to probability poll, making the performance of network further improves.In addition, ALOHA agreements are for each section
Also all it is that height is fair for point.
One of ordinary skill in the art will be appreciated that embodiment described here is to aid in reader and understands this hair
Bright principle, it should be understood that protection scope of the present invention is not limited to such especially statement and embodiment.For ability
For the technical staff in domain, the present invention can have various modifications and variations.Within the spirit and principles of the invention, made
Any modification, equivalent substitution and improvements etc., should be included within scope of the presently claimed invention.
Claims (3)
1. a kind of ALOHA Protocol Design Methods collected suitable for environmental energy, it is characterised in that be specially：Sink nodes are wide
Neighbours sensor node of the text to surrounding is reported, the message includes contention probability；Active neighbours' sensor node receives report
Wen Hou, just generates a random number x between [0,1] at random；If x is less than contention probability, packet is sent；Otherwise, after
Reception state is held in continuation of insurance；
The inverse of active neighbours' sensor node number is used as the contention probability in message next time；
Active neighbours' sensor node number by using Bayesian formula, sink nodes using the result of poll for several times come
It is determined that.
2. a kind of ALOHA Protocol Design Methods collected suitable for environmental energy according to claim 1, its feature exists
In the determination process of active neighbours' sensor node number comprises the following steps：
If had around A1, sink node after n active neighbours' sensor nodes, the broadcasting packet for receiving sink nodes, institute
The probability for having active neighbours' sensor node not send data is：
pidle=(1-pc)n
A2, set event AnN active neighbours' sensor nodes are indicated, event B represents that Num poll has NumidleThe secondary free time,
Then have：
<mrow>
<mi>P</mi>
<mrow>
<mo>(</mo>
<mi>B</mi>
<mo>|</mo>
<msub>
<mi>A</mi>
<mi>n</mi>
</msub>
<mo>)</mo>
</mrow>
<mo>=</mo>
<mfenced open = "(" close = ")">
<mtable>
<mtr>
<mtd>
<mrow>
<mi>N</mi>
<mi>u</mi>
<mi>m</mi>
</mrow>
</mtd>
</mtr>
<mtr>
<mtd>
<mrow>
<msub>
<mi>Num</mi>
<mrow>
<mi>i</mi>
<mi>d</mi>
<mi>l</mi>
<mi>e</mi>
</mrow>
</msub>
</mrow>
</mtd>
</mtr>
</mtable>
</mfenced>
<msup>
<msub>
<mi>p</mi>
<mrow>
<mi>i</mi>
<mi>d</mi>
<mi>l</mi>
<mi>e</mi>
</mrow>
</msub>
<mrow>
<msub>
<mi>Num</mi>
<mrow>
<mi>i</mi>
<mi>d</mi>
<mi>l</mi>
<mi>e</mi>
</mrow>
</msub>
</mrow>
</msup>
<msup>
<mrow>
<mo>(</mo>
<mn>1</mn>
<mo>-</mo>
<msub>
<mi>p</mi>
<mrow>
<mi>i</mi>
<mi>d</mi>
<mi>l</mi>
<mi>e</mi>
</mrow>
</msub>
<mo>)</mo>
</mrow>
<mrow>
<mo>(</mo>
<mi>N</mi>
<mi>u</mi>
<mi>m</mi>
<mo>-</mo>
<msub>
<mi>Num</mi>
<mrow>
<mi>i</mi>
<mi>d</mi>
<mi>l</mi>
<mi>e</mi>
</mrow>
</msub>
<mo>)</mo>
</mrow>
</msup>
</mrow>
A3, by Bayesian formula, have：
<mrow>
<mi>P</mi>
<mrow>
<mo>(</mo>
<msub>
<mi>A</mi>
<mi>n</mi>
</msub>
<mo>|</mo>
<mi>B</mi>
<mo>)</mo>
</mrow>
<mo>=</mo>
<mfrac>
<mrow>
<mi>P</mi>
<mrow>
<mo>(</mo>
<msub>
<mi>A</mi>
<mi>n</mi>
</msub>
<mo>)</mo>
</mrow>
<mi>P</mi>
<mrow>
<mo>(</mo>
<mi>B</mi>
<mo>|</mo>
<msub>
<mi>A</mi>
<mi>n</mi>
</msub>
<mo>)</mo>
</mrow>
</mrow>
<mrow>
<munderover>
<mo>&Sigma;</mo>
<mrow>
<mi>i</mi>
<mo>=</mo>
<mn>1</mn>
</mrow>
<mi>N</mi>
</munderover>
<mi>P</mi>
<mrow>
<mo>(</mo>
<msub>
<mi>A</mi>
<mi>i</mi>
</msub>
<mo>)</mo>
</mrow>
<mi>P</mi>
<mrow>
<mo>(</mo>
<mi>B</mi>
<mo>|</mo>
<msub>
<mi>A</mi>
<mi>n</mi>
</msub>
<mo>)</mo>
</mrow>
</mrow>
</mfrac>
</mrow>
A4、P(An| B) the n values corresponding to maximum are exactly the active neighbours' sensor node number existed around sink nodes.
3. a kind of ALOHA Protocol Design Methods collected suitable for environmental energy according to claim 1, its feature exists
In, in addition to：When the energy of sensor node is not enough to the power consumption of activity periods of support, sensor node enters charging
State.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710330247.3A CN107197534A (en) | 2017-05-11 | 2017-05-11 | A kind of ALOHA Protocol Design Methods collected suitable for environmental energy |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710330247.3A CN107197534A (en) | 2017-05-11 | 2017-05-11 | A kind of ALOHA Protocol Design Methods collected suitable for environmental energy |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN107197534A true CN107197534A (en) | 2017-09-22 |
Family
ID=59873552
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201710330247.3A Pending CN107197534A (en) | 2017-05-11 | 2017-05-11 | A kind of ALOHA Protocol Design Methods collected suitable for environmental energy |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN107197534A (en) |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20070014236A1 (en) * | 2005-07-15 | 2007-01-18 | Samsung Electronics Co., Ltd. | Voice packet scheduling method for wireless local area network |
| US20140062664A1 (en) * | 2012-04-05 | 2014-03-06 | Ken Gudan | Low power radio frequency communication |
| CN104185237A (en) * | 2014-08-04 | 2014-12-03 | 西安电子科技大学 | Robustness optimization algorithm based on ant colony algorithm |
| CN106455026A (en) * | 2016-11-01 | 2017-02-22 | 北京邮电大学 | MAC protocol realization method and device for adjusting working cycles based on energy states |
| CN106507496A (en) * | 2016-11-01 | 2017-03-15 | 北京邮电大学 | Based on MAC protocol implementation method and device that energy state adjusts competition probability |
-
2017
- 2017-05-11 CN CN201710330247.3A patent/CN107197534A/en active Pending
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20070014236A1 (en) * | 2005-07-15 | 2007-01-18 | Samsung Electronics Co., Ltd. | Voice packet scheduling method for wireless local area network |
| US20140062664A1 (en) * | 2012-04-05 | 2014-03-06 | Ken Gudan | Low power radio frequency communication |
| CN104185237A (en) * | 2014-08-04 | 2014-12-03 | 西安电子科技大学 | Robustness optimization algorithm based on ant colony algorithm |
| CN106455026A (en) * | 2016-11-01 | 2017-02-22 | 北京邮电大学 | MAC protocol realization method and device for adjusting working cycles based on energy states |
| CN106507496A (en) * | 2016-11-01 | 2017-03-15 | 北京邮电大学 | Based on MAC protocol implementation method and device that energy state adjusts competition probability |
Non-Patent Citations (3)
| Title |
|---|
| SIJUN DOU: ""A Reliable MAC Protocol for Hybrid Wireless Sensor Networks"", 《WEB OF SCIENCE》 * |
| XU KE: ""Cellular Automata Self-organization Algorithm for Wireless Sensor Network"", 《WEB OF SCIENCE》 * |
| 楚佩佳: ""基于LTE***的UE随机接入过程研究"", 《信息科技辑》 * |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101695195B (en) | Control method and system for wireless channel access competition | |
| Eu et al. | Probabilistic polling for multi-hop energy harvesting wireless sensor networks | |
| Gopinath et al. | Mathematical and simulation analysis of contention resolution mechanism for IEEE 802.11 ah networks | |
| Vázquez-Gallego et al. | Reservation dynamic frame slotted-ALOHA for wireless M2M networks with energy harvesting | |
| Bel et al. | CAS-based channel access protocol for IEEE 802.11 ah WLANs | |
| CN105744628A (en) | Resource allocation optimization method of data and energy integrated communication networks | |
| CN101252511A (en) | Method for optimizing multi-jumping wireless sensor network dynamic proportion equitable access | |
| Vázquez-Gallego et al. | Contention tree-based access for wireless machine-to-machine networks with energy harvesting | |
| CN102256317B (en) | Wireless channel access control method | |
| Nguyen et al. | SCSMA: A smart CSMA/CA using blind learning for wireless sensor networks | |
| Cao et al. | Deep reinforcement learning MAC for backscatter communications relying on Wi-Fi architecture | |
| Kim et al. | Energy Efficient MAC Scheme for Wireless Sensor Networks with High‐Dimensional Data Aggregate | |
| CN109819505A (en) | A kind of limiting and access window time slot adaptation method of network energy efficiency optimization | |
| Lotfinezhad et al. | Energy efficient clustering in sensor networks with mobile agents | |
| Vazquez-Gallego et al. | Performance evaluation of reservation frame slotted-ALOHA for data collection M2M networks | |
| Dasgupta et al. | Congestion avoidance topology in wireless sensor network using Karnaugh map | |
| CN107197534A (en) | A kind of ALOHA Protocol Design Methods collected suitable for environmental energy | |
| Chen et al. | A pre-scheduling-based MAC protocol for underwater acoustic sensor network | |
| Tsakmakis et al. | On the Effect of Traffic Burstiness in LoRaWAN Networks' Performance | |
| Hsu et al. | Achieving ultra energy-efficient and collision-free data collection in wake-up radio enabled mIoT | |
| Wijesiri et al. | Energy harvesting-aware backoff algorithms for distributed device-to-device communication | |
| Simaiya et al. | Simulation and performance evaluation of energy efficient MAC protocols for wireless sensor networks | |
| Vázquez-Gallego et al. | Energy harvesting-aware contention tree-based access for wireless machine-to-machine networks | |
| Lampin et al. | Sari-mac: The self adapting receiver initiated mac protocol for wireless sensor networks | |
| Vazquez-Gallego et al. | Energy harvesting-aware distributed queuing access for wireless machine-to-machine networks |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| RJ01 | Rejection of invention patent application after publication | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20170922 |