CN105472688B - A Hierarchical Multi-Hop Link Method with Uniform Vehicle Distribution in Vehicle-mounted Ad Hoc Networks - Google Patents
A Hierarchical Multi-Hop Link Method with Uniform Vehicle Distribution in Vehicle-mounted Ad Hoc Networks Download PDFInfo
- Publication number
- CN105472688B CN105472688B CN201510794828.3A CN201510794828A CN105472688B CN 105472688 B CN105472688 B CN 105472688B CN 201510794828 A CN201510794828 A CN 201510794828A CN 105472688 B CN105472688 B CN 105472688B
- Authority
- CN
- China
- Prior art keywords
- vehicle
- access
- point
- roadside unit
- link
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Expired - Fee Related
Links
- 238000000034 method Methods 0.000 title claims abstract description 37
- 230000005540 biological transmission Effects 0.000 claims abstract description 24
- 238000013459 approach Methods 0.000 claims abstract description 12
- 230000000750 progressive effect Effects 0.000 claims abstract description 12
- 238000012546 transfer Methods 0.000 claims description 4
- 238000004364 calculation method Methods 0.000 claims description 2
- 101150094193 AHP1 gene Proteins 0.000 description 11
- 101100269451 Arabidopsis thaliana AHL10 gene Proteins 0.000 description 11
- 101150039260 AHP2 gene Proteins 0.000 description 9
- 101100322803 Arabidopsis thaliana AHL13 gene Proteins 0.000 description 9
- 101100124983 Arabidopsis thaliana HOP2 gene Proteins 0.000 description 9
- 238000005457 optimization Methods 0.000 description 8
- 230000008569 process Effects 0.000 description 8
- 101100055117 Arabidopsis thaliana AHP3 gene Proteins 0.000 description 6
- 238000004458 analytical method Methods 0.000 description 5
- 238000004891 communication Methods 0.000 description 4
- 230000032798 delamination Effects 0.000 description 4
- 238000012423 maintenance Methods 0.000 description 4
- 238000013178 mathematical model Methods 0.000 description 2
- 230000006855 networking Effects 0.000 description 2
- 238000011160 research Methods 0.000 description 2
- 244000187801 Carpobrotus edulis Species 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000008859 change Effects 0.000 description 1
- 235000013399 edible fruits Nutrition 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
- H04W40/22—Communication route or path selection, e.g. power-based or shortest path routing using selective relaying for reaching a BTS [Base Transceiver Station] or an access point
-
- 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
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
Layering multi-hop link method under being uniformly distributed the present invention relates to vehicle in a kind of vehicular ad hoc network, vehicle is divided equally on road to be distributed, and the transmission radius of common move vehicle is equal, and exchanges periodically location information in the vehicle of a jump range；When roadside unit can cover entire road, comprising: inwardly successively progressive layered approach, uplink link method, the initialization and update of hierarchical link；When roadside unit can not cover entire road, comprising: the layered approach of outside progressive expansion, uplink link method, the initialization and update of hierarchical link.The present invention can effectively reduce the time delay in data transmission procedure.
Description
Technical field
The present invention relates to vehicular ad hoc network technical fields, are uniformly distributed down more particularly to vehicle in a kind of vehicular ad hoc network
Layering multi-hop link method.
Background technique
Currently, in vehicular ad hoc network (Vehicular Ad Hoc Network, hereinafter referred to as VANET), vehicle can be with
And vehicle communication, while vehicle can also with vehicle node and roadside unit (Road Side Unite, hereinafter referred to as RSU) into
Row communication.When move vehicle needs to send data, request service or accessing external network to RSU, move vehicle needs to carry out with RSU
Communication.Information is transmitted to RSU in a multi-hop fashion, since the transmission radius of common vehicle is certain, so distance RSU is remoter
Vehicle issue information, required hop count is more in transmission process, and corresponding propagation delay time will be bigger, such as Fig. 1
Scene case.How a major challenge and numerous research institution and enterprise that propagation delay time be VANET technology is effectively reduced
Hot research content.
Summary of the invention
Layering under being uniformly distributed technical problem to be solved by the invention is to provide vehicle in a kind of vehicular ad hoc network is more
Hop link method can effectively reduce the time delay in data transmission procedure.
The technical solution adopted by the present invention to solve the technical problems is: providing vehicle in a kind of vehicular ad hoc network and uniformly divides
The layering multi-hop link method planted, vehicle is divided equally on road to be distributed, and the transmission radius of common move vehicle is equal, and
The vehicle of one jump range exchanges periodically location information；When roadside unit can cover entire road, comprising: inwardly successively progressive
Layered approach, uplink link method, the initialization and update of hierarchical link；When roadside unit can not cover entire road
When, comprising: the layered approach of outside progressive expansion, uplink link method, the initialization and update of hierarchical link.
The roadside unit can cover entire road refer to any vehicle on road can a jumper connection receive and come from
The information of some roadside unit broadcast, and be located in the coverage area of some roadside unit.
Layered approach inwardly successively progressive refers to when the roadside unit can cover entire road covers in roadside unit
First layer access is selected at half in lid range R and helps point, continues to access in the coverage area R/2 for helping point in first layer
Second layer access is selected at half helps point, and so on, successively the successively progressive access for choosing other layers helps point.
Uplink link method refers to that mobile node will be by comparing tradition when the roadside unit can cover entire road
Multi-hop and by it is different access help point help mode transmission data needed for time delay, choose the smallest link of time delay as oneself
Uplink；One jump of delay hypothesis delay used is the same when comparing, and time-delay calculation is reduced to the calculating of link hop count.
The roadside unit can cover the initialization of entire road layered link and update refers to that roadside unit is broadcasted
After helping the information of point position, all move vehicles to receive comprising hierarchy number and each layer of access compared with self-position, away from
It helps the nearest vehicle in point position that the access for becoming this layer is helped point from access, and accordingly changes the transmission radius of oneself.
The roadside unit, which can not cover entire road and refer to, to be located at outside the coverage area of roadside unit there are vehicle, no
One jumper connection of energy receives the information broadcasted from some roadside unit, but other vehicles is needed to forward, and can just receive.
The layered approach of progressive expansion refers in roadside unit outward when the roadside unit can not cover entire road
Direction of the both sides far from roadside unit successively chooses access and helps point, and every layer of only one upper access helps point in each direction.
Uplink link method refers to that mobile node transfers data to when the roadside unit can not cover entire road
The highest access of the level nearest apart from oneself helps point, helps point to transfer data to by the access and higher accesses help
Point, until data are received by roadside unit.
The roadside unit can not cover the initialization of entire road layered link and update refers to that roadside unit is wide
The information that point position is helped comprising hierarchy number and each layer of access is broadcast, after all move vehicles for receiving broadcast message receive
First by all positions compared with self-position, distance access helps the nearest vehicle in point position to help the access for becoming this layer
Point accordingly changes the transmission radius of oneself, and whether next position for detecting oneself is greater than or equal in roadside unit coverage area
The access farthest apart from roadside unit helps the position of point otherwise not forward if it is that will forward the broadcast message received.
Beneficial effect
Due to the adoption of the above technical solution, compared with prior art, the present invention having the following advantages that and actively imitating
Fruit: after In-vehicle networking foundation, the vehicle in In-vehicle networking can communicate and obtains communication range interior nodes the present invention
Location information improve the service quality of vehicular ad hoc network so as to effectively reduce the time delay of link.
Detailed description of the invention
Fig. 1 is Scene case figure；
Fig. 2 is the delamination figure that the number of plies is 2 when RSU covers entire road；
Fig. 3 is the flow chart that uplink link scheme determines when RSU covers entire road；
Fig. 4 is link initialization and renewal process flow chart when RSU covers entire road；
Fig. 5 is initialization and updated scene figure when RSU covers entire road；
Fig. 6 is the delamination figure that the number of plies is 3 when RSU cannot cover entire road；
Fig. 7 is link initialization and renewal process flow chart when RSU cannot cover entire road；
Fig. 8 is layered optimization number analysis chart when RSU covers entire road surface；
Fig. 9 is the relational graph of average delay and hierarchy number when RSU cannot cover entire road surface.
Specific embodiment
Present invention will be further explained below with reference to specific examples.It should be understood that these embodiments are merely to illustrate the present invention
Rather than it limits the scope of the invention.In addition, it should also be understood that, after reading the content taught by the present invention, those skilled in the art
Member can make various changes or modifications the present invention, and such equivalent forms equally fall within the application the appended claims and limited
Range.
Embodiments of the present invention are related to a kind of layering multi-hop link method under vehicle is uniformly distributed in vehicular ad hoc network,
Vehicle is divided equally on road to be distributed, and the transmission radius of common move vehicle is equal, and is exchanged periodically in the vehicle of a jump range
Location information；When roadside unit can cover entire road, comprising: inwardly successively progressive layered approach, uplink side
Method, the initialization and update of hierarchical link；When roadside unit can not cover entire road, comprising: outside progressive expansion
Layered approach, uplink link method, the initialization and update of hierarchical link.
The first situation, when the quantity of RSU is enough, when can cover entire road surface
1. the method for link layering
In the coverage area R of RSU, on the both sides RSU, selected distance RSU distance isThe vehicle node at place is as first layer
Mobile access help point (Accessing Help Point, hereinafter referred to as AHP) i.e. AHP1, therefore the number of AHP1 be 2, AHP1
Initial transmission radius be
It is in two back gauge AHP1 distance of AHP1AHP, that is, AHP2 of the vehicle node at place as the second layer, therefore AHP2
The initial transmission radius that number is 4, AHP2 is
It is in two back gauge AHP2 distance of AHP2AHP, that is, AHP3 of the vehicle node at place as third layer, therefore AHP3
The initial transmission radius that number is 8, AHP3 is
And so on, it can according to said method be layered down always according to the actual situation, by analyzing link maximum delay Dmax
With the mathematical model of hierarchy number k:
Min Dmax=f1(k)
Must send as an envoy to DmaxThe smallest layering quantity k.Fig. 2 is the delamination figure that the number of plies is 2.
2. uplink scheme
According to the layered approach it is proposed that following data uplink scheme (assuming that the link layering number is k):
When vehicle is between AHPk and RSU or at AHPk and farthest RSU coverage area R, vehicle will be relatively following
Hop count needed for two kinds of uplink modes:
1) traditional multihop mode, not by the help of AHP；
2) data are transmitted to AHPk by hierarchical system, data are forwarded to AHPk-1 by AHPk again, and so on until number
According to being forwarded to RSU；
Hop count needed for two ways is compared by vehicle, and the uplink of smaller hop count is selected to carry out data forwarding.
Between vehicle is located at two AHP when (AHPi and AHPi-1), vehicle will be needed for relatively following lower three kinds of modes
Hop count:
1) traditional multihop mode, not by the help of AHP；
2) data are transmitted to AHPi by hierarchical system, data are forwarded to AHPi-1 by AHPi again, and so on until number
According to being forwarded to RSU；
3) data are transmitted to AHPi-1 by hierarchical system, data are forwarded to AHPi-2 by AHPi-1 again, and so on it is straight
RSU is forwarded to data；
Hop count needed for three kinds of modes is compared by vehicle, is selected the uplink of smaller hop count to carry out data and is turned.Fig. 3
The flow chart (it is assumed that layered optimization number is 2) determined for uplink link scheme.
3. link initialization and maintenance process
The preliminary examination of link and maintenance process include:
After analysis link maximum delay and optimization algorithm, it is determined that layered optimization number k.RSU is in oneself covering
All vehicles of range broadcast the message, which includes the location of layered optimization number k and each layer of vehicle, i.e. pij(table
Show i-th layer of j-th of position, wherein j=1,2 ..., 2i-1)。
After road vehicle receives broadcast message, by the position of oneself and pijSuccessively it is compared, range difference is small
In the pi of r (the transmission radius that r is general vehicle)jIt screens, is denoted as pi1j1.By oneself one jump within vehicle position and
pi1j1It is successively compared, distance pi1j1Nearest node becomes j-th of AHPi, positioned at i-th layer of hierarchical link, and changes
The transmission radius of oneself becomes Rij, to reduce chain-circuit time delay.After all AHP are determined, after ▽ T time, RSU is re-broadcast,
All AHP will be also updated according to new location information, and Fig. 4 is link initialization and renewal process flow chart, and Fig. 5 is initial
Change and updated scene figure.
Second situation can not cover entire road when the lazy weight of RSU
1 link layering method
In the coverage area L (L > R) that a RSU needs, selected distance RSU distance is x1The vehicle node at place is as
One layer of mobile access helps point (Accessing Help Point, hereinafter referred to as AHP) i.e. AHP1, therefore the number of AHP1 is 2,
The initial transmission radius of AHP1 is x1；
It is x in distance AHP1 distance2And AHP, that is, AHP2 far from the vehicle node on the direction RSU as the second layer, therefore
The initial transmission radius that the number of AHP2 is 2, AHP2 is x2；
It is x in distance AHP2 distance3AHP, that is, AHP3 of the vehicle node at place as third layer, therefore the number of AHP3 is 2,
The initial transmission radius of AHP3 is x3；
And so on, can according to said method be layered down always according to the actual situation, by analysis link maximum delay D with
The mathematical model of hierarchy number k:
It must send as an envoy toThe smallest layering quantity k, Fig. 6 are the delamination figure that the number of plies is 3.
2. uplink scheme
According to the layered approach it is proposed that following data uplink scheme (assuming that the link layering number is k):
1) when vehicle is between AHP1 and RSU, the data of vehicle will be by traditional multihop mode, not by AHP's
It helps；
2) when vehicle is between AHPi-1 and AHPi, data will be transmitted in a multi-hop fashion AHPi-1 and be forwarded to again
AHPi, and so on until data be forwarded to RSU；
3) when vehicle is between AHPk and R, data will be transmitted to AHPk in a multi-hop fashion, then be forwarded to AHPk-
1, and so on until data be forwarded to RSU.Uplink scenario as shown in FIG. 6.
3. link initialization and maintenance process
The preliminary examination of link and maintenance process include:
After analysis link maximum delay and optimization algorithm, it is determined that layered optimization number k.RSU is in oneself covering
All vehicles of range broadcast the message, which includes the location of layered optimization number k and each layer of vehicle, i.e. pij(table
Show i-th layer of j-th of position, wherein j=1,2) comprising p that distance RSU within the scope of R is farthest, and in informationi0j0。
After road vehicle receives broadcast message, by the position of oneself and pijSuccessively it is compared, range difference is small
In the pi of r (the transmission radius that r is general vehicle)jIt screens, is denoted as pi1j1.By oneself one jump within vehicle position and
pi1j1It is successively compared, distance pi1j1Nearest node becomes j-th of AHPi, positioned at i-th layer of hierarchical link, and changes
The transmission radius of oneself becomes Rij, to reduce chain-circuit time delay.If pi1j1≥pi0j0Illustrate that the AHP is that distance RSU is most within the scope of R
AHP outside remote AHP R range, then the AHP will continue the data for forwarding RSU to broadcast.If pi1j1<pi0j0Then the AHP is not
Forwarding.
After all AHP are determined, after ▽ T time, RSU is re-broadcast, all AHP also by according to new location information into
Row updates, and Fig. 7 is link initialization and renewal process flow chart.
The present invention is further illustrated with specific embodiment below.
When RSU covers entire road enough:
As f '1(k)=0 it can calculate:
As setting R=3000m, r=150m, T0=0.02s,Fig. 8 maximum delay and link layering number can be obtained
Purpose relationship, when β=20, optimal layering number is 4 under the scene.
RSU will calculate the broadcast of position information of resulting k and each AHP to all vehicles on oneself covered road surface, move
Dynamic vehicle will initialize after receiving information according to initialization and update method.When move vehicle needs to think RSU request clothes
When business, it will be made requests according to uplink scheme.
When RSU does not cover entire road enough:
Assuming that being divided into m layers, then there is m-1A AHP, the distribution density of vehicle are σ.
1) the total hop count H1 of all vehicle uplinks between [0 AHP1]:
2) the total hop count H2 of all vehicle uplinks between [AHP1 AHP2]:
3) the total hop count Hm-1 of all vehicle uplinks between [AHPm-2 AHP-1]:
4) the total hop count Hm of all vehicle uplinks between [AHPm AHPm+Rm]:
Then average delay are as follows:
Restrictive condition:
Optimal k is measured by optimality analysis.Fig. 9, which is shown, works as L=20000m, when r takes different numerical value average delay with
The relationship of hierarchy number can obtain optimal hierarchy number.
RSU will calculate the broadcast of position information of resulting k and each AHP to all vehicles on oneself covered road surface, move
Dynamic vehicle will initialize after receiving information according to initialization and update method.When move vehicle needs to think RSU request clothes
When business, the uplink scheme for not covering entire road enough according to RSU is made requests.
Claims (3)
1. a kind of layering multi-hop link method under vehicle is uniformly distributed in vehicular ad hoc network, which is characterized in that vehicle is in road
Upper to divide equally distribution, the transmission radius of common move vehicle is equal, and exchanges periodically location information in the vehicle of a jump range；When
When roadside unit can cover entire road, comprising: inwardly successively progressive layered approach refers to and covers model in roadside unit
It encloses and selectes first layer access help point at the half in R, continue to access the half in the coverage area R/2 for helping point in first layer
Locate selected second layer access and helps point, and so on, successively the successively progressive access for choosing other layers helps point；Uplink side
Method refers to that mobile node will help needed for the help mode transmission data of point by comparing traditional multihop and by different accesses
Time delay chooses the smallest link of time delay as the uplink of oneself；Delay assumes that jump delay used is the same when comparing
, time-delay calculation is reduced to the calculating of link hop count；The initialization and update of hierarchical link refer to roadside unit broadcast comprising dividing
The number of plies and each layer of access help the information of point position, and all move vehicles receive rear compared with self-position, distance access
It helps the nearest vehicle in point position that the access for becoming this layer is helped point, and accordingly changes the transmission radius of oneself；When roadside list
When member can not cover entire road, comprising: the layered approach of outside progressive expansion refers on roadside unit both sides far from road
The direction of side unit successively chooses access and helps point, and every layer of only one upper access helps point in each direction；Uplink side
Method refers to that mobile node transfers data to the highest access of the level nearest apart from oneself and helps point, is helped by the access
Point transfers data to higher access and helps point, until data are received by roadside unit；The initialization and update of hierarchical link,
It is the side cell broadcast that shows the way include information that hierarchy number and each layer of access help point position, all broadcast messages that receive
Move vehicle receive after first by all positions compared with self-position, distance access helps the nearest vehicle in point position will be at
Point is helped for the access of this layer, accordingly changes the transmission radius of oneself, whether next position for detecting oneself is greater than or equal to road
The access farthest apart from roadside unit helps the position of point in the unit coverage area of side, if it is will forward the broadcast received letter
Breath, does not otherwise forward.
The layering multi-hop link method under 2. vehicle is uniformly distributed in vehicular ad hoc network according to claim 1, feature
Be, the roadside unit can cover entire road refer to any vehicle on road can a jumper connection receive from some
The information of roadside unit broadcast, and be located in the coverage area of some roadside unit.
The layering multi-hop link method under 3. vehicle is uniformly distributed in vehicular ad hoc network according to claim 1, feature
It is, the roadside unit, which can not cover entire road and refer to, to be located at outside the coverage area of roadside unit there are vehicle, cannot
One jumper connection receives the information broadcasted from some roadside unit, but other vehicles is needed to forward, and can just receive.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510794828.3A CN105472688B (en) | 2015-11-18 | 2015-11-18 | A Hierarchical Multi-Hop Link Method with Uniform Vehicle Distribution in Vehicle-mounted Ad Hoc Networks |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510794828.3A CN105472688B (en) | 2015-11-18 | 2015-11-18 | A Hierarchical Multi-Hop Link Method with Uniform Vehicle Distribution in Vehicle-mounted Ad Hoc Networks |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN105472688A CN105472688A (en) | 2016-04-06 |
| CN105472688B true CN105472688B (en) | 2019-04-09 |
Family
ID=55609851
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201510794828.3A Expired - Fee Related CN105472688B (en) | 2015-11-18 | 2015-11-18 | A Hierarchical Multi-Hop Link Method with Uniform Vehicle Distribution in Vehicle-mounted Ad Hoc Networks |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN105472688B (en) |
Families Citing this family (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108012244B (en) * | 2017-11-29 | 2020-12-01 | 南京工业大学 | Cluster-based highway vehicle-mounted self-organizing network data service communication system and method |
| CN109035760B (en) * | 2018-06-22 | 2021-11-02 | 东华大学 | Road network information collection method in different RSU scenarios in vehicle-mounted ad hoc network |
| CN111314885A (en) * | 2020-02-28 | 2020-06-19 | 长安大学 | An urban vehicle networking communication method based on named data network |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101558676A (en) * | 2006-10-23 | 2009-10-14 | 泰克迪亚科技公司 | Method and communication device for routing unicast and multicast messages in an ad hoc wireless network |
| CN101573994A (en) * | 2006-10-23 | 2009-11-04 | 泰克迪亚科技公司 | Roadside network unit using local peer-to-peer groups as network groups |
| WO2015019234A1 (en) * | 2013-08-05 | 2015-02-12 | Universidade De Aveiro | Method and apparatus for multi-network communication in vehicular networks |
-
2015
- 2015-11-18 CN CN201510794828.3A patent/CN105472688B/en not_active Expired - Fee Related
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101558676A (en) * | 2006-10-23 | 2009-10-14 | 泰克迪亚科技公司 | Method and communication device for routing unicast and multicast messages in an ad hoc wireless network |
| CN101573994A (en) * | 2006-10-23 | 2009-11-04 | 泰克迪亚科技公司 | Roadside network unit using local peer-to-peer groups as network groups |
| WO2015019234A1 (en) * | 2013-08-05 | 2015-02-12 | Universidade De Aveiro | Method and apparatus for multi-network communication in vehicular networks |
Non-Patent Citations (1)
| Title |
|---|
| A Dynamic Hierarchical VANET Architecture for Named Data Networking Applications;Cristina De Castro 等;《IEEE，Communications (ICC), 2015 IEEE International Conference on 8-12 June 2015》;20150612;第II、III部分 |
Also Published As
| Publication number | Publication date |
|---|---|
| CN105472688A (en) | 2016-04-06 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Xu et al. | Efficiency resource allocation for device-to-device underlay communication systems: A reverse iterative combinatorial auction based approach | |
| CN103987103B (en) | A kind of vehicle self-organizing network route selection method based on game theory | |
| Rani et al. | Multi-hop routing in wireless sensor networks: an overview, taxonomy, and research challenges | |
| Mohanadevi et al. | A qos-aware, hybrid particle swarm optimization-cuckoo search clustering based multipath routing in wireless sensor networks | |
| CN101568124A (en) | Channel allocation method in wireless mesh network | |
| CN106912079A (en) | Federated user accesses selection and resource allocation methods in one kind caching heterogeneous network | |
| CN105472688B (en) | A Hierarchical Multi-Hop Link Method with Uniform Vehicle Distribution in Vehicle-mounted Ad Hoc Networks | |
| CN105050095B (en) | A topology construction method for heterogeneous wireless sensor networks based on energy prediction | |
| CN107040323B (en) | Multichannel power bandwidth combined distributing method in a kind of cognitive radio networks | |
| CN103260264A (en) | Wireless sensor network data fusion method based on double-fusion node ant colony optimization | |
| CN110769444A (en) | A transmission method for wireless energy-carrying communication based on power allocation | |
| WO2017042523A1 (en) | Self-evolving wireless backhaul | |
| US20210227364A1 (en) | Method of allocating sidelink radio resources to a group of vehicles, in a telecommunication network, wherein vehicles within said group of vehicles intent to use said sidelink for vehicle-to-vehicle, v2v, communication | |
| US8929387B2 (en) | Cognitive radio communication system and operating method thereof | |
| CN102833755A (en) | Method and device for constructing CoMP (Coordinated Multi-Point) cell coordination set | |
| Liu et al. | Cooperative edge-cloud caching for real-time sensing big data search in vehicular networks | |
| Zhang | A WSN Clustering Multi‐Hop Routing Protocol Using Cellular Virtual Grid in IoT Environment | |
| CN103228057A (en) | Distributed resource allocation method of wireless MESH network | |
| Charoenchai et al. | Coalitional graph game for area maximization of multi-hop clustering in vehicular ad hoc networks | |
| Liu et al. | Research on MAC Protocols in Cluster‐Based Ad Hoc Networks | |
| Lin et al. | Statistical dissemination control in large machine-to-machine communication networks | |
| Chen et al. | Game‐Based Channel Selection for UAV Services in Mobile Edge Computing | |
| CN113285777A (en) | 5G communication system user association, unmanned aerial vehicle deployment and resource allocation method | |
| An et al. | Multi-modal mutation cooperatively coevolving algorithm for resource allocation of large-scale D2D communication system | |
| Kabir | Cooperative content caching and distribution in dense networks |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20190409 Termination date: 20211118 |
|
| CF01 | Termination of patent right due to non-payment of annual fee |