CN107318117A - A kind of adaptive method of work based on expected contact value in dutycycle chance mobile network - Google Patents
A kind of adaptive method of work based on expected contact value in dutycycle chance mobile network Download PDFInfo
- Publication number
- CN107318117A CN107318117A CN201710437686.4A CN201710437686A CN107318117A CN 107318117 A CN107318117 A CN 107318117A CN 201710437686 A CN201710437686 A CN 201710437686A CN 107318117 A CN107318117 A CN 107318117A
- Authority
- CN
- China
- Prior art keywords
- mrow
- msub
- node
- msubsup
- contact
- 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
Classifications
-
- 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
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W24/00—Supervisory, monitoring or testing arrangements
- H04W24/02—Arrangements for optimising operational condition
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W28/00—Network traffic management; Network resource management
- H04W28/16—Central resource management; Negotiation of resources or communication parameters, e.g. negotiating bandwidth or QoS [Quality of Service]
- H04W28/18—Negotiating wireless communication parameters
-
- 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)
- Quality & Reliability (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
A kind of adaptive method of work based on expected contact value in dutycycle chance mobile network, including four steps：Each node using the caching record of oneself and the history time of contact interval of other nodes, at the beginning of each cycle between, each node is by Cycle LengthTIt is divided inton p Individual time slot, and update and last time time of contact of other nodes in upper a cycle.Updating with after last time time of contact of other nodes in upper a cycle, utilizing the contact historical record of storage, the expected contact value of each node calculating each time slot in current period.Each node in network will be selectedn w Individual slot wakeup, and thisn w Individual time slot has bigger expected contact value.Above-mentioned process at the beginning of each cycle between repeat, each node in such network just can at the beginning of each cycle between adaptively set the method for work of oneself.The present invention can not only substantially reduce the energy expenditure of node, and can minimize reduction network performance as much as possible.
Description
Technical field
The present invention relates to chance mobile network's application field, it is based on being expected in specifically a kind of dutycycle chance mobile network
Contact value adaptive method of work.
Background technology
In recent years, with the wireless portable devices for being equipped with Wi-Fi interface or blue tooth interface, such as：Ipad, smart mobile phone
Deng popularization and prevalence, based on chance mobile network in terms of application obtained vigorous growth.Chance mobile network
(Opportunistic Mobile Networks, OMNs) refers to sparse distribution, quick movement and the radio communication due to node
The reasons such as the limitation of technology, the class between the source node caused and destination node in the absence of complete end to end connection is special
Mobile ad-hoc network.At present, chance mobile network networking and wild animal tracking etc. under intelligent transportation, adverse circumstances
Aspect is widely used, and is an emerging study hotspot in wireless network.
In order to realize that the node in the data transfer between node, chance mobile network must keep listening mode, so as to send out
Neighbor node around it now.Contact very sparse between chance mobile network's interior joint, the time of contact interval between node is remote
Much larger than the contact duration between node, so if the node time instance in network keeps listening state, most of energy of node
In listening mode when all consumption is not in contact among the nodes.Test result indicates that, energy of the nodes more than 95%
Amount consumption is during idle listening (referring to N.Banerjee, M.Corner, B.Levine.Design and field
experimentation of an energyefficient architecture for dtn throwboxes.IEEE/
ACM Transactions on Networking,2010,18(2):554–567.).Result explanation above, is carried as much as possible
The effective rate of utilization of high-energy, is extremely heavy for the chance mobile network being made up of the portable equipment of some finite energies
The problem of wanting.
It is well known that duty cycle operation is an effective method for saving energy, it allows the node in network to replace
Ground switches between wake-up states and resting state.Duty cycle operation can be divided into two major classes：It is synchronous and asynchronous.Because synchronous
Duty cycle operation needs global time synchronized, and realizes that global time synchronized can bring very big communication overhead, so different
The duty cycle operation of step is more favourable in chance mobile network.Although can be greatly reduced using duty cycle operation in network
The energy expenditure of node, but can also substantially reduce the performance of network.Causing the main cause of this result is, when in network
Node be switched to resting state go save energy when, they can miss the contact with other nodes, thus missed data transmission
Chance.Therefore, the problem of influence of the duty cycle operation to network performance is one critically important is studied in chance mobile network.
At present, the document for having had correlation is studied the duty cycle operation in chance mobile network.
O.Trullols-Cruces etc. (referring to O.Trullols-Cruces, J.Morillo-Pozo, J.M.Barcelo-Ordinas,
Et al.Power saving tradeoffs in delay/disruptive tolerant networks, in
Proceedings of IEEE WoWMoM2011.) it have studied in dutycycle chance mobile network to wake up duration and dormancy
The energy of a length of function saves compromise when duration and contact.Given in text in dutycycle chance mobile network energy save and
It is compromise between contact probability of detection, and delay tolerance object (Delay Tolerant Object, DTO) and energy saving
Between it is compromise.S.Yang etc. is (referring to S.Yang, C.Yeo, B.Lee.Cooperative duty cycling for
energy-efficient contact discovery in pocket switched networks[J].IEEE
Transactions on Vehicular Technology, 2013,62 (4)：1815-1826.) propose a kind of Energy Efficient
Neighbor discovering method, be called cooperation duty ratio method (Cooperative Duty Cycling, CDC).This method utilizes net
Node in network can regularly be gathered in some focuses, so as to form the cluster of some connections.Based on such Move Mode, node
Between cooperation be utilized neighbours in the text and find in design.But, existing research work is intended to research and works as dutycycle
When method of work under operation is random selection, influence of the duty cycle operation to network performance does not account for method of work pair but
In the influence of network performance.
The content of the invention
The present invention provides the adaptive method of work based on expected contact value in a kind of dutycycle chance mobile network, no
The energy expenditure of node can be only substantially reduced, and reduction network performance can be minimized as much as possible.
The technical scheme that the present invention takes is：
The technical scheme that the present invention takes is：
A kind of adaptive method of work based on expected contact value in dutycycle chance mobile network, including following step
Suddenly：Step one：Each node using the caching record of oneself and the history time of contact interval of other nodes, node i and j it
Between record history time of contact interval setRepresent；WhereinRepresent the section of kth time record
History time of contact interval between point i and j, hijThen represent total of the history time of contact interval recorded between node i and j
Number, at the beginning of each cycle between, T points by Cycle Length of each node is npIndividual time slot, and update and exist with other nodes
Last time time of contact in upper a cycle.
Step 2：Updating with after last time time of contact of other nodes in upper a cycle, utilizing storage
Contact historical record, each node calculates the expected contact value of each time slot in current period；
The step of expected contact that each time slot in current period is described by taking node i as an example is worth：
The history time of contact recorded between node i and j is at intervals of set Hij, j ∈ θ, it is assumed that under between node i and j
One time of contact interval tij, last once contact occurred in the time between node i and jAnd some cycle opens
Time beginning isThe probability that m-th of time slot that node i can be within this cycle and node j contacts can be obtained is：Therefore, node i is in this week
The expected contact value EV of m-th of time slot in phasei(m) it can be expressed as：
Consider
Wherein
And uij=| uij|, whereinThen, it is possible to obtain：
In summary formula, can obtain the expected contact value EV of m-th time slot of the node i within the cyclei(m)
For：
Step 3：Each node in network will select nwIndividual slot wakeup, and this nwIndividual time slot has bigger expection
Contact value；Such as：Node i calculates the expected contact value EV of each time slot in current periodi(m),From
And obtain n in current periodpThe expected contact value of individual time slot, to this npThe expected contact value of individual time slot is according to from big to small
It is ranked up, takes preceding nwIndividual corresponding slot wakeup.
Step 4：Above-mentioned process at the beginning of each cycle between repeat, each node in such network is just
Can at the beginning of each cycle between adaptively set the method for work of oneself.
Adaptive method of work based on expected contact value in a kind of dutycycle chance mobile network of the present invention, technology effect
Fruit is as follows：
1)：Adaptive method of work proposed by the invention can effectively improve the capacity usage ratio of node, drop simultaneously
Influence of the low duty cycle operation to network performance.
2)：Adaptive method of work (Adaptive) proposed by the invention compares existing random work method
(Random) more effective contact numbers and periodic duty method (Periodical), are achieved, as shown in Figure 4.
3)：Adaptive method of work (Adaptive) proposed by the invention compares existing random work method
(Random) higher packet transmission success rate and relatively low biography and periodic duty method (Periodical), are achieved
Defeated delay, as illustrated in Figures 5 and 6.
4)：Adaptive method of work algorithm proposed by the invention is simple, it is easy to accomplish.
Brief description of the drawings
Fig. 1 is the schematic diagram that node i will be contacted in some cycle in m-th of time slot and node j.
Fig. 2 is the contact schematic diagram between dutycycle chance mobile network's interior joint.
Fig. 3 is adaptive method of work proposed by the invention and random work method comparison schematic diagram.
Adaptive method of work (Adaptive) and existing random work method (Random) proposed by the invention Fig. 4
With effective contact number comparison schematic diagram of the periodic duty method (Periodical) in different duty.
Adaptive method of work (Adaptive) and existing random work method (Random) proposed by the invention Fig. 5
With packet transmission success rate comparison schematic diagram of the periodic duty method (Periodical) in different duty.
Fig. 6 is adaptive method of work (Adaptive) and existing random work method proposed by the invention
And packet transmission delay comparison schematic diagram of the periodic duty method (Periodical) in different duty (Random).
Embodiment
Adaptive method of work based on expected contact value in a kind of dutycycle chance mobile network of the present invention, mainly
For the chance mobile network with N number of mobile node, wherein θ={ i=1,2 ..., N }, and each node i ∈ θ week
Run to phase property oneself selected method of work by an element group representation.The method of work of node i is expressed as si=＜
ωi, T, Δ t ＞, wherein ωiThe bitmap of node i, each represents resting state or wake-up states, T represent the cycle when
Long, Δ t is represented in ωiIn the duration of each.For the sake of simplification, when all nodes in network have the identical cycle
It is long, the duration in cycle is directly represented with T here.Therefore, the method for work of node i can be expressed as si=＜ ωi, T, Δ t ＞.
All nodes in network have identical dutycycle D=nw/np, wherein nwThe timeslot number waken up in each cycle T is represented, and
npTimeslot number altogether in each cycle T is then represented, here
Specifically, adaptive method of work proposed by the invention, it is main to include four steps：
Step one：Each node utilizes the caching record of oneself and the history time of contact interval of other nodes.For example：
The history time of contact interval recorded between node i and j can use setRepresent, whereinGeneration
History time of contact interval between the node i and j of table kth time record, hijThe history recorded between node i and j is then represented to connect
Touch the total number of time interval.Between at the beginning of each cycle, T points by Cycle Length of each node is npIndividual time slot, and
Update and last time time of contact of other nodes in upper a cycle.
Step 2：Updating with after last time time of contact of other nodes in upper a cycle, utilizing storage
Contact historical record, each node calculates the expected contact value of each time slot in current period.As shown in figure 1, to save
The step of expected contact that each time slot in current period is introduced exemplified by point i is worth.The history recorded between node i and j connects
It is set H to touch time intervalij, j ∈ θ.Assuming that next time of contact interval t between node i and jij, between node i and j
Last once contact occurred in the timeAnd it is between at the beginning of some cycleNode i meeting can be obtained
M-th of time slot within this cycle and the probability of node j contacts are：
Here Δ t represents each time slot duration, npRepresent timeslot number altogether in each cycle T.
Therefore, the expected contact value EV of m-th time slot of the node i within the cyclei(m) it can be expressed as：
Consider
Wherein
And uij=| uij|, whereinIt is then possible to obtain：
Here tijNext time of contact interval between node i and j is represented,Represent the node i and j of kth time record
Between history time of contact interval, hijThe total number at the history time of contact interval recorded between node i and j is then represented,
Represent setThe quantity of middle element.
Here uijRepresent set uijThe quantity of middle element.
In summary formula, can obtain the expected contact value EV of m-th time slot of the node i within the cyclei(m)
For：
HereRepresent setThe quantity of middle element, uijRepresent set uijThe quantity of middle element.
Step 3：Each node in network will select nwIndividual slot wakeup, and this nwIndividual time slot has bigger expection
Contact value.For example：Node i calculates the expected contact value Ev of each time slot in current periodi(m),
So as to obtain n in current periodpThe expected contact value of individual time slot.To this npThe expected contact value of individual time slot according to from greatly to
It is small to be ranked up, take preceding nwIndividual corresponding slot wakeup.
Step 4：Above-mentioned process at the beginning of each cycle between repeat, each node in such network is just
Can at the beginning of each cycle between adaptively set the method for work of oneself.
Illustrate that specific embodiment of the invention is in conjunction with accompanying drawing 2 and 3：
Fig. 2 gives an example contacted between dutycycle chance mobile network's interior joint i and j.Use T0Represent certain
Between at the beginning of a cycle, then node i and j can go according to their method of work periodically to stop in each cycle T
Sleep and wake up.As shown in figure 1, the once contact of node i and j randomly occurred within some cycle, and it continue for one section
Time TdThat is, the contact duration between two nodes.If node i and j current contact occur to be at them simultaneously
During wake-up states, then current contact will be detected.For example, as shown in Fig. 2 (a), if current contact occurred in the time
Point t1Or t2, then current contact will be detected, that is, effective contact.If the current contact of node i and j
It is not to occur at them while when being in wake-up states, then current contact would not be detected.For example, such as Fig. 2 (b) institutes
Show, if current contact occurs in time point t3Or t4, then specifically contact cannot be found each other, that is, miss
Contact.
As shown in Fig. 3 (a), if node i and j are in time T0To T+T0Method of work is randomly chosen respectively<101000,
180s, 30s>With<100010,180s, 30s>, then occur in time t5A contact between node i and j will be wrong
Lose.But, if node i can predict the contact information in future with j, and select suitable time slot to go wake-up, then current
Contact is possible to be changed into effective contact.As shown in Fig. 3 (b), if node i and j are in time T0To T+T0Work is selected respectively
Method<000101,180s,30s>With<000110,180s,30s>, then occur in time t5Node i and j between it is current
Contact is just changed to effective contact.
Fig. 4 gives adaptive method of work (Adaptive) and existing random work method proposed by the invention
And effective contact number comparison schematic diagram of the periodic duty method (Periodical) in different duty (Random).Such as
Shown in figure, the effective contact number under different operating mechanism all increases with the increase of dutycycle, but compared to random work
Mechanism and periodic duty mechanism, adaptive working mechanism are substantially dominant in terms of effective contact number.Its main cause is certainly
Adapt to working mechanism and go following contact information of prediction using past contact historical record, exist so as to be set adaptively node
Dormancy and wake-up states in each cycle.Therefore, much missed in random work mechanism and periodic duty mechanism
Contact is all changed to effective contact.
Fig. 5 and Fig. 6 sets forth adaptive method of work (Adaptive) proposed by the invention and existing random
The packet transmission success rate of method of work (Random) and periodic duty method (Periodical) in different duty
With the comparison schematic diagram of transmission delay.As illustrated, when dutycycle increases to 100% from 10%, under different operating mechanism
Packet transmission success rate is all in increase, and transmission delay is then correspondingly reducing, particularly when dutycycle is less than 50%.Its
Main cause is that, when dutycycle increase, the quantity for the contact missed will be reduced, or can be for the effective of exchange data
Contact quantity increase, so as to cause the increase of packet transmission success rate, and transmission delay reduction.Adaptive work
Mechanism will be better than random work mechanism and periodic duty mechanism in terms of packet transmission success rate and transmission delay, especially
It is when dutycycle is less than 50%.Its main cause is compared with random work mechanism and periodic duty mechanism, adaptively
Less contact will be had in working mechanism to be missed, as shown in Figure 4.In this case, adaptive working mechanism will
Having more can be for transmitting effective contacts of data, so as to cause the increase of packet transmission success rate, and transmission is prolonged
When reduction.
Above-mentioned specific embodiment is used for explaining the present invention, rather than limits the invention, the present invention spirit and
In the protection domain of claim, any modifications and changes made to the present invention both fall within protection scope of the present invention.
Claims (1)
1. the adaptive method of work based on expected contact value in a kind of dutycycle chance mobile network, it is characterised in that including
Following steps：
Step one：Each node utilizes the caching record of oneself and the history time of contact interval of other nodes, node i and j
Between record history time of contact interval setRepresent；
WhereinRepresent the history time of contact interval between the node i and j of kth time record, hijThen represent between node i and j
The total number at the history time of contact interval of record, at the beginning of each cycle between, T points by Cycle Length of each node is np
Individual time slot, and update and last time time of contact of other nodes in upper a cycle；
Step 2：Updating with after last time time of contact of other nodes in upper a cycle, utilizing connecing for storage
Historical record is touched, each node calculates the expected contact value of each time slot in current period；
The step of expected contact that each time slot in current period is described by taking node i as an example is worth：
The history time of contact recorded between node i and j is at intervals of set Hij, j ∈ θ, it is assumed that next between node i and j
Time of contact interval tij, last once contact occurred in the time between node i and jAnd at the beginning of some cycle
Between beThe probability that m-th of time slot that node i can be within this cycle and node j contacts can be obtained is：Therefore, node i is in the cycle
The expected contact value EV of m-th interior of time sloti(m) it can be expressed as：
<mrow>
<mtable>
<mtr>
<mtd>
<mrow>
<msub>
<mi>EV</mi>
<mi>i</mi>
</msub>
<mrow>
<mo>(</mo>
<mi>m</mi>
<mo>)</mo>
</mrow>
<mo>=</mo>
</mrow>
</mtd>
</mtr>
<mtr>
<mtd>
<mrow>
<msub>
<mi>&Sigma;</mi>
<mrow>
<mn>1</mn>
<mo>&le;</mo>
<mi>j</mi>
<mo>&le;</mo>
<mi>N</mi>
<mo>,</mo>
<mi>j</mi>
<mo>&NotEqual;</mo>
<mi>i</mi>
</mrow>
</msub>
<mi>Pr</mi>
<mo>{</mo>
<mi>t</mi>
<mo>+</mo>
<mrow>
<mo>(</mo>
<mrow>
<mi>m</mi>
<mo>-</mo>
<mn>1</mn>
</mrow>
<mo>)</mo>
</mrow>
<mi>&Delta;</mi>
<mi>t</mi>
<mo>-</mo>
<msubsup>
<mi>t</mi>
<mrow>
<mi>i</mi>
<mi>j</mi>
</mrow>
<mn>0</mn>
</msubsup>
<mo><</mo>
<msub>
<mi>t</mi>
<mrow>
<mi>i</mi>
<mi>j</mi>
</mrow>
</msub>
<mo>&le;</mo>
</mrow>
</mtd>
</mtr>
<mtr>
<mtd>
<mrow>
<mi>t</mi>
<mo>+</mo>
<mi>m</mi>
<mi>&Delta;</mi>
<mi>t</mi>
<mo>-</mo>
<msubsup>
<mi>t</mi>
<mrow>
<mi>i</mi>
<mi>j</mi>
</mrow>
<mn>0</mn>
</msubsup>
<mo>|</mo>
<msub>
<mi>t</mi>
<mrow>
<mi>i</mi>
<mi>j</mi>
</mrow>
</msub>
<mo>></mo>
<mi>t</mi>
<mo>-</mo>
<msubsup>
<mi>t</mi>
<mrow>
<mi>i</mi>
<mi>j</mi>
</mrow>
<mn>0</mn>
</msubsup>
<mo>}</mo>
<mo>=</mo>
<msub>
<mi>&Sigma;</mi>
<mrow>
<mn>1</mn>
<mo>&le;</mo>
<mi>j</mi>
<mo>&le;</mo>
<mi>N</mi>
<mo>,</mo>
<mi>j</mi>
<mo>&NotEqual;</mo>
<mi>i</mi>
</mrow>
</msub>
<mfrac>
<mrow>
<mi>Pr</mi>
<mrow>
<mo>{</mo>
<mrow>
<mi>t</mi>
<mo>+</mo>
<mrow>
<mo>(</mo>
<mrow>
<mi>m</mi>
<mo>-</mo>
<mn>1</mn>
</mrow>
<mo>)</mo>
</mrow>
<mi>&Delta;</mi>
<mi>t</mi>
<mo>-</mo>
<msubsup>
<mi>t</mi>
<mrow>
<mi>i</mi>
<mi>j</mi>
</mrow>
<mn>0</mn>
</msubsup>
<mo><</mo>
<msub>
<mi>t</mi>
<mrow>
<mi>i</mi>
<mi>j</mi>
</mrow>
</msub>
<mo>&le;</mo>
<mi>t</mi>
<mo>+</mo>
<mi>m</mi>
<mi>&Delta;</mi>
<mi>t</mi>
<mo>-</mo>
<msubsup>
<mi>t</mi>
<mrow>
<mi>i</mi>
<mi>j</mi>
</mrow>
<mn>0</mn>
</msubsup>
</mrow>
<mo>}</mo>
</mrow>
</mrow>
<mrow>
<mi>Pr</mi>
<mrow>
<mo>{</mo>
<mrow>
<msub>
<mi>t</mi>
<mrow>
<mi>i</mi>
<mi>j</mi>
</mrow>
</msub>
<mo>></mo>
<mi>t</mi>
<mo>-</mo>
<msubsup>
<mi>t</mi>
<mrow>
<mi>i</mi>
<mi>j</mi>
</mrow>
<mn>0</mn>
</msubsup>
</mrow>
<mo>}</mo>
</mrow>
</mrow>
</mfrac>
<mo>,</mo>
<mo>&ForAll;</mo>
<mi>m</mi>
<mo>=</mo>
<mn>1</mn>
<mo>,</mo>
<mn>2</mn>
<mo>,</mo>
<mn>...</mn>
<mo>,</mo>
<msub>
<mi>n</mi>
<mi>p</mi>
</msub>
</mrow>
</mtd>
</mtr>
</mtable>
<mo>-</mo>
<mo>-</mo>
<mo>-</mo>
<mrow>
<mo>(</mo>
<mn>1</mn>
<mo>)</mo>
</mrow>
</mrow>
Consider
WhereinAnd
uij=| uij|, whereinThen, it is possible to obtain：
<mrow>
<mi>Pr</mi>
<mo>{</mo>
<mi>t</mi>
<mo>+</mo>
<mrow>
<mo>(</mo>
<mi>m</mi>
<mo>-</mo>
<mn>1</mn>
<mo>)</mo>
</mrow>
<mi>&Delta;</mi>
<mi>t</mi>
<mo>-</mo>
<msubsup>
<mi>t</mi>
<mrow>
<mi>i</mi>
<mi>j</mi>
</mrow>
<mn>0</mn>
</msubsup>
<mo><</mo>
<msub>
<mi>t</mi>
<mrow>
<mi>i</mi>
<mi>j</mi>
</mrow>
</msub>
<mo>&le;</mo>
<mi>t</mi>
<mo>+</mo>
<mi>m</mi>
<mi>&Delta;</mi>
<mi>t</mi>
<mo>-</mo>
<msubsup>
<mi>t</mi>
<mrow>
<mi>i</mi>
<mi>j</mi>
</mrow>
<mn>0</mn>
</msubsup>
<mo>}</mo>
<mo>=</mo>
<mfrac>
<msubsup>
<mi>r</mi>
<mrow>
<mi>i</mi>
<mi>j</mi>
</mrow>
<mi>m</mi>
</msubsup>
<msub>
<mi>h</mi>
<mrow>
<mi>i</mi>
<mi>j</mi>
</mrow>
</msub>
</mfrac>
<mo>-</mo>
<mo>-</mo>
<mo>-</mo>
<mrow>
<mo>(</mo>
<mn>2</mn>
<mo>)</mo>
</mrow>
</mrow>
<mrow>
<mi>Pr</mi>
<mo>{</mo>
<msub>
<mi>t</mi>
<mrow>
<mi>i</mi>
<mi>j</mi>
</mrow>
</msub>
<mo>></mo>
<mi>t</mi>
<mo>-</mo>
<msubsup>
<mi>t</mi>
<mrow>
<mi>i</mi>
<mi>j</mi>
</mrow>
<mn>0</mn>
</msubsup>
<mo>}</mo>
<mo>=</mo>
<mfrac>
<msub>
<mi>u</mi>
<mrow>
<mi>i</mi>
<mi>j</mi>
</mrow>
</msub>
<msub>
<mi>h</mi>
<mrow>
<mi>i</mi>
<mi>j</mi>
</mrow>
</msub>
</mfrac>
<mo>-</mo>
<mo>-</mo>
<mo>-</mo>
<mrow>
<mo>(</mo>
<mn>3</mn>
<mo>)</mo>
</mrow>
</mrow>
In summary formula, can obtain the expected contact value EV of m-th time slot of the node i within the cyclei(m) it is：
<mrow>
<msub>
<mi>EV</mi>
<mi>i</mi>
</msub>
<mrow>
<mo>(</mo>
<mi>m</mi>
<mo>)</mo>
</mrow>
<mo>=</mo>
<msub>
<mi>&Sigma;</mi>
<mrow>
<mn>1</mn>
<mo>&le;</mo>
<mi>j</mi>
<mo>&le;</mo>
<mi>N</mi>
<mo>,</mo>
<mi>j</mi>
<mo>&NotEqual;</mo>
<mi>i</mi>
</mrow>
</msub>
<mfrac>
<mrow>
<mi>Pr</mi>
<mrow>
<mo>{</mo>
<mrow>
<mi>t</mi>
<mo>+</mo>
<mrow>
<mo>(</mo>
<mrow>
<mi>m</mi>
<mo>-</mo>
<mn>1</mn>
</mrow>
<mo>)</mo>
</mrow>
<mi>&Delta;</mi>
<mi>t</mi>
<mo>-</mo>
<msubsup>
<mi>t</mi>
<mrow>
<mi>i</mi>
<mi>j</mi>
</mrow>
<mn>0</mn>
</msubsup>
<mo><</mo>
<msub>
<mi>t</mi>
<mrow>
<mi>i</mi>
<mi>j</mi>
</mrow>
</msub>
<mo>&le;</mo>
<mi>t</mi>
<mo>+</mo>
<mi>m</mi>
<mi>&Delta;</mi>
<mi>t</mi>
<mo>-</mo>
<msubsup>
<mi>t</mi>
<mrow>
<mi>i</mi>
<mi>j</mi>
</mrow>
<mn>0</mn>
</msubsup>
</mrow>
<mo>}</mo>
</mrow>
</mrow>
<mrow>
<mi>Pr</mi>
<mrow>
<mo>{</mo>
<mrow>
<msub>
<mi>t</mi>
<mrow>
<mi>i</mi>
<mi>j</mi>
</mrow>
</msub>
<mo>></mo>
<mi>t</mi>
<mo>-</mo>
<msubsup>
<mi>t</mi>
<mrow>
<mi>i</mi>
<mi>j</mi>
</mrow>
<mn>0</mn>
</msubsup>
</mrow>
<mo>}</mo>
</mrow>
</mrow>
</mfrac>
<mo>=</mo>
<msub>
<mi>&Sigma;</mi>
<mrow>
<mn>1</mn>
<mo>&le;</mo>
<mi>j</mi>
<mo>&le;</mo>
<mi>N</mi>
<mo>,</mo>
<mi>j</mi>
<mo>&NotEqual;</mo>
<mi>i</mi>
</mrow>
</msub>
<mfrac>
<mrow>
<msubsup>
<mi>r</mi>
<mrow>
<mi>i</mi>
<mi>j</mi>
</mrow>
<mi>m</mi>
</msubsup>
<mo>/</mo>
<msub>
<mi>h</mi>
<mrow>
<mi>i</mi>
<mi>j</mi>
</mrow>
</msub>
</mrow>
<mrow>
<msub>
<mi>u</mi>
<mrow>
<mi>i</mi>
<mi>j</mi>
</mrow>
</msub>
<mo>/</mo>
<msub>
<mi>h</mi>
<mrow>
<mi>i</mi>
<mi>j</mi>
</mrow>
</msub>
</mrow>
</mfrac>
<mo>=</mo>
<msub>
<mi>&Sigma;</mi>
<mrow>
<mn>1</mn>
<mo>&le;</mo>
<mi>j</mi>
<mo>&le;</mo>
<mi>N</mi>
<mo>,</mo>
<mi>j</mi>
<mo>&NotEqual;</mo>
<mi>i</mi>
</mrow>
</msub>
<mfrac>
<msubsup>
<mi>r</mi>
<mrow>
<mi>i</mi>
<mi>j</mi>
</mrow>
<mi>m</mi>
</msubsup>
<msub>
<mi>u</mi>
<mrow>
<mi>i</mi>
<mi>j</mi>
</mrow>
</msub>
</mfrac>
<mo>-</mo>
<mo>-</mo>
<mo>-</mo>
<mrow>
<mo>(</mo>
<mn>4</mn>
<mo>)</mo>
</mrow>
</mrow>
Step 3：Each node in network will select nwIndividual slot wakeup, and this nwIndividual time slot has bigger expected connect
Touch value；Such as：Node i calculates the expected contact value EV of each time slot in current periodi(m),So as to
N in current periodpThe expected contact value of individual time slot, to this npThe expected contact value of individual time slot according to carrying out from big to small
Sequence, takes preceding nwIndividual corresponding slot wakeup；
Step 4：Above-mentioned process at the beginning of each cycle between repeat, each node in such network just can be with
The method of work of oneself is adaptively set between at the beginning of each cycle.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710437686.4A CN107318117A (en) | 2017-06-12 | 2017-06-12 | A kind of adaptive method of work based on expected contact value in dutycycle chance mobile network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710437686.4A CN107318117A (en) | 2017-06-12 | 2017-06-12 | A kind of adaptive method of work based on expected contact value in dutycycle chance mobile network |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN107318117A true CN107318117A (en) | 2017-11-03 |
Family
ID=60181796
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201710437686.4A Pending CN107318117A (en) | 2017-06-12 | 2017-06-12 | A kind of adaptive method of work based on expected contact value in dutycycle chance mobile network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN107318117A (en) |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20070211654A1 (en) * | 2006-03-07 | 2007-09-13 | Samsung Electronics Co., Ltd. | Power-saving method for wireless sensor network |
| CN104378229A (en) * | 2014-10-30 | 2015-02-25 | 东南大学 | Link prediction method for opportunity network |
| CN106060887A (en) * | 2016-05-25 | 2016-10-26 | 重庆邮电大学 | Opportunistic network routing method based on spatial-temporal characteristic change cognition |
-
2017
- 2017-06-12 CN CN201710437686.4A patent/CN107318117A/en active Pending
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20070211654A1 (en) * | 2006-03-07 | 2007-09-13 | Samsung Electronics Co., Ltd. | Power-saving method for wireless sensor network |
| CN104378229A (en) * | 2014-10-30 | 2015-02-25 | 东南大学 | Link prediction method for opportunity network |
| CN106060887A (en) * | 2016-05-25 | 2016-10-26 | 重庆邮电大学 | Opportunistic network routing method based on spatial-temporal characteristic change cognition |
Non-Patent Citations (1)
| Title |
|---|
| 周欢: "机会移动网络中的数据传输机制研究", 《中国博士学位论文全文数据库》 * |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Khan et al. | Energy management in wireless sensor networks: A survey | |
| Wei et al. | Cluster-based routing protocols in wireless sensor networks: a survey | |
| Tabassum et al. | COSEN: A chain oriented sensor network for efficient data collection | |
| CN100544493C (en) | A kind of method for searching network of portable terminal | |
| Tang et al. | An energy harvesting aware routing algorithm for hierarchical clustering wireless sensor networks | |
| Park et al. | Energy-efficient opportunistic spectrum access in cognitive radio networks with energy harvesting | |
| CN103476099B (en) | The dual dormancy method of wireless sensor node | |
| Salah et al. | Energy efficient clustering based on LEACH | |
| Sun et al. | A study on medium access control scheme for energy efficiency in wireless smart sensor networks | |
| Feng et al. | A low overhead wireless sensor networks MAC protocol | |
| Xuhui et al. | Unequal clustering mechanism of leach protocol for wireless sensor networks | |
| Anees et al. | Harvested energy scavenging and transfer capabilities in opportunistic ring routing | |
| Gupta et al. | Clustering Approach for Enhancing Network Energy using LEACH Protocol in WSN | |
| Imani et al. | Adaptive S-grid: a new adaptive quorum-based power saving protocol for multi-hop ad hoc networks | |
| Karthi et al. | Duty cycle adapted MAC for wireless sensor networks with energy harvesting | |
| Nguyen et al. | A receiver-initiated mac protocol for energy harvesting sensor networks | |
| Mahlknecht et al. | Energy aware distance vector routing scheme for data centric low power wireless sensor networks | |
| Wu et al. | An asymmetric quorum-based power saving protocol for clustered ad hoc networks | |
| CN107318117A (en) | A kind of adaptive method of work based on expected contact value in dutycycle chance mobile network | |
| Xie et al. | An energy-efficient TDMA protocol for clustered wireless sensor networks | |
| Choi et al. | An adaptive mobility-supporting MAC protocol for mobile sensor networks | |
| Kumar et al. | EBDRA: energy balanced dynamic cluster routing approach for WSN | |
| Nguyen et al. | Implementation of an adaptive energy-efficient MAC protocol in OMNeT++/MiXiM | |
| Wang et al. | Low-latency TDMA sleep scheduling in wireless sensor networks | |
| Simaiya et al. | Simulation and performance evaluation of energy efficient MAC protocols for wireless sensor 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 |
Application publication date: 20171103 |
|
| RJ01 | Rejection of invention patent application after publication |