CN103634846B - By the method for greedy algorithm distribution channel resource in multi-channel multi-hop wireless network - Google Patents
By the method for greedy algorithm distribution channel resource in multi-channel multi-hop wireless network Download PDFInfo
- Publication number
- CN103634846B CN103634846B CN201210311650.9A CN201210311650A CN103634846B CN 103634846 B CN103634846 B CN 103634846B CN 201210311650 A CN201210311650 A CN 201210311650A CN 103634846 B CN103634846 B CN 103634846B
- Authority
- CN
- China
- Prior art keywords
- node
- link
- channel
- interference
- greedy algorithm
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Expired - Fee Related
Links
Abstract
The present invention provides a kind of method with greedy algorithm distribution channel resource in multi-channel multi-hop wireless network, including step: the first step, each nodal test with oneself transmitting the essential information of the node that data interfere with each other and may calculate oneself and the transmittability of these nodes by these essential informations respectively；Second step, for each node, carries out greedy algorithm；3rd step, each node performs second step the most successively, until the optional link in network is all already divided into selecting link set SNInterior or selected link set S set uplIn, selected link set S set up of outputlResult as greedy algorithm.The present invention has the strongest realizability, has a wide range of applications background, and can give play to higher efficiency in pervasive application scenarios so that network traffics reach effect that can be comparable with global optimum, and the most efficient.
Description
Technical field
A kind of method that the present invention relates to wireless communication technology field, especially a kind of reasonable distribution channel resource reaches net
The greedy algorithm that network output is optimum, is specifically related in multi-channel multi-hop wireless network the side with greedy algorithm distribution channel resource
Method.
Background technology
Along with the development of wireless network, frequency spectrum resource increasingly seems rare, seriously constrains the efficient and quick of information
Transmission, thus the channel distribution in multi-channel multi-hop wireless network receives publicity more and more.This topic is not only in science
On obtained studying widely, the application in industrial application is the most quite paid attention to.Effectively utilize existing resource help to be sent out
It is an important topic urgently to be resolved hurrily that the network of a person of good sense is preferably exported.
On the one hand, along with channel quantity and the increase of nodes number, the problem of channel resource allocation will become more to come
The most complicated, the complexity of its theory deduction exponentially situation rises.And the channel resource allocation in multichannel multihop network is exactly
Be most widely used, closing to reality.On the other hand, prior art uses centralized processing mode mostly, i.e. from
The angle of Complete Information is set out, Global motion planning.And this is high cost, high cost in the middle of reality is applied.Distributed greedy
Center algorithm, is possible not only to cost-effective, makes optimization, and can efficiently and rapidly complete certainly in limited local message
Plan, reduces the delay of information transmission, and is finally reached effect analogous with global optimization.
The invention provides a kind of greedy algorithm to solve this Channel Assignment Problems in multi channel multihop network.According to
The greedy algorithm that the present invention provides can solve Channel Assignment Problems the most efficiently, and has the strongest realizability, can be by extensively
Apply in present wireless network transmissions generally.The algorithm provided according to the present invention can help network to obtain one with the overall situation
The analogous output of excellent algorithm, and recurrent data blocking in multihop network can be effectively prevented.
Summary of the invention
The network system model discussed in the present invention is a multihop network having multiple channel, only has one in this network
Individual Centroid, each time slot of other nodes can produce a certain amount of data, and these data the most all can pass through via node
It is sent to Centroid, and the data that only Centroid receives just are calculated as the output of network.The present invention does not discuss
About sending the select permeability (i.e. the selection of via node) of data path in multihop network, but one random the most out
Any one known in network topology structure, Channel Assignment Problems is discussed, the most each node known it need data
Pass to which node.
According to an aspect of the present invention, it is provided that one distributes channel resource by greedy algorithm in multi-channel multi-hop wireless network
Method, comprise the steps:
The first step, each nodal test with oneself transmitting the essential information of the node that data interfere with each other and may pass through these bases
This information calculates the transmittability of oneself and these nodes respectively；
Second step, the access link l that the n bar existed in a network by each node is relevant1,l2,...ln, selected according to receive
Link set S set uplWith can not select link set SN, mark optional link；Each channel is used to build by calculating this node
The transmittability of vertical link, selects the link l in legal link with high-transmission abilitym, find the node that this link is corresponding
And the channel used during transmission, and this link is joined link set S of selected foundationl, i.e. Sl←Sl∪{lm, wherein,
The implication of described legal link is, currently the unselected link for setting up of this link, and be not labeled as can not select chain road；
Finally according to the link l foundm, marking all interfering links corresponding to this link is can not select chain road broadcasts selected foundation
Link set SlWith can not select link set SNTo node about, in order to other node resources distribute, by that analogy；
3rd step, each node performs second step the most successively, until the optional link in network is all already divided into can not
Select link set SNInterior or selected link set S set uplIn, selected link set S set up of outputlKnot as greedy algorithm
Really.
Preferably, described essential information includes: the transmission signal to noise ratio of all optional channels of node, node data to be transferred backlog；
Described transmittability refers to, every the channel calculated according to signal to noise ratio and shannon formula is taken advantage of for the channel capacity of each node
Long-pending with this node data to be transferred backlog and channel usable probability, described transmittability is expressed as follows:
X in formulaikIt is exactly this node i transmittability for channel k,
For the signal to noise ratio of link, liIt it is i-node data to be transferred
Backlog or a function about data congestion, pkRepresenting the usable probability of k channel, scope is [0,1], and this is general
Rate is used for describing channel and can be used, or user tends to the probability of use.
Preferably, described interfering link refers to the interference of same node and adjacent interference；Wherein, transmission link is referred to node interference
Having identical node, this interference can make link all disturb on all channels；Adjacent interference includes launching interference and receiving interference,
Wherein, when transmitting interference refers to this node as transmitting node, the receiving node in other link is in the interference model of this node
In enclosing, when reception interference refers to this node as reception node, this node is in the interference range of the transmitting node of other link
In.
Preferably, the definition of described legal link is: the currently unselected link for setting up of this link, and is not labeled as
Can not select chain road.
Preferably, when traveling through all nodes successively at random, carry out link selection according to some specific node ID order,
When traveling through each node, collecting the information of surroundings nodes, oneself node does greed selection, then broadcast selects result
Method.
Preferably, for the network characteristics of single centre node, in order to obtain preferable performance, according to nodal distance Centroid
The number of jumping figure, ascending decision traversal order.
In a preferred scheme of the present invention, comprise the following steps:
The first step, each nodal test with oneself transmitting the essential information of the node that data interfere with each other and may pass through these bases
This information calculates the transmittability of oneself and these nodes respectively.These essential informations include: all optional channels of node
Transmission signal to noise ratio, node data to be transferred backlog.Described transmittability refers to, calculates according to signal to noise ratio and shannon formula
Every channel is multiplied by the long-pending of this node data to be transferred backlog and channel usable probability for the channel capacity of each node.Described
Transmittability is expressed as follows:
X in formulaikIt is exactly this node i transmittability for channel k,
For the signal to noise ratio of link, liIt it is i-node data to be transferred
Backlog, but it is not limited to that, and it can also be a function about data congestion, is used for preventing data at network
In blocking, such that it is able to the node making data accumulation many has higher priority transmission data, pkRepresent the available of k channel
Probability, scope is [0,1], and this probability is used for describing channel and can be used, or user tends to the probability of use.Just
Be due to by the transmittability so defined to determine the priority of node-node transmission data so that ensure high s/n ratio preferentially pass
Account for transmitting between node the fairness of data while this principle of transmission of data, allow the node of long-time no transmission data have
Higher priority is made a return journey transmission data.
Second step, for each node, carries out greedy algorithm.Algorithm specifically comprises the following steps that
There is the access link that n bar is relevant in each node, is designated as l in a network1,l2,...ln.Relevant access link includes multiple
Channel, the access link of multiple neighboring user.
(1) by all link l1,l2,...lN is according to link set S of the selected foundation receivedlWith can not select link set SN, mark can
Select chain road.
(2) calculating this node uses each channel to set up the transmittability of link, if link l1,l2,...lnCorresponding value of utility
For x1,x2,...xn。
(3) the link l in legal link with high-transmission ability is selectedm, when finding the node and transmission that this link is corresponding
The channel used, joins link set S of selected foundation by this linkl, i.e. Sl←Sl∪{lm}.The implication of legal link is,
The unselected link for setting up of this link current, and be not labeled as can not select chain road.
(4) for the link l found in (3)m, mark all interfering links corresponding to this link for can not select chain road, i.e.
Note lmInterfering link integrate as SI, can not select link set is SN, then SN←SN∪SI.In ensuing selection, refusal
Set up these links.Here interfering link refers to two kinds of interference: with node interference and adjacent interference.Refer to node interference
Transmission link has identical node, and this interference can make link all disturb on all channels.Adjacent interference includes two kinds of interference:
Launch interference and receive interference.When transmitting interference refers to this node as transmitting node, the receiving node in other link is in
In the interference range of this node.When reception interference refers to this node as reception node, this node is in the transmitting of other link
In the interference range of node.
(5) link set S that broadcasts selected is set uplWith can not select link set SNTo node about.
3rd step, each node performs second step the most successively, until the optional link in network is all already divided into can not
Select link set SNInterior or selected link set S set uplIn.Selected link set S set up of outputlKnot as greedy algorithm
Really.
When traveling through all nodes successively at random, link selection can be carried out, no according to some specific node ID order
The result selected may be caused different impacts by same traversal order.For the network characteristics of single centre node, in order to obtain
Preferable performance, can according to nodal distance Centroid jumping figure number, ascending decision traversal order.In traversal
During each node, collect the information of surroundings nodes, oneself node is done greed selection, the method that then broadcast selects result.
Algorithm above travels through after all nodes, masked noisy possibility, and system reaches one and can stably transmit
State.This stable transmission state refers to, in each interference range, on the premise of not producing interference, channel is all by effectiveness
The link of value local optimum takies.Be may certify that by the experiment of inventor, this stable transmission state, it is possible to reach with
The effect that centralized optimal throughput is comparable.
Present invention have the advantage that
(1) after greedy algorithm travels through all nodes, all without clashing on any one channel.It is to say, appoint
Anticipate on a channel, do not have two nodes disturbed mutually and select to transmit data simultaneously.
(2), during greedy algorithm travels through all node process, the link that transmittability is high can preferential busy channel.So energy
On the premise of avoiding channel confliction so that whole network has higher output.
(3) greedy algorithm travels through after all nodes, does not has channel to be wasted, say, that every channel all can be by
Take unless be less than the number of channel in certain region interior nodes number.Even if certain link has the ability to take a plurality of channel, the result of decision
Only use preferred channels, the most also will not waste the suboptimum channel of this node.
Further, compared with the prior art, the present invention has a following superiority:
(1) present invention has the strongest realizability, has a wide range of applications background, and can be in pervasive application
Scene is given play to higher efficiency so that network traffics reach effect that can be comparable with global optimum.
(2) present invention is the most efficient.By algorithm presented hereinbefore, those skilled in the art it is found that algorithm only
I.e. can reach final stable transmission state after needing one to take turns all nodes of traversal, time complexity is linear.Because each
When individual node does the selection of local greed, it is contemplated that and avoid channel disturbance.Result is selected not result in channel confliction, permissible
Ensure stable effective transmission.Time complexity is low, and to make this period of decision-making time before transmitting the data will be the ofest short duration, no
Network transmission can be caused unnecessary delay, substantially increase the resource utilization in network, decrease waste.
Accompanying drawing explanation
The detailed description with reference to the following drawings, non-limiting example made by reading, the further feature of the present invention, purpose
Will become more apparent upon with advantage:
Fig. 1 is the flow chart of the greedy algorithm that the channel prior provided according to the present invention travels through；
Fig. 2 is the effectiveness comparison schematic diagram of greedy algorithm and the centralized algorithm provided according to the present invention.
Detailed description of the invention
Elaborating embodiments of the invention below, the present embodiment is being implemented premised on technical solution of the present invention,
Give detailed embodiment and concrete operating process, but protection scope of the present invention is not limited to following embodiment.
The algorithm that the present invention provides is a quick centralized greedy algorithm, can be efficiently completed Channel Assignment Problems, and
Network can be made to have a good output performance.Key step according to method provided by the present invention is as follows: the most each joint
Point first calculates the transmittability of oneself, then makes channel according to the transmittability of oneself and the transmittability of surroundings nodes and accounts for
The greedy decision-making of local optimum.Can mark the link disturbed with its phase after certain link decisions is illegal link, not at row
Within the range of choice of residue link.After traveling through all links, all optional link in network is not all already divided into
Optional link set SNInterior or selected link set S set uplIn.Final network is according to this selected link set S set uplCarry out
Information is transmitted.The present invention can guarantee that and distributes channel resource efficiently, and node starts transmission when, do not has channel punching
Prominent, obtain the network output performance of relative good simultaneously.
Inventor has carried out the emulation of 3000 time slots, and i.e. one has 3000 transmission opportunitys, and in an experiment, inventor exists
Generating the node of 40 random distribution in the region of one 30*30, each node has different for each channel
Transmission signal to noise ratio.And these signal to noise ratios meet Gaussian Profile.Meanwhile, inventor makes interference radius and the transmission of node of node
Radius is all 5, and (the most each node is last through which node to establish network topological diagram according to their transmission radius
Transfer data to Centroid).Centroid is positioned at the center (15,15) in the region that inventor generates, and is all numbers
According to terminal.It will be appreciated by those skilled in the art that in the interference radius of transmission node, other in addition to receiving node simultaneously
Node can not use same channel received data；Other nodes in the interference radius of receiving node, in addition to transmission node
Data can not be sent with same channel.And arbitrary node can only receive the node data to it simultaneously, and can not be simultaneously
Receive and send data.Based on those relationships it is possible to set up the interference relationships matrix of this network scenarios.
Implement step and include following steps:
The first step, sets the data production rate of each node, and this data production rate is identical for each node,
And it be node single time slot transmitted data amount mean value 1/3rd.(this 1/3rd the most special number
Word requirement, simply needs the data production rate of node and the message transmission rate of node may compare, does not haves speed and produce
The data that speed is too high and in network are constantly in blocked state, or message transmission rate causes channel resource to divide the soonest
Match and affect the least situation in exporting of network).
Second step, the greedy algorithm provided according to the present invention, calculate the transmittability of node.
3rd step, according to the present invention provide greedy algorithm travel through all links, until network in optional link the most by
Being divided in can not selecting link set or in the selected link set set up, the selected link set set up of output is as greedy algorithm
Result.
4th step, records following data:
(1) the data total amount that Centroid receives at each time slot.
(2) the data heap accumulated amount of the node that in each time slot, heap volume data is most.
By record data above, add simultaneously inventor carry out other experiment draw network output upper bounds compare, send out
A person of good sense has obtained Fig. 2.Wherein, centralized algorithm is the result that the direct overall situation selects the strongest transmission of transmittability.
Above the specific embodiment of the present invention is described.It is to be appreciated that the invention is not limited in above-mentioned specific
Embodiment, those skilled in the art can make various deformation or amendment within the scope of the claims, and this has no effect on this
The flesh and blood of invention.
Claims (5)
1. the method distributing channel resource by greedy algorithm in multi-channel multi-hop wireless network, it is characterised in that include
Following steps:
The first step, each nodal test with oneself transmitting the essential information of the node that data interfere with each other and may pass through these bases
This information calculates the transmittability of oneself and these nodes respectively；
Second step, the access link l that the n bar existed in a network by each node is relevant1,l2,...ln, selected according to receive
Link set S set uplWith can not select link set SN, mark optional link；Each channel is used to build by calculating this node
The transmittability of vertical link, selects the link l in legal link with high-transmission abilitym, find the node that this link is corresponding
And the channel used during transmission, and this link is joined link set S of selected foundationl, i.e. Sl←Sl∪{lm, wherein,
The implication of described legal link is, currently the unselected link for setting up of this link, and be not labeled as can not select chain road；
Finally according to the link l foundm, marking all interfering links corresponding to this link is can not select chain road broadcasts selected foundation
Link set SlWith can not select link set SNTo node about, in order to other node resources distribute, by that analogy；
3rd step, each node performs second step the most successively, until the optional link in network is all already divided into can not
Select link set SNInterior or selected link set S set uplIn, selected link set S set up of outputlKnot as greedy algorithm
Really；
Described essential information includes: the transmission signal to noise ratio of all optional channels of node, node data to be transferred backlog；Described biography
Movement Capabilities refers to, every the channel calculated according to signal to noise ratio and shannon formula is multiplied by this joint for the channel capacity of each node
Point data to be transferred backlog is long-pending with channel usable probability, and described transmittability is expressed as follows:
X in formulaikIt is exactly this node i transmittability for channel k,For the signal to noise ratio of link, liIt it is i-node data to be transferred
Backlog or a function about data congestion, pkRepresenting the usable probability of k channel, scope is [0,1], and this is general
Rate is used for describing channel and can be used, or user tends to the probability of use.
The method distributing channel resource by greedy algorithm in multi-channel multi-hop wireless network the most according to claim 1,
It is characterized in that, described interfering link refers to the interference of same node and adjacent interference；Wherein, transmission link is referred to node interference
Having identical node, this interference can make link all disturb on all channels；Adjacent interference includes launching interference and receiving interference,
Wherein, when transmitting interference refers to this node as transmitting node, the receiving node in other link is in the interference model of this node
In enclosing, when reception interference refers to this node as reception node, this node is in the interference range of the transmitting node of other link
In.
The method distributing channel resource by greedy algorithm in multi-channel multi-hop wireless network the most according to claim 1,
It is characterized in that, the definition of described legal link is: the currently unselected link for setting up of this link, and is not labeled as
Can not select chain road.
The method distributing channel resource by greedy algorithm in multi-channel multi-hop wireless network the most according to claim 1,
It is characterized in that, when traveling through all nodes successively at random, carry out link selection according to some specific node ID order,
When traveling through each node, collecting the information of surroundings nodes, oneself node does greed selection, then broadcast selects result
Method.
The method distributing channel resource by greedy algorithm in multi-channel multi-hop wireless network the most according to claim 4,
It is characterized in that, for the network characteristics of single centre node, in order to obtain preferable performance, according to nodal distance Centroid
The number of jumping figure, ascending decision traversal order.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201210311650.9A CN103634846B (en) | 2012-08-29 | 2012-08-29 | By the method for greedy algorithm distribution channel resource in multi-channel multi-hop wireless network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201210311650.9A CN103634846B (en) | 2012-08-29 | 2012-08-29 | By the method for greedy algorithm distribution channel resource in multi-channel multi-hop wireless network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN103634846A CN103634846A (en) | 2014-03-12 |
| CN103634846B true CN103634846B (en) | 2016-08-17 |
Family
ID=50215375
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201210311650.9A Expired - Fee Related CN103634846B (en) | 2012-08-29 | 2012-08-29 | By the method for greedy algorithm distribution channel resource in multi-channel multi-hop wireless network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN103634846B (en) |
Families Citing this family (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104780616B (en) * | 2015-03-23 | 2018-02-13 | 东南大学 | A kind of link scheduling method of the Energy Efficient based on SINR interference models |
| CN107509249B (en) * | 2017-08-07 | 2019-10-11 | 东南大学 | One kind being based on time-multiplexed virtual multi-channel distribution method |
| CN108124253B (en) * | 2017-11-14 | 2020-10-20 | 杭州电子科技大学 | Wireless multi-hop network routing selection and power distribution method considering safety |
| CN108809456B (en) * | 2018-07-04 | 2020-09-18 | 天津大学 | Centralized cognitive radio frequency spectrum allocation method based on improved reinforcement learning |
| CN111610495B (en) * | 2020-06-02 | 2022-11-29 | 北京理工大学 | UAV network radar interference suppression method based on resource allocation and power control |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2005060170A1 (en) * | 2003-12-19 | 2005-06-30 | Telefonaktiebolaget Lm Ericsson (Publ) | Fast/opportunistic distributed resource reallocation for established connections in a multihop network |
| CN101534557A (en) * | 2009-04-15 | 2009-09-16 | 东南大学 | Method for allocating resources optimally in distributed mode by self-organizing cognitive wireless network |
| CN102244913A (en) * | 2010-05-12 | 2011-11-16 | 华为技术有限公司 | Multi-hop routing cooperation method of wireless network and realization apparatus thereof |
| CN102523588A (en) * | 2011-12-08 | 2012-06-27 | 东南大学 | Method for reducing interruption probability of large-scale wireless self-organizing network |
-
2012
- 2012-08-29 CN CN201210311650.9A patent/CN103634846B/en not_active Expired - Fee Related
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2005060170A1 (en) * | 2003-12-19 | 2005-06-30 | Telefonaktiebolaget Lm Ericsson (Publ) | Fast/opportunistic distributed resource reallocation for established connections in a multihop network |
| CN101534557A (en) * | 2009-04-15 | 2009-09-16 | 东南大学 | Method for allocating resources optimally in distributed mode by self-organizing cognitive wireless network |
| CN102244913A (en) * | 2010-05-12 | 2011-11-16 | 华为技术有限公司 | Multi-hop routing cooperation method of wireless network and realization apparatus thereof |
| CN102523588A (en) * | 2011-12-08 | 2012-06-27 | 东南大学 | Method for reducing interruption probability of large-scale wireless self-organizing network |
Also Published As
| Publication number | Publication date |
|---|---|
| CN103634846A (en) | 2014-03-12 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Accettura et al. | Decentralized traffic aware scheduling in 6TiSCH networks: Design and experimental evaluation | |
| Shao et al. | Performance analysis of connectivity probability and connectivity-aware MAC protocol design for platoon-based VANETs | |
| CN103634846B (en) | By the method for greedy algorithm distribution channel resource in multi-channel multi-hop wireless network | |
| Hafeez et al. | Optimizing the control channel interval of the DSRC for vehicular safety applications | |
| Kasana et al. | Fuzzy-based channel selection for location oriented services in multichannel VCPS environments | |
| CN103685025A (en) | Cross-layer dynamic self-adapting routing method based on LEO satellite network | |
| CN102625362A (en) | Distributed channel allocating method in multi-channel multi-radio wireless Mesh network | |
| Rawat et al. | Cloud-assisted GPS-driven dynamic spectrum access in cognitive radio vehicular networks for transportation cyber physical systems | |
| Sicignano et al. | Real-time wireless multi-hop protocol in underground voice communication | |
| Nguyen et al. | A distributed algorithm: Minimum-latency collision-avoidance multiple-data-aggregation scheduling in multi-channel WSNs | |
| CN103607737A (en) | Heterogeneous network service flow-dividing method and system | |
| Martinez et al. | Determining the representative factors affecting warning message dissemination in VANETs | |
| CN103200689A (en) | Link distribution method used for multichannel wireless Mesh network | |
| Chen et al. | When vehicles meet TV white space: A QoS guaranteed dynamic spectrum access approach for VANET | |
| Nguyen et al. | Application of the lowest-ID algorithm in cluster-based TDMA system for VANETs | |
| CN102724669B (en) | Routing and time slot distributing method on basis of main user protection in cognitive radio network | |
| CN104394569B (en) | The method that QoS routing is set up based on angle and interference control in wireless D2D networks | |
| Hadded et al. | A fully distributed tdma based mac protocol for vehicular ad hoc networks | |
| CN103582136B (en) | The method efficiently distributing channel in using multi channel wireless sensor network | |
| Diamant et al. | Joint time and spatial reuse handshake protocol for underwater acoustic communication networks | |
| Venkataraman et al. | A moving cluster architecture and an intelligent resource reuse protocol for vehicular networks | |
| CN109600815A (en) | A kind of method, apparatus that realizing data forwarding and storage equipment, program product | |
| CN104080088A (en) | Method and device of channel allocation | |
| CN103781179B (en) | Load sensing type wireless Mesh network partially-overlapped channel distribution system and method | |
| Abedi et al. | Distributed routing for vehicular ad hoc networks: Throughput-delay tradeoff |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20160817 Termination date: 20190829 |
|
| CF01 | Termination of patent right due to non-payment of annual fee |