CN110337069A - The frame length optimization method of information broadcast - Google Patents
The frame length optimization method of information broadcast Download PDFInfo
- Publication number
- CN110337069A CN110337069A CN201910607960.7A CN201910607960A CN110337069A CN 110337069 A CN110337069 A CN 110337069A CN 201910607960 A CN201910607960 A CN 201910607960A CN 110337069 A CN110337069 A CN 110337069A
- Authority
- CN
- China
- Prior art keywords
- information
- broadcast
- frame length
- probability
- calculated
- 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
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L1/00—Arrangements for detecting or preventing errors in the information received
- H04L1/0078—Avoidance of errors by organising the transmitted data in a format specifically designed to deal with errors, e.g. location
- H04L1/0083—Formatting with frames or packets; Protocol or part of protocol for error control
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W28/00—Network traffic management; Network resource management
- H04W28/02—Traffic management, e.g. flow control or congestion control
- H04W28/0294—Traffic management, e.g. flow control or congestion control forcing collision
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W28/00—Network traffic management; Network resource management
- H04W28/02—Traffic management, e.g. flow control or congestion control
- H04W28/04—Error control
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W4/00—Services specially adapted for wireless communication networks; Facilities therefor
- H04W4/06—Selective distribution of broadcast services, e.g. multimedia broadcast multicast service [MBMS]; Services to user groups; One-way selective calling services
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W4/00—Services specially adapted for wireless communication networks; Facilities therefor
- H04W4/30—Services specially adapted for particular environments, situations or purposes
- H04W4/40—Services specially adapted for particular environments, situations or purposes for vehicles, e.g. vehicle-to-pedestrians [V2P]
- H04W4/44—Services specially adapted for particular environments, situations or purposes for vehicles, e.g. vehicle-to-pedestrians [V2P] for communication between vehicles and infrastructures, e.g. vehicle-to-cloud [V2C] or vehicle-to-home [V2H]
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W74/00—Wireless channel access, e.g. scheduled or random access
- H04W74/08—Non-scheduled or contention based access, e.g. random access, ALOHA, CSMA [Carrier Sense Multiple Access]
- H04W74/0808—Non-scheduled or contention based access, e.g. random access, ALOHA, CSMA [Carrier Sense Multiple Access] using carrier sensing, e.g. as in CSMA
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Multimedia (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The invention discloses a kind of frame length optimization methods of information broadcast, which comprises determines the information broadcast success probability between central node and other nodes；Using the information broadcast success probability, broadcast message age mean function related with frame length is established；Broadcast message age average value refers to the average value of the difference at current time and multiple generation times for broadcasting successful information before；It carries out the broadcast message age mean function to calculate, obtains the specific frame length when broadcast message age average value minimum, be applicable in the specific frame length.Using the above scheme, reasonably the information generation process of control node and information repeating process, the timeliness of raising information broadcast the collision probability of information can be reduced, the probability of success of information transmission, support vehicles driving safety are improved.
Description
Technical field
The present invention relates to the frame length optimization methods that the communications field more particularly to a kind of information are broadcasted.
Background technique
Nowadays, the application such as intelligent car networking network is expressly identified as carrying answering for real economy in " internet+" and artificial intelligence
With, and the Rapid development stage that a longer term will be welcome.
In the prior art, the communication of car networking network is mainly based upon the IEEE of American Electronic and the Institution of Electrical Engineers
802.11 series standards, the information of each node use Carrier Sense Multiple access/collision-avoidance mechanism in transmission process
(Carrier Sensing Multiple Access with Collision Avoidance, CSMA/CA), is easy in the sky
It collides, leads to information timeliness decline and network congestion.This inefficiencies and unreliability will bring calamity to car networking network
The consequence of difficulty.
Summary of the invention
Goal of the invention: being directed to prior art defect, the present invention is intended to provide a kind of frame length optimization method of information broadcast, leads to
Optimization frame length is crossed, reasonably the information generation process of control node and information repeating process, improves the timeliness of information broadcast, drop
The collision probability of low information improves the probability of success of information transmission, support vehicles driving safety.
Technical solution: a kind of frame length optimization method of information broadcast is provided in present invention implementation, comprising: determine central node
Information broadcast success probability between other nodes；Using the information broadcast success probability, establish related with frame length wide
Broadcast information age mean function；Broadcast message age average value, refer to current time and it is multiple before broadcast successful information
Generate the average value of the difference of time；It carries out the broadcast message age mean function to calculate, obtains the broadcast message age
Specific frame length when average value minimum is applicable in the specific frame length.
Specifically, determining information sending probability, the information collision probability of central node；By the information sending probability, institute
State information broadcast success probability described in information collision determine the probability.
Specifically, carrying out calculating information broadcast success probability μ using following formula:
Wherein,For the information collision probability, ptxFor the information sending probability,
Wherein, WminFor the minimum value of competition window, ρ is the node density in network, and r is the maximum communication of center node
Distance.
Specifically, broadcast message age mean function are as follows:
Wherein,For broadcast message age average value, X is information interarrival time, when T is the system of center node
Between, Y is that information leaves interval time, and E is mathematic expectaion, E (XT)=E (X (S+W)), E (X (S+W))=E (XS)+E (XW)=E
(X) E (S)+E (XW), S are service time, and W is the waiting time.
Specifically, setting iteration precision value, primary iteration number i=1 are presetP is calculated in valuetx
(i-1)；It willAnd ptx(i-1) corresponding calculation formula is substituted into, is calculatedAnd ptx(i)；WhenWithBetween difference absolute value be less than or equal to iteration precision value when, export μ.
Specifically, the probability distribution of X is calculated using following formula:
Wherein, TFInterarrival time X for frame length, between packet k and packet k+1k=mk+1-mkUniformly for two
It is distributed in (1, TF- 1) E (X)=T is calculated in the sum of stochastic variableF,
Specifically, the transmission time of packet k in the channel is clothes when central node carries out information transmission and successful broadcast
Be engaged in time Sk, meet the geometry distribution of μ, calculated using following formula:
Pr{Sk=j }=(1- μ)j-1μ,
Wherein, it is calculated
Specifically, system time T is the sum of waiting time W and service time S, meet the geometry distribution of υ, υ is using following
Formula is calculated:
υ=1- μ (1- α),
Wherein, α is equation z=GXThe unique root of [1- μ (1-z)] in (0,1), GX(z) corresponding for the probability distribution of X
Probability generating function, i.e.,WhereinIt is calculated:
Specifically, the probability generating function of Y are as follows:
Wherein, it is calculated using L'Hospital rule,
Specifically, F1: in the medium n point x of poorly taking-up of frame length range [l, r]1,x2,...,xn, wherein x0=l, xn+1
=r,
It calculatesIt picks out and wherein makesThe smallest point xt, judge frame length range
Whether the algnment accuracy eps of setting is less than or equal to, if it is not, by frame length range shorter to [xt-1,xt+1] step F1 is executed afterwards,；
If so, continuing；
To xtImmediate integer is taken according to size, is respectively obtainedWith
It calculatesWithIt picks out and wherein makesLesser value, as particular frame
It is long.
The utility model has the advantages that compared with prior art, the present invention has the following obvious advantages: reasonably the information of control node produces
Raw process and information repeating process improve the timeliness of information broadcast, reduce the collision probability of information, improve information transmission at
Function probability, support vehicles driving safety.
Detailed description of the invention
Fig. 1 is the structural schematic diagram of interior joint of embodiment of the present invention network；
Fig. 2 is the relation schematic diagram of frame length and time slot in the embodiment of the present invention；
Fig. 3 is the flow diagram of the frame length optimization method of information broadcast in the embodiment of the present invention；
Fig. 4 is the relationship in the embodiment of the present invention between broadcast message age average value and frame length.
Specific embodiment
Technical solution of the present invention is described further with reference to the accompanying drawing.
It refering to fig. 1, is the structural schematic diagram of interior joint of embodiment of the present invention network.
In specific implementation, each vehicle itself is central node, be center r using vehicle as the circle of radius is the vehicle
Centered on node meshed network maximum communication range, other vehicles within the communication range are other nodes, in
Heart node can be communicated with other nodes.
Referring to Fig.2, its relation schematic diagram for frame length and time slot in the embodiment of the present invention.
In specific implementation, it is the unit time that frame, which can be presented as, and frame length indicates the number of timeslots having in 1 frame, when
Gap is the chronomere that node generates information, sends information.For example, having 70 time slots in 1 frame, then frame length is 70.
In specific implementation, in each frame, each node is by independent, random one time slot of selection and generates a letter
Breath packet.If node also has received the packet from the broadcast of its neighbor node in this frame, the letter of oneself generation will be abandoned
Breath packet, then save and broadcast the received packet of institute；Otherwise, node can save and broadcast the packet of oneself.
In specific implementation, the optimization of frame length has great importance for information network, and reasonable frame length can be reasonable
The information generation process and information repeating process of ground control node, improve the timeliness of information broadcast, and the collision for reducing information is general
Rate improves the probability of success of information transmission, support vehicles driving safety.
It is the flow diagram of the frame length optimization method of information broadcast in the embodiment of the present invention, including specific refering to Fig. 3
Step is described in detail below in conjunction with specific steps.
Step S301 determines the information broadcast success probability between central node and other nodes.
In specific implementation, information broadcast success probability, the information for referring to that central node issues is not in information collision,
Can succeed the probability received by other nodes, can calculate to obtain by acquisition factor, can also be by historical data
Integration is carried out to handle to obtain.
In the embodiment of the present invention, information sending probability, the information collision probability of determining central node can be passed through；By described
Information broadcast success probability described in information sending probability, the information collision determine the probability.
In specific implementation, information sending probability is that the backoff counter of central node is reduced to zero and starts to send data
The probability of (i.e. acquisition channel), information collision probability refer to that central node is sent out in information transmission process with the information of other nodes
The probability of raw conflict.Only central node obtain channel and there is no collision in the case where, central node can just start to pass
It is defeated and successfully broadcast, information broadcast success probability can be obtained accordingly.
In the embodiment of the present invention, information broadcast success probability μ between the central node and other nodes, use is following
Formula is calculated:
Wherein,For the information collision probability, ptxFor the information sending probability,
Wherein, WminFor the minimum value of competition window (ContentionWindows, CW), ρ is the node density in network,
R is the maximum communication distance of center node.
Step S302 establishes broadcast message age average value related with frame length using the information broadcast success probability
Function.
In the embodiment of the present invention, the broadcast message age, when referring to current time and the generation of the upper one successful information of broadcast
Between difference.And broadcast message age average value, refer to the difference of the generation time of current time and multiple successful information of broadcast
Average value, if the information sent can be successfully received, send next time information and it is last send between information when
Between difference it is shorter, then information broadcast timeliness it is strong, can be with support vehicles driving safety.
In specific implementation, the broadcast message age, (broadcast age of information, BAoI) can be used for
It is fast on network to describe node for the timeliness of metric broadcast process, the freshness of the packet broadcast of each node of precise quantification
The ability of fast broadcast message packet.
Broadcast message age mean function related with frame length can show as different frame length and broadcast message age
Relationship between average value, it is possible thereby to determine that broadcast message age average value is minimum, centromere in the case where which kind of frame length
The timeliness that point is broadcasted is most strong, and successful information broadcast is same to influence timeliness, therefore information broadcast success probability is being established extensively
It is also to need to be considered accordingly when broadcasting information age mean function.
In the embodiment of the present invention, broadcast message age mean function are as follows:
Wherein,For broadcast message age average value, X is information interarrival time, when T is the system of center node
Between, Y is that information leaves interval time, and E is mathematic expectaion, E (XT)=E (X (S+W)), E (X (S+W))=E (XS)+E (XW)=E
(X) E (S)+E (XW), S are service time, and W is the waiting time.
In specific implementation, X information interarrival time refers to two that central node is continuously successfully transmitted to other nodes
Packet reaches the time interval of other nodes；The system time of T central node, refer to time flowed through according to central node into
The time of capable timing, be waiting time and service time and；Y information leaves interval time, refers to central node continuously to it
Two packets that his node is successfully transmitted leave the time interval of central node；S service time refers to that central node obtains channel
To the time interval started between successful broadcast information；The W waiting time, referring to that central node has information to generate can be with to central node
Obtain the time interval between channel transmission data.
Step S303 carries out the broadcast message age mean function and calculates, it is average to obtain the broadcast message age
Specific frame length when value is minimum, is applicable in the specific frame length.
In specific implementation, in broadcast message age average value minimum, the timeliness of the information in information broadcasting network
It is most strong, the collision probability of information can be reduced, the probability of success of information transmission, support vehicles driving safety are improved.
In the embodiment of the present invention, iteration precision value is set, primary iteration number i=1 is presetValue calculates
Obtain ptx(i-1)；It willAnd ptx(i-1) corresponding calculation formula is substituted into, is calculatedAnd ptx(i)；WhenWithBetween difference absolute value be less than or equal to iteration precision value when, export μ.
In specific implementation, iteration precision value can be set by user according to practical application scene accordingly.
In specific implementation, willAnd ptx(i-1) substitute into corresponding calculation formula refer to substitute into formula (1) and
Formula (2).When working asWithBetween difference absolute value be less than or equal to iteration precision value when, can pass through
AccordinglyAnd ptx(i) μ is calculated.
In the embodiment of the present invention, the probability distribution of X is calculated using following formula:
Wherein, TFInterarrival time X for frame length, between packet k and packet k+1k=mk+1-mkUniformly for two
It is distributed in (1, TF- 1) E (X)=T is calculated in the sum of stochastic variableF,
In specific implementation, E (X)=T is calculatedF,After can substitute into accordingly in formula (3),
Obtain broadcast message age average value and frame length TFBetween functional relation.
In the embodiment of the present invention, when central node carries out information transmission and successful broadcast, the transmission of packet k in the channel
Time is service time Sk, meet the geometry distribution of μ, calculated using following formula:
Pr{Sk=j }=(1- μ)j-1μ,
Wherein, it is calculated
In specific implementation, it can incite somebody to actionIt substitutes into formula (3), available information broadcast success probability μ and wide
Broadcast the functional relation between information age average value.
In the embodiment of the present invention, system time T is the sum of waiting time W and service time S, meets the geometry distribution of υ, υ
It is calculated using following formula:
υ=1- μ (1- α),
Wherein, α is equation z=GXThe unique root of [1- μ (1-z)] in (0,1), GX(z) corresponding for the probability distribution of X
Probability generating function, i.e.,WhereinIt is calculated:
In specific implementation, information interarrival time X is general distribution, and system time T is geometry distribution, then center
The broadcasting process of node can be modeled with GI/G/1 type discrete-time control system.It is discussed according to the discrete-time control system of Tian etc., is
System time T be waiting time W and service time S and.System time T also obeys the geometry that parameter is υ and is distributed, available υ
Value be 1- μ (1- α).
In specific implementation, function h (z) refers to that variable is replaced with the function of z by xh′
(x) it is its derivative.
In specific implementation, it after E (XW) is calculated, can substitute into accordingly among formula (3).
In the embodiment of the present invention, the probability generating function of Y are as follows:
Wherein, it is calculated using L'Hospital rule,
In specific implementation, function h () can be
In specific implementation, after E (Y) is calculated, formula (3) can be substituted into accordingly.
In the embodiment of the present invention, F1: in the medium n point x of poorly taking-up of frame length range [l, r]1,x2,...,xn, wherein x0
=l, xn+1=r,
It calculatesIt picks out and wherein makesThe smallest point xt, judge frame length range
Whether the algnment accuracy eps of setting is less than or equal to, if it is not, by frame length range shorter to [xt-1,xt+1] step F1 is executed afterwards,；
If so, continuing；
To xtImmediate integer is taken according to size, is respectively obtainedWithFor example, 65.5, take 65 and 66.
It calculatesWithIt picks out and wherein makesLesser value, as particular frame
It is long.
In specific implementation, ρ=0.2, minimum competition window W can be setmin=16, maximum communication distance r=4m, frame
Long TFInfluence of the variation to broadcast message age average value can be solved by formula (3), and as shown in Figure 4.Because of each section
Independent in each frame, random one time slot of selection of point generates a packet, therefore changes frame length and be equivalent to change extensively
Broadcast the information flow-rate density in network.As shown in figure 4, broadcast message age average value increases afterwards as the value of frame length first reduces.
Specifically, when frame length value is smaller, broadcast message age average value is larger, i.e. information flow-rate density is big；When frame length value very
When big, the frequency that packet generates becomes smaller, and corresponding broadcast message age average value also can be very big.Therefore, in order to reduce letter
Cease broadcasting network in broadcast message age average value, frame length can neither it is too long can not be too small, therefore using approximatioss carry out
It obtains, algnment accuracy eps is then the standard for embodying precision degree.Finally existValue andValue among choose
Select so thatLesser value, the value are then specific frame lengths, i.e. the quantity of time slot in a frame.It is possible thereby to rationally
The information generation process and information repeating process of ground control node, improve the timeliness of information broadcast, and the collision for reducing information is general
Rate improves the probability of success of information transmission, support vehicles driving safety.
Claims (10)
1. a kind of frame length optimization method of information broadcast characterized by comprising
Determine the information broadcast success probability between central node and other nodes；
Using the information broadcast success probability, broadcast message age mean function related with frame length is established；Broadcast message
Age average value refers to the average value of the difference at current time and multiple generation times for broadcasting successful information before；
The broadcast message age mean function is carried out to calculate, it is specific when obtaining the broadcast message age average value minimum
Frame length is applicable in the specific frame length.
2. the frame length optimization method of information according to claim 1 broadcast, which is characterized in that the central node and other
Information broadcast success probability between node, comprising:
Determine information sending probability, the information collision probability of central node；
The information broadcast success probability as described in the information sending probability, the information collision determine the probability.
3. the frame length optimization method of information according to claim 2 broadcast, which is characterized in that the central node and other
Information broadcast success probability μ between node, is calculated using following formula:
Wherein,For the information collision probability, ptxFor the information sending probability,
Wherein, WminFor the minimum value of competition window, ρ is the node density in network, and r is the maximum communication distance of center node.
4. the frame length optimization method of information broadcast according to claim 3, which is characterized in that the broadcast message age is flat
Mean function are as follows:
Wherein,For broadcast message age average value, X is information interarrival time, and T is the system time of center node, Y
It is that information leaves interval time, E is mathematic expectaion, E (XT)=E (X (S+W)), E (X (S+W))=E (XS)+E (XW)=E (X) E
(S)+E (XW), S are service time, and W is the waiting time.
5. the frame length optimization method of information broadcast according to claim 4, which is characterized in that described to carry out the broadcast letter
Age mean function is ceased to calculate, comprising:
Iteration precision value is set, primary iteration number i=1 is presetP is calculated in valuetx(i-1)；
It willAnd ptx(i-1) corresponding calculation formula is substituted into, is calculatedAnd ptx(i)；
WhenWithBetween difference absolute value be less than or equal to iteration precision value when, export μ.
6. the frame length optimization method of information broadcast according to claim 5, which is characterized in that described to carry out the broadcast letter
Age mean function is ceased to calculate, comprising:
The probability distribution of X is calculated using following formula:
Wherein, TFInterarrival time X for frame length, between packet k and packet k+1k=mk+1-mkIt is uniformly distributed for two
(1, TF- 1) E (X)=T is calculated in the sum of stochastic variableF,
7. the frame length optimization method of information broadcast according to claim 6, which is characterized in that described to carry out the broadcast letter
Age mean function is ceased to calculate, comprising:
When central node carries out information transmission and successful broadcast, the transmission time of packet k in the channel is service time Sk, symbol
The geometry distribution for closing μ, is calculated using following formula:
Pr{Sk=j }=(1- μ)j-1μ,
Wherein, it is calculated
8. the frame length optimization method of information broadcast according to claim 7, which is characterized in that described to carry out the broadcast letter
Age mean function is ceased to calculate, comprising:
System time T is the sum of waiting time W and service time S, meets the geometry distribution of υ, and υ is counted using following formula
It calculates:
υ=1- μ (1- α),
Wherein, α is equation z=GXThe unique root of [1- μ (1-z)] in (0,1), GX(z) corresponding general for the probability distribution of X
Rate generating function, i.e.,WhereinIt is calculated:
9. the frame length optimization method of information broadcast according to claim 8, which is characterized in that described to carry out the broadcast letter
Age mean function is ceased to calculate, comprising:
The probability generating function of Y are as follows:
Wherein, it is calculated using L'Hospital rule,
10. the frame length optimization method broadcasted according to information described in claim requirement 9, which is characterized in that described in the acquisition
Specific frame length when broadcast message age average value minimum, comprising:
F1: in the medium n point x of poorly taking-up of frame length range [l, r]1,x2,...,xn, wherein x0=l, xn+1=r,
It calculatesIt picks out and wherein makesThe smallest point xt, whether judge frame length range
Less than or equal to the algnment accuracy eps of setting, if it is not, by frame length range shorter to [xt-1,xt+1] step F1 is executed afterwards,；If so,
Then continue；
To xtImmediate integer is taken according to size, is respectively obtainedWith
It calculatesWithIt picks out and wherein makesLesser value, as specific frame length.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910607960.7A CN110337069B (en) | 2019-07-08 | 2019-07-08 | Frame length optimization method for information broadcasting |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910607960.7A CN110337069B (en) | 2019-07-08 | 2019-07-08 | Frame length optimization method for information broadcasting |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN110337069A true CN110337069A (en) | 2019-10-15 |
| CN110337069B CN110337069B (en) | 2022-01-28 |
Family
ID=68144738
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910607960.7A Active CN110337069B (en) | 2019-07-08 | 2019-07-08 | Frame length optimization method for information broadcasting |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110337069B (en) |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112073940A (en) * | 2020-08-25 | 2020-12-11 | 华中科技大学 | Method for setting automobile message sending probability in vehicle-mounted social network |
| CN112867090A (en) * | 2021-01-14 | 2021-05-28 | 南京信息工程大学 | Military combat communication link selector rule method |
| US20220334894A1 (en) * | 2021-04-15 | 2022-10-20 | Accenture Global Solutions Limited | Temporal disentanglement protocol for event ordering |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102695287A (en) * | 2012-06-20 | 2012-09-26 | 电子科技大学 | VANET (vehicular ad-hoc network) media access control method |
| US20160212729A1 (en) * | 2013-06-07 | 2016-07-21 | Stichting Vu-Vume | Position-based broadcast protocol and time slot schedule for a wireless mesh network |
| CN107071854A (en) * | 2017-04-25 | 2017-08-18 | 西安电子科技大学 | The distributed multihop Radio Broadcasting Agreements of relay forwarding probability is maximized based on car networking |
-
2019
- 2019-07-08 CN CN201910607960.7A patent/CN110337069B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102695287A (en) * | 2012-06-20 | 2012-09-26 | 电子科技大学 | VANET (vehicular ad-hoc network) media access control method |
| US20160212729A1 (en) * | 2013-06-07 | 2016-07-21 | Stichting Vu-Vume | Position-based broadcast protocol and time slot schedule for a wireless mesh network |
| CN107071854A (en) * | 2017-04-25 | 2017-08-18 | 西安电子科技大学 | The distributed multihop Radio Broadcasting Agreements of relay forwarding probability is maximized based on car networking |
Non-Patent Citations (1)
| Title |
|---|
| WANG MEI 等: "Broadcast Age of Information in CSMA/CA Based Wireless Networks", 《IEEE》 * |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112073940A (en) * | 2020-08-25 | 2020-12-11 | 华中科技大学 | Method for setting automobile message sending probability in vehicle-mounted social network |
| CN112867090A (en) * | 2021-01-14 | 2021-05-28 | 南京信息工程大学 | Military combat communication link selector rule method |
| US20220334894A1 (en) * | 2021-04-15 | 2022-10-20 | Accenture Global Solutions Limited | Temporal disentanglement protocol for event ordering |
| US11928525B2 (en) * | 2021-04-15 | 2024-03-12 | Accenture Global Solutions Limited | Temporal disentanglement protocol for event ordering |
Also Published As
| Publication number | Publication date |
|---|---|
| CN110337069B (en) | 2022-01-28 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN110337069A (en) | The frame length optimization method of information broadcast | |
| CN103259741B (en) | Based on the minimum competition window method of adjustment that neighbor node number is estimated in In-vehicle networking | |
| Nguyen et al. | A survey on adaptive multi-channel MAC protocols in VANETs using Markov models | |
| CN107040948B (en) | CSMA/CA optimization method based on priority | |
| Le et al. | Cooperative MAC protocol for LED-ID systems | |
| CN110972162B (en) | Underwater acoustic sensor network saturation throughput solving method based on Markov chain | |
| CN104640155B (en) | Gray throughput prediction-based wireless Ad Hoc network TCP congestion avoidance mechanism | |
| CN111107622B (en) | Time synchronization system and method of self-adaptive networking based on ultra-wideband wireless communication | |
| CN112637965B (en) | Game-based Q learning competition window adjusting method, system and medium | |
| CN102421151A (en) | Minimum contention window adaptive adjustment method based on WLAN (Wireless Local Area Network) contention station number | |
| CN112203307A (en) | Multi-channel wireless network scheduling method supporting information age optimization | |
| CN102379135A (en) | Method and device for improving the management of wireless mesh networks | |
| CN107659911A (en) | A kind of car networking relay node selecting method of stabilization | |
| Wu et al. | A MAC protocol for delay-sensitive VANET applications with self-learning contention scheme | |
| CN106656795A (en) | Wireless sensor and actor networks clustering routing method | |
| CN104581786A (en) | Remote distributed carrier detection wireless network backoff time slot length optimizing method | |
| CN105007586A (en) | Two-factor based self-adaptive contention window adjusting method for SMAC protocol of wireless sensor network | |
| Wu et al. | Joint mac and network layer control for vanet broadcast communications considering end-to-end latency | |
| CN110381559B (en) | Distributed wireless network spectrum access method based on global optimal threshold decision | |
| Liu et al. | Ro-raw: run-time restricted access window optimization in IEEE 802.11 ah network with extended kalman filter | |
| CN104507119A (en) | Concurrent transmission based wireless sensor network data collection method | |
| CN110708737B (en) | Wireless MESH network route optimization method based on bandwidth | |
| CN109362104B (en) | Wireless communication rate self-adaptive control method and device | |
| CN112969240A (en) | Heterogeneous wireless distributed network intelligent channel access method based on pure threshold decision | |
| Tsakmakis et al. | Learning-Automata-Based Hybrid Model for Event Detection in LoRaWAN Networks |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |