CN107809662B - A kind of scalable video transmission method and device based on heterogeneous wireless ad hoc network - Google Patents

A kind of scalable video transmission method and device based on heterogeneous wireless ad hoc network Download PDF

Info

Publication number
CN107809662B
CN107809662B CN201711078364.1A CN201711078364A CN107809662B CN 107809662 B CN107809662 B CN 107809662B CN 201711078364 A CN201711078364 A CN 201711078364A CN 107809662 B CN107809662 B CN 107809662B
Authority
CN
China
Prior art keywords
video
node
quality information
path
link quality
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
Application number
CN201711078364.1A
Other languages
Chinese (zh)
Other versions
CN107809662A (en
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.)
Shaanxi Normal University
Original Assignee
Shaanxi Normal University
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 Shaanxi Normal University filed Critical Shaanxi Normal University
Priority to CN201711078364.1A priority Critical patent/CN107809662B/en
Publication of CN107809662A publication Critical patent/CN107809662A/en
Application granted granted Critical
Publication of CN107809662B publication Critical patent/CN107809662B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N21/00—Selective content distribution, e.g. interactive television or video on demand [VOD]
    • H04N21/40—Client devices specifically adapted for the reception of or interaction with content, e.g. set-top-box [STB]; Operations thereof
    • H04N21/43—Processing of content or additional data, e.g. demultiplexing additional data from a digital video stream; Elementary client operations, e.g. monitoring of home network or synchronising decoder's clock; Client middleware
    • H04N21/436—Interfacing a local distribution network, e.g. communicating with another STB or one or more peripheral devices inside the home
    • H04N21/4363—Adapting the video stream to a specific local network, e.g. a Bluetooth® network
    • H04N21/43637—Adapting the video stream to a specific local network, e.g. a Bluetooth® network involving a wireless protocol, e.g. Bluetooth, RF or wireless LAN [IEEE 802.11]
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N21/00—Selective content distribution, e.g. interactive television or video on demand [VOD]
    • H04N21/40—Client devices specifically adapted for the reception of or interaction with content, e.g. set-top-box [STB]; Operations thereof
    • H04N21/43—Processing of content or additional data, e.g. demultiplexing additional data from a digital video stream; Elementary client operations, e.g. monitoring of home network or synchronising decoder's clock; Client middleware
    • H04N21/44—Processing of video elementary streams, e.g. splicing a video clip retrieved from local storage with an incoming video stream or rendering scenes according to encoded video stream scene graphs
    • H04N21/4402—Processing of video elementary streams, e.g. splicing a video clip retrieved from local storage with an incoming video stream or rendering scenes according to encoded video stream scene graphs involving reformatting operations of video signals for household redistribution, storage or real-time display
    • H04N21/440227—Processing of video elementary streams, e.g. splicing a video clip retrieved from local storage with an incoming video stream or rendering scenes according to encoded video stream scene graphs involving reformatting operations of video signals for household redistribution, storage or real-time display by decomposing into layers, e.g. base layer and one or more enhancement layers
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N21/00—Selective content distribution, e.g. interactive television or video on demand [VOD]
    • H04N21/40—Client devices specifically adapted for the reception of or interaction with content, e.g. set-top-box [STB]; Operations thereof
    • H04N21/43—Processing of content or additional data, e.g. demultiplexing additional data from a digital video stream; Elementary client operations, e.g. monitoring of home network or synchronising decoder's clock; Client middleware
    • H04N21/44—Processing of video elementary streams, e.g. splicing a video clip retrieved from local storage with an incoming video stream or rendering scenes according to encoded video stream scene graphs
    • H04N21/4402—Processing of video elementary streams, e.g. splicing a video clip retrieved from local storage with an incoming video stream or rendering scenes according to encoded video stream scene graphs involving reformatting operations of video signals for household redistribution, storage or real-time display
    • H04N21/440236—Processing of video elementary streams, e.g. splicing a video clip retrieved from local storage with an incoming video stream or rendering scenes according to encoded video stream scene graphs involving reformatting operations of video signals for household redistribution, storage or real-time display by media transcoding, e.g. video is transformed into a slideshow of still pictures, audio is converted into text
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N21/00—Selective content distribution, e.g. interactive television or video on demand [VOD]
    • H04N21/40—Client devices specifically adapted for the reception of or interaction with content, e.g. set-top-box [STB]; Operations thereof
    • H04N21/43—Processing of content or additional data, e.g. demultiplexing additional data from a digital video stream; Elementary client operations, e.g. monitoring of home network or synchronising decoder's clock; Client middleware
    • H04N21/442—Monitoring of processes or resources, e.g. detecting the failure of a recording device, monitoring the downstream bandwidth, the number of times a movie has been viewed, the storage space available from the internal hard disk
    • H04N21/44227—Monitoring of local network, e.g. connection or bandwidth variations; Detecting new devices in the local network
    • 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/12—Communication route or path selection, e.g. power-based or shortest path routing based on transmission quality or channel quality
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W40/00—Communication routing or communication path finding
    • H04W40/24—Connectivity information management, e.g. connectivity discovery or connectivity update
    • 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)
  • Signal Processing (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Multimedia (AREA)
  • Databases & Information Systems (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

The present invention relates to a kind of scalable video transmission method and device based on heterogeneous wireless ad hoc network, which comprises self-organizing network nodes real-time detection collection network environmental information and Unified Characterization are link quality information in network；Originator is found to a plurality of transmission path of receiving end according to link quality information；In conjunction with pathfinding result and link state, originator carries out gradable video encoding；Video selection respective paths after coding are transmitted to terminal.The present invention is directed to multi-hop wireless network environment, using closed loop Multipath Transmission strategy by receiving end video reception situation and transmission state Real-time Feedback to originator, so that originator adaptively can be and guided gradable video encoding by adjusts path selection mode, pass through the disparate modules being equipped with using scalable video transmission device, efficiently solve the problems, such as that transmission of video is insecure in multi-hop wireless network, reaching makes base layer videos have higher robustness, enhancement-layer video has the characteristics that high throughput, and video transmission quality is effectively ensured.

Description

A kind of scalable video transmission method and device based on heterogeneous wireless ad hoc network
Technical field
The invention belongs to wireless video transmission technical fields, and in particular to it is a kind of based on heterogeneous wireless ad hoc network can Scalable video transmission method and device.
Background technique
Wireless Heterogeneous Networks environment is the network environment collectively constituted by networks connect each other, various types of, it It is made of a variety of different communication links, networking mode and communication protocol, the network of various isomeries is merged, is made full use of The advantage of various Internet resources provides reliable, efficient, convenient and fast network service for user.Due to the isomery of heterogeneous network itself, The mobility of otherness and communication node between independent, changeable and network determines the isomerism of communication network environment and answers Polygamy.Live video communication is carried out in a network, and the quality of video will necessarily be influenced by link-quality.
Secondly because in video frame, all there is bulk informations for interframe, during video compress, wrapped in each GOP I frame, P frame, the different types of frame of B frame are contained, caused error diffusion occurs when error code for I, P, B frame to the shadow of video reconstruction quality It rings also different.Therefore, I frame need to be given more to protect, reduces the bit error rate of I frame, acquisition P frame and B frame as much as possible.
Chinese patent open file CN201610371308.6 " a kind of scalable video transmission method, apparatus and system ", The disclosure of the invention is a kind of according to receiving client hardware configuration information and real-time network speed carries out hardware grade division, it is adaptive really The video data for determining corresponding level under video level, successfully manages heterogeneous client and changes and still ensure that preferable video matter Amount.The disadvantages are as follows: only setting about not considering more to divide the grade of video from the hardware configuration of client and real-time network speed Influence the network environmental factors of transmission of video；In terms of transmission of video route selection, do not consider network path selection and it is a plurality of can Up between path the problems such as common transport；In terms of gradable video encoding, more detailed graduated encoding plan is not provided yet Slightly.Meanwhile in video transmission manner, most articles are equally all based on node and node one in this article and existing technology The transmission of video between range is jumped, does not emphasize that multi-hop wireless network transmits the influence to video performance.
Currently, multipath routing policy is considered as that a kind of efficiently solution network topology is unstable, and information real-time Transmission is reliable How the available strategy of the low problem of property, efficiently routed using multipath to solve gradable video-transmission problems and become video The focus on research direction of transmission.In addition to this, channel information and receiving end reception condition can be fed back using closed-loop transmission techniques To transmitting terminal, the adverse effect being effectively shielded from wireless channel brings gain to transmission performance.Therefore need to invent a kind of needle To the closed loop Multipath Transmission system of multi-hop wireless network environment, transmitting terminal utilizes the reception condition and transmission process of receiving end feedback Network state between interior joint and node selects transmission path, and completes the adaptive of transmitting terminal video and divide Grade coding, the reliability of transmission of video is ensured with this, improves video quality.
Summary of the invention
In order to solve the above-mentioned problems in the prior art, the present invention provides one kind to be based on heterogeneous wireless ad hoc net The scalable video transmission method and device of network.The technical problem to be solved in the present invention is achieved through the following technical solutions: a kind of Scalable video transmission method based on heterogeneous wireless ad hoc network, comprising the following steps:
Step S10, self-organizing network nodes find the wireless network in its position for access, and detecting periodically in real time Link quality information between node and node carries out Unified Characterization to link quality information according to different criterion；
Step S20, according to the characterization result of the step S10 link quality information, in conjunction with opposite with video traffic feature The different pathfinding criterion answered find out originator to n (n >=1) reachable path between terminal；N indicates natural number；
Step S30, the number of passes of the originator found out according to the step S20 to terminal, in conjunction with different link states, Video traffic is subjected to corresponding gradable video encoding；
Step S40, the video after coding select different transmission paths to end respectively according to corresponding routing criterion End；Then video after judging the coding whether end of transmission, otherwise the return step S20 if not finishing terminates this Transmission.
Further, the specific side of Unified Characterization is carried out in the step S10 to link quality information according to different criterion Method are as follows: obtain arbitrary two link quality information q between node i and j in the wireless network according to multiple judgement factorsij's Expression formula:
Wherein, i and j indicates arbitrary two self-organizing network nodes in network, enables if i and j each other non-conterminous node qijFor infinity；
K indicates to constitute the judgement factor of link quality information；
Indicate that the link quality information when node i and j are adjacent node adjudicates the weight of factor k；
Indicate that the link quality information when node i and j are adjacent node adjudicates the attribute value of factor k；
fijIt indicatesWithFor link quality information q between adjacent node i and jijThe Function Mapping of utilization variance is closed System；
The weightSize indicate judgement factor k to the influence degree of link quality information；
The judgement factor k includes different network environment status information.
Further, the specific steps of the step S20 are as follows:
Step S21, according to link quality information qijCharacterization result, respectively obtain two heterogeneous networks connected relation matrixes D=(dij)m×m, Q=(qij)m×m,
Wherein, m indicates the number of self-organizing network nodes in the wireless network；
dijIndicate the weight packet loss information in the wireless network between arbitrary two self-organizing network nodes i and j, if Node i and j neighbor node each other, then dijWeight packet loss for i, between j adjacent node；If node i and j are non-conterminous, Enable dij=∞；
qijThe link quality information in representation formula (1), if node i and j neighbor node each other, qijFor i, j Link quality information between adjacent node；If node i and j are non-conterminous, q is enabledij=∞；
Step S22, according to network topological diagram and step S21 network-in-dialing relational matrix D=obtained (dij)m×m, establish a figure G1, scheme G1It is by a vertex set V (G1), a side collection E (G1) and weight relationship constitute Triple, weight relationship therein makes each side associated with two vertex, and the two vertex are known as this edge Endpoint；
If to any vertex i, j ∈ V (G1) all there is a line ij, then the weight of side ij is denoted as w (ij), wherein w (ij)=dij, dijFor the weight packet loss of vertex i to vertex j；If ij is not a line, then w (ij)=∞ is remembered；
Step S23, in figure G1In, using Dijkstra's algorithm, the packet loss of calculating source point to point of destination is the smallest can By path
WhereinIndicate the smallest trusted path of the packet lossSource point to point of destination equivalent packet loss；
Step S24, according to network topological diagram and according to step S21 network-in-dialing relational matrix Q=obtained (qij)m×m, establish a figure G2, scheme G2It is by a vertex set V (G2), a side collection E (G2) and weight relationship constitute Triple, weight relationship therein makes each side associated with two vertex, and the two vertex are known as this edge Endpoint；
If to any vertex i, j ∈ V (G2) all there is a line ij, then the weight of side ij is denoted as u (ij), wherein u (ij)=qij, qijFor vertex i to the link quality information of vertex j；If ij is not a line, then u (ij)=∞ is remembered；
Step S25, the smallest trusted path of the packet loss that the step S23 is found outPass through it is all in Node collection Y is added in intermediate node, then in figure G2Vertex set V (G2) in the element deleted in the set Y obtain vertex set V (G21), while according to vertex set V (G21) update the collection E (G when obtaining21), G21Indicate obtained new figure；
Step S26, in figure G21In, using Dijkstra's algorithm, the link quality information for calculating source point to point of destination is total With the smallest path rα(ψα),(1≤α≤n-1)；
Wherein rα(ψα), (1≤α≤n-1) is the ascending arrangement of link quality information summation according to source point to point of destination Path, ψαIndicate path rα(ψα) source point to point of destination link quality information summation；α indicates natural number；
Step S27 enumerates the path r that the step S26 is found outα(ψα), (1≤α≤n-1) passes through all Intermediate node is added to node collection Y', then in figure G21Vertex set V (G21) in delete set Y' in element, obtain new Vertex set；According to new vertex set, side is updated, updated figure is obtained, the step S26 is returned to, until the chain in looked for path Road quality information summation is greater than the predetermined threshold value h of link quality information summationmaxOr when finding without new route, algorithm terminates.
Further, the specific steps of the step S30 are as follows: to video frame as unit of GOP by comprising data frame Bit stream is divided, the video of layer based on encoding to the video frame of accounting γ in each GOP, by accounting in GOP Video of the video frame of 1- γ as enhancement layer；Wherein, in enhancement-layer video, accounting λ in GOP is chosen1Video frame conduct The video of enhancement layer 1 chooses accounting λ in GOP2Video of the video frame as enhancement layer 2, and so on, choose accounting in GOP λn-1Video of the video frame as enhancement layer n-1, the pass of base layer videos frame accounting γ and enhancement layer α distribution video frame accounting It is λαAre as follows:
λα=fα(ψ1,ψ2,ψα……ψn-1,γ) (3)
Wherein, ψαIndicate path rα(ψα) source point to point of destination link quality information summation；fαIndicate path rα(ψα) Link quality information summation ψαWith the accounting λ of the distributed video frame of enhancement layer ααFunction Mapping relationship.
Further, the specific steps of the step S40 are as follows: lost described in the video data stream use for the basal layer The smallest trusted path of packet rateIt is transmitted；It is optimal for the video data stream selection link-quality of the enhancement layer 1 Path r1(ψ1) transmitted；For the path r of the video data stream selection link-quality suboptimum of the enhancement layer 22(ψ2) carry out Transmission, and so on, for the path r of the video data stream selection link-quality suboptimum of the enhancement layer n-1n-1(ψn-1) carry out Transmission, it is ensured that the video data stream of all enhancement layers is all in corresponding path transmission；Then judge the basal layer and increasing The video data stream of strong layer whether end of transmission, the step S21 is returned if not finishing, otherwise terminates this transmission.
A kind of scalable video transmitting device based on heterogeneous wireless ad hoc network, comprising:
Heterogeneous network accesses network interface card, finds the wireless network in its position for access in real time for self-organizing network nodes Network；
Link-quality detecting module, for the link quality information between detecting periodically node and node；
Link-quality Unified Characterization module, for carrying out Unified Characterization to link quality information according to different criterion；
Multipath finds module, the characterization knot of the link quality information for obtaining according to link-quality Unified Characterization module Fruit finds out originator to n (n >=1) item between terminal up to road in conjunction with different pathfinding criterion corresponding from video traffic feature Diameter；N indicates natural number；
Gradable video encoding module, for finding the path item of the originator found out of module to terminal according to multipath Number, in conjunction with different link states, carries out corresponding gradable video encoding for video traffic；
Video transmission module, for by the video after gradable video encoding module coding according to corresponding routing criterion, Select different transmission paths to terminal respectively；
Transmission of video adaptively adjusts module, for judge the video after the coding whether end of transmission, if not complete Bi Ze returns to multipath searching module and is handled, and otherwise terminates this transmission.
Further, the link-quality Unified Characterization module includes computational submodule, for according to multiple judgement factors Arbitrary two link quality information q between node i and j in the wireless network are calculatedijExpression formula:
Wherein, i and j indicates arbitrary two self-organizing network nodes in network, enables if i and j each other non-conterminous node qijFor infinity；
K indicates to constitute the judgement factor of link quality information；
Indicate that the link quality information when node i and j are adjacent node adjudicates the weight of factor k；
Indicate that the link quality information when node i and j are adjacent node adjudicates the attribute value of factor k；
fijIt indicatesWithFor link quality information q between adjacent node i and jijThe Function Mapping of utilization variance Relationship；
The weightSize indicate judgement factor k to the influence degree of link quality information；
The judgement factor k includes different network environment status information.
Further, it includes the first computational submodule that the multipath, which finds module, for according to the computational submodule Characterization result, respectively obtain two heterogeneous networks connected relation matrix D=(dij)m×m, Q=(qij)m×m,
Wherein, m indicates the number of self-organizing network nodes in the wireless network；
dijIndicate the weight packet loss information in the wireless network between arbitrary two self-organizing network nodes i and j, if Node i and j neighbor node each other, then dijWeight packet loss for i, between j adjacent node；If node i and j are non-conterminous, Enable dij=∞；
qijThe link quality information in representation formula (1), if node i and j neighbor node each other, qijFor i, j Link quality information between adjacent node；If node i and j are non-conterminous, q is enabledij=∞；
First creation submodule, for according to network topological diagram and according to the first computational submodule net obtained Network connected relation matrix D=(dij)m×m, establish a figure G1, scheme G1It is by a vertex set V (G1), a side collection E (G1) and one The triple that a weight relationship is constituted, weight relationship therein make each side associated with two vertex, and by the two Vertex is known as the endpoint of this edge；
If to any vertex i, j ∈ V (G1) all there is a line ij, then the weight of side ij is denoted as w (ij), wherein w (ij)=dij, dijFor the weight packet loss of vertex i to vertex j；If ij is not a line, then w (ij)=∞ is remembered；
First path finds submodule, in figure G1In, using Dijkstra's algorithm, source point is calculated to point of destination The smallest trusted path of packet loss
WhereinIndicate the smallest trusted path of the packet lossSource point to point of destination equivalent packet loss；
Second creation submodule, for according to network topological diagram and according to the first computational submodule net obtained Network connected relation matrix Q=(qij)m×m, establish a figure G2, scheme G2It is by a vertex set V (G2), a side collection E (G2) and one The triple that a weight relationship is constituted, weight relationship therein make each side associated with two vertex, and by the two Vertex is known as the endpoint of this edge；
If to any vertex i, j ∈ V (G2) all there is a line ij, then the weight of side ij is denoted as u (ij), wherein u (ij)=qij, qijFor vertex i to the link quality information of vertex j；If ij is not a line, then u (ij)=∞ is remembered；
Third creates submodule, the smallest trusted path of the packet loss for finding out first path searching submoduleNode collection Y is added in all intermediate nodes passed through, then in figure G2Vertex set V (G2) in delete in the set Y Element obtains vertex set V (G21), while according to vertex set V (G21) update the collection E (G when obtaining21), G21Indicate obtained new figure；
Submodule is found in second path, in figure G21In, using Dijkstra's algorithm, source point is calculated to point of destination The smallest path r of link quality information summationα(ψα),(1≤α≤n-1)；
Wherein rα(ψα), (1≤α≤n-1) is the ascending arrangement of link quality information summation according to source point to point of destination Path, ψαIndicate path rα(ψα) source point to point of destination link quality information summation；α indicates natural number；
Second computational submodule finds the path r that submodule is found out for enumerating the second pathα(ψα),(1≤ α≤n-1) all intermediate nodes for passing through, it is added to node collection Y', then in figure G21Vertex set V (G21) in delete set Y' In element, obtain new vertex set；According to new vertex set, side is updated, obtains updated figure, returns to second path Submodule is found, until the link quality information summation in looked for path is greater than the predetermined threshold value h of link quality information summationmax Or when finding without new route, algorithm terminates.
Further, the gradable video encoding module includes encoding submodule, is used for video frame as unit of GOP By comprising the bit stream of data frame divide, layer based on being encoded to the video frame of accounting γ in each GOP Video, using the video frame of accounting 1- γ in GOP as the video of enhancement layer；Wherein, it in enhancement-layer video, chooses in GOP and accounts for Compare λ1Video of the video frame as enhancement layer 1, choose accounting λ in GOP2Video of the video frame as enhancement layer 2, with such It pushes away, chooses accounting λ in GOPn-1Video of the video frame as enhancement layer n-1, base layer videos frame accounting γ and enhancement layer α points Relationship λ with video frame accountingαAre as follows:
λα=fα(ψ1,ψ2,ψα……ψn-1,γ) (3)
Wherein, ψαIndicate path rα(ψα) source point to point of destination link quality information summation；fαIndicate path rα(ψα) Link quality information summation ψαWith the accounting λ of the distributed video frame of enhancement layer ααFunction Mapping relationship.
Further, the video transmission module includes transmission submodule, for the video data for the basal layer Stream uses the smallest trusted path of the packet lossIt is transmitted；Chain is selected for the video data stream of the enhancement layer 1 The path r of road optimal quality1(ψ1) transmitted；For the road of the video data stream selection link-quality suboptimum of the enhancement layer 2 Diameter r2(ψ2) transmitted, and so on, for the path of the video data stream selection link-quality suboptimum of the enhancement layer n-1 rn-1(ψn-1) transmitted, it is ensured that the video data stream of all enhancement layers is all in corresponding path transmission.
It includes judging submodule that transmission of video, which adaptively adjusts module, for judging the video of the basal layer and enhancement layer Data flow whether end of transmission, first computational submodule is returned if not finishing, otherwise terminates this transmission.
Compared with prior art, beneficial effects of the present invention: the present invention applies multipath parallel transmission strategy in isomery In the transmission of video of wireless self-organization network, the mulitpath of originator node to terminal node is found out using link quality information, The phenomenon that reducing multi-hop wireless network environment lower network congestion, Network Packet Loss, reduce the propagation delay time of video traffic.Except this Except, to the link quality information in heterogeneous wireless ad hoc network, according to network bandwidth, network delay, network load, network The network informations such as standard have reasonably carried out Unified Characterization by certain rule.
Present invention employs closed loop Multipath Transmission strategy, video transmission end according to receiving end feedback video reception situation with And the network environment status in transmission process, come the mulitpath of the originator node that searches out to terminal node；And in conjunction with connecing The network state of receiving end feedback has carried out the gradable Video coding in conjunction with transmission path situation to video traffic, has given More detailed Video Coding Scheme effectively avoids the poor path of link state, it is ensured that the integrality of receiving end video. The present invention transmits the video data stream of different layers using originator to the different path of terminal, and it is low preferentially to select a packet loss Trusted path transmit the video of basal layer；Secondly the superiority and inferiority according to originator to terminal links quality information is sequentially selected more Paths successively transmit the video data stream of several enhancement layers.It is unreliable to efficiently solve transmission of video in multi-hop wireless network The problem of, reaching makes base layer videos have stronger robustness, and enhancement-layer video has the characteristics that high throughput, and final Realize service quality guarantee of the HD video business in multi-hop wireless network.
Detailed description of the invention
Fig. 1 is the application scenario diagram of the embodiment of the present invention；
Fig. 2 is the process of the scalable video transmission method based on heterogeneous wireless ad hoc network of the embodiment of the present invention Figure；
Fig. 3 is that the node based on heterogeneous wireless ad hoc network of the embodiment of the present invention finds multichannel routing method figure；
Fig. 4 is that the structure of the scalable video Transmission system based on heterogeneous wireless ad hoc network of the embodiment of the present invention is shown It is intended to.
Fig. 5 is link-quality Unified Characterization modular structure block diagram of the embodiment of the present invention.
Fig. 6 is that multipath of the embodiment of the present invention finds modular structure block diagram.
Fig. 7 is gradable video encoding modular structure block diagram of the embodiment of the present invention.
Fig. 8 is that video transmission module of the embodiment of the present invention and transmission of video adaptively adjust modular structure block diagram.
Specific embodiment
Further detailed description is done to the present invention combined with specific embodiments below, but embodiments of the present invention are not limited to This.
In the description of the invention, it is to be understood that term " center ", " longitudinal direction ", " transverse direction ", "upper", "lower", The orientation or positional relationship of the instructions such as "front", "rear", "left", "right", "vertical", "horizontal", "top", "bottom", "inner", "outside" is Orientation or position based on the figure are merely for convenience of description the invention and simplify description, rather than instruction or dark Show that signified device or element must have a particular orientation, be constructed and operated in a specific orientation, therefore should not be understood as pair The limitation of the invention.
In addition, term " first ", " second ", " third " etc. are used for description purposes only, it is not understood to indicate or imply Relative importance or the quantity for implicitly indicating indicated technical characteristic.The feature of " first ", " second " etc. is defined as a result, It can explicitly or implicitly include one or more of the features.In the description of the invention, unless otherwise indicated, The meaning of " plurality " is two or more.
Term " installation ", " connected ", " connection " shall be understood in a broad sense, for example, it may be being fixedly connected, be also possible to removable Connection is unloaded, or is integrally connected；It can be mechanical connection, be also possible to be electrically connected；It can be directly connected, it can also be in Between medium be indirectly connected, can be the connection inside two elements.For the ordinary skill in the art, can pass through Concrete condition understands concrete meaning of the above-mentioned term in the invention.
As shown in Figure 1, Figure 2, Figure 3 shows, the present embodiment provides a kind of scalable videos based on heterogeneous wireless ad hoc network Transmission method, comprising the following steps:
Step S10, self-organizing network nodes find the wireless network in its position for access, and detecting periodically in real time Link quality information between node and node carries out Unified Characterization to link quality information according to different criterion.Isomery without Line self-organizing network refers specifically to: by wireless self-organization network as backbone network fusing wireless personal area network, WLAN, Cellular Networks Deng the Wireless Heterogeneous Networks as subnet.Self-organizing network nodes refer specifically to: having wireless ad-hoc communications port or be provided simultaneously with nothing Line ad-hoc communication port and node equipped with subnetwork communicating port.The tool of link quality information between probe node and node Body detection method are as follows: periodicity sending route maintenance message between each node node adjacent thereto in network, detection, interaction The information such as network bandwidth, network load, network delay, network formats.
The node in the present embodiment namely refer to self-organizing network nodes.
Unified Characterization is carried out to link quality information according to different criterion in step S10 method particularly includes: comprehensively consider The network environment status such as network bandwidth, network load, network delay, network formats information is sentenced as composition link quality information The certainly factor, each judgement factor have a corresponding weight, and weight size indicates judgement factor pair link quality information Influence degree, arbitrary two link quality information q between node i and j in networkijExpression formula:
Wherein, i and j indicates arbitrary two self-organizing network nodes in network, enables if i and j each other non-conterminous node qijFor infinity；
K indicates the judgement factor of composition link quality information,
Indicate that the link quality information when node i and j are adjacent node adjudicates the weight of factor k；
Indicate that the link quality information when node i and j are adjacent node adjudicates the attribute value of factor k；
fijIt indicatesWithFor link quality information q between adjacent node i and jijThe Function Mapping of utilization variance is closed System；
WeightSize indicate judgement factor k to the influence degree of link quality information；
Adjudicating factor k includes different network environment status information.
Step S20, according to the characterization result of step S10 link quality information, in conjunction with corresponding with video traffic feature Different pathfinding criterion find out originator to n (n >=1) reachable path between terminal；N indicates natural number.
According to step S10 link quality information characterization result, respectively obtain two heterogeneous networks connected relation matrix Ds= (dij)m×m, Q=(qij)m×m,
Wherein, m indicates the number of self-organizing network nodes in network；
dijThe weight packet loss information in network between arbitrary two self-organizing network nodes i and j is indicated, if node i and j Neighbor node each other, then dijWeight packet loss for i, between j adjacent node；If node i and j are non-conterminous, d is enabledij= ∞；
qijIndicate the link-quality letter in the network being calculated by (1) formula between arbitrary two self-organizing network nodes i and j Breath, if node i and j neighbor node each other, qijLink quality information for i, between j adjacent node；If node i and j It is non-conterminous, then enable qij=∞.Originator to terminal also refers to source point to point of destination.
Combine different pathfinding criterion corresponding from business characteristic to refer specifically in step S20: network-in-dialing obtained closes It is matrix, passes through matrix D=(d firstij)m×mFind out the smallest trusted path of packet lossWhereinIndicate pathOriginator to the end-to-end equivalent packet loss between terminal；Secondly by matrix Q=(qij)m×mSuccessively find out the road Bu Yu DiameterThe n-1 paths r of coincidenceα(ψα), (1≤α≤n-1), wherein rα(ψα) it is to be arrived according to originator to the end between terminal Hold the path of the ascending arrangement of link-quality summation, ψαIndicate path rα(ψα) originator to the end-to-end link between terminal Quality summation, α indicate natural number.
In conjunction with different pathfinding criterion corresponding from video traffic feature, originator is found out to n (n >=1) item between terminal The specific method is as follows for reachable path:
Step S21, according to link quality information qijCharacterization result, respectively obtain two heterogeneous networks connected relation matrixes D=(dij)m×m, Q=(qij)m×m,
Step S22, according to network topological diagram and step S21 network-in-dialing relational matrix D=(d obtainedij)m×m, Establish a figure G1, scheme G1It is by a vertex set V (G1), a side collection E (G1) and a weight relationship constitute triple, It is associated with two vertex that weight relationship therein makes each side, and the two vertex are known as to the endpoint of this edge；
If to any vertex i, j ∈ V (G1) all there is a line ij, then the weight of side ij is denoted as w (ij), wherein w (ij)=dij, dijFor the weight packet loss of vertex i to vertex j；If ij is not a line, then w (ij)=∞ is remembered；
Step S23, in figure G1In, using Di Jiesitela (Dijkstra) algorithm, calculate the packet loss of source point to point of destination The smallest trusted path of rate, is denoted as
Step S24, according to network topological diagram and according to step S21 network-in-dialing relational matrix Q=obtained (qij)m×m, establish a figure G2, scheme G2It is by a vertex set V (G2), a side collection E (G2) and weight relationship constitute Triple, weight relationship therein makes each side associated with two vertex, and the two vertex are known as this edge Endpoint；
If to any vertex i, j ∈ V (G2) all there is a line ij, then the weight of side ij is denoted as u (ij), wherein u (ij)=qij, qijFor vertex i to the link quality information of vertex j；If ij is not a line, then u (ij)=∞ is remembered；
Step S25, the smallest trusted path of the packet loss that step S23 is found outAll intermediate nodes passed through add Ingress collection Y, then in figure G2Vertex set V (G2) in delete set Y in element obtain vertex set V (G21), while basis Vertex set V (G21) update the collection E (G when obtaining21), G21Indicate obtained new figure；
Step S26, in figure G21In, using Dijkstra's algorithm, the link quality information for calculating source point to point of destination is total With the smallest path rα(ψα),(1≤α≤n-1)；
Step S27 enumerates the path r that step S26 is found outα(ψα), all intermediate nodes that (1≤α≤n-1) passes through, It is added to node collection Y', then in figure G21Vertex set V (G21) in delete set Y' in element, obtain new vertex set；Root According to new vertex set, side is updated, updated figure, return step S26, until the link quality information summation in looked for path are obtained Greater than the predetermined threshold value h of link quality information summationmaxOr when finding without new route, algorithm terminates.
The number of passes of step S30, the originator found out according to step S20 to terminal will be regarded in conjunction with different link states Frequency business carries out corresponding gradable video encoding.
The specific steps of step S30 are as follows: to video frame as unit of GOP by comprising the bit stream of data frame draw Point, the video of layer based on being encoded to the video frame of accounting γ in each GOP, by the video frame of accounting 1- γ in GOP Video as enhancement layer；Wherein, in enhancement-layer video, accounting λ in GOP is chosen1View of the video frame as enhancement layer 1 Frequently, accounting λ in GOP is chosen2Video of the video frame as enhancement layer 2, and so on, choose accounting λ in GOPn-1Video frame As the video of enhancement layer n-1, the relationship λ of base layer videos frame accounting γ and enhancement layer α distribution video frame accountingαAre as follows:
λα=fα(ψ1,ψ2,ψα……ψn-1,γ) (3)
Wherein, ψαIndicate path rα(ψα) source point to point of destination link quality information summation；fαIndicate path rα(ψα) Link quality information summation ψαWith the accounting λ of the distributed video frame of enhancement layer ααFunction Mapping relationship.α takes different values, fα The meaning of representative is also different.N and α take natural number.
Step S40, the video after coding select different transmission paths to end respectively according to corresponding routing criterion End；Then video after judging coding whether end of transmission, otherwise the return step S20 if not finishing terminates this transmission.
Video after coding selects different transmission paths to be sent to video traffic respectively according to certain routing criterion Terminal, specific routing criterion are as follows: the smallest path of packet loss is used for the video data stream of basal layerIt is transmitted； The optimal path r of video data stream selection link-quality for enhancement layer 11(ψ1) transmitted；For the video of enhancement layer 2 The path r of data flow selection link-quality suboptimum2(ψ2) transmitted, and so on, for the video data stream of enhancement layer n-1 Select the path r of link-quality suboptimumn-1(ψn-1) transmitted, it is ensured that the video data stream of all enhancement layers is all being corresponding to it Path transmission.
Then the video data stream of judgement basis layer and enhancement layer whether end of transmission, the return step if not finishing Otherwise S21 terminates this transmission.
As shown in Fig. 4, Fig. 5, Fig. 6, Fig. 7 and Fig. 8, the present embodiment also provides a kind of based on heterogeneous wireless ad hoc network Scalable video transmitting device, including heterogeneous network access network interface card 110, are found in its position in real time for self-organizing network nodes For the wireless network of access；
Link-quality detecting module 120, for the link quality information between detecting periodically node and node；For right The information such as connection relationship and network bandwidth, network load, network delay, network formats between nodes and node into Row detection.
Link-quality Unified Characterization module 130, for carrying out Unified Characterization to link quality information according to different criterion. By the connection relationship and the links such as network bandwidth, network load, network delay, network formats between the node and node of detection Quality information carries out Unified Characterization according to certain criterion.
Multipath finds module 210, the link quality information for being obtained according to link-quality Unified Characterization module 130 Characterization result finds out originator to n (n >=1) item between terminal in conjunction with different pathfinding criterion corresponding from video traffic feature Reachable path；N indicates natural number.According to the characterization result of the link quality information in network, looked for using corresponding pathfinding criterion Out from originator to a plurality of reachable path between terminal.
Gradable video encoding module 310, for finding the originator found out of module 210 to the road of terminal according to multipath Video traffic is carried out corresponding gradable video encoding in conjunction with different link states by diameter item number.For arriving terminal according to originator Between pathfinding as a result, in conjunction with different link states, video frame is encoded into according to certain rules a base layer videos and Several enhancement-layer videos.
Video transmission module 410, for the video after encoding gradable video encoding module 310 according to corresponding routing Criterion selects different transmission paths to terminal respectively.For the video data stream after encoding according to certain criterion Corresponding path is selected to be transmitted respectively.
Transmission of video adaptively adjusts module 420, for judge coding after video whether end of transmission, if do not finished It then returns to multipath searching module 210 to be handled, otherwise terminates this transmission.In video transmitting procedure, video is monitored Situation is transmitted, when network topology changes, real-time update link quality information, return re-starts corresponding path choosing It selects, the transmission work of gradable video encoding, adaptive video.
Further, link-quality Unified Characterization module 130 include computational submodule 131, for according to multiple judgements because Arbitrary two link quality information q between node i and j in wireless network are calculated in sonijExpression formula:
Wherein, i and j indicates arbitrary two self-organizing network nodes in network, enables if i and j each other non-conterminous node qijFor infinity；
K indicates to constitute the judgement factor of link quality information；
Indicate that the link quality information when node i and j are adjacent node adjudicates the weight of factor k；
Indicate that the link quality information when node i and j are adjacent node adjudicates the attribute value of factor k；
fijIt indicatesWithFor link quality information q between adjacent node i and jijThe Function Mapping of utilization variance is closed System；
The weightSize indicate judgement factor k to the influence degree of link quality information；
The judgement factor k includes different network environment status information.
Further, it includes the first computational submodule 211 that multipath, which finds module 210, for according to computational submodule Characterization result obtains two heterogeneous networks connected relation matrix D=(d respectivelyij)m×m, Q=(qij)m×m,
Wherein, m indicates the number of self-organizing network nodes in wireless network；
dijThe weight packet loss information in wireless network between arbitrary two self-organizing network nodes i and j is indicated, if node I and j neighbor node each other, then dijWeight packet loss for i, between j adjacent node；If node i and j are non-conterminous, d is enabledij =∞；
qijLink quality information in representation formula (1), if node i and j neighbor node each other, qijFor i, j is adjacent Link quality information between node；If node i and j are non-conterminous, q is enabledij=∞；
First creation submodule 212, for obtained according to network topological diagram and according to the first computational submodule 211 Network-in-dialing relational matrix D=(dij)m×m, establish a figure G1, scheme G1It is by a vertex set V (G1), a side collection E (G1) and The triple that one weight relationship is constituted, weight relationship therein makes each side associated with two vertex, and by this two A vertex is known as the endpoint of this edge；
If to any vertex i, j ∈ V (G1) all there is a line ij, then the weight of side ij is denoted as w (ij), wherein w (ij)=dij, dijFor the weight packet loss of vertex i to vertex j；If ij is not a line, then w (ij)=∞ is remembered；
First path finds submodule 213, in figure G1In, using Dijkstra's algorithm, source point is calculated to purpose The smallest trusted path of packet loss of point
WhereinIndicate the smallest trusted path of packet lossSource point to point of destination equivalent packet loss；
Second creation submodule 215, for obtained according to network topological diagram and according to the first computational submodule 211 Network-in-dialing relational matrix Q=(qij)m×m, establish a figure G2, scheme G2It is by a vertex set V (G2), a side collection E (G2) and The triple that one weight relationship is constituted, weight relationship therein makes each side associated with two vertex, and by this two A vertex is known as the endpoint of this edge；
If to any vertex i, j ∈ V (G2) all there is a line ij, then the weight of side ij is denoted as u (ij), wherein u (ij)=qij, qijFor vertex i to the link quality information of vertex j；If ij is not a line, then u (ij)=∞ is remembered；
Third creates submodule 216, the smallest reliable road of packet loss for finding out first path searching submodule 213 DiameterNode collection Y is added in all intermediate nodes passed through, then in figure G2Vertex set V (G2) in delete set Y in member Element obtains vertex set V (G21), while according to vertex set V (G21) update the collection E (G when obtaining21), G21Indicate obtained new figure；
Submodule 217 is found in second path, in figure G21In, using Dijkstra's algorithm, source point is calculated to purpose The smallest path r of link quality information summation of pointα(ψα),(1≤α≤n-1)；
Wherein rα(ψα), (1≤α≤n-1) is the ascending arrangement of link quality information summation according to source point to point of destination Path, ψαIndicate path rα(ψα) source point to point of destination link quality information summation；α indicates natural number；
Second computational submodule 214 finds the path r that submodule 217 is found out for enumerating the second pathα(ψα),(1 ≤ α≤n-1) all intermediate nodes for passing through, it is added to node collection Y', then in figure G21Vertex set V (G21) in delete set Element in Y' obtains new vertex set；According to new vertex set, side is updated, obtains updated figure, the second path is returned to and seeks Submodule 217 is looked for, until the link quality information summation in looked for path is greater than the predetermined threshold value h of link quality information summationmax Or when finding without new route, algorithm terminates.The sum of quality information is both less than threshold value hmaxIt can be carried out according to Network status preparatory It calculates and sets.
Further, gradable video encoding module 310 includes encoding submodule 311, is used to be single with GOP to video frame Position by comprising the bit stream of data frame divide, layer based on being encoded to the video frame of accounting γ in each GOP Video, using the video frame of accounting 1- γ in GOP as the video of enhancement layer；Wherein, it in enhancement-layer video, chooses in GOP Accounting λ1Video of the video frame as enhancement layer 1, choose accounting λ in GOP2Video of the video frame as enhancement layer 2, with this Analogize, chooses accounting λ in GOPn-1Video of the video frame as enhancement layer n-1, base layer videos frame accounting γ and enhancement layer α Distribute the relationship λ of video frame accountingαAre as follows:
λα=fα(ψ1,ψ2,ψα……ψn-1,γ) (3)
Wherein, ψαIndicate path rα(ψα) source point to point of destination link quality information summation；fαIndicate path rα(ψα) Link quality information summation ψαWith the accounting λ of the distributed video frame of enhancement layer ααFunction Mapping relationship.
Further, video transmission module 410 includes transmission submodule 411, for the video data stream for basal layer Using the smallest trusted path of packet lossIt is transmitted；It is optimal for the video data stream selection link-quality of enhancement layer 1 Path r1(ψ1) transmitted；For the path r of the video data stream selection link-quality suboptimum of enhancement layer 22(ψ2) passed It is defeated, and so on, for the path r of the video data stream selection link-quality suboptimum of enhancement layer n-1n-1(ψn-1) transmitted, Ensure the video data stream of all enhancement layers all in corresponding path transmission；
It includes judging submodule 421, the view for judgement basis layer and enhancement layer that transmission of video, which adaptively adjusts module 420, Frequency data stream whether end of transmission, the first computational submodule 211 is returned if not finishing, otherwise terminates this transmission.
The working principle of the invention or the course of work are as follows:
Referring to Fig. 1, a kind of scalable video based on heterogeneous wireless ad hoc network proposed for the embodiment of the present invention is passed Transmission method and schematic device.The scene that the present invention uses is by wireless self-organization network as backbone network fusing wireless domain For net, WLAN, Cellular Networks etc. are as the multi-hop wireless heterogeneous network of subnet, but not limited to this net, wherein by WG_ 1, this eight self-organizing network nodes of WG_2, WG_3, WG_4, WG_5, WG_6, WG7, WG_8 constitute wireless self-organization network, each Self-organizing network nodes are equipped with the network interface card for accessing each heterogeneous network, and node can not only be communicated with other nodes at this time, but also can be same When access external network communicated with other heterogeneous network terminal devices.
As shown in Figure 1, the mobile phone user 5 that the iPad user 6 connecting with WG_5 will give WG_2 connection sends video, After initialization, each self-organizing network nodes detect the wireless network in its position for access, and WG_1 accesses WPAN at this time, Such as the network that Bluetooth accessing point 3 and cell phone apparatus 4 form, WG_2 access cellular network, WG_5 accesses WLAN.At the same time, Node WG_5 periodically sends route maintenance message to neighbor node and carries out neighbours' discovery, link detection, between sensing node Link packet drop rate and link quality information, by the information such as bandwidth, load, time delay, standard between perception link by chain Road quality information carries out Unified Characterization, and embodiments method is as follows:
The information such as the network bandwidth between surroundings nodes, network load, network delay, the network formats that node will acquire As the judgement factor for constituting link quality information, each judgement factor has a corresponding weight, and weight size indicates Adjudicate the influence degree of factor pair link quality information.In Fig. 1, the link information between adjacent node is expressed as (d, b (Mbps), t (s), l (Mbps)), wherein d indicates that the packet loss between adjacent node, b indicate the Netowrk tape between adjacent node Width, t indicate that the network delay between adjacent node, l indicate existing network load between adjacent node.Adjacent section in network The weight of network bandwidth b is 0.5 between point, and the weight of network load l is 0.3, and the weight of network delay t is 0.2, then adjacent segments Link quality information between point can Unified Characterization are as follows:
Next, characterization result of each node according to link quality information, obtains network packet loss rate information communication respectively Relational matrix D=(dij)8×8With network link quality information communication relational matrix Q=(qij)8×8, it is as follows:
Matrix D=(dij)8×8In if any two node i, j neighbor node each other, then dijFor i, between j adjacent node Packet loss；If node i and j are non-conterminous, d is enabledij=∞；Matrix Q=(qij)8×8In if any two node i, j are mutual For neighbor node, then qijLink quality information for i, between j adjacent node；If node i and j are non-conterminous, q is enabledij= ∞.Then, according to network topological diagram and network-in-dialing relational matrix D, figure G is established1, scheme G1By a vertex set V (G1), one A side collection E (G1) and a weight relationship composition.Using dijkstra's algorithm, in figure G1In find out that a packet loss is the smallest can By path WG_5-WG_1-WG_2, path originator to the equivalent packet loss of terminal is 0.015, then enumerates path process Node set Y is added in all intermediate nodes, at this time Y={ WG_1 }；Then according to network topological diagram and connected relation matrix Q structure Make figure G2, scheme G2By a vertex set V (G2), a side collection E (G2) and a weight relationship composition.In figure G2Vertex set V (G2) in element in deletion of node collection Y={ WG_1 }, obtain vertex set V (G21), according to vertex set V (G21) update side collected Close E (G21), G21For obtained new figure；Next, using dijkstra's algorithm, in figure G21In find out a link quality information The sum of the smallest path WG_5-WG_6-WG_7-WG_8-WG_2, path originator to link quality information between terminal is 0.84；In figure G21In the middle intermediate node access node set Y' for passing through the path, Y'={ WG_6, WG_7, WG_8 } is scheming G21Element in middle deletion of node set Y', obtains new vertex set；According to new vertex set, side is updated, is obtained updated Figure；Dijkstra's algorithm is used again, and the sum of link quality information of WG_5 to WG_2 time is found out in figure in the updated Small path WG_5-WG_4-WG_3-WG_2, path originator to link quality information between terminal are 1.26, and it was found that three The sum of link quality information of paths is both less than threshold value 2, while other paths never again from WG_5 to WG_2.Thus Have found three reachable paths from source node WG_5 to destination node WG_2.
Next, according to the number for finding path as a result, WG_5 video traffic is carried out gradable video encoding, specific volume Code process are as follows:
To video frame as unit of GOP by comprising the bit stream of data frame divide, to accounting γ in each GOP= The video of layer based on 20% video frame is encoded, using the video frame of accounting 80% in GOP as the video of enhancement layer； Wherein, in enhancement-layer video, accounting λ in GOP is chosen1Video of=48% video frame as enhancement layer 1 is chosen in GOP Accounting λ2Video of=32% video frame as enhancement layer 2, base layer videos frame accounting γ divide with enhancement layer 1 and enhancement layer 2 With video frame accounting λ1And λ2Relationship are as follows:
1- γ=λ1+λ2 (2)
Wherein, ψ1Indicate path r1(ψ1) originator to the end-to-end total link quality between terminal；
ψ2Indicate path r2(ψ2) originator to the end-to-end total link quality between terminal.
The base layer videos business of coding passes through the smallest path WG_5-WG_ of packet loss having been found by WG_5 node 1-WG_2 is sent to node WG_2；1 video traffic of enhancement layer of coding, which is passed through the link-quality having been found by WG_5 node, to be believed The smallest path WG_5-WG_6-WG_7-WG_8-WG_2 of the sum of breath is sent to node WG_2；2 video traffic of enhancement layer of coding The small path WG_5-WG_4-WG_3-WG_2 of the sum of link quality information having been found time is passed through by WG_5 node and is sent to section Point WG_2 completes the work of gradable Video coding transmission video.In this way, the mobile phone user connecting with WG_2 can receive The video that the iPad user connecting with WG_5 sends over, and can guarantee preferable video quality.
The present embodiment is directed to the scene of multi-hop wireless network environment, proposes a kind of closed loop Multipath Video strategy.Section Point real-time detection is collected wireless network environment information and is integrated, Unified Characterization, and then originator node is according to network link Quality information characterization result finds a plurality of reachable path parallel transmission video for reaching receiving end, and originator node is according to reception end segment The video reception situation and network link situation of point feedback adaptively instruct originator node to carry out gradable video and compile Code.When network environment changes, originator node readjusts routing policy and again guidance view according to network link status Frequency encodes, the final reliable transmission for realizing HD video business in multi-hop wireless network.
Through the above description of the embodiments, those skilled in the art can be understood that the present invention can lead to Software realization is crossed, technical solution of the present invention can be embodied in the form of software products, which can store non-at one In volatile storage medium (can be CD-ROM, USB flash disk, mobile hard disk etc.), that realizes video traffic including some instructions can Hierarchical coding transmission.
The above content is a further detailed description of the present invention in conjunction with specific preferred embodiments, and it cannot be said that Specific implementation of the invention is only limited to these instructions.For those of ordinary skill in the art to which the present invention belongs, exist Under the premise of not departing from present inventive concept, a number of simple deductions or replacements can also be made, all shall be regarded as belonging to of the invention Protection scope.

Claims (2)

1. a kind of scalable video transmission method based on heterogeneous wireless ad hoc network, it is characterised in that: the following steps are included:
Step S10, self-organizing network nodes find the wireless network in its position for access, and detecting periodically node in real time Link quality information between node carries out Unified Characterization to link quality information according to different criterion；
Step S20, according to the characterization result of the step S10 link quality information, in conjunction with corresponding with video traffic feature Different pathfinding criterion find out originator to n (n >=1) reachable path between terminal；N indicates natural number；
The number of passes of step S30, the originator found out according to the step S20 to terminal will be regarded in conjunction with different link states Frequency business carries out corresponding gradable video encoding；
Step S40, the video after coding select different transmission paths to terminal respectively according to corresponding routing criterion； Then video after judging the coding whether end of transmission, otherwise the return step S20 if not finishing terminates this biography It is defeated；
The specific steps of the step S20 are as follows:
Step S21, according to link quality information qijCharacterization result, respectively obtain two heterogeneous networks connected relation matrix Ds= (dij)m×m, Q=(qij)m×m,
Wherein, m indicates the number of self-organizing network nodes in the wireless network；
dijThe weight packet loss information in the wireless network between arbitrary two self-organizing network nodes i and j is indicated, if node I and j neighbor node each other, then dijWeight packet loss for i, between j adjacent node；If node i and j are non-conterminous, d is enabledij =∞；
qijThe link quality information in representation formula (1), if node i and j neighbor node each other, qijFor i, j is adjacent Link quality information between node；If node i and j are non-conterminous, q is enabledij=∞；
Step S22, according to network topological diagram and step S21 network-in-dialing relational matrix D=(d obtainedij)m×m, build Found a figure G1, scheme G1It is by a vertex set V (G1), a side collection E (G1) and a weight relationship constitute triple, In weight relationship to make each side associated with two vertex, and the two vertex are known as to the endpoint of this edge；
If to any vertex i, j ∈ V (G1) all there is a line ij, then the weight of side ij is denoted as w (ij), wherein w (ij)= dij, dijFor the weight packet loss of vertex i to vertex j；If ij is not a line, then w (ij)=∞ is remembered；
Step S23, in figure G1In, using Dijkstra's algorithm, calculate the smallest trusted path of packet loss of source point to point of destination
WhereinIndicate the smallest trusted path of the packet lossSource point to point of destination equivalent packet loss；
Step S24, according to network topological diagram and according to step S21 network-in-dialing relational matrix Q=obtained (qij)m×m, establish a figure G2, scheme G2It is by a vertex set V (G2), a side collection E (G2) and weight relationship constitute Triple, weight relationship therein makes each side associated with two vertex, and the two vertex are known as this edge Endpoint；
If to any vertex i, j ∈ V (G2) all there is a line ij, then the weight of side ij is denoted as u (ij), wherein u (ij)= qij, qijFor vertex i to the link quality information of vertex j；If ij is not a line, then u (ij)=∞ is remembered；
Step S25, the smallest trusted path of the packet loss that the step S23 is found outAll middle nodes passed through Node collection Y is added in point, then in figure G2Vertex set V (G2) in the element deleted in the set Y obtain vertex set V (G21), Simultaneously according to vertex set V (G21) update the collection E (G when obtaining21), G21Indicate obtained new figure；
Step S26, in figure G21In, using Dijkstra's algorithm, the link quality information summation of calculating source point to point of destination is most Small path rα(ψα),(1≤α≤n-1)；
Wherein rα(ψα), (1≤α≤n-1) is the road according to the ascending arrangement of link quality information summation of source point to point of destination Diameter, ψαIndicate path rα(ψα) source point to point of destination link quality information summation；α indicates natural number；
Step S27 enumerates the path r that the step S26 is found outα(ψα), all centres that (1≤α≤n-1) passes through Node is added to node collection Y', then in figure G21Vertex set V (G21) in delete set Y' in element, obtain new vertex Collection；According to new vertex set, side is updated, updated figure is obtained, returns to the step S26, until the link matter in looked for path Measure the predetermined threshold value h that information summation is greater than link quality information summationmaxOr when finding without new route, algorithm terminates；
The specific steps of the step S30 are as follows: to video frame as unit of GOP by comprising the bit stream of data frame draw Point, the video of layer based on being encoded to the video frame of accounting γ in each GOP, by the video frame of accounting 1- γ in GOP It carries out encoding the video as enhancement layer；Wherein, in enhancement-layer video, accounting λ in GOP is chosen1Video frame as enhancing The video of layer 1 chooses accounting λ in GOP2Video of the video frame as enhancement layer 2, and so on, choose accounting λ in GOPn-1 Video of the video frame as enhancement layer n-1, the relationship λ of base layer videos frame accounting γ and enhancement layer α distribution video frame accountingα Are as follows:
λα=fα(ψ1,ψ2,ψαL Lψn-1,γ) (3)
Wherein, ψαIndicate path rα(ψα) source point to point of destination link quality information summation；fαIndicate path rα(ψα) chain Road quality information summation ψαWith the accounting λ of the distributed video frame of enhancement layer ααFunction Mapping relationship；
The specific steps of the step S40 are as follows: use the packet loss is the smallest can the video data stream of the basal layer By pathIt is transmitted；The optimal path r of video data stream selection link-quality for the enhancement layer 11(ψ1) into Row transmission；For the path r of the video data stream selection link-quality suboptimum of the enhancement layer 22(ψ2) transmitted, with such It pushes away, for the path r of the video data stream selection link-quality suboptimum of the enhancement layer n-1n-1(ψn-1) transmitted, it is ensured that institute There is the video data stream of enhancement layer all in corresponding path transmission；Then judge the video counts of the basal layer and enhancement layer According to stream whether end of transmission, the step S21 is returned if not finishing, otherwise terminates this transmission；
Unified Characterization is carried out to link quality information according to different criterion in the step S10 method particularly includes: according to multiple The judgement factor obtains arbitrary two link quality information q between node i and j in the wireless networkijExpression formula:
Wherein, i and j indicates arbitrary two self-organizing network nodes in network, enables q if i and j each other non-conterminous nodeijFor It is infinitely great；
K indicates to constitute the judgement factor of link quality information；
Indicate that the link quality information when node i and j are adjacent node adjudicates the weight of factor k；
Indicate that the link quality information when node i and j are adjacent node adjudicates the attribute value of factor k；
fijIt indicatesWithFor link quality information q between adjacent node i and jijThe Function Mapping relationship of utilization variance；
The weightSize indicate judgement factor k to the influence degree of link quality information；
The judgement factor k includes different network environment status information.
2. a kind of scalable video transmitting device based on heterogeneous wireless ad hoc network, it is characterised in that:
Heterogeneous network accesses network interface card, finds the wireless network in its position for access in real time for self-organizing network nodes；
Link-quality detecting module, for the link quality information between detecting periodically node and node；
Link-quality Unified Characterization module, for carrying out Unified Characterization to link quality information according to different criterion；
Multipath searching module, the characterization result of the link quality information for being obtained according to link-quality Unified Characterization module, Originator is found out to n (n >=1) reachable path between terminal in conjunction with different pathfinding criterion corresponding from video traffic feature；n Indicate natural number；
Gradable video encoding module, number of passes of the originator to terminal for being found out according to multipath searching module, knot Different link states are closed, video traffic is subjected to corresponding gradable video encoding；
Video transmission module, for according to corresponding routing criterion, distinguishing the video after gradable video encoding module coding Select different transmission paths to terminal；
Transmission of video adaptively adjusts module, for judge the video after the coding whether end of transmission, if not finishing It returns to multipath searching module to be handled, otherwise terminates this transmission；
It includes the first computational submodule that the multipath, which finds module, for the characterization result according to the computational submodule, is divided It Huo get not two heterogeneous networks connected relation matrix D=(dij)m×m, Q=(qij)m×m,
Wherein, m indicates the number of self-organizing network nodes in the wireless network；
dijThe weight packet loss information in the wireless network between arbitrary two self-organizing network nodes i and j is indicated, if node I and j neighbor node each other, then dijWeight packet loss for i, between j adjacent node；If node i and j are non-conterminous, d is enabledij =∞；
qijThe link quality information in representation formula (1), if node i and j neighbor node each other, qijFor i, j is adjacent Link quality information between node；If node i and j are non-conterminous, q is enabledij=∞；
First creation submodule, for connecting according to network topological diagram and according to first computational submodule network obtained Clearance system matrix D=(dij)m×m, establish a figure G1, scheme G1It is by a vertex set V (G1), a side collection E (G1) and a power The triple that series of fortified passes system is constituted, weight relationship therein makes each side associated with two vertex, and by the two vertex The referred to as endpoint of this edge；
If to any vertex i, j ∈ V (G1) all there is a line ij, then the weight of side ij is denoted as w (ij), wherein w (ij)= dij, dijFor the weight packet loss of vertex i to vertex j；If ij is not a line, then w (ij)=∞ is remembered；
First path finds submodule, in figure G1In, using Dijkstra's algorithm, calculate the packet loss of source point to point of destination The smallest trusted path of rate
WhereinIndicate the smallest trusted path of the packet lossSource point to point of destination equivalent packet loss；
Second creation submodule, for connecting according to network topological diagram and according to first computational submodule network obtained Logical relational matrix Q=(qij)m×m, establish a figure G2, scheme G2It is by a vertex set V (G2), a side collection E (G2) and a power The triple that series of fortified passes system is constituted, weight relationship therein makes each side associated with two vertex, and by the two vertex The referred to as endpoint of this edge；
If to any vertex i, j ∈ V (G2) all there is a line ij, then the weight of side ij is denoted as u (ij), wherein u (ij)= qij, qijFor vertex i to the link quality information of vertex j；If ij is not a line, then u (ij)=∞ is remembered；
Third creates submodule, the smallest trusted path of the packet loss for finding out first path searching submoduleNode collection Y is added in all intermediate nodes passed through, then in figure G2Vertex set V (G2) in delete in the set Y Element obtains vertex set V (G21), while according to vertex set V (G21) update the collection E (G when obtaining21), G21Indicate obtained new figure；
Submodule is found in second path, in figure G21In, using Dijkstra's algorithm, calculate the link of source point to point of destination The smallest path r of quality information summationα(ψα),(1≤α≤n-1)；
Wherein rα(ψα), (1≤α≤n-1) is the road according to the ascending arrangement of link quality information summation of source point to point of destination Diameter, ψαIndicate path rα(ψα) source point to point of destination link quality information summation；α indicates natural number；
Second computational submodule finds the path r that submodule is found out for enumerating the second pathα(ψα),(1≤α≤ N-1) all intermediate nodes passed through are added to node collection Y', then in figure G21Vertex set V (G21) in delete set Y' in Element, obtain new vertex set；According to new vertex set, side is updated, obtains updated figure, second path is returned to and seeks Submodule is looked for, until the link quality information summation in looked for path is greater than the predetermined threshold value h of link quality information summationmaxOr When not having new route to find, algorithm terminates；
The gradable video encoding module includes encoding submodule, for video frame as unit of GOP by comprising data The bit stream of frame is divided, the video of layer based on encoding to the video frame of accounting γ in each GOP, will be in GOP Video of the video frame of accounting 1- γ as enhancement layer；Wherein, in enhancement-layer video, accounting λ in GOP is chosen1Video frame As the video of enhancement layer 1, accounting λ in GOP is chosen2Video of the video frame as enhancement layer 2, and so on, choose in GOP Accounting λn-1Video of the video frame as enhancement layer n-1, base layer videos frame accounting γ and enhancement layer α distribute video frame accounting Relationship λαAre as follows:
λα=fα(ψ1,ψ2,ψαL Lψn-1,γ) (3)
Wherein, ψαIndicate path rα(ψα) source point to point of destination link quality information summation；fαIndicate path rα(ψα) chain Road quality information summation ψαWith the accounting λ of the distributed video frame of enhancement layer ααFunction Mapping relationship；
The video transmission module includes transmission submodule, uses the packet loss for the video data stream for the basal layer The smallest trusted path of rateIt is transmitted；The optimal road of video data stream selection link-quality for the enhancement layer 1 Diameter r1(ψ1) transmitted；For the path r of the video data stream selection link-quality suboptimum of the enhancement layer 22(ψ2) passed It is defeated；And so on, for the path r of the video data stream selection link-quality suboptimum of the enhancement layer n-1n-1(ψn-1) passed It is defeated, it is ensured that the video data stream of all enhancement layers is all in corresponding path transmission；
It includes judging submodule that transmission of video, which adaptively adjusts module, for judging the video data of the basal layer and enhancement layer Stream whether end of transmission, first computational submodule is returned if not finishing, otherwise terminates this transmission；
The link-quality Unified Characterization module includes computational submodule, for the nothing to be calculated according to multiple judgement factors Arbitrary two link quality information q between node i and j in gauze networkijExpression formula:
Wherein, i and j indicates arbitrary two self-organizing network nodes in network, enables q if i and j each other non-conterminous nodeijFor It is infinitely great；
K indicates to constitute the judgement factor of link quality information；
Indicate that the link quality information when node i and j are adjacent node adjudicates the weight of factor k；
Indicate that the link quality information when node i and j are adjacent node adjudicates the attribute value of factor k；
fijIt indicatesWithFor link quality information q between adjacent node i and jijThe Function Mapping relationship of utilization variance；
The weightSize indicate judgement factor k to the influence degree of link quality information；
The judgement factor k includes different network environment status information.
CN201711078364.1A 2017-11-06 2017-11-06 A kind of scalable video transmission method and device based on heterogeneous wireless ad hoc network Active CN107809662B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201711078364.1A CN107809662B (en) 2017-11-06 2017-11-06 A kind of scalable video transmission method and device based on heterogeneous wireless ad hoc network

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201711078364.1A CN107809662B (en) 2017-11-06 2017-11-06 A kind of scalable video transmission method and device based on heterogeneous wireless ad hoc network

Publications (2)

Publication Number Publication Date
CN107809662A CN107809662A (en) 2018-03-16
CN107809662B true CN107809662B (en) 2019-08-16

Family

ID=61582986

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201711078364.1A Active CN107809662B (en) 2017-11-06 2017-11-06 A kind of scalable video transmission method and device based on heterogeneous wireless ad hoc network

Country Status (1)

Country Link
CN (1) CN107809662B (en)

Families Citing this family (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN111342984B (en) * 2018-12-18 2021-08-10 大唐移动通信设备有限公司 Information processing method, system and device
CN110519632B (en) 2019-07-30 2021-08-20 华为技术有限公司 Screen projection method and equipment
CN114424552A (en) * 2019-09-29 2022-04-29 华为技术有限公司 Low-delay source-channel joint coding method and related equipment
CN111263160A (en) * 2019-12-16 2020-06-09 陕西师范大学 Video coding processing method and device adaptive to wireless transmission dynamic change
CN111510737B (en) * 2020-04-26 2022-03-22 广州虎牙科技有限公司 Video data transmission method, device, equipment and storage medium

Family Cites Families (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US9537759B2 (en) * 2012-01-31 2017-01-03 Massachusetts Institute Of Technology Multi-path data transfer using network coding
TWI500336B (en) * 2013-06-11 2015-09-11 Univ Nat Chiao Tung System architecture and transmission method for service continuity in heterogeneous wireless networks for user device
CN103338410B (en) * 2013-07-19 2016-05-11 西安电子科技大学 Real time flow medium reassembly algorithm based on SVC under multipath parallel transmission
CN103840917B (en) * 2014-03-28 2017-04-26 北京邮电大学 Multipath parallel transmission scheme based on network coding
WO2016206709A1 (en) * 2015-06-22 2016-12-29 Telefonaktiebolaget Lm Ericsson (Publ) Path selection in wireless mesh networks
CN105187849B (en) * 2015-08-14 2018-06-12 合肥工业大学 A kind of method based on the distribution of the telescopic video multicast resource of D2D and cellular network
CN105491402B (en) * 2015-12-08 2018-04-10 中国电子科技集团公司第二十八研究所 A kind of adaptive scalable video transmission method based on partial cooperative communication protocol
CN105873096B (en) * 2016-03-24 2019-05-10 重庆邮电大学 A kind of optimization method of multipath parallel transmission system effective throughput
CN106130608B (en) * 2016-06-07 2019-10-22 华中科技大学 A kind of heterogeneous network converged framework and its data transmission method based on the processing of the double-deck cloud

Also Published As

Publication number Publication date
CN107809662A (en) 2018-03-16

Similar Documents

Publication Publication Date Title
CN107809662B (en) A kind of scalable video transmission method and device based on heterogeneous wireless ad hoc network
CN101415248B (en) Method for establishing layer-striding dynamic source route protocol based on load balance
CN107182074B (en) A kind of routing optimal path choosing method based on Zigbee
Unnikrishnan et al. Cooperative routing for improving the lifetime of wireless ad-hoc networks
Kim et al. Load balanced congestion adaptive routing for mobile ad hoc networks
Sedrati et al. Multipath routing to improve quality of service for video streaming over mobile ad hoc networks
CN109104366A (en) A kind of link duration calculation method, MPR node selecting method and Routing Protocol
Laufer et al. PLASMA: A new routing paradigm for wireless multihop networks
Bidai et al. Node disjoint multi-path routing for ZigBee cluster-tree wireless sensor networks
Khelifi et al. LQCC: A link quality-based congestion control scheme in named data networks
CN114867061A (en) Cloud monitoring method based on wireless communication network
Kunavut et al. Generalized Multi-Constrained Path (G_MCP) QoS Routing Algorithm for Mobile Ad hoc Networks.
Junnarkar et al. Novel quality of service (qos) improvement routing protocol for manet using ant colony optimization
Shrivastava et al. Effect of number of CBR Connections on the performance of a Load Balanced Congestion Adaptive Routing for MANET
EP2432269B1 (en) Method and system for optimum configuration of a mesh network considering traffic characteristics
Okamura et al. Opportunistic routing for heterogeneous IoT networks
Bagheri et al. An energy-efficient leader selection algorithm for cooperative mobile clouds
Kaur et al. Implementation of rank based ACO approach with load balancing in ad hoc network for multipath routing mechanism
Han et al. Cross-layer protocol design for wireless communication in hybrid data center networks
Junnarkar et al. Efficient algorithm and study of QoS-aware mobile Ad hoc network methods
Uchida et al. Proposal of never die network with the combination of cognitive wireless network and satellite system
Liu et al. Research on video transmission Ad Hoc network routing technology oriented multimedia applications
Badhusha et al. Energy efficient improved bandwidth video streaming through reliable multipath propagation in manets
CN106856618B (en) A kind of realization wireless Mesh netword maximum throughput rate method
CN106911433A (en) A kind of chance forwarding Design of Routing Protocol method that nodes encoding is perceived

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant