CN105978742A - Transmission method for onboard image data - Google Patents

Transmission method for onboard image data Download PDF

Info

Publication number
CN105978742A
CN105978742A CN201610571487.8A CN201610571487A CN105978742A CN 105978742 A CN105978742 A CN 105978742A CN 201610571487 A CN201610571487 A CN 201610571487A CN 105978742 A CN105978742 A CN 105978742A
Authority
CN
China
Prior art keywords
node
route
link
energy consumption
routing
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Pending
Application number
CN201610571487.8A
Other languages
Chinese (zh)
Inventor
谢欣霖
陈波
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Chengdu Zhida Technology Co Ltd
Original Assignee
Chengdu Zhida Technology Co Ltd
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Chengdu Zhida Technology Co Ltd filed Critical Chengdu Zhida Technology Co Ltd
Priority to CN201610571487.8A priority Critical patent/CN105978742A/en
Publication of CN105978742A publication Critical patent/CN105978742A/en
Pending legal-status Critical Current

Links

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L41/00Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
    • H04L41/06Management of faults, events, alarms or notifications
    • H04L41/0654Management of faults, events, alarms or notifications using network fault recovery
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00Routing or path finding of packets in data switching networks
    • H04L45/02Topology update or discovery
    • H04L45/021Ensuring consistency of routing table updates, e.g. by using epoch numbers
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00Routing or path finding of packets in data switching networks
    • H04L45/70Routing based on monitoring results
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00Routing or path finding of packets in data switching networks
    • H04L45/74Address processing for routing
    • H04L45/742Route cache; Operation thereof

Abstract

The present invention provides a transmission method for onboard image data. The method comprises: a node sets a route to a target node by receiving a response; a local repair function is invoked to conduct route interrupt repair; the node sends heartbeat packets to neighbor nodes at regular times, clears interrupted neighbor nodes and clears interrupted routes, detects a routing table at regular times, and clears timed out routing entries in the routing table; an energy consumption threshold and a received signal strength threshold are set for onboard nodes; if a certain node in a link reaches the thresholds, a source node is notified of the risk from the target node, and if no interrupt risk in link exists in a new link, a newly added route is used. The present invention proposes a transmission method for onboard image data, which optimizes media collection and transmission according the characteristics of onboard systems and distribution network communications, thereby improving the overall performance of onboard media transmission.

Description

Vehicle-mounted image data transfer method
Technical field
The present invention relates to car networking, particularly to a kind of vehicle-mounted image data transfer method.
Background technology
Vehicle mounted electric line of force communication network be intelligent transportation realizes vehicle multimedia transmission, remote traffic accident pre- The basis of the application technologies such as police.The application of vehicle mounted electric line of force communication network is the most simply at safety, the car of vehicle The field such as flow management, monitoring, under real road environment, owing to fast running can cause topological structure dynamic Change, simultaneously power line carrier signal be also faced with electromagnetic interference influence cause communication quality reduce even interrupt, The most existing vehicle mounted electric line of force communication network is difficult to the media transmission of stability and high efficiency.
Summary of the invention
For solving the problem existing for above-mentioned prior art, the present invention proposes the transmission of a kind of vehicle-mounted view data Method, including:
Each node is responded by reception, arranges the route of destination node;When a route occurs to interrupt, Route is called local repair function and is carried out route repair;The timing of each node sends heartbeat packet to neighbor node, Remove the neighbor node interrupted and remove the route interrupted, route-caching intervalometer timing detection routing table, and Time remove the route entry of time-out in routing table, realize the vehicle-mounted matchmaker of electrically-based line communication with current routing table Body transmits;
Respectively set energy consumption and the received signal strength threshold value of vehicle-mounted node;If certain node in link Reach threshold value, sent notice from destination node to opposite direction, risk is notified source node, such as new link Do not deposit disruption risk in a link, then use the route being newly added;
The most internodal signal receiving strength is calculated as:
G=PcHcHrlclr/s3k
The signal intensity that its interior joint receives is g;PcFor signal transmission power;HcChain for sending node Road gain;HrLink gain for receiving node;lcFor sending the length of link;lrLong for receiving node link Degree, s is the spacing between two nodes;K is loss coefficient;
Size g of signal intensity judgment thresholdtIt is defined as:
gt=gn×t+g
T represents the time delay that cannot receive signal, gnIllustrate the node energy consumption when two adjacent signal receive Successively decrease;
By controlling threshold range, when less than certain scope, select search new routing link and safeguard new Routing link table;
The energy consumption calculation of its interior joint is:
Ut=(R × t)+U
U is the energy consumption maintaining basic communication;R is node energy consumption power;T is that energy consumption uses up the time, if passing through Time be ts, DtRepresent t node energy consumption situation, then energy consumption power R can be expressed as R=(D(t-ts)-Dt) /ts
By controlling UtThe threshold value of energy consumption avoids routing link to interrupt.
The present invention compared to existing technology, has the advantage that
The present invention proposes a kind of vehicle-mounted image data transfer method, the spy communicated according to onboard system with distribution Point, is optimized acquisition of media and transmission, improves the overall performance of vehicle-mounted media transmission.
Accompanying drawing explanation
Fig. 1 is the flow chart of vehicle-mounted image data transfer method according to embodiments of the present invention.
Detailed description of the invention
Hereafter provide one or more embodiment of the present invention together with the accompanying drawing of the diagram principle of the invention is detailed Thin description.Describe the present invention in conjunction with such embodiment, but the invention is not restricted to any embodiment.This Bright scope is limited only by the appended claims, and the present invention contains many replacements, amendment and equivalent.? Middle elaboration many detail is described below to provide thorough understanding of the present invention.For exemplary purposes And these details are provided, and can also be according to right without some in these details or all details Claim realizes the present invention.
An aspect of of the present present invention provides a kind of vehicle-mounted image data transfer method.Fig. 1 is real according to the present invention Execute the vehicle-mounted image data transfer method flow chart of example.
Vehicle node has router and main frame dual identity, has operation as main frame and applies kimonos accordingly The function of business;As router, have and safeguard routing table, determine the function of Route Selection.At vehicle power Line communication network environment lower node has random movement, self-organizing, provisional feature, the therefore present invention couple Power line communication network agreement is optimized.
The physical layer of vehicle mounted electric line of force communication network be responsible for the selection of frequency, the detection of carrier signal, modulation with Demodulation, signal send and receive.Vehicle-mounted node uses based on OFDM agreement, arranges 64 secondary loads Ripple, the channel of a width of 20MHz of each band is made up of 52 subcarriers in 64 subcarriers.Wherein 4 Subcarrier is as pilot tone, and to monitor frequency offset and phase bias, remaining 48 subcarrier is then for transmitting Data.The header file of each physical layer data bag includes short sequence symbol and long sequence symbol, is used for doing signal Detecting, frequency offset estimation, time synchronized and channel judge.Before being adjusted to carrier wave, information bit is used Interlacing scan encodes.In order to carry out larger range of communication in the automotive environment, define the highest effectively etc. It is 44dBm to radiant power, allows automobile process emergency to greatest extent.Network layer protocol monitoring network The change of topological structure;Exchange routing iinformation;The position of the node determined;Produce, safeguard and cancel road By;Select route and forward data.Routing Protocol includes route requests, route response and route maintenance.Association View relies on four bags to realize: routing request packet, route response bag, and route interrupts bag and heartbeat packet.At net In the case of network resource is sufficient, Routing Protocol safeguards route by periodic broadcasting heartbeat packet, once finds certain One link disconnects, and node just sends erroneous packets notice, and because link disconnects, inaccessible knot removal is corresponding Record or already present route is repaired.When source node sends packet to destination node, first Find the route table items of destination node in the routing table, if it is found, be then transmitted by this route;No Then, structure routing request packet carries out broadcasting the route searching out destination node.Other node is receiving route After request bag, first determine whether oneself to be destination node;Secondly, search oneself routing table whether have to The route entry of destination node, if had, sends respond packet to neighbor node, without then continuing to forward route requests Bag.Each routing request packet arranges a max-forwards number of times, does not still have when exceeding this max-forwards number of times There is the route finding destination node, then abandon this bag.When a node receives routing request packet, find certainly When oneself is to have the route to this destination node in destination node or the routing table of oneself, then send respond packet. Notice upstream node finds the route towards destination node.When node receives respond packet, initially set up The route of destination node;Secondly, check whether oneself is source node, if then stopping forwarding response, otherwise Continue transmitted response.When a route is interrupted, first start local routing reparation, if can not repair, then Send route response bag to relevant node, notify that this route is interrupted.The timing of route-caching timer is by time-out Route entry delete from routing table.Additionally, neighbor node timer also can the detection of fixed time broadcast heartbeat packet The connectivity of neighbor node, removes the route interrupted.
Transport layer, for providing reliable end-to-end service to application layer, makes upper strata be isolated with communication subnet, And use udp protocol to utilize Internet resources according to the characteristic of Internet.Application layer offer is user oriented respectively Plant application service, including the transmission service of media data.
The handling process sending routing request packet is as follows:
First check whether local routing has to Target Link, if local routing table has to target circuit and Can use, then be disposed;When arriving the time sending routing request packet, detection search routing times Whether have arrived at number of times to limit, the most do not search destination node if reaching to limit, then delete packet, It is disposed;If sending routing request packet for the first time, arranging searching threshold is initial value.If not Once send broadcast packet, then expand the broadcasting area of bag;If arriving the search threshold sent when bag number of times limits Value, still little than the searching threshold arranged, then increase searching threshold.Contrary, if sent out for the last time Also have remaining searching threshold when sending bag, then increase packet broadcast radius.
The when that upper-layer protocol having data to send, packet receiving function is called by system, in the interpolation of this packet IP header, then carries out routing resolution.Adding a route to destination node in the routing table, keeping in should Packet, then sends request bag, sends routing request packet and searches out the route of destination node.Now in source The routing table of node is set up a route from source node to destination node.
When node receives routing request packet, first determine whether whether this routing request packet is that oneself sends, if It is to abandon this routing request packet and terminate to process.Followed by setting up reversely route.Search in routing table and be No have the route to source node, if not having, then adds a route.Then, it is judged that to the route of source node The need of renewal.After having updated source node route, sending the packet arriving source node in caching all Send.Thus establish reverse route.Then, it is judged that whether this node is destination node.If It is then to send respond packet and carry out route response.Otherwise, search in routing table whether have the road to destination node By.If having, sending respond packet and carrying out route response (arriving destination node through available).If the most do not looked for To the route of destination node, then this routing request packet is broadcasted, continually looks for route.
The foundation of forward direction route, sets up during receiving respond packet.When node receives sound When should wrap, first look for whether routing table has the route to destination node.If no, then setting up target The route of node.Then, it is judged that to the route of destination node the need of renewal.After having updated route, sentence Whether this node disconnected is source node, just arranges corresponding entry if being.If this node has mesh to be sent to The packet of mark node, then perform transmission.If route does not update, then abandon this response, thus reduce number According to transmission.If this routing update but this node is not destination node; whether search routing table have and to save to source The route of point, if having, forwards this response, otherwise, abandons this response and terminates to process.Each node passes through Receive response, the route of destination node is set to, has thus set up forward direction route.
The maintenance of routing table is made up of three parts: local reparation, heartbeat packet, route-caching intervalometer.When one The when that bar route occurring to interrupt, if it occur that the nodal distance destination node interrupted is closer, route is called Local repair function, carries out route repair.The timing of each node sends heartbeat packet to neighbor node, comes with this The connectivity of detection neighbor node, removes the neighbor node interrupted in time, thus removes the route of interruption in time. Route-caching intervalometer can timing detection routing table, the in time route entry of time-out in removing routing table.Pass through These three function guarantees it is up-to-date route in routing table.
When in link, certain node relative velocity signal intensity that is excessive or that receive is too low, this circuit Just there is the risk of interruption, in order to avoid the link of high power consumption and high latency, have employed method below: respectively Threshold value is set for the energy consumption of node and the received signal strength of node.If certain node in link reaches Threshold value, sends notice from destination node to opposite direction, and notice source node has the risk causing link down, root Whether disruption risk is had, by every from this node to this section of link of destination node according to node maintenance each in link Whether the sending node of link section is it may determine that have disruption risk from this node to this section of link of destination node. As new link does not deposit risk in a link, then use the route being newly added, otherwise use original route.
Disruption risk often occurs it is necessary to it is carried out a suboptimization process so that communication process route Gradually become the route lines that disruption risk is minimum.Optimize Routing Protocol time consider signals below receiving intensity and The impact on Route Selection of the node energy consumption parameter:
Internodal signal receiving strength can be calculated as follows, and the signal intensity that its interior joint receives is g; PcFor signal transmission power;HcLink gain for sending node;HrLink gain for receiving node;lc For sending the length of link;lrFor receiving node linkage length, s is the spacing between two nodes;K is for damaging Lose coefficient.
G=PcHcHrlclr/s3k
Size g of signal intensity judgment thresholdtIt is defined as:
gt=gn×t+g
T represents the time delay that cannot receive signal, gnIllustrate the node energy consumption when two adjacent signal receive Successively decrease;By controlling threshold range, when less than certain scope, select search new routing link and safeguard New routing link table.
Additionally, carry out range set according to the energy consumption of each node, in following equation, U is to remain basic The energy consumption of communication;R is node energy consumption power;T is that energy consumption uses up the time, node total energy consumption Ut=(R × t)+U
Assume that elapsed time is ts, DtRepresent t node energy consumption situation, then energy consumption power R can be with table It is shown as R=(D(t-ts)-Dt)/ts
Have only to control UtThe threshold value of energy consumption, is the most just avoided that the risk that routing link interrupts.
In the acquisition of media stage, it is first turned on media device file, reads photographic head in structure, image Essential information, arranges the information parameter of acquisition of media.The media formats of capture, resolution, frame rate are set; Control management media device I/O passage, carry out inquiring about and arrange media device attribute;Media-driven interface passes through Internal memory mapping mode, by application to address, kernel buffers be mapped to user's space, define an input Queue and an output queue.The former is to wait for receiving the queue of storage media data, and the latter is to have been placed in The queue of media data.Acquisition of media application program by application to relief area be put into successively input rank row Team, then starts acquisition of media, each frame media data gathered sequentially is put into the relief area of input rank In.The relief area storing media data is moved to output queue by driver successively, waits application program Take out relief area and process media data therein.After having processed data, this relief area is placed again into Input rank is queued up.The frame buffer zone just processed is placed again into Gather and input queue tail.
The edge direction of image block is done pretreatment by existing method, calculates complexity, is not suitable for terminal high definition The real-time Transmission of media;And code check change is huge, the bandwidth of power line channel is proposed challenge.The present invention A kind of interframe compression transmission method being applicable to vehicle-mounted media is proposed, based on inter mode decision algorithm and adopt Spend gently with image and judge.
The original pixel value of input macro block and macro block position information to be predicted, first carry out horizontal pattern and vertical mould Formula is predicted, calculates the predictive value under both patterns respectively, then subtracts each other with original pixel value and obtain each pattern Under residual sum cost value, compare and obtain the pattern of minimum cost value and be optimum prediction mode.To pass through again Optimal mode adjudicates the optimal mode and optimal cost value input selector drawn, carries out the right side according to optimal mode Vertical mode, lower horizontal pattern, left vertical mode and the prediction of upper horizontal pattern, the more optimal mould that will obtain Formula and the next selector of optimal cost value input carry out the judgement of optimal mode;Through judging step by step, obtain Final predictive mode and optimal cost value;After prediction terminates, output optimal mode and cost value, and export Good residual error.Output residual error carries out dct transform, quantifies, then carries out inverse process, and both inverse quantization and IDCT became Changing, output valve adds best predictor, completes the reconstruct of macro block.Wherein, through DCT quantify after the most residual Difference data is transported to the transmission of NAL layer after carrying out entropy code again.
In inter predication process, by under vertical coordinate identical in computing macro block, it is separated by two pictures of abscissa The absolute value of element gray scale difference judges that this macro block is the mildest, and i.e. 16 × 16 macro blocks are spent T gently and are defined as
T=∑ | (x+2, y)+(x+3, y)-(x, y)-(x+1, y) |
x∈[1,12] y∈[1,15]
Two threshold T are set1And T2As the basis for estimation that macro block is mild, spend gently in advance according to image Judge interframe prediction block sizes, so that it is determined that use 16 × 16 or 8 × 8 pieces to carry out inter prediction;If T < T1, use 16 × 16 to carry out inter prediction, if T is > T2, use 8 × 8 pieces and carry out inter prediction, its In the case of him, use 16 × 16 and 8 × 8 pieces to carry out inter prediction simultaneously;
Carrying out inter prediction for 8 × 8 macro blocks, utilizing procedure below to skip can not become optimal 8 × 8 Predictive mode, the amount of calculation of minimizing coding:
The minimum RDO cost of obtaining mode 0 and 1, continues search for its neighboring modes, calculates respective RDO cost, then carries out the comparison of neighboring modes.Use and press with left reference pixel above current macro Lower-left is to the interpolation of upper right as predictive value, and wherein left and top neighbor pixel are respectively as follows:
H = Σ x = 0 7 ( x + 1 ) ( p ( 8 + x , - 1 ) - p ( 6 - x , - 1 ) )
V = Σ x = 0 7 ( y + 1 ) ( p ( - 1 , 8 + y ) - p ( - 1 , 8 - y ) )
Acquisition predicts the outcome:
Pre (x, y)=((5 × H) (i-7)+(5 × V) (j-7))/64+16 wherein i, j ∈ [0,15]
In sum, the present invention proposes a kind of vehicle-mounted image data transfer method, according to onboard system and joining The feature of Network Communication, is optimized acquisition of media and transmission, improves the overall performance of vehicle-mounted media transmission.
Obviously, it should be appreciated by those skilled in the art, each module or each step of the above-mentioned present invention are permissible Realizing by general calculating system, they can concentrate in single calculating system, or is distributed in many On the network that individual calculating system is formed, alternatively, they can use the executable program code of calculating system Realize, it is thus possible to be stored in storage system being performed by calculating system.So, this Bright be not restricted to any specific hardware and software combine.
It should be appreciated that the above-mentioned detailed description of the invention of the present invention is used only for exemplary illustration or explains this The principle of invention, and be not construed as limiting the invention.Therefore, without departing from the spirit and scope of the present invention In the case of any modification, equivalent substitution and improvement etc. done, should be included in protection scope of the present invention Within.Additionally, claims of the present invention be intended to fall into scope and border or Whole in the equivalents on this scope of person and border change and modifications example.

Claims (1)

1. a vehicle-mounted image data transfer method, it is characterised in that including:
Each node is responded by reception, arranges the route of destination node;When a route occurs to interrupt, Route is called local repair function and is carried out route repair;The timing of each node sends heartbeat packet to neighbor node, Remove the neighbor node interrupted and remove the route interrupted, route-caching intervalometer timing detection routing table, and Time remove the route entry of time-out in routing table, realize the vehicle-mounted matchmaker of electrically-based line communication with current routing table Body transmits;
Respectively set energy consumption and the received signal strength threshold value of vehicle-mounted node;If certain node in link Reach threshold value, sent notice from destination node to opposite direction, risk is notified source node, such as new link Do not deposit disruption risk in a link, then use the route being newly added;
The most internodal signal receiving strength is calculated as:
G=PcHcHrlclr/s3k
The signal intensity that its interior joint receives is g;PcFor signal transmission power;HcChain for sending node Road gain;HrLink gain for receiving node;lcFor sending the length of link;lrLong for receiving node link Degree, s is the spacing between two nodes;K is loss coefficient;
Size g of signal intensity judgment thresholdtIt is defined as:
gt=gn×t+g
T represents the time delay that cannot receive signal, gnIllustrate the node energy consumption when two adjacent signal receive Successively decrease;
By controlling threshold range, when less than certain scope, select search new routing link and safeguard new Routing link table;
The energy consumption calculation of its interior joint is:
Ut=(R × t)+U
U is the energy consumption maintaining basic communication;R is node energy consumption power;T is that energy consumption uses up the time, if passing through Time be ts, DtRepresent t node energy consumption situation, then energy consumption power R can be expressed as R=(D(t-ts)-Dt) /ts
By controlling UtThe threshold value of energy consumption avoids routing link to interrupt.
CN201610571487.8A 2016-07-19 2016-07-19 Transmission method for onboard image data Pending CN105978742A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201610571487.8A CN105978742A (en) 2016-07-19 2016-07-19 Transmission method for onboard image data

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201610571487.8A CN105978742A (en) 2016-07-19 2016-07-19 Transmission method for onboard image data

Publications (1)

Publication Number Publication Date
CN105978742A true CN105978742A (en) 2016-09-28

Family

ID=56951770

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201610571487.8A Pending CN105978742A (en) 2016-07-19 2016-07-19 Transmission method for onboard image data

Country Status (1)

Country Link
CN (1) CN105978742A (en)

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP1326388A2 (en) * 2002-01-05 2003-07-09 Lg Electronics Inc. System and method for avoiding stall using timer for high-speed downlink packet access system
CN1663149A (en) * 2002-06-27 2005-08-31 高通股份有限公司 Method and apparatus for forward link gain control in a power controlled repeater
CN104936169A (en) * 2014-03-18 2015-09-23 中国移动通信集团公司 Safety verification processing method, device, terminal and base station thereof
CN105007607A (en) * 2014-04-24 2015-10-28 中国电信股份有限公司 Method and system for route advertisement

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP1326388A2 (en) * 2002-01-05 2003-07-09 Lg Electronics Inc. System and method for avoiding stall using timer for high-speed downlink packet access system
CN1663149A (en) * 2002-06-27 2005-08-31 高通股份有限公司 Method and apparatus for forward link gain control in a power controlled repeater
CN104936169A (en) * 2014-03-18 2015-09-23 中国移动通信集团公司 Safety verification processing method, device, terminal and base station thereof
CN105007607A (en) * 2014-04-24 2015-10-28 中国电信股份有限公司 Method and system for route advertisement

Non-Patent Citations (3)

* Cited by examiner, † Cited by third party
Title
牟强 等: "基于AODV的节能优化路由算法", 《计算机工程与设计》 *
荆瑞霞: "一种路由断裂预测处理的改进AODV协议研究", 《中国优秀硕士学位论文全文数据库 信息科技辑》 *
闫晓春: "ZigBee 的Mesh网络路由协议的设计", 《中国优秀硕士学位论文全文数据库 信息科技辑》 *

Similar Documents

Publication Publication Date Title
EP1698117B1 (en) Method and system for efficient routing in ad hoc networks
US10827410B2 (en) System, apparatus and method for robust transmission of visual data through visual sensor network
US10645609B2 (en) Method and apparatus for transmitting TCP ACK in communication system
CN101917752B (en) Convergent routing method of wireless sensor network based on Pareto optimum paths
Masdari et al. Fuzzy logic-based sink selection and load balancing in multi-sink wireless sensor networks
Pang et al. A smart network resource management system for high mobility edge computing in 5G internet of vehicles
CN112188495B (en) Cache pollution attack detection method based on federal learning in ultra-dense network
CN107707476A (en) Efficient wireless relay device and method based on FPGA
Trullols-Cruces et al. A cooperative vehicular network framework
CN104980354B (en) Data transmission processing method and device
CN100496023C (en) Method for transmitting link-state information
CN106130604A (en) Mobile unit power line communication method
CN106131556A (en) Mobile unit image signal transmission method
CN105978742A (en) Transmission method for onboard image data
CN106534367B (en) Based on user QoE, maximumlly vehicle-mounted cloud video data transmission scheme determines method
CN115243226A (en) Self-adaptive link monitoring system of software defined vehicle network
Zhang et al. A cooperation-driven ICN-based caching scheme for mobile content chunk delivery at RAN
CN105263122B (en) A kind of radio transmission optimization method based on RS coding
CN101155125B (en) Method for processing congestion
CN106454940A (en) Load balancing method in wireless mesh network
CN106452545A (en) High-efficiency multicast transmission method of wireless mesh network
Zhao et al. Long short-term memory-based hybrid V2V/V2I transmission latency method
CN104869606B (en) A kind of message forwarding method and device
Wang et al. A traffic flow phase adaptive routing for vehicular communication on highways
Zhang Based on Fuzzy Measure Algorithm Message Adaptive Rate Algorithm of Internet of Things

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
RJ01 Rejection of invention patent application after publication

Application publication date: 20160928

RJ01 Rejection of invention patent application after publication