CN106851694A - A kind of dynamic optimal network selecting method and device for heterogeneous network - Google Patents
A kind of dynamic optimal network selecting method and device for heterogeneous network Download PDFInfo
- Publication number
- CN106851694A CN106851694A CN201710169515.8A CN201710169515A CN106851694A CN 106851694 A CN106851694 A CN 106851694A CN 201710169515 A CN201710169515 A CN 201710169515A CN 106851694 A CN106851694 A CN 106851694A
- Authority
- CN
- China
- Prior art keywords
- network
- values
- time
- packet
- heterogeneous
- 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
Classifications
-
- 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
- H04W48/00—Access restriction; Network selection; Access point selection
- H04W48/18—Selecting a network or a communication service
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Computer Security & Cryptography (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The embodiment of the invention discloses a kind of dynamic optimal network selecting method and device for heterogeneous network, it is preset value by first initialization algorithm parameter, then certain amount of packet is sent using different networks in the exploratory stage, after reaching default exploration number, two Q values of network are calculated respectively, current optimal network is found out, the exploratory stage is completed.After completing the exploratory stage, algorithm starts the study stage, when there is new packet to arrive, the successful probability of every kind of transmitted data on network is calculated by the behavior before study, heterogeneous network node calculates new Q values using the optimal network in last stage, then the Q values with last another network of stage are compared, and the network for finally selecting Q values larger carries out packet forwarding.
Description
Technical field
The present invention relates to the selection field of heterogeneous network, more particularly to a kind of dynamic optimal network choosing for heterogeneous network
Selection method and device.
Background technology
Heterogeneous network distributes load by different network technologies to improve the overall performance of network, is high density covering
Regional cost, intensive, large area or temporary variations event provide support.But current heterogeneous network network selects faced master
Challenge including：Mobile data flow causes network load to be continuously increased in explosive growth；Network resource utilization is low；No
Same type e-learning quality causes that network structure is increasingly sophisticated, and network cooperating efficiency is not good.Therefore, how network transmission technology is optimized
Selection be a significant challenge that heterogeneous network faces.
It is not high in order to tackle the network whole volume that the heterogeneous network transmission choice of technology brings, low and network the association of utilization rate
Same inefficient, so that the performance of heterogeneous network does not reach expection.The transmission technology of present heterogeneous network mainly has：Micro-cellular network
Micronetwork in network improves channeling by compared with low transmitting power；Heterogeneous network is distributed between network using radio characteristics
Data；Network capacity is improved by splitting data；In-vehicle networking elects node as gateway forwards packet, due to different nets
Using different standard and data form, these methods need heterogeneous network by a new mechanism between different networks to network
Exchange of control information, has that time delay is higher, energy consumption is larger, it is impossible to preferably solve the problems, such as that capacity is low, efficiency is low and concertedness is poor.
Therefore it provides one can solve the problem that in heterogeneous network transmission technology that time delay is high, energy consumption is big, capacity is low, efficiency is low and
The method and device of the problems such as concertedness difference is those skilled in the art's technical issues that need to address.
The content of the invention
A kind of dynamic optimal network selecting method and device for heterogeneous network is the embodiment of the invention provides, with reference to strong
Change the theories of learning to optimize the selection of transmission technology, propose a new nitrification enhancement come before allowing each node to learn
Operation improve network performance.
A kind of dynamic optimal network selecting method for heterogeneous network is the embodiment of the invention provides, including：
S1：Get parameter Exp=true, mark scalar FlagW=true, counting variable Expcount=0；
S2：After obtaining packet, judge whether parameter Exp=true, if so, S3 is then performed, if it is not, then performing S7；
S3：Judge whether to indicate scalar FlagW=true, if so, S4 is then performed, if not then performing S5；
S4：Selection sends packet using the second network, and makes FlagW=flase, then performs S6；
S5：Selection sends packet using first network, and makes FlagW=true, then performs S6；
S6：Counting variable Expcount is added one, whether counting variable Expcount is judged more than preset threshold value, if greatly
In, make Exp=flase and compare the Q value sizes being calculated to first network and the second network by preset formula, make
Larger Q values are a Q values, make less Q values for the 2nd Q values, and it is current optimal net to select network corresponding with a Q values
Network, and S2 is performed, if being not more than, perform S2；
S7：After getting new packet, current optimal network is carried out by preset formula be calculated the 3rd Q values,
And compare the size of the 2nd Q values and the 3rd Q values, obtain maximum Q values, and select the network corresponding with maximum Q values to carry out packet
Send.
Preferably, the preset formula is：
Q(ti)=(1- α) Q (ti-1)+α[SR(ti-1-ti)+CQ(ti)-Q(ti-1)]
Wherein, Q (ti) it is in time tiHeterogeneous nodes access the probability of network channel；α is learning rate；SR(ti-1-ti) be
Heterogeneous nodes are from time ti-1To time tiBetween packet transmission success rate；CQ(ti) it is in time tiNetwork channel matter
Amount.
Preferably, the heterogeneous nodes are in time ti-1To time tiBetween packet transmission success rate SR (ti-1-ti)
Computing formula is：
SR(ti-1-ti)=ST (ti-1-ti)/TT(ti-1-ti)
Wherein, ST (ti-1-ti) it is heterogeneous nodes from time ti-1To time tiPacket Successful transmissions number；TT(ti-1-
ti) it is heterogeneous nodes from ti-1To tiThe entire packet transmission number of period.
Preferably, it is described in time tiNetwork channel quality CQ (ti) computing formula be：
CQ(ti)=R (ti)/Rmax
Wherein, R (ti) for heterogeneous nodes in time tiThe transmission rate of network；RmaxFor network transmission technology can be supported
Peak transfer rate.
Preferably, the embodiment of the present invention also provides volume a kind of dynamic optimal network selection apparatus for heterogeneous network, bag
Include：
Acquiring unit, for getting parameter Exp=true, mark scalar FlagW=true, counting variable Expcount
=0；
First judging unit, after obtaining packet, judges whether parameter Exp=true, if so, then triggering second is sentenced
Disconnected unit, if it is not, then triggering the second computing unit；
Second judging unit, for judging whether to indicate scalar FlagW=true, if so, first choice unit is then triggered,
If not then triggering the second select unit；
First choice unit, for selecting to send packet using the second network, and makes FlagW=flase, then triggers the
One computing unit；
Second select unit, for selecting to send packet using first network, and makes FlagW=true, then triggers the
One computing unit；
First computing unit, for adding one by counting variable Expcount, judges whether counting variable Expcount is more than
Preset threshold value, if being more than, is made Exp=flase and compared first network and the second network are calculated by preset formula
The Q value sizes for arriving, make larger Q values for a Q values, make less Q values for the 2nd Q values, select network corresponding with a Q values
It is current optimal network, and triggers the first judging unit, if being not more than, triggers the first judging unit；
Second computing unit, after getting new packet, is counted by preset formula to current optimal network
Calculation obtains the 3rd Q values, and compares the size of the 2nd Q values and the 3rd Q values, obtains maximum Q values, and select corresponding with maximum Q values
Network carries out packet transmission.
Preferably, the preset formula is：
Q(ti)=(1- α) Q (ti-1)+α[SR(ti-1-ti)+CQ(ti)-Q(ti-1)]
Wherein, Q (ti) it is in time tiHeterogeneous nodes access the probability of network channel；α is learning rate；SR(ti-1-ti) be
Heterogeneous nodes are from time ti-1To time tiBetween packet transmission success rate；CQ(ti) it is in time tiNetwork channel matter
Amount.
Preferably, the heterogeneous nodes are in time ti-1To time tiBetween packet transmission success rate SR (ti-1-ti)
Computing formula is：
SR(ti-1-ti)=ST (ti-1-ti)/TT(ti-1-ti)
Wherein, ST (ti-1-ti) it is heterogeneous nodes from time ti-1To time tiPacket Successful transmissions number；TT(ti-1-
ti) it is heterogeneous nodes from ti-1To tiThe entire packet transmission number of period.
Preferably, it is described in time tiNetwork channel quality CQ (ti) computing formula be：
CQ(ti)=R (ti)/Rmax
Wherein, R (ti) for heterogeneous nodes in time tiThe transmission rate of network；RmaxFor network transmission technology can be supported
Peak transfer rate.
As can be seen from the above technical solutions, the embodiment of the present invention has advantages below：
A kind of dynamic optimal network selecting method and device for heterogeneous network is the embodiment of the invention provides, wherein,
The dynamic optimal network selecting method for being used for heterogeneous network includes：S1：Get parameter Exp=true, mark scalar FlagW
=true, counting variable Expcount=0；S2：After obtaining packet, judge whether parameter Exp=true, if so, then performing
S3, if it is not, then performing S7；S3：Judge whether to indicate scalar FlagW=true, if so, S4 is then performed, if not then performing
S5；S4：Selection sends packet using the second network, and makes FlagW=flase, then performs S6；S5：Selection uses the first net
Network sends packet, and makes FlagW=true, then performs S6；S6：Counting variable Expcount is added one, counting variable is judged
Whether Expcount is more than preset threshold value, if being more than, makes Exp=flase and compares by preset formula to first network and the
The Q value sizes that two networks are calculated, make larger Q values for a Q values, make less Q values for the 2nd Q values, select and
The corresponding network of first Q values is current optimal network, and performs S2, if being not more than, performs S2；S7：Get new data
Bao Hou, carries out being calculated the 3rd Q values by preset formula to current optimal network, and it is big with the 3rd Q values to compare the 2nd Q values
It is small, maximum Q values are obtained, and selection network corresponding with maximum Q values carries out packet transmission.Embodiment of the present invention combination extensive chemical
Practise theoretical, the parameter based on each network, the network state before study optimizes the selection of transmission technology, improve network appearance
Amount, reduces expense, solves the problems, such as that efficiency is low and concertedness is poor.
Brief description of the drawings
In order to illustrate more clearly about the embodiment of the present invention or technical scheme of the prior art, below will be to embodiment or existing
The accompanying drawing to be used needed for having technology description is briefly described, it should be apparent that, drawings in the following description are only this
Some embodiments of invention, for those of ordinary skill in the art, without having to pay creative labor, may be used also
Other accompanying drawings are obtained with according to these accompanying drawings.
Fig. 1 is that a kind of flow of dynamic optimal network selecting method for heterogeneous network provided in an embodiment of the present invention is shown
It is intended to；
Fig. 2 is that a kind of structure of dynamic optimal network selection apparatus for heterogeneous network provided in an embodiment of the present invention is shown
It is intended to.
Specific embodiment
A kind of dynamic optimal network selecting method and device for heterogeneous network is the embodiment of the invention provides, with reference to strong
Change the theories of learning to optimize the selection of transmission technology, propose a new nitrification enhancement come before allowing each node to learn
Operation improve network performance.
To enable that goal of the invention of the invention, feature, advantage are more obvious and understandable, below in conjunction with the present invention
Accompanying drawing in embodiment, is clearly and completely described, it is clear that disclosed below to the technical scheme in the embodiment of the present invention
Embodiment be only a part of embodiment of the invention, and not all embodiment.Based on the embodiment in the present invention, this area
All other embodiment that those of ordinary skill is obtained under the premise of creative work is not made, belongs to protection of the present invention
Scope.
Fig. 1 is referred to, a kind of dynamic optimal network selecting method for heterogeneous network provided in an embodiment of the present invention
One embodiment, including：
101st, parameter Exp=true, mark scalar FlagW=true, counting variable Expcount=0 are got；
Get parameter Exp=true, mark scalar FlagW=true, the counting variable Expcount=0 for presetting.
102nd, after obtaining packet, parameter Exp=true is judged whether, if so, 103 are then performed, if it is not, then performing
107；
After obtaining packet, judge whether parameter Exp=true, if so, step 103 is then performed, if it is not, then performing step
Rapid 107.
103rd, judge whether to indicate scalar FlagW=true, if so, 104 are then performed, if not then performing 105；
After parameter Exp=true is judged, judge whether to indicate scalar FlagW=true, if so, step 104 is then performed,
If not then performing step 105.
104th, selection sends packet using the second network, and makes FlagW=flase, then performs 106；
After judging FlagW=true, selection sends packet using the second network, and makes FlagW=flase, then performs
Step 106.
105th, selection sends packet using first network, and makes FlagW=true, then performs 106；
After judging FlagW=flase, selection sends packet using first network, and makes FlagW=true, then performs
Step 106.
106th, counting variable Expcount is added one, whether counting variable Expcount is judged more than preset threshold value, if greatly
In, make Exp=flase and compare the Q value sizes being calculated to first network and the second network by preset formula, make
Larger Q values are a Q values, make less Q values for the 2nd Q values, and it is current optimal net to select network corresponding with a Q values
Network, and 102 are performed, if no more than, performing 102；
107th, after getting new packet, current optimal network is carried out by preset formula be calculated the 3rd Q values,
And compare the size of the 2nd Q values and the 3rd Q values, obtain maximum Q values, and select the network corresponding with maximum Q values to carry out packet
Send.
After judging Exp=flase, after getting new packet, current optimal network is counted by preset formula
Calculation obtains the 3rd Q values, and compares the size of the 2nd Q values and the 3rd Q values, obtains maximum Q values, and select corresponding with maximum Q values
Network carries out packet transmission.
Further, preset formula is：
Q(ti)=(1- α) Q (ti-1)+α[SR(ti-1-ti)+CQ(ti)-Q(ti-1)]
Wherein, Q (ti) it is in time tiHeterogeneous nodes access the probability of network channel；α is learning rate；SR(ti-1-ti) be
Heterogeneous nodes are from time ti-1To time tiBetween packet transmission success rate；CQ(ti) it is in time tiNetwork channel matter
Amount.
Further, heterogeneous nodes are in time ti-1To time tiBetween packet transmission success rate SR (ti-1-ti) meter
Calculating formula is：
SR(ti-1-ti)=ST (ti-1-ti)/TT(ti-1-ti)
Wherein, ST (ti-1-ti) it is heterogeneous nodes from time ti-1To time tiPacket Successful transmissions number；TT(ti-1-
ti) it is heterogeneous nodes from ti-1To tiThe entire packet transmission number of period.
Further, in time tiNetwork channel quality CQ (ti) computing formula be：
CQ(ti)=R (ti)/Rmax
Wherein, R (ti) for heterogeneous nodes in time tiThe transmission rate of network；RmaxFor network transmission technology can be supported
Peak transfer rate.
The above is the detailed description carried out to a kind of dynamic optimal network selecting method for heterogeneous network, for ease of reason
Solution, will be said with a concrete application scene to a kind of application of the dynamic optimal network selecting method for heterogeneous network below
Bright, application examples includes：
1. initial algorithm parameter, parameter preset value first：ti=0；Exp=true；FlagW=true；Expcount=
0；Q(ti)=0；CQ(ti)=0；SR(ti-1-ti)=0.
2. the exploratory stage is entered, the exploratory stage sends certain amount of packet using different networks, and a mark becomes
Which network is amount (FlagW) be used to refer to show using, by canonical variable, packet is used alternatingly and trains two networks, then
One counting variable (Expcount) is for controlling in the exploration number completed required by this stage, when not using a data
Bao Shi, Expcount add 1, and when Expcount reaches threshold value, setting Exp is false, and two Q of network are then calculated respectively
Value, finds out current optimal network, completes the exploratory stage.
3. after completing the exploratory stage, because Exp=false, algorithm has started the study stage, new when having in this stage
Packet arrive when, heterogeneous network node calculates new Q values using the optimal network in last stage, then with the last stage
The Q values of another network are compared, and the network for finally selecting Q values larger carries out packet forwarding.
It should be noted that step 2. in：
A, calculate Q values formula it is as follows：
Q(ti)=(1- α) Q (ti-1)+α[SR(ti-1-ti)+CQ(ti)-Q(ti-1)]
Wherein, Q (ti) represent in time ti, the probability of node visit network channel；α is learning rate, SR (ti-1-ti) it is section
Point is in ti-1State to tiState since packet transmission success rate；CQ(ti) it is in time point tiNetwork channel matter
Amount.
b、SR(ti-1-ti) computing formula it is as follows：
SR(ti-1-ti)=ST (ti-1-ti)/TT(ti-1-ti)
Wherein, ST (ti-1-ti) it is node from ti-1To tiPacket Successful transmissions number, TT (ti-1-ti) it is that node exists
ti-1To tiThe entire packet transmission number of period.
c、CQ(ti) computing formula it is as follows：
CQ(ti)=R (ti)/Rmax
Wherein, R (ti) it is node in tiWhen network transmission rate, RmaxIt is that the maximum that network transmission technology can be supported is passed
Defeated speed.
Fig. 2 is referred to, a kind of dynamic optimal network selection apparatus for heterogeneous network provided in an embodiment of the present invention
One embodiment, including：
Acquiring unit 201, for getting parameter Exp=true, mark scalar FlagW=true, counting variable
Expcount=0；
First judging unit 202, after obtaining packet, judges whether parameter Exp=true, if so, then triggering
Two judging units 203, if it is not, then triggering the second computing unit 207；
Second judging unit 203, for judging whether to indicate scalar FlagW=true, if so, then triggering first choice list
Unit 204, if not then triggering the second select unit 205；
First choice unit 204, for selecting to send packet using the second network, and makes FlagW=flase, then touch
Send out the first computing unit 206；
Second select unit 205, for selecting to send packet using first network, and makes FlagW=true, then trigger
First computing unit 206；
First computing unit 206, for adding one by counting variable Expcount, judges whether counting variable Expcount is big
In preset threshold value, if being more than, make Exp=flase and compare first network and the second network are calculated by preset formula
The Q value sizes for obtaining, make larger Q values for a Q values, make less Q values for the 2nd Q values, select net corresponding with a Q values
Network is current optimal network, and triggers the first judging unit 202, if being not more than, triggers the first judging unit 202；
Second computing unit 207, after getting new packet, is carried out by preset formula to current optimal network
It is calculated the 3rd Q values, and compares the size of the 2nd Q values and the 3rd Q values, obtains maximum Q values, and select corresponding with maximum Q values
Network carry out packet transmission.
Further, preset formula is：
Q(ti)=(1- α) Q (ti-1)+α[SR(ti-1-ti)+CQ(ti)-Q(ti-1)]
Wherein, Q (ti) it is in time tiHeterogeneous nodes access the probability of network channel；α is learning rate；SR(ti-1-ti) be
Heterogeneous nodes are from time ti-1To time tiBetween packet transmission success rate；CQ(ti) it is in time tiNetwork channel matter
Amount.
Further, heterogeneous nodes are in time ti-1To time tiBetween packet transmission success rate SR (ti-1-ti) meter
Calculating formula is：
SR(ti-1-ti)=ST (ti-1-ti)/TT(ti-1-ti)
Wherein, ST (ti-1-ti) it is heterogeneous nodes from time ti-1To time tiPacket Successful transmissions number；TT(ti-1-
ti) it is heterogeneous nodes from ti-1To tiThe entire packet transmission number of period.
Further, in time tiNetwork channel quality CQ (ti) computing formula be：
CQ(ti)=R (ti)/Rmax
Wherein, R (ti) for heterogeneous nodes in time tiThe transmission rate of network；RmaxFor network transmission technology can be supported
Peak transfer rate.
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, may be referred to the corresponding process in preceding method embodiment, will not be repeated here.
In several embodiments provided herein, it should be understood that disclosed system, apparatus and method can be with
Realize by another way.For example, device embodiment described above is only schematical, for example, the unit
Divide, only a kind of division of logic function there can be other dividing mode when actually realizing, for example multiple units or component
Can combine or be desirably integrated into another system, or some features can be ignored, or do not perform.It is another, it is shown or
The coupling each other for discussing or direct-coupling or communication connection can be the indirect couplings of device or unit by some interfaces
Close or communicate to connect, can be electrical, mechanical or other forms.
The unit that is illustrated as separating component can be or may not be it is physically separate, it is aobvious as unit
The part for showing can be or may not be physical location, you can with positioned at a place, or can also be distributed to multiple
On NE.Some or all of unit therein can be according to the actual needs selected to realize the mesh of this embodiment scheme
's.
In addition, during each functional unit in each embodiment of the invention can be integrated in a processing unit, it is also possible to
It is that unit is individually physically present, it is also possible to which two or more units are integrated in a unit.Above-mentioned integrated list
Unit can both be realized in the form of hardware, it would however also be possible to employ the form of SFU software functional unit is realized.
If the integrated unit is to realize in the form of SFU software functional unit and as independent production marketing or use
When, can store in a computer read/write memory medium.Based on such understanding, technical scheme is substantially
The part for being contributed to prior art in other words or all or part of the technical scheme can be in the form of software products
Embody, the computer software product is stored in a storage medium, including some instructions are used to so that a computer
Equipment (can be personal computer, server, or network equipment etc.) performs the complete of each embodiment methods described of the invention
Portion or part steps.And foregoing storage medium includes：USB flash disk, mobile hard disk, read-only storage (ROM, Read-Only
Memory), random access memory (RAM, RandomAccess Memory), magnetic disc or CD etc. are various can store journey
The medium of sequence code.
The above, the above embodiments are merely illustrative of the technical solutions of the present invention, rather than its limitations；Although with reference to preceding
Embodiment is stated to be described in detail the present invention, it will be understood by those within the art that：It still can be to preceding
State the technical scheme described in each embodiment to modify, or equivalent is carried out to which part technical characteristic；And these
Modification is replaced, and does not make the spirit and scope of the essence disengaging various embodiments of the present invention technical scheme of appropriate technical solution.
Claims (8)
1. a kind of dynamic optimal network selecting method for heterogeneous network, it is characterised in that including：
S1：Get parameter Exp=true, mark scalar FlagW=true, counting variable Expcount=0；
S2：After obtaining packet, judge whether parameter Exp=true, if so, S3 is then performed, if it is not, then performing S7；
S3：Judge whether to indicate scalar FlagW=true, if so, S4 is then performed, if not then performing S5；
S4：Selection sends packet using the second network, and makes FlagW=flase, then performs S6；
S5：Selection sends packet using first network, and makes FlagW=true, then performs S6；
S6：Whether counting variable Expcount is added one, counting variable Expcount is judged more than preset threshold value, if being more than, order
Exp=flase simultaneously compares the Q value sizes being calculated to first network and the second network by preset formula, makes larger
Q values be a Q values, make less Q values for the 2nd Q values, selection network corresponding with a Q values is current optimal network, and
S2 is performed, if being not more than, S2 is performed；
S7：After getting new packet, current optimal network is carried out by preset formula be calculated the 3rd Q values, and compare
Compared with the 2nd Q values and the size of the 3rd Q values, maximum Q values are obtained, and selection network corresponding with maximum Q values carries out packet transmission.
2. the dynamic optimal network selecting method for heterogeneous network according to claim 1, it is characterised in that described pre-
Putting formula is：
Q(ti)=(1- α) Q (ti-1)+α[SR(ti-1-ti)+CQ(ti)-Q(ti-1)]
Wherein, Q (ti) it is in time tiHeterogeneous nodes access the probability of network channel；α is learning rate；SR(ti-1-ti) it is isomery
Node is from time ti-1To time tiBetween packet transmission success rate；CQ(ti) it is in time tiNetwork channel quality.
3. the dynamic optimal network selecting method for heterogeneous network according to claim 2, it is characterised in that described different
Structure node is in time ti-1To time tiBetween packet transmission success rate SR (ti-1-ti) computing formula be：
SR(ti-1-ti)=ST (ti-1-ti)/TT(ti-1-ti)
Wherein, ST (ti-1-ti) it is heterogeneous nodes from time ti-1To time tiPacket Successful transmissions number；TT(ti-1-ti)
It is heterogeneous nodes from ti-1To tiThe entire packet transmission number of period.
4. the dynamic optimal network selecting method for heterogeneous network according to claim 3, it is characterised in that it is described
Time tiNetwork channel quality CQ (ti) computing formula be：
CQ(ti)=R (ti)/Rmax
Wherein, R (ti) for heterogeneous nodes in time tiThe transmission rate of network；RmaxFor the maximum that network transmission technology can be supported
Transmission rate.
5. a kind of dynamic optimal network selection apparatus for heterogeneous network, it is characterised in that including：
Acquiring unit, for getting parameter Exp=true, mark scalar FlagW=true, counting variable Expcount=0；
First judging unit, after obtaining packet, judges whether parameter Exp=true, if so, then triggering second judges single
Unit, if it is not, then triggering the second computing unit；
Second judging unit, for judging whether to indicate scalar FlagW=true, if so, first choice unit is then triggered, if not
It is to trigger the second select unit；
First choice unit, for selecting to send packet using the second network, and makes FlagW=flase, then trigger the first meter
Calculate unit；
Second select unit, for selecting to send packet using first network, and makes FlagW=true, then trigger the first meter
Calculate unit；
Whether the first computing unit, for adding one by counting variable Expcount, judge counting variable Expcount more than preset
Threshold value, if being more than, is made Exp=flase and compares the Q being calculated to first network and the second network by preset formula
Value size, makes larger Q values for a Q values, makes less Q values for the 2nd Q values, and it is to work as to select network corresponding with a Q values
Preceding optimal network, and the first judging unit is triggered, if being not more than, trigger the first judging unit；
Second computing unit, after getting new packet, is calculated by preset formula to current optimal network
To the 3rd Q values, and compare the size of the 2nd Q values and the 3rd Q values, obtain maximum Q values, and select network corresponding with maximum Q values
Carry out packet transmission.
6. dynamic optimal network selection apparatus for heterogeneous network according to claim 5, it is characterised in that described pre-
Putting formula is：
Q(ti)=(1- α) Q (ti-1)+α[SR(ti-1-ti)+CQ(ti)-Q(ti-1)]
Wherein, Q (ti) it is in time tiHeterogeneous nodes access the probability of network channel；α is learning rate；SR(ti-1-ti) it is isomery
Node is from time ti-1To time tiBetween packet transmission success rate；CQ(ti) it is in time tiNetwork channel quality.
7. dynamic optimal network selection apparatus for heterogeneous network according to claim 6, it is characterised in that described different
Structure node is in time ti-1To time tiBetween packet transmission success rate SR (ti-1-ti) computing formula be：
SR(ti-1-ti)=ST (ti-1-ti)/TT(ti-1-ti)
Wherein, ST (ti-1-ti) it is heterogeneous nodes from time ti-1To time tiPacket Successful transmissions number；TT(ti-1-ti)
It is heterogeneous nodes from ti-1To tiThe entire packet transmission number of period.
8. dynamic optimal network selection apparatus for heterogeneous network according to claim 7, it is characterised in that it is described
Time tiNetwork channel quality CQ (ti) computing formula be：
CQ(ti)=R (ti)/Rmax
Wherein, R (ti) for heterogeneous nodes in time tiThe transmission rate of network；RmaxFor the maximum that network transmission technology can be supported
Transmission rate.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710169515.8A CN106851694B (en) | 2017-03-21 | 2017-03-21 | Dynamic optimal network selection method and device for heterogeneous network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710169515.8A CN106851694B (en) | 2017-03-21 | 2017-03-21 | Dynamic optimal network selection method and device for heterogeneous network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN106851694A true CN106851694A (en) | 2017-06-13 |
| CN106851694B CN106851694B (en) | 2020-04-14 |
Family
ID=59130348
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201710169515.8A Active CN106851694B (en) | 2017-03-21 | 2017-03-21 | Dynamic optimal network selection method and device for heterogeneous network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN106851694B (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108668338A (en) * | 2018-03-28 | 2018-10-16 | 华东交通大学 | Network selecting method in heterogeneous network |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20120002567A1 (en) * | 2010-07-01 | 2012-01-05 | The Hong Kong University Of Science And Technology | Cross-layer optimization for next-generation wifi systems |
| CN103327556A (en) * | 2013-07-04 | 2013-09-25 | 中国人民解放军理工大学通信工程学院 | Dynamic network selection method for optimizing quality of experience (QoE) of user in heterogeneous wireless network |
| KR20150069496A (en) * | 2013-12-12 | 2015-06-23 | 한국과학기술원 | Method and Apparatus for Selecting Energy-Efficient in Multi Radio Environment |
| CN105120468A (en) * | 2015-07-13 | 2015-12-02 | 华中科技大学 | Dynamic wireless network selection method based on evolutionary game theory |
| CN105391490A (en) * | 2015-10-20 | 2016-03-09 | 中国人民解放军理工大学 | Satellite communication network selection algorithm based on cognition |
-
2017
- 2017-03-21 CN CN201710169515.8A patent/CN106851694B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20120002567A1 (en) * | 2010-07-01 | 2012-01-05 | The Hong Kong University Of Science And Technology | Cross-layer optimization for next-generation wifi systems |
| CN103327556A (en) * | 2013-07-04 | 2013-09-25 | 中国人民解放军理工大学通信工程学院 | Dynamic network selection method for optimizing quality of experience (QoE) of user in heterogeneous wireless network |
| KR20150069496A (en) * | 2013-12-12 | 2015-06-23 | 한국과학기술원 | Method and Apparatus for Selecting Energy-Efficient in Multi Radio Environment |
| CN105120468A (en) * | 2015-07-13 | 2015-12-02 | 华中科技大学 | Dynamic wireless network selection method based on evolutionary game theory |
| CN105391490A (en) * | 2015-10-20 | 2016-03-09 | 中国人民解放军理工大学 | Satellite communication network selection algorithm based on cognition |
Non-Patent Citations (2)
| Title |
|---|
| 吴昌宇: "终端设备异构无线网络接入选择算法研究", 《中国优秀硕士学位论文全文数据库 信息科技辑》 * |
| 高继勋 等: "基于增强学习与QoE需求函数的自适应无线网络择取优化机制", 《计算机应用与软件》 * |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108668338A (en) * | 2018-03-28 | 2018-10-16 | 华东交通大学 | Network selecting method in heterogeneous network |
| CN108668338B (en) * | 2018-03-28 | 2020-10-02 | 华东交通大学 | Network selection method in heterogeneous network |
Also Published As
| Publication number | Publication date |
|---|---|
| CN106851694B (en) | 2020-04-14 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN102611617B (en) | Techniques for channel access and transmit queue selection | |
| CN109618373A (en) | Link choosing method and relevant apparatus | |
| CN101584234B (en) | Method of congestion management in a wireless mesh network, system and station of the wireless mesh network | |
| CN104301141B (en) | A kind of method, apparatus and system for preserving configuration information | |
| CN104917820B (en) | A kind of data transmission method based on the wireless interconnected interworking technology of micropower | |
| CN101835239A (en) | Multi-path delay sensing optimal route selecting method for cognitive network | |
| CN102647773B (en) | Method for controlling, optimizing and selecting of heterogeneous network access based on Q-learning | |
| CN104254137B (en) | A kind of method and apparatus of competition window adjustment | |
| KR101560523B1 (en) | Operating method of wireless sensor networks considering energy efficiency | |
| CN116744311B (en) | User group spectrum access method based on PER-DDQN | |
| CN106686598A (en) | Node accessing method of Zigbee network | |
| CN104333882A (en) | Wireless network traffic control method | |
| CN105557045A (en) | Access network node, core network node and paging method | |
| CN113965474A (en) | Network quality evaluation method, electronic device and storage medium | |
| CN103312469A (en) | Method and device for selecting ACK-leader in multicast retransmission | |
| WO2020173295A1 (en) | Random access method and apparatus | |
| CN106851694A (en) | A kind of dynamic optimal network selecting method and device for heterogeneous network | |
| CN107454659A (en) | A kind of terminal identification method, system, terminal device and base station | |
| CN106658647A (en) | Relay selection algorithm based on interference perception | |
| CN102907052A (en) | Topological information processing method and equipment | |
| Nicopolitidis et al. | Carrier‐sense‐assisted adaptive learning MAC protocols for distributed wireless LANs | |
| CN103188785A (en) | Optimization method of power distribution in accessing strategy of wireless relays of internet of things | |
| Pengwon et al. | Solving asymmetric link problems in WSNs using site Link Quality Estimators and dual-tree topology | |
| CN107018576A (en) | Accidental access method based on grid chart | |
| CN109417775A (en) | A kind of end-to-end communication method, terminal and base station |
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 | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |