CN105610732B - Vehicle self-organizing network forwarder selection and collaboration communication method - Google Patents
Vehicle self-organizing network forwarder selection and collaboration communication method Download PDFInfo
- Publication number
- CN105610732B CN105610732B CN201610009407.XA CN201610009407A CN105610732B CN 105610732 B CN105610732 B CN 105610732B CN 201610009407 A CN201610009407 A CN 201610009407A CN 105610732 B CN105610732 B CN 105610732B
- Authority
- CN
- China
- Prior art keywords
- node
- vehicle
- data
- forward node
- queue
- 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.)
- Active
Links
Classifications
-
- 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/08—Load balancing or load distribution
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/50—Queue scheduling
-
- 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
- H04W40/00—Communication routing or communication path finding
- H04W40/34—Modification of an existing route
- H04W40/38—Modification of an existing route adapting due to varying relative distances between nodes
-
- 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
Abstract
The purpose of the invention is to advanced optimize the communication mechanism of vehicle self-organizing network (VANET), therefore propose a kind of dynamic select forward node and self-determination cooperation communication means.Between vehicle if necessary the information of multi-hop transmission when, two alternative forward node can be selected according to the mutual speed between vehicle, then determine which node of selection forwards further according to the size of the current storage space of the two forward node, and another node becomes stand-by state.While in order to reduce the load of forward node as far as possible, other nodes around forward node successfully listen to the information for needing to forward and from when current time not having information to send, can be spontaneous carry out cooperation transmission, and forward node is deleted the information to facilitate reception other information from storage queue accordingly.When Vehicle Speed is stablized relatively in In-vehicle networking, this method can effectively reduce packet drop, and the properties of network get a promotion.
Description
Technical field
The invention belongs to fields of communication technology, are related to a kind of collaborative vehicle self-organizing network data transmission method for uplink.
Background technology
In intelligent transportation system, vehicle and infrastructure are two essential elements.With the development of economy, soon
The contradiction of the infrastructure construction of the increased vehicle fleet size of speed and stagnation is increasingly sharpened.According to effective statistics, by 2013,
The car ownership of China is 1.37 hundred million, and average annual increment is 10% or so, and urban road increment is average annual 3% in infrastructure
To 5%.The problem of shortage of infrastructure is brought also increasingly shows, and road is crowded, and conevying efficiency is low.And infrastructure is built
If the land resource needed is very in short supply, it is clear that cannot in order to improve traffic environment and land occupation builds road without restraint,
The infrastructure such as base station.Realize that the efficient communication between vehicle can effectively improve traffic environment, therefore, it has become in recent years
Research hotspot.
When designing mac-layer protocol for In-vehicle networking, the high-speed mobile of node, the characteristics such as distribution density dynamic change are all to need
Consider the problems of, and optimizes the key of agreement.In recent years, what IEEE 802.11p were undoubtedly that people understand the most is suitble to
The MAC protocol of VANETs, but IEEE802.11p does not have RTS/CTS exchanging mechanisms, cannot provide reliable broadcast service, therefore
It can not avoid the problem that hidden terminal is brought.In order to realize that reliable broadcast service, scholars gradually begin one's study and be based on
The MAC access protocols of TDMA effectively can avoid hidden terminal from bringing by carrying out a reliable hop broadcasting on a control channel
The problem of.This kind of agreement provides reliable broadcast and point-to-point communication for vehicle-mounted net.But when node high density can cause when being distributed
Gap resource is not enough distributed, and the time slot collision problem brought with the movement of vehicle more results in the waste of time interval resource.
Once node loses time slot, it is meant that data can not send and queue is caused to be accumulated.The timeliness of data is very in vehicle-mounted net
It is important, thus become by the way of collaboration communication make up In-vehicle networking time interval resource it is inadequate when a kind of settling mode.
General collaboration protocols are all to carry out data transmission using free timeslot that may be present in network, to improve the entirety of system
Handling capacity.But this collaboration protocols exactly need enough free timeslots to support cooperation to relay, and in vehicle there are a disadvantage
In contained network, time interval resource is often extremely limited, and in high-density environments, time interval resource is even more not reasonable distribution.
In view of the communication between Shape Of Things To Come is not just to safety traffic, while some data services can also be carried out
Transmission, therefore this method consider data arrival rate variation and the collaboration communication scene under node processing power fixing situation, when
Inter-node communication range can select a suitable forward node to be used for forwarding data when being more than a jump according to given rule, and send out
Node around node completes forwarding according to consideration facilitating collaboration the case where own queue or is not involved in forwarding, this cooperation forwarding
It is to be carried out on the time slot that itself is occupied, is not necessarily to new free timeslot.
Invention content
Technical problem：The object of the present invention is to provide one kind in vehicle self-organizing network, and node is sending multi-hop
Forward node is reasonably selected when data, idle node provides spontaneous forwarding service, improves network overall throughput, reduces packet loss
The collaborative vehicle self-organizing network communication means of rate.
Technical solution：The present invention is vehicle self-organizing network forwarder selection and collaboration communication method.
In method proposed by the present invention, when each node needs to preengage a time slot on a control channel and uses this always
Gap loses time slot until mobile conflict occurs, and frame assumption diagram is as shown in Figure 1.When node successfully occupies time slot, regardless of whether
It has data to send on data service channel, node sends in control channel when the time slot that every frame itself occupies is reached and controls
Message, for ensure with neighbor node data exchange and information update.
It is as shown in Figure 2 to control message format：Wherein slot occupancy information can clearly record time slot quilt within the scope of double bounce
The case where occupancy, time slot S in figure1It is occupied by node x, time slot S2It is unoccupied, it can preengage, and time slot SM- the 1 of label indicates
Time slot SMThere is reservation at place.New module WCHWhat is recorded is the weight of itself that each node is calculated according to car speed
Value.And module RMThe different type of node is distinguished with different value, if the value is 0, node is ordinary node, if it is 1,
Then node is available forward node, if vehicle itself WCHValue is vehicle W within the scope of a jumpCHIt is minimum or secondary small in value, then
By RMValue is rewritten as 1.Header file has recorded a series of vehicle movement related datas such as vehicle location, speed, moving direction.
The method of the present invention includes the following steps：
(1) initial runtime t=1, the W of each vehicle nodeCH,RMIt is set to 0 (wherein WCHIt is relatively fast between vehicle for weighing
Degree, RMBe vehicle whether be forward node label), each vehicle node WCH(0) it is set to 0；
(2) when the corresponding delivery time of vehicle node does not reach, node keeps monitor channel, while successively by data
Deposit storage queue；
(3) vehicle node calculates the W of itselfCHValue；
3-1) calculate impact factorWherein, ViIt is this
The speed of node itself, VjIt is the speed that the node one jumps other nodes in range, n is the number of the node surrounding vehicles node
Amount；
3-2) calculate node WCH(t)=β W (t)+(1- β) WCH(t-1), wherein β is that regulatory factor is used for adjusting working as
Preceding moment and previous moment impact factor are to calculating WCH(t) weight, and the numerical value being calculated is written in control message
WCH；
(4) after the corresponding delivery time of vehicle node reaches, node is conveyed respectively by controlling message to adjacent node
Respective weight W is conveyed while occupying time slotCH, whether node judges to store has data to send in queue, if there is data
It sends, then enters (5), otherwise enter (7)；
(5) vehicle node judges that the data of storage queue head of the queue need the distance sent, if within the scope of one jumps,
It can be sent directly to correspondingly received node, otherwise enter (6)；
(6) data of vehicle node storage queue head of the queue need to be sent to outside a jump range, then must select forward node
Realize that multi-hop is sent.
6-1) according to the W of each double bounce set interior jointCHValue selects minimum and secondary two small nodes as the double bounce collection
The possible forward node closed, and by RMIt is changed to 1 by initial value 0.And store queue length according to the two node current times
Size, a node for selecting team leader short is as forward node transmission data.
6-2) due to the characteristic of vehicle movement, narrowed down within a jump communication range r when there are two forward node distances,
It needs to merge forward node, i.e., according to respective WCHValue determines unique forward node, WCHIt is worth larger node by RMIt is changed to by 1
0, it indicates not forward data in storage；
Be more than 6-3) double bounce communication range 2r when there is two adjacent forward node distance, that is, occur subregion without turn
Coverage is sent out, the vehicle in the region can select a vehicle node to temporarily become forward node, by once again listening for channel
After determine whether to become formal forward node or merge with other forward node；
(7) node current time storage queue is idle, and no data need to send.Node is according to other nodes of monitor channel
The data of transmission send to decide whether to cooperation.If the node does not listen to the data for needing to forward, node is being worked as
The preceding moment keeps idle.And time counter t=t+1 after delivery time, (2) are returned to, otherwise enter (8)；
(8) node current time storage queue is idle, and no data need to send, but listen to forward node and have received
New multi-hop information.The spontaneous cooperation of the node forwards the message, after other nodes, which listen to the message, to be forwarded, choosing
It selects and deletes the message from storage queue, no longer forward.After carving when sending, time counter t=t+1 is returned to
(2)；
Parameter definition
WCH：The weighted value of node；
WCH(0)：Node initial weight value；
WCH(t)：Node t moment weighted value；
W(t)：Node t moment impact factor；
RM：Forwarding mark (forwarding is identified as 0 and is not involved in forwarding, participates in forwarding for 1)；
Vi：The speed of node itself；
Vj：The node one jumps the speed of other nodes in range；
n：The quantity of the node surrounding vehicles node.
Advantageous effect
Compared with prior art, the present invention haing the following advantages：
1. when data need multi-hop transmission, forward node is more reasonably selected.Due to the movement of vehicle in vehicle-mounted net
Characteristic, fixed often inappropriate using same forward node, the present invention selects on the basis of mutual speed between considering vehicle
It selects with the metastable vehicle of surrounding vehicles as forward node, improves the stability of network link.
2. ordinary node is spontaneous during idle time to carry out cooperation forwarding.If ordinary node reaches in itself delivery time and is not had
When thering are data to need to send, if having listened to the data for needing multi-hop transmission of other nodes transmission, transmission that can be spontaneous
The data are to destination node.This method reduces the load of forward node under the premise of without using additional free timeslots,
And effectively improve throughput of system.
Description of the drawings
Fig. 1 is frame structure schematic diagram.
Fig. 2 message structure schematic diagrames in order to control.
Fig. 3 is the flow diagram of the method for the present invention.
Fig. 4 is the simulation result diagram of handling capacity under highway scene.
Fig. 5 is the simulation result diagram of packet loss under highway scene
Specific implementation mode
The technical solution of invention is described in detail with reference to embodiment and Figure of description：
The thinking of the present invention is to reasonably select forward node according to car speed to promote the stability of network link, allows it
His node during idle time spontaneous offer cooperation forwarding service to mitigate the load of forward node and promote network performance.
Vehicle self-organizing network forwarder selection is shown in attached drawing 3 with collaboration communication method detailed process.
The vehicle self-organizing network forwarder selection and collaboration communication method of the present invention, includes the following steps：
(1) initial runtime t=1, the W of each vehicle nodeCH,RMIt is set to 0 (wherein WCHIt is relatively fast between vehicle for weighing
Degree, RMBe vehicle whether be forward node label), each vehicle node WCH(0) it is set to 0；
(2) when the corresponding delivery time of vehicle node does not reach, node keeps monitor channel, while successively by data
Deposit storage queue；
(3) vehicle node calculates the W of itselfCHValue；
3-1) calculate impact factorWherein, ViIt is this
The speed of node itself, VjIt is the speed that the node one jumps other nodes in range, n is the number of the node surrounding vehicles node
Amount；
3-2) calculate node WCH(t)=β W (t)+(1- β) WCH(t-1), wherein β is that regulatory factor is used for adjusting working as
Preceding moment and previous moment impact factor are to calculating WCH(t) weight, and the numerical value being calculated is written in control message
WCH；
(4) after the corresponding delivery time of vehicle node reaches, node is conveyed respectively by controlling message to adjacent node
Respective weight W is conveyed while occupying time slotCH, whether node judges to store has data to send in queue, if there is data
It sends, then enters 5), otherwise enter 7)；
(5) vehicle node judges that the data of storage queue head of the queue need the distance sent, if within the scope of one jumps,
It can be sent directly to correspondingly received node, otherwise entered 6)；
(6) data of vehicle node storage queue head of the queue need to be sent to outside a jump range, then must select forward node
Realize that multi-hop is sent.
6-1) according to the W of each double bounce set interior jointCHValue selects minimum and secondary two small nodes as the double bounce collection
The possible forward node closed, and by RMIt is changed to 1 by initial value 0.And store queue length according to the two node current times
Size, a node for selecting team leader short is as forward node transmission data.
6-2) due to the characteristic of vehicle movement, narrowed down within a jump communication range r when there are two forward node distances,
It needs to merge forward node, i.e., according to respective WCHValue determines unique forward node, WCHIt is worth larger node by RMIt is changed to by 1
0, it indicates not forward data in storage；
Be more than 6-3) double bounce communication range 2r when there is two adjacent forward node distance, that is, occur subregion without turn
Coverage is sent out, the vehicle in the region can select a vehicle node to temporarily become forward node, by once again listening for channel
After determine whether to become formal forward node or merge with other forward node；
(7) node current time storage queue is idle, and no data need to send.Node is according to other nodes of monitor channel
The data of transmission send to decide whether to cooperation.If the node does not listen to the data for needing to forward, node is being worked as
The preceding moment keeps idle.And time counter t=t+1 after delivery time, it returns to 2), otherwise enters 8)；
(8) node current time storage queue is idle, and no data need to send, but listen to forward node and have received
New multi-hop information.The spontaneous cooperation of the node forwards the message, after other nodes, which listen to the message, to be forwarded, choosing
It selects and deletes the message from storage queue, no longer forward.After carving when sending, 2) time counter t=t+1 is returned to；
In conclusion The present invention gives the reasonable selection modes of forward node in vehicle-mounted net, and idle node is allowed to provide
Spontaneous cooperation forwarding service, can effectively promote network stabilization and handling capacity.It is in highway scene as shown in Fig. 4
The simulation result of lower handling capacity is the simulation result of the packet loss under highway scene shown in attached drawing 5.Vehicle self-organizing network
Collaboration communication method is substantially better than traditional time slot reservation mode, effectively reduces packet loss and improves network and totally handles up
Amount.
Claims (1)
1. vehicle self-organizing network forwarder selection and collaboration communication method, which is characterized in that this approach includes the following steps：
(1) initial runtime t=1, the W of each vehicle nodeCH,RMIt is set to 0, each vehicle node WCH(0) it is set to 0；
(2) when the corresponding delivery time of vehicle node does not reach, node keeps monitor channel, while data being sequentially stored into
Store queue；
(3) vehicle node calculates the W of itselfCHValue；
3-1) calculate impact factorWherein, ViIt is the node
The speed of itself, VjIt is the speed that the node one jumps other nodes in range, n is the quantity of the node surrounding vehicles node；
3-2) calculate node WCH(t)=β W (t)+(1- β) WCH(t-1), wherein β is that regulatory factor is used for adjusting current time
With previous moment impact factor to calculating WCH(t) weight, and W in control message is written into the numerical value being calculatedCH；
(4) after the corresponding delivery time of vehicle node reaches, node conveys respectively occupancy by controlling message to adjacent node
Respective weight W is conveyed while time slotCH, whether node judges to store has data to send in queue, if there is data are sent,
Then enter (5), otherwise enters (7)；
(5) vehicle node judges that the data of storage queue head of the queue need the distance that sends, if within the scope of one jumps, it can be with
It is sent directly to correspondingly received node, otherwise enters (6)；
(6) data of vehicle node storage queue head of the queue need to be sent to outside a jump range, then forward node must be selected to realize
Multi-hop is sent；
6-1) according to the W of each double bounce set interior jointCHValue selects minimum and secondary two small nodes as the double bounce set
Possible forward node, and by RMIt is changed to 1 by initial value 0, and queue length size is stored according to the two node current times,
A node for selecting team leader short is as forward node transmission data；
6-2) due to the characteristic of vehicle movement, narrows down within a jump communication range r, need when there are two forward node distances
Merge forward node, i.e., according to respective WCHValue determines unique forward node, WCHIt is worth larger node by RMIt is changed to 0 by 1, table
Show no longer storage forwarding data；
It is more than 6-3) double bounce communication range 2r when there are two adjacent forward node distances, that is, subregion occurs and saved without forwarding
Point covering, the vehicle in the region can select a vehicle node to temporarily become forward node, by once again listening for after channel really
It is fixed whether to become formal forward node or merge with other forward node；
(7) node current time storage queue is idle, and no data need to send；Node is sent according to other nodes of monitor channel
Data come decide whether to cooperation send；If the node does not listen to the data for needing to forward, node is when current
It carves and keeps idle, and time counter t=t+1 after delivery time, return to (2), otherwise enter (8)；
(8) node current time storage queue is idle, and no data need to send, but listen to forward node have received it is new
Multi-hop message；The spontaneous cooperation of the node forwards message, after other nodes, which listen to the multi-hop message, to be forwarded, selection
The multi-hop message is deleted from storage queue, is no longer forwarded；After carving when sending, time counter t=t+1 is returned to
(2)；
Wherein：
WCH：The weighted value of node；
WCH(0)：Node initial weight value；
WCH(t)：Node t moment weighted value；
W(t)：Node t moment impact factor；
RM：Forwarding mark, forwarding are identified as 0 and are not involved in forwarding, participate in forwarding for 1；
Vi：The speed of node itself；
Vj：The node one jumps the speed of other nodes in range；
n：The quantity of the node surrounding vehicles node.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610009407.XA CN105610732B (en) | 2016-01-07 | 2016-01-07 | Vehicle self-organizing network forwarder selection and collaboration communication method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610009407.XA CN105610732B (en) | 2016-01-07 | 2016-01-07 | Vehicle self-organizing network forwarder selection and collaboration communication method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN105610732A CN105610732A (en) | 2016-05-25 |
| CN105610732B true CN105610732B (en) | 2018-09-25 |
Family
ID=55990274
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201610009407.XA Active CN105610732B (en) | 2016-01-07 | 2016-01-07 | Vehicle self-organizing network forwarder selection and collaboration communication method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN105610732B (en) |
Families Citing this family (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106953681B (en) * | 2017-03-15 | 2020-04-07 | 北京航空航天大学 | Inter-satellite network broadcast communication high throughput network coding transmission method |
| CN107295600B (en) * | 2017-07-07 | 2019-08-30 | 北京邮电大学 | A kind of data transmission method in In-vehicle networking |
| CN111917830A (en) * | 2020-07-02 | 2020-11-10 | 南昌工程学院 | Method and system for vehicle communication in Internet of vehicles |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103095592A (en) * | 2013-01-11 | 2013-05-08 | 上海交通大学 | Zone multicast routing system and method of vehicular ad hoc network |
| CN103095593A (en) * | 2013-01-11 | 2013-05-08 | 上海交通大学 | Routing system and method of vehicular ad hoc network |
| CN103974373A (en) * | 2014-05-26 | 2014-08-06 | 北京邮电大学 | Vehicle-mounted network routing method and device |
| CN104580407A (en) * | 2014-12-24 | 2015-04-29 | 南京邮电大学 | VANET (vehicular ad hoc network) time slot reservation method based on game theory |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US7885285B2 (en) * | 2008-09-29 | 2011-02-08 | Toyota Infotechnology Center Co., Ltd. | Probabilistic routing for vehicular ad hoc network |
-
2016
- 2016-01-07 CN CN201610009407.XA patent/CN105610732B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103095592A (en) * | 2013-01-11 | 2013-05-08 | 上海交通大学 | Zone multicast routing system and method of vehicular ad hoc network |
| CN103095593A (en) * | 2013-01-11 | 2013-05-08 | 上海交通大学 | Routing system and method of vehicular ad hoc network |
| CN103974373A (en) * | 2014-05-26 | 2014-08-06 | 北京邮电大学 | Vehicle-mounted network routing method and device |
| CN104580407A (en) * | 2014-12-24 | 2015-04-29 | 南京邮电大学 | VANET (vehicular ad hoc network) time slot reservation method based on game theory |
Also Published As
| Publication number | Publication date |
|---|---|
| CN105610732A (en) | 2016-05-25 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN105722231B (en) | A kind of design method for the vehicle-mounted net MAC protocol of multichannel continuously coordinated | |
| CN100442786C (en) | Tree structure based routing method | |
| CN101409660B (en) | Channel access control method for wireless sensor network | |
| CN104580407B (en) | A kind of vehicle self-organizing network time slot reservation method based on game theory | |
| CN103347290B (en) | A kind of vehicle self-organizing network relay selection method based on game opinion | |
| CN101529756B (en) | Framework to design new MAC message exchange procedure related to mobile station (ms) handover in multi-hop relay broadband wireless access network | |
| CN103078934B (en) | Vehicle-mounted network data distribution method on basis of collaborative optimization sign bit encoding | |
| EP2448331A1 (en) | Centralized path notification in a wireless multi-hop network | |
| Ni et al. | Vehicular beacon broadcast scheduling based on age of information (AoI) | |
| CN1984020A (en) | Method and device for transmitting data | |
| CN103179628B (en) | Based on the method for the clustering routing of wireless sensing net node middleware | |
| CN105263143A (en) | Self-adaptive time slot allocation method according to node density and loads in self-organizing network | |
| CN105610732B (en) | Vehicle self-organizing network forwarder selection and collaboration communication method | |
| Nguyen et al. | MAC protocols with dynamic interval schemes for VANETs | |
| EkbataniFard et al. | A detailed review of multi-channel medium access control protocols for wireless sensor networks | |
| CN109548084A (en) | A kind of efficient multi-hop TDMA cut-in method of the unmanned plane ad hoc network of load balancing | |
| Zhang et al. | EVC-TDMA: An enhanced TDMA based cooperative MAC protocol for vehicular networks | |
| EP1610503B1 (en) | Controlling routing operations in communication networks | |
| CN105554838A (en) | Frequency coordination and allocation method for multichannel multi-hop vehicular ad hoc network | |
| CN105554107B (en) | Optimal cooperation point selection method based on TDMA agreements in high dynamic vehicular ad hoc network network | |
| CN108112046A (en) | A kind of routing scheduling method based on vehicle-mounted internet | |
| Zhang et al. | A tdma based cooperative communication mac protocol for vehicular ad hoc networks | |
| CN100426877C (en) | Method of communication by bimode terminal | |
| CN107483560A (en) | It is a kind of towards the multimode group-net communication of shared electricity consumption and system of selection | |
| Liu et al. | An optimized mobile similarity and link transmission quality routing protocol for urban VANETs |
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 |