CN102056233A - Queue management scheduling method of opportunity network based on message importance degree - Google Patents
Queue management scheduling method of opportunity network based on message importance degree Download PDFInfo
- Publication number
- CN102056233A CN102056233A CN2010106093849A CN201010609384A CN102056233A CN 102056233 A CN102056233 A CN 102056233A CN 2010106093849 A CN2010106093849 A CN 2010106093849A CN 201010609384 A CN201010609384 A CN 201010609384A CN 102056233 A CN102056233 A CN 102056233A
- Authority
- CN
- China
- Prior art keywords
- message
- node
- queue management
- active degree
- formation
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Images
Landscapes
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention discloses a queue management scheduling method of an opportunity network based on a message transmission state, relating to the field of wireless networks. Aiming at the limits that the node active degree is not considered and the node characteristic is not reflected to a message in the traditional queue management method of the opportunity network, the invention provides a method for estimating the node active degree. According to the method, the active degree difference among different nodes can be estimated only according to the information stored by a current local node, and further the queue management method of the opportunity network based on the message transmission state is designed according to the transmission state and the importance degree of the node active degree estimation message, and the node storage resource is reasonably utilized with the message transmission state as a basis. The method for estimating the node active degree, provided in the invention, is more accurate, meanwhile, a self-adaptive queue management strategy for perceiving the message importance degree can effectively improve the successful delivery rate of the message and reduce the network average time delay and the network load rate.
Description
Technical field
The present invention relates to field of wireless, relate in particular to the queue management mechanism in the opportunistic network.
Background technology
The universal application that promotes mobile Ad hoc network of a large amount of hand-held intelligent mobile devices.In the wireless network of complexity, owing to reasons such as node motion, signal attenuations, network usually can interrupt.But traditional mobile Ad hoc network requires to have a definite link at least between source node and destination node, thereby can't adapt to such environment.Be different from the communication pattern of traditional mobile Ad hoc network, the node in the opportunistic network did not need to set up end-to-end path, but utilizes the chance of meeting between the node to carry out data forwarding before transmitting data, until arriving destination node.This brand-new communication mode has caused insider's very big interest, is considered to one of direction of following wireless network development.
Opportunistic network with store more flexibly-carry-forward mode realize to interconnect, mobile computing.In the forwards process, a plurality of nodes will be preserved the message that needs are transmitted, and obviously, compare under the condition of limited for node processing ability, storage capacity etc., effectively node queue's administrative mechanism can directly improve the memory space utilance, and then improve network performance.
The Activity On the Node ability is strong more, and then this node and other nodes chance of meeting will increase thereupon, so transmit and the message of storage also just many more.After message in the network was stored by the node of this type, its chance of successfully delivering significantly increased.Know easily that thus the active degree of node has directly reflected the successful delivery probability of its entrained message.In the opportunistic network, after meeting, node needs to exchange the store status in the formation each other, and higher through the successfully delivery rate of message that a plurality of live-vertexs carry, as seen, too much it is stored and transmit the serious waste Internet resources, that is to say, the significance level of this kind message can descend.Therefore, should take into full account the difference between the node active degree, the message with in the management node formation effectively reaches the purpose of rationally utilizing Internet resources.
At present, all do not consider the active degree of node, the active degree of node be not reflected on the message yet that as seen, there are limitation to a certain degree in these mechanism at the queue management method of opportunistic network.
Summary of the invention
Technical problem to be solved by this invention is: limited at node queue space in the opportunistic network, and can't efficiently utilize the limitation of memory space in the existing queue management dispatching method, the present invention has designed a kind of opportunistic network self adaptation array dispatching method based on message transfer phase, node basis and other node situations of meeting are determined the active degree difference between each node, and according in the forwards process, its active degree that carries node is estimated current transmission state, and then, determine the queue operation of node after meeting.Designed message transfer phase appraisal procedure is more accurate, and simultaneously, this kind self adaptation queue management method can effectively improve successfully delivery rate of message, reduces network average delay and offered load rate.
The technical solution adopted for the present invention to solve the technical problems is: the present invention is with the internodal key parameter of number of times as measurement node active degree that meet, the meet median of number of times of the total degree that node meets in the estimation network and each node, utilize the local historical information of meeting that preserve of node with other nodes, according to this node meet difference between the number of times median of number of times and each node of meeting, use the uniform quantization method, weigh the active degree difference of each node.Obviously, the node active degree is high more, and is then high more by its probability that message is successfully delivered, and therefore, message is stored, carried and transmit by many more live-vertex, shows that then its probability of successfully having delivered is high more.Message needs to transmit through a plurality of nodes in transmission course, the present invention is a foundation with the active degree of all nodes of preserving given message, estimate the probability that message is successfully delivered, the higher message significance level of probability of success delivery also just decreases, and its meaning that continues to survive in network just descends.According to this principle, the present invention has designed a kind of self adaptation queue management method based on message transfer phase, this queue management method mainly comprises the dequeue operation and goes into two aspects of formation operation that the message of node queue inside sorts according to the significance level under the current network state.In the dequeue operation, after meeting, node at first exchanges the highest message of significance level, go in the formation operation, after formation takes, significance level and inner queue message significance level that node need enter needs local queue message compare, and use limited storage resources to carry the highest message of significance level.
The opportunistic network queue management method of the message significance level perception that the present invention proposes utilizes the historical information that moves at random between the node fully, determine the active degree difference between itself and other node approx, and the active degree that utilizes message to carry node in repeating process is judged transmission state, and then, be parameter adjustment node queue operating position with the message significance level.Compare with existing queue management method, the method that this patent proposes can be considered the difference of active degree between the node and message significance level fully, utilize the limited storage resources of node, effectively improve successfully delivery rate of message, reduce network average delay and offered load rate, improve network performance.
Description of drawings
The queueing form of Fig. 1 message in formation
The reception flow chart of Fig. 2 message.
Embodiment
The present invention is with the internodal key parameter of number of times as measurement node active degree that meet, the meet median of number of times of the total degree that node meets in the estimation network and each node, utilize the local historical information of meeting that preserve of node with other nodes, according to this node meet difference between the number of times median of number of times and each node of meeting, use the uniform quantization method, weigh the active degree difference of each node.Obviously, the node active degree is high more, and is then high more by its probability that message is successfully delivered, and therefore, message is stored, carried and transmit by many more live-vertex, shows that then its probability of successfully having delivered is high more.Message needs to transmit through a plurality of nodes in transmission course, the present invention is a foundation with the active degree of all nodes of preserving given message, estimate the probability that message is successfully delivered, the higher message significance level of probability of success delivery also just decreases, and its meaning that continues to survive in network just descends.According to this principle, the present invention has designed a kind of self adaptation queue management method based on message transfer phase, this queue management method mainly comprises the dequeue operation and goes into two aspects of formation operation that the message of node queue inside sorts according to the significance level under the current network state.In the dequeue operation, after meeting, node at first exchanges the highest message of significance level, go in the formation operation, after formation takes, significance level and inner queue message significance level that node need enter needs local queue message compare, and use limited storage resources to carry the highest message of significance level.
Estimate the node active degree
The meet median of number of times of the total degree that node meets in the computing network and each node, utilization uniform quantization method is weighed the active degree difference of each node.
The present invention is with the internodal key parameter of number of times as estimation node active degree that meet.Variable-definition is as follows: the number of times that meets of other nodes is called the number of times that meets of this node in given node and the network
M, its size [
M Min ,
M Max ] in.The total degree that each node enters other node communication scopes is defined as the node total degree that meets
M Total , the average time that each node enters other node communication scopes is defined as the node number of times that on average meets
M Avr The node at interval NM(Node Meeting Interval that meets) expression is from node
iThe communication range that leaves a certain node is to node
iEnter the time interval of arbitrary node communication scope once more, node is Encounter Time NFM(Node First Meeting Time first) represent that two nodes begin to (the entering communication range separately) elapsed time that meets for the first time from static.
Random Way Point mobility model for extensive use, call formula (1) and determine NFM:
(1)
Wherein the node motion relative velocity of RWP model can be selected
,
LBe the distance of node to destination node,
For
LThe estimated average value, at one
Desirable in the RWP network model of size
,
Be mean residence time,
Be the average speed of node,
KBe the node transmission range.
, the time that the expression node was kept in motion in the unit interval.
Node in the opportunistic network adopts and stores-carry-and the mode transmitted communicates, and may there be a plurality of backups in same message in network.If in the current network there be certain message
LIndividual backup, and the routing mode of message is directly to deliver, promptly node only runs into destination node and just transmits message.Call formula
(2) determine that message successfully is delivered to the delay ED(Expected Delay of destination node).
N node arranged, if work as in the network
nIn the network that individual node is formed n-1 backup arranged, then this message is node visit at interval to the delay of destination node
NM, as the formula (3):
(3)
As seen,
TIn time period, node visit at interval
NMWith the time
Ratio be the average time that certain node and other nodes meet, always meet number of times so between all nodes as the formula (4):
Obtaining node according to formula (5) exists
TIn time period with the number of times that on average meets of other nodes:
Make the weights of node active degree be
X, its size [
X Min ,
X Max ] in the scope,,, determine that according to formula 5 node of the medium active degrees number of times that meets is with node node that number of times the is defined as medium active degree number of times that meets that on average meets if make under the current network state
M Med , can basis
M Med And the number of times that always meets between the node of given node, know the difference between the node active degree, and then calculate weight numerical value.As seen,
M Med The order of accuarcy of numerical value is directly related with the validity of node active degree method of estimation.Opportunistic network moves with distribution mode, and node can't obtain the state information of other nodes in the whole network range, and the present invention adopts
M Avr The conduct of estimation numerical value
M Med Numerical approximation, promptly
Obviously, if the number of times that meets of given node equals
M Avr , the weights of this node so
XAlso be [
X Min ,
X Max ] median
X Med If the number of times ratio that meets of certain node
M Med Greatly, its weights need correspondingly to increase so, otherwise reduce.In order to reflect the mapping relations of meeting between state difference and the weight difference more rationally and effectively, can choose according to the size of network size as the present invention
XScope [
X Min ,
X Max ] be [0,10], at the uniform quantization computational methods of node active degree as the formula (6):
Wherein
Be quantized interval,
Estimate the message significance level
Message record in repeating process repeatedly carries the node active degree, at T constantly, stores all node active degree weights summations of given message
A(
T):
(7)
In the network actual moving process, the state that message is stored by node dynamically changes, promptly
, obviously, if given message
A(
T) be maximum weights
A Max , show that then this message successfully delivers.Thus, can get the probability that message is successfully delivered
P(
T), as the formula (8):
Wherein,
A(
T) can obtain by node local record information.
More each other active degree weights after node meets
A, after the network operation was stable, each node all can obtain in the current network
A Max
Utilize all node active degree weights summations of given message
A(
T) being each message design corresponding weights, this weight reflection message is in the continuous significance level of transmitting of network trunk, and this significance level can be expressed as:
The live-vertex quantity of carrying given message is many more, its
A(
T) big more, show that the probability of successfully having been delivered also rises thereupon, continue to carry the also correspondingly decline of meaning of this message, its significance level in network also just reduces, and (9) formula that is reflected to is exactly
A(
T) big more,
Q(
T) more little.
As shown in formula (9), node can dynamically be estimated according to current network state
A(
T) and
A Max Numerical value, therefore, for the stronger opportunistic network of network state time variation, weight
Q(
T) can reflect the significance level of message in network adaptively, according to significance level design queue management strategy.
Opportunistic network self adaptation queue management method based on message transfer phase
Based on message significance level design opportunities network self-adapting queue management strategy, comprise the dequeue operation and go into two aspects of formation operation.
The dequeue operation mainly solves inner queue message priority problem.After two nodes meet in the opportunistic network, need exchange the message of being preserved in quene state and the formation each other.According to the message significance level, node is arranged it in formation according to weight is descending.As shown in Figure 1, all message are arranged according to its weight, weights the maximum Message
1Be positioned at the formation head, weight reckling Message
nBe positioned at the formation afterbody.When node meets and during message transfer, team's message obtains preferential transmission route.
Go into the formation operation and mainly solve the data carry decision problem.All carry the active degree of node each Message Record, by the active degree summation of each node, estimate under the given network state, and the probability that message has successfully been delivered, and then weigh its significance level.Significance level with message is a foundation, and the message in the formation is arranged, and node is in information exchanging process, and the message that significance level is the highest preferentially sends.When message enters formation, judge whether enough free spaces are arranged in the formation, if having, then receive this message, otherwise, begin to delete message from the message of weight minimum, for message is reserved enough spaces, enough spaces are arranged in formation, then receive this message, otherwise refuse information.Absorb when between queue empty, and need mutual exchange message after meeting between the node, at this moment, will weigh the significance level of the message that needs exchange, the less message of significance level in the deletion formation is until reserve enough spaces for new information.
As shown in Figure 2, wherein
SThe idle storage space of expression node,
S i Expression message
iSize,
Q i (
T) expression current network state under message
iWeight.Work as message
iWhen entering formation, earlier judge whether enough free spaces are arranged in the formation,, then receive this message, otherwise message weight relationship relatively begins to carry out deletion action from the message of weight minimum, if weight minimum and compare message in the deletion formation if having
iAfter the little message of weight, enough spaces are arranged in the formation, then receive this message, otherwise it is time little and compare message to continue in the deletion formation weight
iThe message that weight is little is up to being message
iReserve between enough queue empties.If deleted ownership anharmonic ratio message
iAfter the little message of weight, still can't reserve enough spaces, then refuse this message
i
Claims (5)
1. opportunistic network self adaptation queue management dispatching method based on message transfer phase, it is characterized in that, according to this node meet difference between the number of times median of number of times and each node of meeting, utilization uniform quantization method is estimated the active degree difference of each node; Message record in repeating process repeatedly carries the node active degree, stores all node active degree weights summations of given message
A(
T); Utilize all node active degree weights summations of given message
A(
T) determine the weight of each message correspondence; Based on weight design opportunistic network self adaptation queue management strategy.
2. opportunistic network self adaptation queue management dispatching method according to claim 1 is characterized in that, calls formula:
Calculate the number of times that always meets between all nodes
, according to formula
Obtaining node exists
TIn time period with the number of times that on average meets of other nodes
, according to formula
Determine the active degree difference of each node, wherein, n is a node number in the network,
Be node Encounter Time first,
X Med Be node weights median,
Be quantized interval.
3. opportunistic network self adaptation queue management dispatching method according to claim 1 is characterized in that, the probability of successfully delivering according to message
P(
T), call formula
Determine the weight of each message.
4. opportunistic network self adaptation queue management dispatching method according to claim 4, it is characterized in that, according to the message significance level, node is arranged it in formation according to the weight of message is descending, weighted value the maximum is positioned at the formation head, the weighted value reckling is positioned at the formation afterbody, when node meets and during message transfer, team's message obtains preferential transmission route.
5. opportunistic network self adaptation queue management dispatching method according to claim 4, it is characterized in that when message enters formation, judge whether enough free spaces are arranged in the formation, if have, then receive this message, otherwise, begin to delete message from the message of weight minimum, for message is reserved enough spaces, enough spaces are arranged in formation, then receive this message, otherwise refuse information.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN 201010609384 CN102056233B (en) | 2010-12-28 | 2010-12-28 | Queue management scheduling method of opportunity network based on message importance degree |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN 201010609384 CN102056233B (en) | 2010-12-28 | 2010-12-28 | Queue management scheduling method of opportunity network based on message importance degree |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN102056233A true CN102056233A (en) | 2011-05-11 |
| CN102056233B CN102056233B (en) | 2013-05-08 |
Family
ID=43960028
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN 201010609384 Active CN102056233B (en) | 2010-12-28 | 2010-12-28 | Queue management scheduling method of opportunity network based on message importance degree |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN102056233B (en) |
Cited By (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102185783A (en) * | 2011-05-25 | 2011-09-14 | 重庆邮电大学 | Routing design method for multi-ferry direct communication in opportunistic network |
| CN102202000A (en) * | 2011-06-14 | 2011-09-28 | 重庆邮电大学 | Routing selection method based on node property in social transportation in opportunistic network |
| CN104394236A (en) * | 2014-12-18 | 2015-03-04 | 重庆邮电大学 | Distributed cooperative caching method capable of realizing node and message state combined perception |
| CN106850425A (en) * | 2016-12-21 | 2017-06-13 | 陕西师范大学 | Segmental routing method and a kind of network node based on markov decision process |
| CN108401274A (en) * | 2018-01-29 | 2018-08-14 | 中南大学 | The data transmission method of opportunistic network |
| CN115225563A (en) * | 2022-06-21 | 2022-10-21 | 中国电信股份有限公司 | Message transmission method and device |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101784067A (en) * | 2010-01-14 | 2010-07-21 | 重庆邮电大学 | Method for quickly sensing meeting nodes based on cross-layer triggering in opportunistic network |
| CN101895954A (en) * | 2010-08-24 | 2010-11-24 | 重庆邮电大学 | Opportunistic network routing method based on incremental transmission of packet index |
-
2010
- 2010-12-28 CN CN 201010609384 patent/CN102056233B/en active Active
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101784067A (en) * | 2010-01-14 | 2010-07-21 | 重庆邮电大学 | Method for quickly sensing meeting nodes based on cross-layer triggering in opportunistic network |
| CN101895954A (en) * | 2010-08-24 | 2010-11-24 | 重庆邮电大学 | Opportunistic network routing method based on incremental transmission of packet index |
Non-Patent Citations (1)
| Title |
|---|
| YONG LI,等: "Energy-Efficient Optimal Opportunistic Forwarding for Delay-Tolerant Networks", 《IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY》 * |
Cited By (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102185783A (en) * | 2011-05-25 | 2011-09-14 | 重庆邮电大学 | Routing design method for multi-ferry direct communication in opportunistic network |
| CN102185783B (en) * | 2011-05-25 | 2013-06-19 | 重庆邮电大学 | Routing design method for multi-ferry direct communication in opportunistic network |
| CN102202000A (en) * | 2011-06-14 | 2011-09-28 | 重庆邮电大学 | Routing selection method based on node property in social transportation in opportunistic network |
| CN102202000B (en) * | 2011-06-14 | 2013-07-17 | 重庆邮电大学 | Routing selection method based on node property in social transportation in opportunistic network |
| CN104394236A (en) * | 2014-12-18 | 2015-03-04 | 重庆邮电大学 | Distributed cooperative caching method capable of realizing node and message state combined perception |
| CN104394236B (en) * | 2014-12-18 | 2017-11-07 | 重庆邮电大学 | Node combines the distributed collaborative caching method perceived with message status |
| CN106850425A (en) * | 2016-12-21 | 2017-06-13 | 陕西师范大学 | Segmental routing method and a kind of network node based on markov decision process |
| CN108401274A (en) * | 2018-01-29 | 2018-08-14 | 中南大学 | The data transmission method of opportunistic network |
| CN108401274B (en) * | 2018-01-29 | 2021-07-13 | 中南大学 | Data transmission method of opportunity network |
| CN115225563A (en) * | 2022-06-21 | 2022-10-21 | 中国电信股份有限公司 | Message transmission method and device |
| CN115225563B (en) * | 2022-06-21 | 2024-04-05 | 中国电信股份有限公司 | Message transmission method and device |
Also Published As
| Publication number | Publication date |
|---|---|
| CN102056233B (en) | 2013-05-08 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN102056233B (en) | Queue management scheduling method of opportunity network based on message importance degree | |
| Turgut et al. | Heuristic approaches for transmission scheduling in sensor networks with multiple mobile sinks | |
| US10440666B2 (en) | Managing communication between a plurality of moving objects through control of transmit power and/or transmit rate | |
| CN107517158B (en) | The design method of Communication Network for UAVS joint route agreement | |
| WO2005060604B1 (en) | Wireless network with improved sharing of high power consumption tasks | |
| CN110445866A (en) | Task immigration and collaborative load-balancing method in a kind of mobile edge calculations environment | |
| CN103929782A (en) | Resource leveling multi-path routing method applicable to industrial wireless sensor network | |
| CN101296152A (en) | Data scheduling method and system of equity linked network | |
| CN102461093A (en) | Method of managing a traffic load | |
| CN115473855B (en) | Network system and data transmission method | |
| CN109309620A (en) | A kind of lightweight heterogeneous network cluster-dividing method towards edge calculations | |
| CN109673018A (en) | Novel cache contents in Wireless Heterogeneous Networks are placed and content caching distribution optimization method | |
| CN102821422A (en) | Network clustering method of mobile sensor based on partition | |
| CN103532877A (en) | Scheduling method for guaranteeing real-time transmission of wireless sensor network information | |
| CN113132490A (en) | MQTT protocol QoS mechanism selection scheme based on reinforcement learning | |
| CN110932969B (en) | Advanced metering system AMI network anti-interference attack routing algorithm for smart grid | |
| Zhu et al. | Efficient actuator failure avoidance mobile charging for wireless sensor and actuator networks | |
| Dzung et al. | To transmit now or not to transmit now | |
| CN110213088A (en) | A kind of optimization method transmitting ALOHA network network reliability under the time limit | |
| CN112148482A (en) | Edge computing task scheduling method based on combination with load balancing | |
| Lohith et al. | Intensifying the lifetime of Wireless Sensor Network using a centralized energy accumulator node with RF energy transmission | |
| Yu et al. | Distributed packet-aware routing scheme based on dynamic network coding | |
| Semchedine et al. | QoS-based protocol for routing in wireless sensor networks | |
| Mathapati et al. | Energy efficient cluster based mobility prediction for wireless sensor networks | |
| CN102573021A (en) | Method and gateway for processing wireless sensor network (WSN) message |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant |