CN104735742B - A kind of sending method and device of opportunistic network data - Google Patents
A kind of sending method and device of opportunistic network data Download PDFInfo
- Publication number
- CN104735742B CN104735742B CN201510157424.3A CN201510157424A CN104735742B CN 104735742 B CN104735742 B CN 104735742B CN 201510157424 A CN201510157424 A CN 201510157424A CN 104735742 B CN104735742 B CN 104735742B
- Authority
- CN
- China
- Prior art keywords
- node
- sent
- mobile terminal
- terminal model
- network delay
- 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.)
- Expired - Fee Related
Links
- 238000000034 method Methods 0.000 title claims abstract description 32
- 238000012545 processing Methods 0.000 claims description 11
- 230000002776 aggregation Effects 0.000 claims description 6
- 238000004220 aggregation Methods 0.000 claims description 6
- 230000005540 biological transmission Effects 0.000 claims description 6
- 238000012546 transfer Methods 0.000 claims description 3
- 230000007613 environmental effect Effects 0.000 abstract description 3
- 230000006870 function Effects 0.000 description 20
- 239000000243 solution Substances 0.000 description 9
- 230000007704 transition Effects 0.000 description 7
- 238000004891 communication Methods 0.000 description 6
- 239000011159 matrix material Substances 0.000 description 6
- 230000008569 process Effects 0.000 description 6
- 238000010586 diagram Methods 0.000 description 4
- 238000010168 coupling process Methods 0.000 description 3
- 238000005859 coupling reaction Methods 0.000 description 3
- 238000005516 engineering process Methods 0.000 description 3
- 238000010276 construction Methods 0.000 description 2
- 230000008878 coupling Effects 0.000 description 2
- 238000003860 storage Methods 0.000 description 2
- 235000008694 Humulus lupulus Nutrition 0.000 description 1
- 230000015572 biosynthetic process Effects 0.000 description 1
- 238000004364 calculation method Methods 0.000 description 1
- 235000019994 cava Nutrition 0.000 description 1
- 238000002716 delivery method Methods 0.000 description 1
- 238000013461 design Methods 0.000 description 1
- 238000001514 detection method Methods 0.000 description 1
- 238000009792 diffusion process Methods 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 238000002347 injection Methods 0.000 description 1
- 239000007924 injection Substances 0.000 description 1
- 230000003993 interaction Effects 0.000 description 1
- 238000004519 manufacturing process Methods 0.000 description 1
- 230000007246 mechanism Effects 0.000 description 1
- 239000000203 mixture Substances 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 238000005507 spraying Methods 0.000 description 1
Landscapes
- Mobile Radio Communication Systems (AREA)
Abstract
The embodiment of the invention discloses a kind of sending method of opportunistic network data and devices, can be suitable for and opportunistic network as environmental classes under mine.Present invention method includes：Obtain data to be sent, at least two nodes to be selected in mobile terminal model and a during cycle；The collision probability of the corresponding network delay of each node to be selected, each node to be selected and destination node and the range of scatter of each node to be selected are obtained according to the mobile terminal model；Linear combination is carried out according to network delay, collision probability and the range of scatter got, and the corresponding weighted sum of each node to be selected is calculated；Select the corresponding node to be selected of maximum weighted sum in each weighted sum for being calculated；If the node to be selected of selection meets threshold condition, the data to be sent are sent to the node to be selected of selection, if being unsatisfactory for threshold condition, does not send and waits for the node to be selected in next period.The embodiment of the present invention also provides a kind of sending device of opportunistic network data, and the embodiment of the present invention can be suitable for and opportunistic network as environmental classes under mine.
Description
Technical field
The present invention relates to the sending methods and device of field of communication technology more particularly to a kind of opportunistic network data.
Background technology
Face and side tunnel bad environments under mine, bend is more, easily caves in, and environment is very severe, distributing network
Node is very difficult.Since personnel's scope of activities is limited under mine, only in oneself workspace in miner's certain time of different work posts
Movable in domain, network connectivty is poor.
In order to solve this problem, a kind of existing solution is carried by people by using with one kind, there is channel radio
The opportunistic network of the portable equipment composition of communication interface is application scenarios, the message generated first to source node, according to application scenarios
Situation calculates the total copy number for needing to replicate forwarding, and the moving rail of node is modeled using improved discrete Markov model
Mark, using node history mobile message prediction node between next Encounter Time and collision probability, using improved two into
System injection Binary Spraying strategies design multicopy routing mechanism, forward messages to destination node collision probability most
Big node, until message is transferred to destination node.
This method does not provide specific improved Markov model, and data transmission Consideration is relatively simple,
Node can be distributed any scene in a network, and personnel are general only movable in the working region of oneself under mine, node phase
Meet limited opportunities and more regularity.When carrying out data transmission under mine, data generally will not merely through once jump reach purpose section
Point, this method are not fully appropriate for and opportunistic network as environmental classes under mine.
Invention content
An embodiment of the present invention provides a kind of sending method of opportunistic network data and devices, can be suitable for and ring under mine
The similar opportunistic network in border.
The embodiment of the present invention has the following advantages：When obtaining the corresponding network of each node to be selected by mobile terminal model
Prolong, each node to be selected and the collision probability of destination node and the range of scatter of each node to be selected, by these three attribute informations into
Row linear combination simultaneously obtains weighted sum, therefrom chooses the corresponding node of maximum weighted sum as optimal node, when this is best
When node meets threshold condition, data are issued into the optimal node, if being unsatisfactory for threshold condition, wait for next cycle, then
Select node.Obviously, in this way, destination node may finally be sent the data to.
Description of the drawings
In order to illustrate the technical solution of the embodiments of the present invention more clearly, required use in being described below to embodiment
Attached drawing be briefly described, it should be apparent that, drawings in the following description are only some embodiments of the invention, for this
For the those of ordinary skill of field, without having to pay creative labor, other are can also be obtained according to these attached drawings
Attached drawing.
Fig. 1 is sending method one embodiment schematic diagram of opportunistic network data in the embodiment of the present invention；
Fig. 2 is another embodiment schematic diagram of sending method of opportunistic network data in the embodiment of the present invention；
Fig. 3 is sending device one embodiment schematic diagram of opportunistic network data in the embodiment of the present invention；
Fig. 4 is another embodiment schematic diagram of sending device of opportunistic network data in the embodiment of the present invention.
Specific implementation mode
An embodiment of the present invention provides a kind of sending method of opportunistic network data and devices, can be suitable for and ring under mine
The similar opportunistic network in border.
In order to enable those skilled in the art to better understand the solution of the present invention, below in conjunction in the embodiment of the present invention
Attached drawing, technical scheme in the embodiment of the invention is clearly and completely described, it is clear that described embodiment is only
The embodiment of a part of the invention, instead of all the embodiments.Based on the embodiments of the present invention, ordinary skill people
The every other embodiment that member is obtained without making creative work should all belong to the model that the present invention protects
It encloses.
Term " first ", " second ", " third " " in description and claims of this specification and above-mentioned attached drawing
The (if present)s such as four " are for distinguishing similar object, without being used to describe specific sequence or precedence.It should manage
The data that solution uses in this way can be interchanged in the appropriate case, so that the embodiments described herein can be in addition to illustrating herein
Or the sequence other than the content of description is implemented.In addition, term " comprising " and " having " and their any deformation, it is intended that
Cover it is non-exclusive include, for example, containing the process of series of steps or unit, method, system, product or equipment need not limit
In those of clearly listing step or unit, but may include not listing clearly or for these processes, method, production
The intrinsic other steps of product or equipment or unit.
Referring to Fig. 1, sending method one embodiment of opportunistic network data includes in the embodiment of the present invention：
101, data to be sent, at least two nodes to be selected in mobile terminal model and a during cycle are obtained；
In the present embodiment, after mobile terminal model is created, data to be sent, mobile terminal model, Yi Jiyi are obtained
At least two nodes to be selected in a during cycle.
102, the corresponding network delay of each node to be selected, each node to be selected and purpose section are obtained according to the mobile terminal model
The collision probability of point and the range of scatter of each node to be selected；
According to the mobile terminal model obtain network delay between each node to be selected and destination node, each node to be selected with
The range of scatter of the collision probability of destination node and each node to be selected.
It should be noted that the mobile terminal model is configured with the algorithm and routing protocol algorithm of network delay.
103, it is calculated and respectively waits for according to network delay, collision probability and the range of scatter progress linear combination got
Select the corresponding weighted sum of node；
The network delay got, collision probability and range of scatter are standardized to and are carried out linear combination, is calculated
Obtain the corresponding weighted sum of each node to be selected.
104, the corresponding node to be selected of maximum weighted sum in each weighted sum for being calculated of selection；
It chooses maximum weighted sum in each weighted sum, and determines the corresponding node to be selected of the maximum weighted sum, choosing should
Node to be selected.
If 105, the node to be selected selected meets threshold condition, which is sent to the section to be selected of selection
Point does not send if being unsatisfactory for threshold condition and waits for the node to be selected in next period.
After node to be selected is selected, if the node to be selected of the selection meets threshold condition, which is sent out
The node to be selected is given, if being unsatisfactory for threshold condition, does not send and waits for the node to be selected in next period.
It is understood that when the number of node to be selected is 0 or 1, it is equally applicable.
In the present embodiment, by mobile terminal model obtain the corresponding network delay of each node to be selected, each node to be selected with
These three attribute informations are carried out linear combination and obtained by the range of scatter of the collision probability of destination node and each node to be selected
Weighted sum therefrom chooses the corresponding node of maximum weighted sum as optimal node, when this optimal node meets threshold condition
When, data are issued into the optimal node, if being unsatisfactory for threshold condition, wait for next cycle, reselection node.Obviously, it adopts
In this way, destination node may finally be sent the data to.
In order to make it easy to understand, being retouched in detail to the sending method of the opportunistic network data in the embodiment of the present invention below
It states, referring to Fig. 2, another embodiment of the sending method of opportunistic network data includes in the embodiment of the present invention：
201, data to be sent, at least two nodes to be selected in mobile terminal model and a during cycle are obtained；
In the present embodiment, after mobile terminal model is created, data to be sent, mobile terminal model, Yi Jiyi are obtained
At least two nodes to be selected in a during cycle.
It should be noted that the establishment of the mobile terminal model includes four aspects, 1, the different scene of construction, and be arranged and turn
Move probability matrix；2, according to the transition probability matrix solve any two node any scene collision probability, wherein this meet
Probability isWherein CrIndicate one of scene,
3, node stays probability, residence time, forwarding probability and forwarding time in any scene；4, between node and destination node
Network delay.
The establishment of the mobile terminal model is exemplified below：Assuming that the scene of construction is 10, according to away from destination node
Sequence from the distant to the near is respectively defined as C1、C2、C3、C4、C5、C6、C7、C8、C9、C10, it is also assumed that be scene 1, scene 2 etc.,
Details are not described herein again, CDFor purpose node region.Initial time, node are randomly dispersed in any of which scene, deutomerite
Point can select to stay for some time and can also be transferred to other scenes according to corresponding probability.These probability constitute node
A transition probability matrix as follows.
Different work post movings range are different under mine, and a step transition probability of formation is also different, as group leader can appoint under mine
Scene of anticipating movement, then one step transition probability is as follows, wherein 0 indicates that normal working hours interior nodes will not be between the two scenes
It is mobile.
Gas work is only mobile in gas detection region (i.e. scene 9,10 and destination node region), and one step transfer is general
Rate matrix is as follows：
Check man only moves in scene 2,3,5,6,7,10 and destination node region, and one walks transition probability matrix such as
Under：
Fireman only moves between scene 1,2, and one step transition probability is：
It is by k moment each work post node transition probability：
Indicate that node is in scene C nowm, as available from the above equation at the k moment, node is in scene CwProbability, be denoted as：
Node a is in kaTime is in scene Ca, node b is in kbMoment is in scene Cb, then in k (k ＞ ka, k ＞ kb) moment,
Node a and node b are in scene CrThe probability to meet is：
At the k moment, node a, the probability that node b is met in any one scene is：
The time of the q times forwarding data of node is tq, kz、tzRespectively forwarding probability, the average time to relay of node, kd、
tdRespectively the residence time of node, stay probability.
M data forwarding time be：
Node average time to relay：
Node a is in scene CrIt meets with any node and the probability for carrying out data forwarding is：
Node a is in scene CrStaying probability * residence times is：
According to mobile terminal model, it is as follows in arbitrary scene collision probability matrix that unit interval interior nodes can be obtained：
If source node is node 1, the probability that destination node is forwarded to by hop count evidence is：
P (s=1)=p1,D
The probability that destination node is forwarded to by double bounce is：
At most (h be effective hop count) from source node to destination node being jumped by h and being forwarded to the probability of destination node be：
N is the average number of hops that data packet is forwarded to destination node from source node, then：
If d is the communication range of node, s is distance of the source node to destination node, passes through n scene altogether, and node advances
Speed is v, if node is jumped to by 1 up to destination node, network delay is：
If node is jumped to by N up to purpose section, network delay is：
202, each node to be selected is calculated according to the algorithm for the network delay being pre-configured in the mobile terminal model to correspond to
Network delay；
Due to being pre-configured the algorithm of network delay in mobile terminal model, the algorithm meter of above-mentioned network delay can be passed through
Calculation obtains the corresponding network delay of each node to be selected.
203, any section in each node to be selected is obtained according to the routing protocol algorithm being pre-configured in the mobile terminal model
The number M that meets of point and other all nodes, and the times N of meeting of any node and destination node is obtained accordingly；
According to the routing protocol algorithm being pre-configured in mobile terminal model, any node in each node to be selected safeguards oneself
Contact probability vector table, node i and node j update the list of oneself and send the abstract vector V of oneself to node j when meeting
=[V1, V2,...,Vn].Node j updates the contact probability table h=[h of oneself after receiving1,h2,...,hm,hD].By to contact
The continuous renewal of probability tables can get any node and other all nodes in each node to be selected and meet number M, including with mesh
Node times N of meeting.
204, determine that the collision probability of any of the above-described node and destination node is N/M；
Can be calculated collision probability is N/M.
205, it is obtained and any in each node to be selected according to the routing protocol algorithm being pre-configured in the mobile terminal model
The number A for the corresponding work post type of node that node meets, and obtain the number B of all work post types；
It is similar with step 203, each section to be selected in a period of time can be obtained by the contact probability vector table of continuous renewal
Contact situation of any node with other work in point, such as the node pair for assuming to meet with any node in each node to be selected
The number A for the work post type answered, and the number of all work post types is B.
206, determine that the range of scatter of any of the above-described node is A/B；
Can be calculated range of scatter is A/B.
It should be noted that step 202, step 203 and step 204, without true between step 205 and step 206 three
Fixed precedence relationship, such as：Step 203 and step 204 can be before steps 202, and step 205 and step 206 can also be
Before step 202, it is not construed as limiting herein.
207, the cost function of pre-configuration is transferred；
After network delay, collision probability and range of scatter determine, the cost function of pre-configuration is transferred.
The cost function can be：F (i)=0.5031xi1+0.4088xi2+0.0880xi3
Wherein xi1、xi2、xi3For the corresponding network delay of node i, collision probability, the standardized nature value of range of scatter.Generation
Valence function is the sum of products of each attribute weight and standardized nature value, and cost function shows to select the node better more greatly.
It should be noted that the attribute weight 0.5031,0.4088,0.0880 in above-mentioned cost function is not unique
, it can determine corresponding attribute weight by the way that different judgement matrixes is arranged, specific details are not described herein again.
208, the network delay got, collision probability and range of scatter are substituted into above-mentioned cost function, is obtained each
The corresponding weighted sum of node to be selected；
After cost function determines, the network delay got, collision probability and range of scatter are standardized, it will
Numerical value after standardization substitutes into above-mentioned cost function, obtains the corresponding weighted sum of each node to be selected.
209, the corresponding node to be selected of maximum weighted sum in each weighted sum for being calculated of selection；
It chooses maximum weighted sum in each weighted sum, and determines the corresponding node to be selected of the maximum weighted sum, choosing should
Node to be selected.
If 210, the node to be selected selected meets threshold condition, which is sent to the section to be selected of selection
Point does not send if being unsatisfactory for threshold condition and waits for the node to be selected in next period.
After node to be selected is selected, if the node to be selected of selection meets threshold condition, which is sent
The node to be selected is given, if being unsatisfactory for threshold condition, does not send and waits for the node to be selected in next period.
It is understood that when the number of node to be selected is 0 or 1, it is equally applicable.
It should be noted that can also use other modes that the data to be sent are sent to the node to be selected of selection, have
Body is not construed as limiting herein.
It is understood that after node to be selected receives the data to be sent, same method may be used this is pending
Data are sent to be sent to other nodes, until the data to be sent are sent to destination node.
In the present embodiment, by mobile terminal model obtain the corresponding network delay of each node to be selected, each node to be selected with
These three attribute informations are carried out linear combination and obtained by the range of scatter of the collision probability of destination node and each node to be selected
Weighted sum therefrom chooses the corresponding node of maximum weighted sum as optimal node, when this optimal node meets threshold condition
When, data are issued into the optimal node, if being unsatisfactory for threshold condition, wait for next cycle, reselection node.Obviously, it adopts
In this way, destination node may finally be sent the data to.
Secondly, the present embodiment describes the establishment process of mobile terminal model and the specific algorithm of network delay in detail,
Range of scatter and collision probability are determined by routing protocol algorithm, weighted sum are determined by cost function, and pass through frame aggregation
Mode transmission data, disclose the specific implementation process of scheme, it is more convincing.
In order to make it easy to understand, below with an actual application scenarios to the hair of the opportunistic network data in the embodiment of the present invention
Delivery method is described：
Miner A has data to need to be transferred on server, and there are three nodes b, c, d in the communication range of miner A, mobile
Terminal model obtains the corresponding network delay of these three nodes, collision probability and range of scatter with destination node, and passes through
The corresponding weighted sum of three nodes is calculated, chooses the corresponding node c of maximum weighted sum as relay node, miner A will
Data are sent to node c, and in the same way, node c sends the data to other relay nodes, until sending the data to
Server completes communication.
The sending device of the opportunistic network data in the embodiment of the present invention is described below, referring to Fig. 3, the embodiment of the present invention
One embodiment of the sending device of middle opportunistic network data includes：
First acquisition module 301, for obtaining data to be sent, in mobile terminal model and a during cycle
At least two nodes to be selected；
Second acquisition module 302, for obtaining the corresponding network delay of each node to be selected, each according to the mobile terminal model
The range of scatter of the collision probability and each node to be selected of node to be selected and destination node；
Processing module 303, for carrying out linear combination according to the network delay, collision probability and the range of scatter that get
The corresponding weighted sum of each node to be selected is calculated；
Selecting module 304, the corresponding node to be selected of maximum weighted sum in each weighted sum for selecting to be calculated；
The data to be sent are sent to choosing by execution module 305 if the node to be selected for selection meets threshold condition
The node to be selected selected does not send if being unsatisfactory for threshold condition and waits for the node to be selected in next period.
In the present embodiment, by mobile terminal model obtain the corresponding network delay of each node to be selected, each node to be selected with
These three attribute informations are carried out linear combination and obtained by the range of scatter of the collision probability of destination node and each node to be selected
Weighted sum therefrom chooses the corresponding node of maximum weighted sum as optimal node, when this optimal node meets threshold condition
When, data are issued into the optimal node, if being unsatisfactory for threshold condition, wait for next cycle, reselection node.Obviously, it adopts
In this way, destination node may finally be sent the data to.
In order to make it easy to understand, being retouched in detail to the sending device of the opportunistic network data in the embodiment of the present invention below
It states, referring to Fig. 4, another embodiment of the sending device of opportunistic network data includes in the embodiment of the present invention：
First acquisition module 401, for obtaining data to be sent, in mobile terminal model and a during cycle
At least two nodes to be selected；
Second acquisition module 402, for obtaining the corresponding network delay of each node to be selected, each according to the mobile terminal model
The range of scatter of the collision probability and each node to be selected of node to be selected and destination node；
Processing module 403, for carrying out linear combination according to the network delay, collision probability and the range of scatter that get
The corresponding weighted sum of each node to be selected is calculated；
Selecting module 404, the corresponding node to be selected of maximum weighted sum in each weighted sum for selecting to be calculated；
The data to be sent are sent to choosing by execution module 405 if the node to be selected for selection meets threshold condition
The node to be selected selected does not send if being unsatisfactory for threshold condition and waits for the node to be selected in next period.
The second acquisition module 402 wherein in the present embodiment includes：
Computing unit 4021, for being calculated respectively according to the algorithm for the network delay being pre-configured in the mobile terminal model
The corresponding network delay of node to be selected；
First acquisition unit 4022, for respectively being waited for according to the routing protocol algorithm acquisition being pre-configured in the mobile terminal model
The number M that meets of any node and other all nodes in node is selected, and obtains any node and destination node accordingly
Times N of meeting；
First determination unit 4023, for determining that the collision probability of any node and destination node in each node to be selected is
N/M；
Second acquisition unit 4024, for being obtained according to the routing protocol algorithm being pre-configured in the mobile terminal model and respectively
The number A for the corresponding work post type of node that any node in node to be selected is met, and obtain of all work post types
Number B；
Second determination unit 4025, for determining that the range of scatter of any node in each node to be selected is A/B.
Processing module 403 wherein in the present embodiment includes：
Unit 4031 is transferred, the cost function for transferring pre-configuration；
Processing unit 4032, for the network delay got, collision probability and range of scatter to be substituted into above-mentioned cost
In function, the corresponding weighted sum of each node to be selected is obtained.
Execution module 405 wherein in the present embodiment includes：
Execution unit 4051 will be upper by the way of frame aggregation if the node to be selected for selection meets threshold condition
The node to be selected that data to be sent are sent to selection is stated, if being unsatisfactory for threshold condition, does not send and waits in next period
Node to be selected.
In the present embodiment, by mobile terminal model obtain the corresponding network delay of each node to be selected, each node to be selected with
These three attribute informations are carried out linear combination and obtained by the range of scatter of the collision probability of destination node and each node to be selected
Weighted sum therefrom chooses the corresponding node of maximum weighted sum as optimal node, when this optimal node meets threshold condition
When, data are issued into the optimal node, if being unsatisfactory for threshold condition, wait for next cycle, reselection node.Obviously, it adopts
In this way, destination node may finally be sent the data to.
Secondly, the present embodiment calculates network delay by the algorithm of network delay, is determined and is spread by routing protocol algorithm
Range and collision probability determine weighted sum, and the transmission data by way of frame aggregation by cost function so that the present invention
It is more convincing.
In order to make it easy to understand, below with an actual application scenarios to the sending device of opportunistic network data in the present embodiment
The interaction of each intermodule is described：
After mobile terminal model is created, the first acquisition module 401 obtains data to be sent, mobile terminal model, with
And at least two nodes to be selected in a during cycle.Due to being pre-configured the algorithm of network delay in mobile terminal model,
The corresponding network delay of each node to be selected is calculated in computation subunit 4021 in second acquisition module 402.Second obtains mould
First acquisition unit 4022 in block 402 is according to the routing protocol algorithm being pre-configured in mobile terminal model, in each node to be selected
Any node safeguard the contact probability vector table of oneself, node i and node j update the list of oneself and to node j when meeting
Send the abstract vector V=[V of oneself1, V2,...,Vn].Node j updates the contact probability table h=[h of oneself after receiving1,
h2,...,hm,hD].By the continuous renewal to contacting probability tables, any node in each node to be selected and other institutes are can get
There is node to meet number M, includes the times N of meeting with destination node.The first determination unit 4023 in second acquisition module 402
Can be calculated collision probability is N/M.Second acquisition unit 4023 in second acquisition module 402 is general by the contact of continuous renewal
Rate vector table can obtain contact situation of any node in a period of time in each node to be selected with other work, such as assume
The number A of work post type corresponding with the node that any node in each node to be selected is met, and all work post types
Number is B.It is A/B that the second determination unit 4025 in second acquisition module 402, which can be calculated range of scatter,.When network delay,
After collision probability and range of scatter determine, the cost letter transferred unit 4031 and transfer pre-configuration in processing module 403
Number, the cost function can be：F (i)=0.5031xi1+0.4088xi2+0.0880xi3, wherein xi1、xi2、xi3For node i pair
The network delay answered, collision probability, the standardized nature value of range of scatter, cost function are that each attribute weight and standardization belong to
The sum of products of property value, cost function show to select the node better more greatly, it should be noted that the attribute in above-mentioned cost function
Weight 0.5031,0.4088,0.0880 is not unique, can determine corresponding category by the way that different judgement matrixes is arranged
Property weight, it is specific that details are not described herein again.After cost function determines, by the network delay got, collision probability and diffusion
Range is standardized, and the processing unit 4032 in processing module 403 substitutes into the numerical value after standardization in above-mentioned cost function,
Obtain the corresponding weighted sum of each node to be selected.Selecting module 404 chooses maximum weighted sum in each weighted sum, and determines the maximum
The corresponding node to be selected of weighted sum, choose the node to be selected.After node to be selected determines, if the node to be selected of selection meets threshold
Value condition, then the execution unit 4051 in execution module 405 data to be sent are sent to selection by the way of frame aggregation
Node to be selected, it should be noted that can also use other modes that the data to be sent be sent to the node to be selected of selection,
This is not limited here, if being unsatisfactory for threshold condition, does not send and waits for the node to be selected in next period, it is possible to understand that
, after node to be selected receives the data to be sent, same method may be used, the data to be sent is sent to other
Node, until the data to be sent are sent to destination node.
It is apparent to those skilled in the art that for convenience and simplicity of description, the system of foregoing description,
The specific work process of device and unit, can refer to corresponding processes in the foregoing method embodiment, and details are not described herein.
In several embodiments provided herein, it should be understood that disclosed system, device and method can be with
It realizes by another way.For example, the apparatus embodiments described above are merely exemplary, for example, the unit
It divides, only a kind of division of logic function, formula that in actual implementation, there may be another division manner, such as multiple units or component
It can be combined or can be integrated into another system, or some features can be ignored or not executed.Another point, it is shown or
The mutual coupling, direct-coupling or communication connection discussed can be the indirect coupling by some interfaces, device or unit
It closes or communicates to connect, can be electrical, machinery or other forms.
This may or may not be physically separated as the unit that separating component illustrates, be shown as unit
Component may or may not be physical unit, you can be located at a place, or may be distributed over multiple nets
On network unit.Some or all of unit therein can be selected according to the actual needs to realize the mesh of this embodiment scheme
's.
In addition, each functional unit in each embodiment of the present invention can be integrated in a processing unit, it can also
It is that each unit physically exists alone, it can also be during two or more units be integrated in one unit.Above-mentioned integrated list
The form that hardware had both may be used in member is realized, can also be realized in the form of SFU software functional unit.
If the integrated unit is realized in the form of SFU software functional unit and when sold or used as an independent product,
It can be stored in a computer read/write memory medium.Based on this understanding, technical scheme of the present invention substantially or
Person says that all or part of the part that contributes to existing technology or the technical solution can body in the form of software products
Reveal and, which is stored in a storage medium, including some instructions are with so that a computer is set
Standby (can be personal computer, server or the network equipment etc.) execute each embodiment this method of the present invention whole or
Part steps.And storage medium above-mentioned includes：USB flash disk, mobile hard disk, read-only memory (ROM, Read-Only Memory),
Random access memory (RAM, Random Access Memory), magnetic disc or CD etc. are various can to store program code
Medium.
The above, the above embodiments are merely illustrative of the technical solutions of the present invention, rather than its limitations；Although with reference to before
Stating embodiment, invention is explained in detail, it will be understood by those of ordinary skill in the art that：It still can be to preceding
The technical solution recorded in each embodiment is stated to modify or equivalent replacement of some of the technical features；And these
Modification or replacement, the spirit and scope for various embodiments of the present invention technical solution that it does not separate the essence of the corresponding technical solution.
Claims (9)
1. a kind of sending method of opportunistic network data, which is characterized in that including：
Obtain data to be sent, at least two nodes to be selected in mobile terminal model and a during cycle, the movement
Terminal model is configured with the algorithm and routing protocol algorithm of network delay；
The phase of the corresponding network delay of each node to be selected, each node to be selected and destination node is obtained according to the mobile terminal model
Meet the range of scatter of probability and each node to be selected, the corresponding network delay of each node to be selected is to select each section to be selected
After point, time for being consumed the data transmission to be sent to the destination node by each node to be selected；
Linear combination is carried out according to network delay, collision probability and the range of scatter got, and each node pair to be selected is calculated
The weighted sum answered；
Select the corresponding node to be selected of maximum weighted sum in each weighted sum for being calculated；
If the node to be selected of selection meets threshold condition, the data to be sent are sent to the node to be selected of selection, if not
Meet threshold condition, then do not send and waits for the node to be selected in next period；
The range of scatter that the node to be selected is obtained according to the mobile terminal model includes：
It is obtained and any node phase in each node to be selected according to the routing protocol algorithm being pre-configured in the mobile terminal model
The number A of the corresponding work post type of node of chance, and obtain the number B of all work post types；
Determine that the range of scatter of any node is A/B.
2. according to the method described in claim 1, it is characterized in that, described obtain each section to be selected according to the mobile terminal model
Point network delay include：
The corresponding network of each node to be selected is calculated according to the algorithm for the network delay being pre-configured in the mobile terminal model
Time delay.
3. according to the method described in claim 1, it is characterized in that, described obtain each section to be selected according to the mobile terminal model
Point and the collision probability of destination node include：
Any node in each node to be selected and its are obtained according to the routing protocol algorithm being pre-configured in the mobile terminal model
The number M that meets of his all nodes, and the times N of meeting of any node and destination node is obtained accordingly, the M is big
In 0 integer；
Determine that the collision probability of any node and destination node is N/M.
4. according to the method in any one of claims 1 to 3, which is characterized in that network delay that the foundation is got,
Collision probability and range of scatter progress linear combination are calculated the corresponding weighted sum of each node to be selected and include：
Transfer the cost function of pre-configuration；
The network delay got, collision probability and range of scatter are substituted into the cost function, each node to be selected is obtained
Corresponding weighted sum.
5. according to the method described in claim 1, it is characterized in that, described be sent to the to be selected of selection by the data to be sent
Node includes：
The data to be sent are sent to the node to be selected of selection by the way of frame aggregation.
6. a kind of sending device of opportunistic network data, which is characterized in that including：
First acquisition module, for obtaining data to be sent, at least two in mobile terminal model and a during cycle
Node to be selected, the mobile terminal model are configured with the algorithm and routing protocol algorithm of network delay；
Second acquisition module, for obtaining the corresponding network delay of each node to be selected, each to be selected according to the mobile terminal model
The range of scatter of the collision probability and each node to be selected of node and destination node, the corresponding network delay of each node to be selected
After selecting each node to be selected, by each node to be selected by the data transmission to be sent to the destination node institute
The time of consumption；
Second acquisition module, specifically for according to the routing protocol algorithm that is pre-configured in the mobile terminal model obtain with
The number A for the corresponding work post type of node that any node in each node to be selected is met, and obtain all work post types
Number B；Determine that the range of scatter of any node is A/B；
Processing module is calculated for carrying out linear combination according to the network delay, collision probability and the range of scatter that get
To the corresponding weighted sum of each node to be selected；
Selecting module, the corresponding node to be selected of maximum weighted sum in each weighted sum for selecting to be calculated；
The data to be sent are sent to selection by execution module if the node to be selected for selection meets threshold condition
Node to be selected does not send if being unsatisfactory for threshold condition and waits for the node to be selected in next period.
7. device according to claim 6, which is characterized in that second acquisition module includes：
Computing unit, for each section to be selected to be calculated according to the algorithm for the network delay being pre-configured in the mobile terminal model
The corresponding network delay of point；
First acquisition unit, for obtaining each node to be selected according to the routing protocol algorithm being pre-configured in the mobile terminal model
In any node and other all nodes the number M that meets, and obtain the phase of any node and destination node accordingly
Times N is met, the M is the integer more than 0；
First determination unit, for determining that the collision probability of any node and destination node in each node to be selected is N/M；
Second acquisition unit, for being obtained and each section to be selected according to the routing protocol algorithm being pre-configured in the mobile terminal model
The number A for the corresponding work post type of node that any node in point is met, and obtain the number B of all work post types；
Second determination unit, for determining that the range of scatter of any node in each node to be selected is A/B.
8. the device described according to claim 6 or 7, which is characterized in that the processing module includes：
Unit is transferred, the cost function for transferring pre-configuration；
Processing unit is obtained for substituting into the network delay got, collision probability and range of scatter in the cost function
To the corresponding weighted sum of each node to be selected.
9. device according to claim 6, which is characterized in that the execution module includes：
Execution unit will be described to be sent by the way of frame aggregation if the node to be selected for selection meets threshold condition
Data are sent to the node to be selected of selection, if being unsatisfactory for threshold condition, do not send and wait for the node to be selected in next period.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510157424.3A CN104735742B (en) | 2015-04-03 | 2015-04-03 | A kind of sending method and device of opportunistic network data |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510157424.3A CN104735742B (en) | 2015-04-03 | 2015-04-03 | A kind of sending method and device of opportunistic network data |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN104735742A CN104735742A (en) | 2015-06-24 |
| CN104735742B true CN104735742B (en) | 2018-08-07 |
Family
ID=53459075
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201510157424.3A Expired - Fee Related CN104735742B (en) | 2015-04-03 | 2015-04-03 | A kind of sending method and device of opportunistic network data |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN104735742B (en) |
Families Citing this family (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107071851B (en) * | 2017-03-20 | 2020-09-04 | 同济大学 | Service combination method and system of opportunity network |
| CN107124750B (en) * | 2017-03-20 | 2020-09-01 | 同济大学 | Routing forwarding method and system for opportunity network encounter prediction and distance perception |
| CN107835493B (en) * | 2017-10-19 | 2021-06-25 | 中国矿业大学 | Mine personnel emergency evacuation method based on cognitive opportunity communication |
| CN107770779B (en) * | 2017-10-19 | 2021-03-16 | 中国矿业大学 | Cognitive opportunity communication method suitable for mine environment |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP2337280A1 (en) * | 2009-12-21 | 2011-06-22 | Thomson Licensing | Method to manage an opportunistic communication network |
| CN103117957A (en) * | 2013-02-04 | 2013-05-22 | 重庆邮电大学 | Cache management method based on numbers of message replications and comprehensive effectiveness in opportunistic network |
-
2015
- 2015-04-03 CN CN201510157424.3A patent/CN104735742B/en not_active Expired - Fee Related
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP2337280A1 (en) * | 2009-12-21 | 2011-06-22 | Thomson Licensing | Method to manage an opportunistic communication network |
| CN103117957A (en) * | 2013-02-04 | 2013-05-22 | 重庆邮电大学 | Cache management method based on numbers of message replications and comprehensive effectiveness in opportunistic network |
Non-Patent Citations (3)
| Title |
|---|
| ProxiMol: Proximity and Mobility Estimation for Efficient Forwarding in Opportunistic Networks;Umiar Sadiq, Mohan Kumar;《2011 Eighth IEEE International Conference on Mobile Ad-Hoc and Sensor Systems》;20111022;全文 * |
| 基于混合策略的机会网络路由算法;刘期烈，刘茂松，李伟;《北京联合大学学报》;20150131;第29卷(第1期);全文 * |
| 基于特征分类的机会网络多因素预测路由;周强，应晶，吴明晖;《浙江大学学报》;20100331;第44卷(第3期);全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN104735742A (en) | 2015-06-24 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN104735742B (en) | A kind of sending method and device of opportunistic network data | |
| Erramilli et al. | Delegation forwarding | |
| Anazawa et al. | Trajectory and data planning for mobile relay to enable efficient Internet access after disasters | |
| CN108520303A (en) | A kind of recommendation system building method and device | |
| Chaitra et al. | Delay optimization and energy balancing algorithm for improving network lifetime in fixed wireless sensor networks | |
| Lu et al. | Interference‐aware spectrum handover for cognitive radio networks | |
| CN103155646B (en) | Realize the method for dynamic internetwork load balance, Apparatus and system | |
| EP3264824B1 (en) | Route selection method and apparatus | |
| Campos et al. | Realistic individual mobility markovian models for mobile ad hoc networks | |
| CN108418752A (en) | A kind of creation method and device of aggregation group | |
| CN101589641B (en) | Building communities of interest and selecting borders between them based on relative motion | |
| Syed et al. | An energy efficiency distributed routing algorithm based on HAC clustering method for WSNs | |
| CN103596286A (en) | Data scheduling method in area-restricted Ad-hoc network (ARANet) and system thereof | |
| Khan et al. | Impact of mobility models on clustering based routing protocols in mobile WSNs | |
| CN107770771A (en) | The method for routing of secret protection is added in opportunistic network | |
| de Araújo et al. | An optimized Markov model to predict link quality in mobile wireless sensor networks | |
| Cadger et al. | MANET location prediction using machine learning algorithms | |
| Lingaraj et al. | OMMIP: An optimized multiple mobile agents itinerary planning for wireless sensor networks | |
| CN105814958B (en) | Channel method and access point apparatus | |
| Fujihara et al. | On the use of congestion information for rerouting in the disaster evacuation guidance using opportunistic communication | |
| Xu et al. | Using complex network effects for communication decisions in large multi-robot teams | |
| Santos et al. | Dribble: A learn-based timer scheme selector for mobility management in IoT | |
| Dressler et al. | Efficient operation in sensor and actor networks inspired by cellular signaling cascades | |
| JP6120411B2 (en) | Network control method and apparatus | |
| Tanase et al. | Quality of service in large scale mobile distributed systems based on opportunistic networks |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| CF01 | Termination of patent right due to non-payment of annual fee | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20180807 |