CN106454860A - Vehicle-mounted opportunity network performance assessment method based on Markov process - Google Patents
Vehicle-mounted opportunity network performance assessment method based on Markov process Download PDFInfo
- Publication number
- CN106454860A CN106454860A CN201610871963.8A CN201610871963A CN106454860A CN 106454860 A CN106454860 A CN 106454860A CN 201610871963 A CN201610871963 A CN 201610871963A CN 106454860 A CN106454860 A CN 106454860A
- Authority
- CN
- China
- Prior art keywords
- vehicle
- state
- mounted node
- node
- information
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W16/00—Network planning, e.g. coverage or traffic planning tools; Network deployment, e.g. resource partitioning or cells structures
- H04W16/18—Network planning tools
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W16/00—Network planning, e.g. coverage or traffic planning tools; Network deployment, e.g. resource partitioning or cells structures
- H04W16/22—Traffic simulation tools or models
- H04W16/225—Traffic simulation tools or models for indoor or short range network
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W84/00—Network topologies
- H04W84/18—Self-organising networks, e.g. ad-hoc networks or sensor networks
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D30/00—Reducing energy consumption in communication networks
- Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The invention discloses a vehicle-mounted opportunity network performance assessment method based on a Markov process, which belongs to the field of vehicle-mounted network communication. The method comprises the following steps of establishing a vehicle-mounted opportunity network model M composed of a source vehicle-mounted node, an object vehicle-mounted node and F+H relay vehicle-mounted nodes; establishing community models of the vehicle-mounted nodes based on the vehicle-mounted opportunity network model M and selfish actions; based on the community models, establishing Markov chains for information spreading processes under the selfish actions; establishing continuous-time Markov chains of the information spreading process with the selfish actions under a condition of limited energy; and analyzing influences of the selfish actions on information transmission delay and information transmission cost in a quantitative manner. The invention provides a general model for vehicle-mounted opportunity network performance assessment, and is beneficial for analyzing deep influences of different factors such as transmission probability, selfish characteristics and network energy consumption on network performance.
Description
Technical field
The present invention relates to the In-vehicle networking communications field, particularly to a kind of vehicle-mounted opportunistic network based on markoff process
Performance estimating method.
Background technology
In vehicle-mounted opportunistic network, how to improve network transmission performance is route and the key problem forwarding needs to solve,
Most typically and simple routing mechanism are the methods of flooding, and it is directed to chance each time and meets and carries out the forwarding of message, but this
Method brings very big network overhead, therefore, how to improve the method, is obtained with less forwarded expense and preferably forwards
Performance becomes the hot issue of current research.
At present, compared with the method for flooding, the Gossip method according to probability transmission can reach while reducing expense
One of a relatively high rate of information throughput.In Gossip method, each vehicle decides whether according to transmission probability to transmit
Information.There are some researches show, in large-scale In-vehicle networking, the transmission probability between 0.6 to 0.8 ensure that almost each purpose
Node can receive information, therefore compares with big vast model strategy, and the information content that Gossip method uses reduces 35%.It is being based on
In the vehicle-mounted opportunistic network of probability transmission, different vehicle needs to transmit by the way of cooperation and relay data.Such as, when certain
When individual vehicle can not transmit information to next vehicle immediately, this vehicle can using the memory block of oneself Lai data cached,
Carry data, when move to can with the communication range of the vehicle of relay data in when, then transfer data to next vehicle.So
And, in actual probability transmits, because each vehicle-mounted node decides whether transmission information according to transmission probability, reduce system
Transmission probability can preserve limited storage and energy resource.That is, because vehicle-mounted node is controlled by people, vehicle leads to
It is often selfish.Such as, in mobile community network, by the people of same interest, community is formed by the mobile phone in vehicle.From
For the angle of each vehicle-mounted node, it is not intended to relaying and storage information, thus preserving limited storage and energy resource.From
For the angle of community, community is more desirable in same community internal transmission information, rather than transmission information between different communities.
Both selfishness behaviors are known respectively as personal selfish and society's selfishness.Obviously, these selfish behaviors will affect transmission information
Performance.
During realizing the present invention, inventor finds that prior art at least has problems with：
Existing probability transmission method and work do not have the selfish impact to In-vehicle networking performance for the behavior of consideration now, with
When, in much vehicle-mounted opportunistic networks, the system capacity restricted problem of information transfer is not taken into full account, leads to vehicle-mounted machine
Can network performance be difficult to assess.
Content of the invention
In order to solve problem of the prior art, embodiments provide a kind of vehicle-mounted machine based on markoff process
Can network performance evaluation method.Described technical scheme is as follows：
A kind of vehicle-mounted machine meeting network performance evaluation method based on markoff process, comprises the following steps：
S100 builds the car being made up of the vehicle-mounted node in source, a vehicle-mounted node of purpose and the F+H vehicle-mounted node of relaying
Carrier aircraft can network model M；
S200 is based on described vehicle-mounted machine meeting network model M and selfish behavior, builds the community model of described vehicle-mounted node；
S300 is based on described community model, builds the Markov Chain of Information Communication process under selfish behavior；
S400 is based on described step S300, builds the Information Communication process under the conditions of energy constraint, with selfish behavior
Markov Chain continuous time；
The impact to information transfer delay and information transfer cost for the S500 quantitative analyses selfishness behavior.
Alternatively, described step S100 is specially：
Described vehicle-mounted machine can network modelling be some wireless vehicle mounted nodes, represented with M, | M |=2+F+H represents described car
The quantity carrying vehicle-mounted node in opportunistic network is 2+F+H, wherein, there is the vehicle-mounted node in source, the vehicle-mounted node of purpose and F
+ H relays vehicle-mounted node.
Alternatively, described selfishness behavior is divided into personal selfishness behavior and society's selfishness behavior.
Alternatively, described step S200 is specially：
Based on described vehicle-mounted machine can network model it is considered to vehicle-mounted node society selfishness behavior, between vehicle-mounted node
Community attributes are modeled, and the vehicle-mounted node of described relaying is divided into Liang Ge community M1And M2, wherein M1={ 1,2 ..., F }, M2=
{ 1,2 ..., H }, each vehicle-mounted node at most belongs to a community；
Consider the impact of personal selfishness behavior it is stipulated that M1In node be personal selfish, M2In vehicle-mounted node be not
People's selfishness.
Alternatively, described step S300 is specially：
Based on described community model, the obedience quantum condition entropy that meets between vehicle-mounted node, the transfer of system mode forms horse
Er Kefu chain；
Based in community and there are different distributions the intercommunal commitment defini interval time it is stipulated that in community between vehicle-mounted node
Communication frequency is λ0, the communication frequency between intercommunal vehicle-mounted node is λ1It is contemplated that the vehicle-mounted node in source and the vehicle-mounted node of purpose
It is not belonging to M1And M2It is stipulated that the communication frequency of the vehicle-mounted node in source and the vehicle-mounted node of purpose and the vehicle-mounted node in this Liang Ge community
For λ；
Under personal selfishness behavior, the vehicle-mounted node having information is with Probability pnfInformation is not passed to and is not believed by ∈ [0,1]
The vehicle-mounted node of breath, the vehicle-mounted node not having information is with Probability pnc∈ [0,1] not receive information；
Under society's selfishness behavior it is stipulated that in community, the transmission probability of vehicle-mounted node is pi, different intercommunal nodes
Transmission probability be po, pi>po.
Alternatively, described step S400 is specially：
Based on described step S300, in the transmission of energy constraint, each vehicle-mounted node with Probability p transmission information and is used
It is limited in the energy of transmission information, message transmitting procedure is modeled as Markov Chain continuous time, Markov chain
State is (f (t), h (t))t≥0, f (t) (orh (t)) expression is in community M1(orM2) in have the number of nodes of information；
With E (E≤F+H) represent energy constraint, f (t)+h (t)≤E, when information transfer starts, an active vehicle node
Carry information, therefore, original state is (0,0), when vehicle-mounted node runs into the vehicle-mounted node of the information of carrying, occur logical
Letter, f (t) or h (t) increase by 1.
Alternatively, during E ＜ min (F, H), total S=(E+1) (E+2)/2 kind of a transition state；
During E ＞ max (F, H), total S=(E+H+1-F) (H-E+F)/2+ (H+1) (E-H+1)+a kind of transition state.
Alternatively, based on described Markov Chain generator matrix Q,
Wherein submatrix T is a S × s-matrix, each element Ti,jRepresent the speed transferring to state (j) from state (i)
Rate, R is S × 1 matrix, each element Ti,DRepresent the speed transferring to absorbing state (D) from state i, 0 matrix on the left side is
One 1 × S vector, wherein element is all 0, represents that the transition probability from absorbing state to transition state is 0, and 0 matrix on the right is degenerated
Become 0 element, represent the negative of the left side 0 vector and according to message transmitting procedure, obtaining transfer rate is { qi,j}；
In the state of transition state (f, h), community M1And M2Middle have f and h vehicle-mounted node to carry message, when one respectively
When not having the vehicle-mounted node of message to run into the vehicle-mounted node that has message, if receiving the vehicle-mounted node of message in M1(orM2)
In, the state of system becomes (f+1, h) (or (f, h+1))；If the vehicle-mounted node receiving message is the vehicle-mounted node of purpose, system
State become (D).
Alternatively, based on described community model, (f+1, transfer rate h) is (F- to state can to obtain state (f, h)
f)(λ+hpiλi+fpo(1-pnf)λo) p, the transfer rate that state (f, h) arrives state (f, h+1) is (H-h) (1-pnc)(λ+fpoλo
+npi(1-pnf)λi) p, the transfer rate of state (f, h) to state (D) is (f+h+1) λ.
Alternatively, described step S500 is specially：
Based on transfer matrix T, the information transfer that can obtain following form postpones Dd,
Dd=e (- T-1) I, formula (2)
Wherein e=[1,0 ..., 0] is 1 × S vector, represents initial state probability vector, I=[1,1 ..., 1] is
Complete 1 vector of one 1 × S；
P represents from transition state (i)i∈[1,S]To the corresponding Markov Chain of absorbing state (D), element pi,jIt is expressed as following shape
Formula,
P represents one-step transition probability matrix, P1,S+1Represent the transition probability matrix arriving state (D) from state (0,0),
P1,S+1=p1,S+1, P2Represent two step transition probability matrixs；
Transition probability matrix from state (1,0) and state (0,1) to state (D) is P2 1,S+1, PiRepresent that i step transfer is general
Rate matrix, obtains information transfer cost CdFor following form,
The beneficial effect that technical scheme provided in an embodiment of the present invention is brought is：
1) message transmitting procedure with selfish behavior is modeled as Markov Chain two-dimentional continuous time, considers simultaneously
The characteristic such as personal selfish, the social selfish, transmission probability in actual In-vehicle networking and system capacity constraint.
2) information transfer of having derived postpones the performance with transmission cost, and these derivations are the forms of closed solutions.
3) by the tradeoff between the impact of research different selfishness behaviors and selfishness, transmission probability and energy constraint Lai
The performance of analysis In-vehicle networking.
Brief description
For the technical scheme being illustrated more clearly that in the embodiment of the present invention, will make to required in embodiment description below
Accompanying drawing be briefly described it should be apparent that, drawings in the following description are only some embodiments of the present invention, for
For those of ordinary skill in the art, on the premise of not paying creative work, other can also be obtained according to these accompanying drawings
Accompanying drawing.
Fig. 1 is the flow chart of steps of the appraisal procedure of the embodiment of the present invention；
Fig. 2 a is the markovian state transition diagram of the embodiment of the present invention；
Fig. 2 b is markovian state transition diagram continuous time of the embodiment of the present invention；
Fig. 3 a is that the mean data transfer of the embodiment of the present invention postpones with different transmission probability pnfAnalogous diagram；
Fig. 3 b is the mean data transfer cost of the embodiment of the present invention with different transmission probability pnfAnalogous diagram；
Fig. 4 a is that the mean data transfer of the embodiment of the present invention postpones with different transmission probability pncAnalogous diagram；
Fig. 4 b is the mean data transfer cost of the embodiment of the present invention with different transmission probability pncAnalogous diagram；
Fig. 5 a is that the mean data transfer of the embodiment of the present invention postpones with cost with different transmission probability pnfAnalogous diagram；
Fig. 5 b is that the mean data transfer of the embodiment of the present invention postpones with cost with different transmission probability pncAnalogous diagram；
Fig. 6 a is that during the p=0.5 of the embodiment of the present invention, mean data transfer postpones with different transmission probability poAnalogous diagram；
Fig. 6 b be during the p=0.5 of the embodiment of the present invention mean data transfer cost with different transmission probability poAnalogous diagram；
Fig. 7 a is that during the p=0.8 of the embodiment of the present invention, mean data transfer postpones with different transmission probability poAnalogous diagram；
Fig. 7 b be during the p=0.8 of the embodiment of the present invention mean data transfer cost with different transmission probability poAnalogous diagram；
Fig. 8 a is that the mean data transfer of the embodiment of the present invention postpones with cost with different transmission probability poAnalogous diagram；
Fig. 8 b is that the mean data transfer of the embodiment of the present invention postpones with cost with different transmission probability piAnalogous diagram；
Fig. 9 a is that the mean data transfer under the selfish vehicle-mounted node of difference of the embodiment of the present invention postpones with different transmission generally
The analogous diagram of rate p；
Fig. 9 b is that the mean data transfer cost under the selfish vehicle-mounted node of difference of the embodiment of the present invention is general with different transmission
The analogous diagram of rate p；
Figure 10 a is that the mean data transfer under the different selfishness degree of the embodiment of the present invention postpones with different transmission probability p
Analogous diagram；
Figure 10 b is mean data transfer cost under the different selfishness degree of the embodiment of the present invention with different transmission probability p
Analogous diagram；
Figure 11 a is that the mean data transfer of the embodiment of the present invention postpones to constrain E and the emulation of selfish degree with different-energy
Figure；
Figure 11 b is that the mean data transfer cost of the embodiment of the present invention constrains E and the emulation of selfish degree with different-energy
Figure.
Specific embodiment
For making the object, technical solutions and advantages of the present invention clearer, below in conjunction with accompanying drawing to embodiment party of the present invention
Formula is described in further detail.
Embodiments provide a kind of meeting network performance evaluation method of the vehicle-mounted machine based on markoff process, referring to
Fig. 1, including：
A kind of vehicle-mounted machine meeting network performance evaluation method based on markoff process, comprises the following steps：
S100 builds the car being made up of the vehicle-mounted node in source, a vehicle-mounted node of purpose and the F+H vehicle-mounted node of relaying
Carrier aircraft can network model M.
S200 is based on described vehicle-mounted machine meeting network model M and selfish behavior, builds the community model of described vehicle-mounted node.
S300 is based on described community model, builds the Markov Chain of Information Communication process under selfish behavior.
S400 is based on described step S300, builds the Information Communication process under the conditions of energy constraint, with selfish behavior
Markov Chain continuous time.
The impact to information transfer delay and information transfer cost for the S500 quantitative analyses selfishness behavior.
In the present embodiment, described step S100 is specially：
Vehicle-mounted machine can network modelling be some wireless vehicle mounted nodes, represented with M, | M |=2+F+H represents that vehicle-mounted machine can net
In network, the quantity of vehicle-mounted node is 2+F+H, wherein, there is the vehicle-mounted node in source, the vehicle-mounted node of purpose and F+H and relays
Vehicle-mounted node.
In the present embodiment, selfish behavior is divided into personal selfishness behavior and society's selfishness behavior.
Specifically, personal selfishness behavior considers, vehicle carrying data not transmission information and do not carry data
Vehicle not Copy Info probability.
Specifically, society selfishness behavior consider is, if the vehicle-mounted node-node transmission information in same community general
Rate.
In the present embodiment, step S200 is specially：
Based on vehicle-mounted machine can network model it is considered to vehicle-mounted node society selfishness behavior, to the community between vehicle-mounted node
Attribute is modeled, and is divided into Liang Ge community M by relaying vehicle-mounted node1And M2, wherein M1={ 1,2 ..., F }, M2=1,
2 ..., H }, each vehicle-mounted node at most belongs to a community.
Consider the impact of personal selfishness behavior it is stipulated that M1In node be personal selfish, M2In vehicle-mounted node be not
People's selfishness.
Specifically, there are in fact two kinds of community model, including overlapping and nonoverlapping community model, in order to more efficient and
Intuitively it is analyzed, be used herein nonoverlapping community model.
In the present embodiment, step S300 is specially：
Based on community model it is known that the obedience quantum condition entropy that meets between vehicle-mounted node, the transfer of system mode forms horse
Er Kefu chain.
Based in community and there are different distributions the intercommunal commitment defini interval time it is stipulated that in community between vehicle-mounted node
Communication frequency is λ0, the communication frequency between intercommunal vehicle-mounted node is λ1It is contemplated that the vehicle-mounted node in source and the vehicle-mounted node of purpose
It is not belonging to M1And M2It is stipulated that the communication frequency of the vehicle-mounted node in source and the vehicle-mounted node of purpose and the vehicle-mounted node in this Liang Ge community
For λ.
Specifically, for the communication opportunity that once may lead to information transfer, the selfish behavior of via node can produce shadow
Ring.
Under personal selfishness behavior, the vehicle-mounted node having information is with Probability pnfInformation is not passed to and is not believed by ∈ [0,1]
The vehicle-mounted node of breath, the vehicle-mounted node not having information is with Probability pnc∈ [0,1] not receive information.
Under society's selfishness behavior it is stipulated that in community, the transmission probability of vehicle-mounted node is pi, different intercommunal nodes
Transmission probability be po, pi>po.
In the present embodiment, step S400 is specially：
Based on step S300, in the transmission of energy constraint, each vehicle-mounted node with Probability p transmission information and is used for passing
The energy of defeated information is limited, and message transmitting procedure is modeled as Markov Chain continuous time, and Markov Chain state is
(f(t),h(t))t≥0, f (t) (orh (t)) expression is in community M1(orM2) in have the number of nodes of information.
With E (E≤F+H) represent energy constraint, f (t)+h (t)≤E, when information transfer starts, an active vehicle node
Carry information, therefore, original state is (0,0), when vehicle-mounted node runs into the vehicle-mounted node of the information of carrying, occur logical
Letter, f (t) or h (t) increase by 1, and which community this belongs to depending on node.Pass in view of E and the vehicle-mounted number of nodes of relaying
System, state transfer may be different.
In the present embodiment, during E ＜ min (F, H), total S=(E+1) (E+2)/2 kind of a transition state.
During E ＞ max (F, H), total S=(E+H+1-F) (H-E+F)/2+ (H+1) (E-H+1)+a kind of transition state.
In the present embodiment, Markov Chain state transition diagram shown in Figure 2, can generator matrix Q,
Wherein submatrix T is a S × s-matrix, each element Ti,jRepresent the speed transferring to state (j) from state (i)
Rate, R is S × 1 matrix, each element Ti,DRepresent the speed transferring to absorbing state (D) from state i, 0 matrix on the left side is
One 1 × S vector, wherein element is all 0, represents that the transition probability from absorbing state to transition state is 0, and 0 matrix on the right is degenerated
Become 0 element, represent the negative of the left side 0 vector and according to message transmitting procedure, obtaining transfer rate is { qi,j}.
Specifically, in the state of transition state (f, h), community M1And M2Middle have f and h vehicle-mounted node to carry message respectively,
When a vehicle-mounted node not having message runs into the vehicle-mounted node that has message, if receiving the vehicle-mounted node of message in M1
(orM2) in, the state of system becomes (f+1, h) (or (f, h+1))；If the vehicle-mounted node receiving message is the vehicle-mounted section of purpose
Point, the state of system becomes (D).
In the present embodiment, based on community model, state (f, h) can be obtained and arrive state (f+1, transfer rate h) is
(F-f)(λ+hpiλi+fpo(1-pnf)λo) p, the transfer rate that state (f, h) arrives state (f, h+1) is (H-h) (1-pnc)(λ+
fpoλo+npi(1-pnf)λi) p, the transfer rate of state (f, h) to state (D) is (f+h+1) λ.
In the present embodiment, step S500 is specially：
Based on transfer matrix T, the information transfer that can obtain following form postpones Dd,
Dd=e (- T-1) I, formula (2)
Wherein e=[1,0 ..., 0] is 1 × S vector, represents initial state probability vector, I=[1,1 ..., 1] is
Complete 1 vector of one 1 × S.
Represented from transition state (i) with Pi∈[1,S]To the corresponding Markov Chain of absorbing state (D), element pi,jIt is expressed as follows
Form,
P represents one-step transition probability matrix, P1,S+1Represent the transition probability matrix arriving state (D) from state (0,0),
P1,S+1=p1,S+1, P2Represent two step transition probability matrixs.
Transition probability matrix from state (1,0) and state (0,1) to state (D) is P2 1,S+1, PiRepresent that i step transfer is general
Rate matrix, obtains information transfer cost CdFor following form,
Specifically, carry out emulation experiment below, quantitative analyses are personal selfish and society's selfishness postpones to information transfer and believes
The impact of breath transmission cost.
Parameter in emulation experiment includes communication frequency λ, λi, λo, vehicle-mounted number of nodes H and F, the biography that selfish behavior causes
Defeated Probability pnf, pnc, pi, po, in order to set communication frequency parameter, using Cambridge data, this data acquisition Cambridge University
These data are carried out average statistics and obtain λ by the behavioral data of 2 grades and 3 grades 2 groups of studentsi=0.101 (contacts/
) and λ hro=0.051 (contacts/hr), by averagely obtaining λ=0.084 (contacts/hr) by all data.
Other parameters default setting is：P=0.8, pnf=0, pnc=0, pi=1, po=1.
When changing some of which parameter, remaining parameter according to default setting, for simplifying the analysis, definition personal selfish and
The selfish degree of society, uses d respectivelyiAnd dsRepresent：
di∝(pnf,pnc),ds∝(1-po,1-pi). formula (5)
Referring to Fig. 3, Fig. 4, Fig. 5, alternatively, carry out the emulation experiment of personal selfishness behavior.
Specifically, F+H=50, E=40, λ are seti=λo=0.084, so that H is changed between 10 to 40, see from Fig. 3 a
Observe average information transfer to postpone to increase with H and increase, this is because H increases and represents that the quantity of selfish node increases, therefore, more
Many nodes are unwilling transmission data, when selfish degree diChange to 1.0 from 0.1, data transfer delay increases therewith, work as pnf=
When 0.1, diVery little, transmission delay increases very slow, however, working as p with HnfWhen=1, transmission delay increase quickly, when transmission probability from
0.5 increases to 0.8, postpones to reduce；Such as, work as pnf=1, postpone to reduce about 26.5%；On the other hand, see from Fig. 3 b,
When p is when 0.5 changes to 0.8, data transfer cost increases therewith；With pnfWith the increase of H, transmission cost reduction；This be because
For pnfBigger, the number of times of data transfer is fewer；Therefore, data transfer cost reduces with the increase postponing.
Specifically, Fig. 4 is different pncUnder the conditions of transmission delay and cost situation, similar to Fig. 3, with pncIncrease
With the increase of selfish node quantity H, data transfer delay increases and cost reduces.Work as pncWhen=0.1, because low replicate data is general
Rate, community M2In vehicle-mounted node be not nearly all selfish, therefore transmission delay and cost will not increase with the increase of H
Plus.However, working as pncWhen=1, community M2In vehicle-mounted node not from other vehicle-mounted node replicate datas, therefore with the increase of H,
Data transfer delay increase quickly and cost reduce quickly.Such as, as p=0.5, increase to 40 with H from 10, prolong
Increased about 125% late, cost reduces about 77%.
Personal selfishness behavior, including not transmitting and not replicating message, these behaviors all can increase information transfer and postpone and subtract
Little transmission cost, in order to study whether delay degradation ratio is more than ratio and the p that cost is improved furtherncAnd pnfWhether there is phase
Same this two problems of power of influence, define delay degradation ratioImprove ratio with cost
Due in this part analyzing personal selfishness impact to performance for the behavior, setting the p in formula (5)i=1, po=1.
Fig. 5 a illustrates and works as pncWhen=0WithWhere the dotted line signifies that cost improves ratioSolid line represents delay degradation ratioFrom result above it is found that working as pnfWhen identical,It is more thanEspecially work as pnfDuring equal to 0.4 and 0.7.Therefore, may be used
Although can increase data transfer delay with judgement personal selfishness behavior, the minimizing of transmission cost is more.Fig. 5 b illustrates pnf=0
WhenWithSituation.In such a case, it is possible to see delay degradation ratioIt is consistently greater than cost and improve ratioWith
PncWith the increase of H,WithBetween gap become big.This means the increase with vehicle-mounted Node selfishness, relatively change
Kind ratio diminishes.For example, work as pncWhen=1, H=40, data transfer delay increased 200%, but transmission cost only decreases
78%.Meanwhile, with Fig. 5 a contrast it was observed that pncCompare pnfPower of influence bigger.For example, work as pnfWhen=1, H=40,However, working as pncWhen=1, H=40,Therefore, it can obtain
Conclusion：The selfish behavior of replicate data does not have more nocuity than the selfish behavior not forwarding data.
Referring to Fig. 6, Fig. 7, Fig. 8, alternatively, carry out the emulation experiment of society's selfishness behavior.
Specifically, in p=0.5 and p=0.8, data transfer delay and cost are respectively as shown in Figure 6 and Figure 7.Can send out
Existing, with community M2(H) the vehicle-mounted number of nodes in increases to (F+H)/2=25 from 10, in given poAnd piUnder conditions of, institute
The transmission delay having curve all can increase.This is because when H ＜ (F+H)/2, the increase of H means the increase of selfishness.Work as H
More than the half of all number of nodes, delay can reduce.When by increasing poAnd piTo increase the selfishness d of nodes, transmission prolongs
Also can increase late.Maximum delay occurs in H=(F+H)/2 and poWhen=0, the at this moment quantity maximum across community and poShadow
The power of sound is maximum.According to this two viewpoints, it is known that social selfishness can make transmission delay penalty.According to data transfer generation
Valency as a result, it is possible to find selfish degree dsBigger, transmission cost is less.Therefore, it can to sum up social selfishness and can be lifted
The performance of transmission cost aspect.Different transmission probability p in relatively Fig. 6 and Fig. 7, although it can be found that data transfer delay and
The relative value of cost is different, but the selfish impact of society is identical.
Specifically, improve ratio by using the delay degradation ratio in formula (5) and cost, set pnf=0 and pnc=
0, to study social selfishness piAnd poImpact.Fig. 8 a illustrates in piUnder conditions of=1, delay degradation ratio and cost change
Kind ratio is with poChange.It can be found that working as society's selfishness degree d from these resultssWhen identical,It is more thanPass through
By poIt is reduced to 0, d from 0.9sWith increase,WithBetween gap become big.Such as, H=25, p are worked aso=0.9,WithAlmost identical, but work as po=0,ThanHigh by about 43%.This means when vehicle-mounted node is more selfish, relative
Improvement ratio is just bigger.Fig. 8 b illustrates in poUnder conditions of=0,WithWith piChange.In this case, permissible
SeeWithWill reduce with the increase of H.It is similar to Fig. 8 a,It is consistently greater thanTherefore, according to these results
It is concluded that：Probability transmits to social selfishness more robust, because while it increased data transfer delay, but transmission cost
That reduces is more.
Referring to Fig. 9, Figure 10, alternatively, carry out the emulation experiment of probability transmission.
Specifically, set pnf=0, pnc=0, pi=1, po=1 and allow p to change between 0 to 1 to carry out Study system performance
How to change with different H, as shown in Figure 9.With the increase of H, transmission delay reduces and transmission cost increases.This be because
When increasing for relaying vehicle-mounted node, data transfer is more, and the probability of data Successful transmissions is bigger, and cost is consequently increased.With p
Increase, transmission delay reduce and cost increase.Obviously, transmission probability is bigger, and more data transfer chances make transmission prolong
Chi Yue little, also increases transmission cost simultaneously.However, it is possible to observe that the rising of cost becomes to get over when increasing transmission probability
Come faster, the decline of delay becomes more and more slower.Especially when p is more than 0.6, postpone almost unchanged, but cost persistently rises.
Such as, work as H=30, postpone only to only reduce 2.1%, but cost increased 31.4%.In order to study vehicle-mounted node selfishness behavior
Impact, to pnf,pnc,pi,poSet different values and result is shown in Fig. 10.When selfish degree diAnd dsDuring increase, number
Increase according to transmission delay, cost reduces.Can be it has further been observed, working as p from result<When 0.6, transmission delay and difference selfish
The cost of degree reduces with p.However, working as p>When 0.6, transmission delay does not change with p with the cost of Bu Tong selfish degree, but cost
Increase with the increase of p.Therefore, when transmission probability is different, the selfish behavior of vehicle-mounted node has different impacts.Work as transmission
During probability very little, selfish behavior increased and postpones and reduce transmission cost.However, when transmission probability is very big, it only increases
Data transfer cost.Therefore, it can obtain as drawn a conclusion：Transmission probability is bigger, and robust is got in probability transmission.
Referring to Figure 11, alternatively, carry out the emulation experiment of energy constraint.
Specifically, E is allowed to change between 1 to 25, being so up to the vehicle-mounted node of half can be with relay data.Can from Figure 11
To see, with the increase of E, data transfer delay increases and cost reduces.However, with the increase of E, postponing the speed reducing
Rate diminishes, and the speed that cost increases becomes big.This shows that energy constraint lifts data transfer by introducing more transmission costs
The systematic function of delay aspect.When all of vehicle-mounted node is all non-selfish, with the increase of E, postpone to reduce although reducing
Speed slack-off.But cost is linearly increasing with E.However, when all vehicle-mounted nodes are all selfish, advancing the speed and reduce speed
Rate all diminishes.Such as, work as pnf=0.9, pnc=0.8, pi=0.2, poWhen=0.2, if E is more than 10, then there is 5% car
Carry node relay data, data transfer delay and cost keep constant.In systems in practice, energy constraint is bigger than regular meeting.This
Mean, in selfish probability transmits, even if increased the system capacity for data transfer, to be also only capable of obtaining limited performance
Lifting.On the other hand, it represents that the selfish behavior specific energy constraint of vehicle-mounted node has bigger power of influence.
In sum, embodiment of the present invention vehicle-mounted machine can provide a universal model by network performance evaluation, is conducive to point
Analyse vehicle-mounted opportunistic network and include the different profound influence to network performance for the factor such as transmission probability, selfish characteristic, network energy consumption,
Theoretical basiss are established for In-vehicle networking Performance Evaluation.
The foregoing is only presently preferred embodiments of the present invention, not in order to limit the present invention, all spirit in the present invention and
Within principle, any modification, equivalent substitution and improvement made etc., should be included within the scope of the present invention.
Claims (10)
1. a kind of vehicle-mounted machine meeting network performance evaluation method based on markoff process is it is characterised in that comprise the following steps：
S100 builds the vehicle-mounted machine being made up of the vehicle-mounted node in source, a vehicle-mounted node of purpose and the F+H vehicle-mounted node of relaying
Can network model M；
S200 is based on described vehicle-mounted machine meeting network model M and selfish behavior, builds the community model of described vehicle-mounted node；
S300 is based on described community model, builds the Markov Chain of Information Communication process under selfish behavior；
S400 is based on described step S300, builds under the conditions of energy constraint, the company of the Information Communication process with selfish behavior
Continuous time Markov Chain；
The impact to information transfer delay and information transfer cost for the S500 quantitative analyses selfishness behavior.
2. a kind of vehicle-mounted machine meeting network performance evaluation method based on markoff process according to claim 1, it is special
Levy and be, described step S100 is specially：
Described vehicle-mounted machine can network modelling be some wireless vehicle mounted nodes, represented with M, | M |=2+F+H represents described vehicle-mounted machine
Can the quantity of vehicle-mounted node be 2+F+H in network, wherein, there is the vehicle-mounted node in source, the vehicle-mounted node of purpose and F+H
Relay vehicle-mounted node.
3. a kind of vehicle-mounted machine meeting network performance evaluation method based on markoff process according to claim 1, it is special
Levy and be, described selfishness behavior is divided into personal selfishness behavior and society's selfishness behavior.
4. a kind of vehicle-mounted machine meeting network performance evaluation method based on markoff process according to claim 3, it is special
Levy and be, described step S200 is specially：
Based on described vehicle-mounted machine can network model it is considered to vehicle-mounted node society selfishness behavior, to the community between vehicle-mounted node
Attribute is modeled, and the vehicle-mounted node of described relaying is divided into Liang Ge community M1And M2, wherein M1={ 1,2 ..., F }, M2=1,
2 ..., H }, each vehicle-mounted node at most belongs to a community；
Consider the impact of personal selfishness behavior it is stipulated that M1In node be personal selfish, M2In vehicle-mounted node be not personal from
Private.
5. a kind of vehicle-mounted machine meeting network performance evaluation method based on markoff process according to claim 3, it is special
Levy and be, described step S300 is specially：
Based on described community model, the obedience quantum condition entropy that meets between vehicle-mounted node, the transfer of system mode forms Ma Erke
Husband's chain；
Based in community and the intercommunal commitment defini interval time has different distributions it is stipulated that the communication between vehicle-mounted node in community
Frequency is λ0, the communication frequency between intercommunal vehicle-mounted node is λ1It is contemplated that the vehicle-mounted node in source and the vehicle-mounted node of purpose do not belong to
In M1And M2It is stipulated that the vehicle-mounted node in source and the vehicle-mounted node of purpose are λ with the communication frequency of the vehicle-mounted node in this Liang Ge community；
Under personal selfishness behavior, the vehicle-mounted node having information is with Probability pnfInformation is not passed to by ∈ [0,1] does not have information
Vehicle-mounted node, the vehicle-mounted node not having information is with Probability pnc∈ [0,1] not receive information；
Under society's selfishness behavior it is stipulated that in community, the transmission probability of vehicle-mounted node is pi, the transmission of different intercommunal nodes
Probability is po, pi>po.
6. a kind of vehicle-mounted machine meeting network performance evaluation method based on markoff process according to claim 3, it is special
Levy and be, described step S400 is specially：
Based on described step S300, in the transmission of energy constraint, each vehicle-mounted node with Probability p transmission information and is used for passing
The energy of defeated information is limited, and message transmitting procedure is modeled as Markov Chain continuous time, and Markov Chain state is
(f(t),h(t))t≥0, f (t) (orh (t)) expression is in community M1(orM2) in have the number of nodes of information；
Represent energy constraint, f (t)+h (t)≤E with E (E≤F+H), when information transfer starts, an active vehicle node carries
There is information, therefore, original state is (0,0), when vehicle-mounted node runs into the vehicle-mounted node of the information of carrying, communicates, f
T () or h (t) increase by 1.
7. a kind of vehicle-mounted machine meeting network performance evaluation method based on markoff process according to claim 6, it is special
Levy and be,
During E ＜ min (F, H), total S=(E+1) (E+2)/2 kind of a transition state；
During E ＞ max (F, H), total S=(E+H+1-F) (H-E+F)/2+ (H+1) (E-H+1)+a kind of transition state.
8. a kind of vehicle-mounted machine meeting network performance evaluation method based on markoff process according to claim 7, it is special
Levy and be,
Based on described Markov Chain generator matrix Q,
Wherein submatrix T is a S × s-matrix, each element Ti,jRepresent the speed transferring to state (j) from state (i), R is
One S × 1 matrix, each element Ti,DRepresenting the speed transferring to absorbing state (D) from state i, 0 matrix on the left side is one 1 ×
S vector, wherein element is all 0, represents that the transition probability from absorbing state to transition state is 0,0 matrix on the right is degenerated to one 0
Element, represents the negative of the left side 0 vector and according to message transmitting procedure, obtaining transfer rate is { qi,j}；
In the state of transition state (f, h), community M1And M2Middle have f and h vehicle-mounted node to carry message, when one does not have respectively
When the vehicle-mounted node of message runs into the vehicle-mounted node that has message, if receiving the vehicle-mounted node of message in M1(orM2) in, it is
The state of system becomes (f+1, h) (or (f, h+1))；If the vehicle-mounted node receiving message is the vehicle-mounted node of purpose, the shape of system
State becomes (D).
9. a kind of vehicle-mounted machine meeting network performance evaluation method based on markoff process according to claim 6, it is special
Levy and be,
Based on described community model, (f+1, transfer rate h) is (F-f) (λ+hp to state can to obtain state (f, h)iλi+
fpo(1-pnf)λo) p, the transfer rate that state (f, h) arrives state (f, h+1) is (H-h) (1-pnc)(λ+fpoλo+npi(1-pnf)
λi) p, the transfer rate of state (f, h) to state (D) is (f+h+1) λ.
10. a kind of vehicle-mounted machine meeting network performance evaluation method based on markoff process according to claim 1, it is special
Levy and be, described step S500 is specially：
Based on transfer matrix T, the information transfer obtaining following form postpones Dd,
Dd=e (- T-1) I, formula (2)
Wherein e=[1,0 ..., 0] is 1 × S vector, represents initial state probability vector, I=[1,1 ..., 1] is one 1
Complete 1 vector of × S；
Represented from transition state (i) with Pi∈[1,S]To the corresponding Markov Chain of absorbing state (D), element pi,jIt is expressed as following form,
P represents one-step transition probability matrix, P1,S+1Represent the transition probability matrix arriving state (D) from state (0,0), P1,S+1=
p1,S+1, P2Represent two step transition probability matrixs；
Transition probability matrix from state (1,0) and state (0,1) to state (D) is P2 1,S+1, PiRepresent i step transition probability square
Battle array, obtains information transfer cost CdFor following form,
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610871963.8A CN106454860A (en) | 2016-09-30 | 2016-09-30 | Vehicle-mounted opportunity network performance assessment method based on Markov process |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610871963.8A CN106454860A (en) | 2016-09-30 | 2016-09-30 | Vehicle-mounted opportunity network performance assessment method based on Markov process |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN106454860A true CN106454860A (en) | 2017-02-22 |
Family
ID=58171441
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201610871963.8A Pending CN106454860A (en) | 2016-09-30 | 2016-09-30 | Vehicle-mounted opportunity network performance assessment method based on Markov process |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN106454860A (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111191185A (en) * | 2019-12-25 | 2020-05-22 | 航天信息股份有限公司 | Block importance evaluation method and system of traffic travel system |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102664805A (en) * | 2012-04-24 | 2012-09-12 | 北京航空航天大学 | Predictive routing method for bus delay tolerant network |
| WO2015013037A1 (en) * | 2013-07-22 | 2015-01-29 | Osram Sylvania Inc. | Light-based communications utilizing a gossip network in a vehicle/roadway environment |
-
2016
- 2016-09-30 CN CN201610871963.8A patent/CN106454860A/en active Pending
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102664805A (en) * | 2012-04-24 | 2012-09-12 | 北京航空航天大学 | Predictive routing method for bus delay tolerant network |
| WO2015013037A1 (en) * | 2013-07-22 | 2015-01-29 | Osram Sylvania Inc. | Light-based communications utilizing a gossip network in a vehicle/roadway environment |
Non-Patent Citations (1)
| Title |
|---|
| XIAO.X,LI.Y,KUI.X,ET AL: "Assessing the influence of selfishness on the system performance", 《WIRELESS NETWORK》 * |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111191185A (en) * | 2019-12-25 | 2020-05-22 | 航天信息股份有限公司 | Block importance evaluation method and system of traffic travel system |
| CN111191185B (en) * | 2019-12-25 | 2024-04-19 | 航天信息股份有限公司 | Block importance assessment method and system of traffic travel system |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Zhou et al. | Energy-efficient edge computing service provisioning for vehicular networks: A consensus ADMM approach | |
| Zhao et al. | A reinforcement learning method for joint mode selection and power adaptation in the V2V communication network in 5G | |
| CN111836321B (en) | Cell switching method based on federal learning and edge calculation | |
| Bao et al. | Edge computing-based joint client selection and networking scheme for federated learning in vehicular IoT | |
| Wang et al. | Task offloading strategy based on reinforcement learning computing in edge computing architecture of internet of vehicles | |
| Liu et al. | Enabling relay-assisted D2D communication for cellular networks: Algorithm and protocols | |
| CN112954651B (en) | Low-delay high-reliability V2V resource allocation method based on deep reinforcement learning | |
| CN108243431A (en) | The power distribution algorithm of unmanned plane relay system based on efficiency optiaml ciriterion | |
| CN107182114B (en) | Power distribution method for communication between vehicle and road side unit in Internet of vehicles | |
| CN107613556A (en) | A kind of full duplex D2D interference management methods based on Power Control | |
| CN103312606A (en) | Wireless Mesh network routing based on multi-path concurrence and method thereof | |
| Huang et al. | Resource allocation for D2D communications with a novel distributed Q-learning algorithm in heterogeneous networks | |
| Ouyang | Task offloading algorithm of vehicle edge computing environment based on Dueling-DQN | |
| Zhang et al. | Buffer-aided device-to-device communication: Opportunities and challenges | |
| Pandey et al. | Lagrange's multiplier based resource management for energy efficient D2D communication in 5G networks | |
| Fu et al. | Optimization of energy consumption in the MEC-assisted multi-user FD-SWIPT system | |
| CN113423087B (en) | Wireless resource allocation method facing vehicle queue control requirement | |
| Wang et al. | Interference hypergraph-based resource allocation (IHG-RA) for NOMA-integrated V2X networks | |
| CN106454860A (en) | Vehicle-mounted opportunity network performance assessment method based on Markov process | |
| CN105792311A (en) | Routing method for internet of vehicles based on user activity area model | |
| CN105530203A (en) | Access control method and system for D2D communication link | |
| Xu et al. | NOMA enabled resource allocation for vehicle platoon-based vehicular networks | |
| CN106332215A (en) | Relay forwarding selection method with least cost in the on-board opportunity network | |
| CN103716816B (en) | Green communications collaboration user system of selection based on energy efficiency and interference factor | |
| CN101772125A (en) | Method and device for network link management |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| RJ01 | Rejection of invention patent application after publication | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20170222 |