Auction-Based Resource Allocation for Cooperative Video Transmission Protocols over Wireless Networks

Cooperative transmission has been proposed as a novel transmission strategy that takes advantage of broadcast nature of wireless networks, forms virtual MIMO system, and provides diversity gains. In this paper, wireless video transmission protocols are proposed, in which the spectrum resources are ﬁrst allocated for the source side to broadcast video packets to the relay and destination, and then for the relay side to transmit side information generated from the received packets. The proposed protocols are optimized to minimize the end-to-end expected distortion via choosing bandwidth/power allocation, conﬁguration of side information, subject to bandwidth and power constraints. For multiuser cases, most of current resource allocation approaches cannot be naturally extended and applied to the networks with relay nodes for video transmission. This paper extends the share auction approach into the cooperative video communication scenarios and provides a near-optimal solution for resource allocation. Experimental results have demonstrated that the proposed approach has signiﬁcant advantage of up to 4 dB gain in single user case and 1.3 dB gain in multiuser case over the reference systems in terms of peak-to-signal-noise ratio. In addition, it reduces the formidable computational complexity of the optimal solution to linear complexity with performance degradation of less than 0.3dB.


Introduction
Over the past few decades, wireless communications and networking have experienced unprecedented growth.With the advancement in video coding technology, transmitting real-time encoded video programs over wireless networks has become a promising service for applications such as video-on-demand and interactive video telephony.Recently, Distributed Source Coding (DSC) and Wyner-Ziv (WZ) coding have been proposed for video transmission [1,2].In DSC, the relay transcodes video packets to form the multiple descriptions of the video contents [1,2].The reencoded video is coded by WZ coding, that is, instead of sending the original video, the relay sends side information to the destination to improve the decoded video quality.Combining the directed transmitted video and relay's side information, the destination can explore the source diversity to improve the reconstructed video quality.
On the other hand, cooperative communication [3][4][5][6][7][8][9][10][11][12][13][14][15] has recently attracted significant attention as an effective transmission strategy, which efficiently takes advantage of the broadcast nature of wireless networks.The basic idea is to let nodes in a wireless network share information and transmit data cooperatively as a virtual antenna array.This collaboration significantly improves the system performance.With the fast growth of the video streaming technology, the concept of cooperative video communication can enable the relay nodes to play more intelligent and active roles in processing, transcoding, or re-adapting the media information received before transmitting to the next node.As a consequence, the advantage of flexibility simultaneously increases the complexity of the network management and resource allocation.So far there is little work in studying the full-fledged cooperative video network due to the high complexity.
Due to the distributed nature of the relay nodes, it is nature to connect the idea of DSC to video cooperative communication.In this paper, we propose a wireless video transmission protocol that leverages the benefits of both cooperative transmission and the idea of DSC.There are two phases involved in the transmission.In the first phase, the source broadcasts the video to the relay and destination.The relay conducts transcoding for the received video content to coarse quality and transmits it as side information.In the second phase, the relay chooses one of two options, that is, either to transmit the coarse-quality video packets using the amplify-and-forward or decode-and-forward protocols, or to encode the coarse-quality video using forward error coding (FEC), and then transmit the parity data to the destination.We assume a control channel is available to let the destination know the processing settings chosen by the relay node.The destination decodes the video transmitted in the first phase and transcodes it using the same coding parameters deployed in the relay node.The coarse-quality video generated at destination will be combined with the side information sent from the relay to improve the reconstructed coarse-quality video.(To achieve real-time streaming, when the source collects one new group of pictures (GOPs), the encoded bitstream of previous GOP can be transmitted by the proposed scheme.)In this paper, an optimization problem is formulated to minimize the end-to-end expected distortion by dynamically choosing the protocol mode, bandwidth/power allocation, FEC coding parameter, subject to the bandwidth and power constraints.From the analysis and simulation results using 3D-Set Partitioning in Hierarchical Trees (3D-SPIHT) video coding [16], the proposed cooperative video transmission protocol has a significant PSNR gain over the traditional direct video transmission.Especially by employing the cooperative video transmission with side information, we have obtained up to 4 dB gain over the amplify-and-forward or decode-and-forward protocols.
For the multiuser case, we concentrate on the resource allocation method using auction theory, which is a subfield of the game theory which attempts to mathematically capture behavior in strategic situations, in which an individual's success in making choices depends on the choices of others.In the auction scenarios, there is a central spectrum moderator that masters the resources and there are autonomous users that request resources in the network.Very recently, researchers start to explore the auction-theory-based solutions for resource allocation for video communications [17,18] based on a Vickrey-Clarke-Groves VCG auction.General cooperative data communications based on share auction is also studied in [7,19].
For our proposed cooperative video transmission, we study the video communications over the full-fledged cooperative network, and we focus on how to use relay nodes to improve the overall system performance, and especially on how to conduct resource allocation for relays.Each relay helps to connect a group of transmitters with a number of receivers.During the resource allocation process, the spectrum resources are first allocated for the transmitters who broadcast video packets to the relay and destination, and then for the relay nodes that transmit side information generated from the received packets to the destination, clearly to balance the resource allocation among source and relay nodes, and the resources used by the relays for each source are very critical for the overall network performance.We propose a quasishare auction-based approach, which explores the concept of share auction into this new domain.(In general the share auction concept cannot be naturally extended to video communications, due to the complexity to express the cooperative video end-to-end distortion and to obtain the close form update function.)Experimental results have demonstrated that the proposed approach has significant advantage of up to 1.3 dB gain over the reference system.In addition, it reduces the formidable computational complexity of the optimal solution to linear complexity with performance degradation of less than 0.3 dB.
This paper is organized as follows.In Section 2, the basics of cooperative transmission are studied, and the channel model, modulation, and coding scheme are discussed.In Section 3, the cooperative video transmission protocol is proposed and analyzed.In Section 4, the proposed resource allocation using quasishare auction is demonstrated and analyzed for multiuser case.A performance upper bound is also proposed.Simulations' results are shown in Section 5, and conclusions are drawn in Section 6.

Traditional Cooperative Communication Protocols and Channel Model
For the cooperative transmission system, we first consider a single source-destination case, in which there are source node s, relay node r, and destination node d.A more general multiuser case will be discussed in Section 4. The cooperative transmission consists of two phases.In Phase respectively, where P s represents the transmit power to the destination from the source, X s,d is the transmitted information symbol with unit energy at Phase 1 at the source, G s,d and G s,r are the channel gains from s to d and r, respectively, and n d and n r are the additive white Gaussian noises (AWGNs).Without loss of generality, we assume that the noise power is the same for all the links, denoted by σ 2 .We also assume that the channels are stable over each transmission frame.
For direct transmission, without the relay node's help, the signal-to-noise ratio (SNR) that results from s to d can be expressed by For the amplify-and-forward (AF) cooperation transmission, in Phase 2, the relay amplifies Y s,r and forwards it to the destination with transmitted power P r .The received signal at the destination is where is the energy-normalized transmitted signal from the source to the destination at Phase 1, G r,d is the channel gain from the relay to the destination, and n d is the received noise at Phase 2. Substituting (2) into (5), we can rewrite (4) as Using ( 6), the relayed SNR at the destination for the source can be obtained by Therefore, by ( 3) and ( 7), we have the combined SNR at the output of maximal ratio combining (MRC) as Notice that even though the SNR is improved, the bandwidth efficiency is reduced to half due to the half duplex of source transmission and relay transmission.
In the decode-and-forward (DF) cooperation transmission protocol, the relay decodes the source information in Phase 1 and retransmits to the destination in Phase 2. The destination combines the direct transmission information and relayed information together.The achievable rate can be calculated as follows: where In this paper, we assume Rayleigh fading scenario.The bit error rate for a packet can be written as [20] P r = 1 2 where Γ is either Γ DT in (3), Γ AF in (7), or Γ DF in (9), depending on the transmission protocol.If each packet has the length of L bits, the packet dropping rate is 1 − (1 − P r ) L .Reed-Solomon (RS) Code is an important subclass of the nonbinary BCH error-correcting codes in which the encoder operates on multiple bits rather than individual bits.An RS code is specified as RS(N, M).This means that the encoder takes M data symbols and adds parity symbols to make an N-symbol codeword.There are N − M parity symbols.An RS decoder can correct up to t symbols that contain errors in a codeword, where 2t = N −M.So by adapting t, we can have different level of channel protections.The coded BER can be closely bounded by [20] (Notice that BER and SER for RS code have the relation BER / SER = 2 (m−1) /(2 m − 1).( 13) is the performance bound which is accurate when m is large.)Here we assume that the BER is equal to 0.5 if the number of errors is greater than t.RS codes can also be shortened to fit different coding length requirements.

Proposed Cooperative Video Transmission
In this section, we first propose our protocol in Section 3.1.
Then an optimization problem is formulated to achieve the best performance in Section 3.2.We analyze the algorithm and discuss the implementation issues in Section 3.3 and Section 3.4, respectively.

Proposed Cooperative Video Transmission Protocols.
Currently, most of researches on cooperative transmission focus on data transmissions.However, video has different characteristics from generic data, such as decoding dependency and delay constraint.We propose cooperative protocols for video transmission to better utilize system resources for performance improvement.Moreover, because of the broadcast nature of the phase 1 in cooperative transmission, the source information is distributed over the relays without any cost.We can further improve end-to-end video quality via exploring source diversity using the idea of DSC.In Figure 1, we propose a cooperative video transmission protocol that can leverage the benefits of both cooperative transmission and the idea of DSC.Specifically, in the first phase, the source broadcasts the video to the relay and destination.In the second phase, the relay has two choices as follows.
(1) The relay can use AF or DF to relay the packets of coarse contents of the video.The destination combines the direct transmission and relay transmission to improve the quality of the received video with error concealment.
(2) The relay can transcode the received video to a coarse-quality video and then encode the coarsequality video using a systematic Reed-Solomon code.
Only the parity is transmitted to the destination.The destination decodes the video transmitted in the first stage and transcodes it using the same coding parameters used by the relay node to construct the coarse-quality video.This coarse-quality video will be combined with the parity check bits sent from the  relay to ensure the reconstructed coarse video quality which will be utilized for error concealment.(Notice that the relay might receive corrupted video packet.As a result, the relay might generate wrong parity bits and the performance at the destination can be impaired.To overcome this, source can use sufficient level of FEC to protect the video stream to transmit to relay and destination; so both relay and destination can have similar video quality.In other words, by carefully joint optimizing source coding and channel level along two paths, the final reconstructed video quality can be further improved.) We can see that the proposed protocol explores not only the inherited spatial diversity and multipath diversity from cooperative transmission, but also the source diversity from the idea of DSC.Moreover, the proposed scheme is backward compatible, in the sense that the source-todestination link is not modified.The current existing direct transmission scheme can coexist with the proposed scheme.This compatibility facilities the deployment of the proposed cooperative video transmission.
In the protocol, we assume that a control channel is available for the destination to know the processing procedures used in the relay node.However, the exchanging information, such as the RS coding rate, requires minimal of communication cost and update frequency.

Optimization of Proposed Protocols.
In this paper, we use 3D-SPIHT [16] as the video encoder, due to its advantage that SPIHT produces an embedded bitstream.Notice that if embedded video codecs are employed, the head segment of successful received packets serves as the coarse-quality version of the original video.Other video encoders can be implemented in a similar way.
Let us define D max as the distortion without receiving any packets, ΔD k as the distortion reduction when receiving packet k after successfully receiving packet 1, 2, . . ., k − 1, and P (X)  k as the probability that receiving all packets from packet 1 to k successfully using protocol X.The estimated distortion can be written as where K is the maximal number of packets constrained by the bandwidth.Notice that in order to decode the kth packet, packet 1 to packet k − 1 must be correctly decoded.
The problem is to optimize the power and bandwidth usage at the relay node under the system bandwidth and overall power constraints.For the power constraint, we assume the total overall power is bounded by P 0 .For the bandwidth constraint, we suppose the source and relays share the same channel, the total number of packets transmitted from source and relay is K, and the packet length is L.So the total bandwidth is W, which is the constraint for both the direct source-destination transmission and relay-destination transmission.For any cooperative protocol, we suppose the relay sends a total of k < K packets to the destination.Due to the bandwidth constraint, the direct transmission has only K − k packets for transmission instead.We define the bandwidth parameter as Notice that the constraints are the sum of bandwidth and the sum of power, which are fair compared to the direct transmission without cooperation.If we consider individual constraints (such as P s ≤ P 0 and P r ≤ P 0 ), the performance of the proposed scheme would be better since the constraints are looser.Moreover, if we also optimize the RS coding rate η = M/N, the problem can be formulated as min θ,Ps,Pr ,η power constraint: The problem in ( 16) is a constrained optimization problem.The objective function E[D] will be explained in the following subsection.The constraints are the bandwidth and power constraints which are linear.The objective functions for different protocols might not be linear.Some standard nonlinear approaches such as interior-point-method [21] can be employed to solve the problem.

Performance Analysis.
In this subsection, we study the performance of different transmission protocols.We define p s,r as the packet loss rate for sending a packet from source node to relay node, p r,d as the packet loss rate for sending a packet from the relay node to destination node, p s,d as the packet loss rate for sending a packet from the source node to destination node, p comb as the packet loss rate for sending a packet from source node to destination node using combined decoding, and p DSC as the packet loss rate for sending parity check bits from the relay.For direct transmission, relay transmission without combined decoding and relay transmission with combined decoding using AF/DF, we suppose that all transmissions are protected by RS(L, M 1 ), where L is the packet length and M 1 is the message length.

Direction Transmission.
The power for the source is P 0 .The successful transmission probability for receiving all correct packet 1 to packet k can be written as where p s,d can be calculated from (3), (12), and ( 13).The distortion is Notice that all bandwidth is used for direct transmission.

Relay Transmission without Combined
Decoding.We use equal power for the source and relay in this scenario.Using this protocol, the packet is lost if both the direct transmission and relay transmission fail.Thus, where the first case represents the situation where the relay retransmits the packets, while the second case represents the direct transmission only.The total transmitted packets from the source is reduced to K − k, due to the relay transmission.Then, we need to solve the following problem to achieve the minimal expected distortion: Clearly it can be solved by line-search over θ.

Relay Transmission with Combined Decoding
Using AF/DF.For AF, p comb can be calculated by ( 8), (12), and (13).For DF, p comb can be calculated by ( 9), (12), and (13).It can be proved that the power constraint and bandwidth constraint in ( 16) can be decoupled without loss of optimality.Due to the page limitation, we omit the proof.We assume that the power is optimally allocated in this case.Similarly to the previous case, we can write The first case and second case have the similar physical meaning as (20).Similar to (21), we can also write

Relay Transmission with Parity
Check.In our proposed protocol, instead of sending the original packets from the source, the relay encodes using another RS code RS(L, M 2 ), and sends the parity bits with length of L − M 2 only.The destination combines the direct transmission part of M 2 bits and the relay transmission bits to improve the link quality.In this case, θ = (L − M 2 )/L.Here we assume the equal power allocation for the source and relay.We can write where the packet error rate is the product of the successful packet transmission rate of source-to-relay path and the successful packet transmission rate after RS(L, M 2 ) decoding from the source to the destination, that is, Define t = (L − M 2 )/2.We have the BER after the decoding of RS(L, M 2 ) code for both direct transmission and relay transmission as Here P s,d r is the BER of direct transmission calculated from (3) and ( 12), and P r,d r is the BER of transmission from the relay to the destination calculated from and (12).We use the fact that the RS code can decode up to t errors in either direct transmission part or the relay transmission part in (26).Notice that in order to have the fair comparison with the other schemes, the direct transmission of this scheme is also protected by an RS code RS(M 2 , M 1 ), where M 1 is the length of original source bits per packet.

Implementation Consideration.
It is possible to incorporate other video transcoding/processing algorithms into the proposed system.For example, we can use a transcoder to convert the received video into a lower-resolution and lower-quality version after the following processing.(1) Use a down-sampling algorithm to change the resolution of the image, for example, the QCIF image (176×144) can be converted to a 96×80 resolution image using 6/11 horizontal scalar and 5/9 vertical scalar.The scaling ratio is adjustable.
(2) Use a QP for quantizing the DCT coefficients; (3) use a truncation tool to adjust the SNR quality.The trancoded version is packed in a single packet and transmitted to the destination.A certain time of retransmission is allowed for this packet.Therefore, the scalar, QP, and truncation parameters in the transcoder side can be jointly optimized with the source coding parameters at the transmitter side to achieve the best performance.In the receiver side, the received packets from the main channel and the relay channel are used together to recover the original videos.The information sent by relay channel can help to recover the lost packets sent via the main channel.Of course, the uppersampling is needed for the lower-resolution image to get back to the original size.The other issue is the complexity for coordination for resource allocation.The optimization in ( 16) is performed, and resource allocation parameters (such as bandwidth and power) are sent back to the source and relay.The size of the information (a few bytes in our case) is relatively trivial compared with the video packets.

Proposed Quasishare Auction Schemes for MultiUser Case
In the previous section, we study the single source-relaydestination case in which one relay tries to help one sourcedestination pair for the received PSNR.In this section, based on the proposed video cooperative protocol, we investigate multiuser case in which one relay tries to help a group of source-destination pairs to achieve the social optimum, that is, the overall PSNR.We first formulate the multiuser resource allocation problem for the relay node in Section 4.1.
Then, the quasishare auction is proposed and analyzed in Section 4.2.Finally, we employ one approach in the literature to our problem as the performance bound in Section 4.3.

Multiuser Resource Allocation for Relay
Node.We consider the full-fledged cooperative network, in which each node can serve as transmitter, relay, or receiver.To make problem a bit simpler, we assume that the nodes that play relay functions have been predetermined (so the relay node determination problem is not in the scope of this paper), so that each relay helps to connect a group of transmitters with a number of receivers as shown in Figure 2. In this paper, we suppose the cooperative transmission system has source node s i , one relay node r and destination node d i .Denote set I as I source-destination pairs accessing one particular relay node in the network.To achieve real-time transmission, the overall allocated transmission time slots for all nodes to transmit I GOPs is set to the required time to playback one GOP.We reserve t% of time slots for relay node.The rest of time slots are allocated to each source-destination pair equally.Due to the distributed location of the nodes, each source-destination pair experiences different channel condition in both direct and cooperative transmission path.Besides, since different sources transmit different video sequences and the contents are changing over time, the relay needs to dynamically adjust rate allocation to provide optimal video quality.The main issue is how to assign relay's time slots to each source-destination pair for delivering side information to achieve overall optimal video quality.Define θ i as the fraction of relay's time slots assigned to sourcedestination pair i and η i as the channel coding rate selected by the source i.We can formulate the considered network within each GOP time scale as min θi,ηi i∈I E D i θ i , η i , (28) By given one θ i , the minimal achievable distortion for received video at destination i can be calculated as follows: The problem in (30) can be solved locally in each source.
For the relay, the resource allocation problem is to optimize the overall distortion by dividing the relay's resources, which are the time slots.The problem can be formulated as In the next two subsections, we discuss two solutions to solve the problem in (31).

Proposed Quasishare Auction.
In this subsection, we find a distributed solution to solve (28).Due to the distributed nature, different source-destination pairs try to optimize their own performances in a noncooperative way.Notice that this noncooperation is between the different sourcedestination pairs, and cooperative transmission is employed for the relay retransmission.Based on the idea from share auction, we propose a quasishare auction that takes advantage of setting for cooperative video transmission.The rules of the quasishare auctions are described below.
(i) Information.Public available information includes noise density σ 2 and bandwidth W. The relay also announces a positive reserve bid (or reserve price in some literature) β > 0 and a price π > 0 to all sources.Each source i also knows the channel gains along direct and cooperative transmission path, namely, G si,di , G si,r , and G r,di .
(ii) Bids.Source i submits b i ≥ 0 to the relay.
(iii) Allocation.Relay allocates proportions of time slot for source-destination pair i according to (iv) Payments.In our case, source i pays the relay C i = πθ i .
A bidding profile is defined as the vector containing the sources' bids, b = (b 1 , . . ., b I ).The bidding profile of source i's opponents is defined as b where Each source chooses its price to maximize its payoff function in (34).If the price is increased, then from (33), the relay allocates more time slots to this user.As a result, the distortion is reduced.However, the cost C i also increases.Consequently, if the other users do not change their prices, there is an optimal point to set the price.Although video's rate-distortion (RD) curve is often a convex decreasing function; however, (35) is generally not a concave increasing function owing to applying optimization over all possible channel coding rate for each θ i in (30).Notice that above payoff function for the quasishare auction is similar to the soul of "Pricing Anarchy," in which the users pay the tax for their usage for the system resources.
Here, we omit the dependency on β.If the reserve bid β = 0, then the resource allocation in (33) only depends on the ratio of the bids.In other words, a bidding profile kb for any k > 0 leads to the same resource allocation, which is not desirable in practice.That is why we need a positive reserve bid.However, the value of β is not important as long as it is positive.For example, if we increase β to kβ, then sources can just scale b to kb, which results in the same resource allocation.For simplicity, we can simply choose β = 1 in the practice.
In (34), if the others' bidsb −i are fixed, source i can increase its time slot θ i in (33) by increasing b i .As a result, the distortion is reduced and ΔE[D i ] is improved.However, the payoff faction needs to pay the price for θ i .Depending one different price per unit π announced by the relay, there are three different scenarios:.
(1) If π is too small, the payoff function S i in (34) is still an increasing function.As a result, the source tries to maximize its own benefit by setting price high.
(2) If π is too large, the payoff function S i is a decreasing function.As a result, the source would not participate in the bidding by setting b i = 0.
(3) If π is set to the right value, the payoff function S i is a quasi-concave shape function, that is, it increases first and then decreases within the feasible region.Consequently, there is an optimal b i for the source to optimize its performance.
Based on the observation above, the quasishare auction algorithm is shown as follows.The relay conducts line search for π from the situation in which b i = 0, ∀i to the situation in which b i = ∞, ∀i.For each π, different sources set bids to optimize their own performances and report the expected distortion to the relay.By doing so, the computation is distributed to each source node.Among all π s' , the relay selects the solution with the best overall system performance and announces the final θ i to each source i.
Compared with the share auction and the proposed quasishare auction, the final results are the same if the bid update for share auction can be obtained and ΔE[D i ] is a concave increasing function.For data communication, the bids can be updated in a close form.However, due to the complexity to express the cooperative video endto-end distortion, the close form update function cannot be obtained.As a result, we can only apply the quasishare auction for the video cooperative transmission.

Performance Upper Bound.
In this subsection, we investigate a performance upper bound similar to the VCG auction proposed in the literature and compared with our proposed approach.(Notice that the VCG auction [22][23][24] is not the contribution of this paper.Moreover, we do not claim any efficiency result in a repeated dynamic setting, where more sophisticated strategies can be adopted.)In the performance upper bound, the relay asks all sources to reveal their evaluations of the relay's time slots, upon which the relay calculates the optimal resource allocation and allocates accordingly.A source pays the " performance loss" of other sources induced by its own participation of the auction.In the context of cooperative video transmissions, the performance upper bound can be described as follows.
(i) Information.Public available information includes noise density σ 2 and bandwidth W. Source s i knows channel gain G si,di .The relay knows channel gains G r,di for all i and can estimate the channel gains G si,r for all i when it receives bids from the sources.(ii) Bids.Source s i submits the function to the relay, which represents the distortion decrease as a function of the relay parameter θ i and channel gains G si,r and G r,di : (iii) Allocation.The relay determines the time slot allocation by solving the following problem (for notational simplicity we omit the dependence on G si,r and G r,di ), (iv) Payments.For each source i, the relay solves the following problem.
that is, the total distortion decreases without allocating resource to source i.The payment of source i is then that is, the performance loss of all other sources because of including source i in the allocation.
Source i in the performance upper bound obtains the payoff function as Although a source can submit any function it wants, it has been shown [22] that it is a (weakly) dominant strategy to bid truthfully, that is, revealing the true function form of its distortion decrease As a result, the resource allocation of the performance upper bound as calculated in (36) achieves the efficient allocation [22].Note that the sources do not need to know global network information, that is, no need of knowing the channel gains related to other sources in the network.The auction can achieve the efficient allocation in one shot, by allowing the relay to gather a lot of information and perform heavy but local computation.
Although the performance upper bound has the desirable social optimal, it is usually computationally expensive for the relay to solve I + 1 nonconvex optimization problems.To solve a nonconvex optimization, the common solution like interior point method needs a complexity of O(I 2 ).As the result, the overall complexity for the performance upper bound is O(I 3 ), while the proposed quasishare auction has linear complexity.Furthermore, there is a significant communication overhead to submit Q i (θ i ) for each source i, which is proportional to the number of source nodes and reserved time slot for relay node.In the proposed scheme, the bids and the corresponding resource allocation are iteratively updated.This is similar to the distributed power control case, where the signal-to-interference-noise ratio and power update are iteratively obtained.As a result, the overall signalling can be reduced.

Simulation Results
In order to test the proposed scheme, we set up two sets of simulations.First, we study the single sourcerelay-destination case for our proposed cooperative video transmission.Then, we investigate the multiuser case for the proposed resource allocation using auction theory.

Single Source-Relay-Destination
Case.The overall power is P 0 = 0.2 W, the noise power is -100 dbmw, and the propagation factor is 3.The source is located at the origin and the destination is located at (1000 m, 0 m).The relay is moved from the (100 m, 400 m) to (900 m, 400 m).The packet length is L = 255.Two tested video streams are Foreman and News in QCIF resolution (176 × 144) with refresh rate 30 frames per second.
In Figures 3 and 4, we show the PSNR as a function of the relay location for video News and video Foreman, respectively.Here we normalize the relay location in xaxis over the distance from the source to the destination.From the figures, we can see that the direct transmission has the worst performance and generates the unacceptable   reconstructed video quality.The cooperative transmission without combining of SNR at the receiver has the best performance when the relay is located at the middle of the source and the destination.For the AF protocol, the best performance is achieved when the relay is relatively close to the destination; for the DF protocol, the optimal relay location is toward the source, and the DF protocol has better performance than the AF protocol when the relay is close to the source.These facts are very different from the data domain cooperative transmission.Finally, the relay transmission with parity check (shown as coded coop) has superior performance (about 4 dB gain) than the other protocols when the source and relay are close.When the  relay is far away from the source, its performance degrades fast.This is because the performance is impaired by the source-relay link.On the whole, the proposed cooperative protocols achieve better performances than those of direct transmission, and the characteristics of the performance improvement are very different from the data domain cooperative protocols.
In Figure 5, we show the RS code rates for different videos of inner code (RS code for direct transmission) and outer code (RS code for relay transmission), respectively.We can see that the inner coding rate is reduced when the relay is far away from the source.This is because the source-relay channel needs more protection.On the other hand, when the relay is close to the source, the relay-destination link is protected more by the lower outer RS code rate.This twolevel RS codes provide the cooperative video transmission scheme with additional 4 dB gain in video quality.
Notice that the proposed cooperative system will not always perform well in every relay location.The location of relay needs to be close to the source-destination link.Otherwise, the cooperative transmission will not work, in the sense that the optimization in ( 16) degrades to traditional direct transmission with θ = 0.
The other concern is to study which protocol fits a certain situation best.For the AF/DF protocol, the received SNR can be significantly increased.This is especially true for low SNR case.However, the signal needs to be stored in the receiver for combining at the second state.This increases the implementation cost.For the relay transmission without combined decoding, the implementation cost is minor, but it has inferior performance when the SNR is low.The proposed scheme with parity check provides an improvement over the relay transmission without combined decoding in a cost effective manner.However, the relay needs to be close to the source to ensure a the good source-relay channel.

Multiple User Case.
For multiple user case, the simulations are setup as follows.The power for all source nodes and relay node is 0.1 W, the noise power is 5 * 10 −10 W, and the propagation factor is 3. Source node 1 to node 3 are located at (−400 m, 0 m), (−300 m, 50 m), and −200 m, −20 m), respectively.The corresponding destination node 1 to 3 are located at (200 m, 0 m), (400 m, 100 m), and (300 m, 30 m), respectively.The relay is located at the origin.We reserve 30% of bandwidth for relay to transmit the parity check bits.The packet length is L = 255.We use a 3D-SPIHT [16]    To demonstrate that the proposed scheme can utilize the relay's bandwidth effectively to achieve better perceptual quality, we compare the constant bit rate (CBR) scheme which allocates equal amount of time slots for relay to transmit parity bits for each video source.In Figure 6, we show the average PSNR gain when we compare the proposed scheme and the CBR scheme for all three video sets.As we can see, the proposed scheme can have PSNR gain between 0.8 dB and 1.3 dB when the received video quality is between 30 dB and 40 dB, which is a noticeable quality improvement.The performance gain achieved by the proposed scheme is mainly contributed by jointly leveraging the diversity of different video source RD characteristics and nodes' channel conditions, and dynamically allocating suitable amount of time slots to each video source.To further assess the impact of different level of motion activities, we show the PSNR performance for three different video sets in Figure 7.As revealed, the performance gain is consistent for all levels of motion activities owing to the dynamic resource allocation.
To evaluate how close the performance of the proposed scheme can approach to the optimal solution, we list the PSNR difference between the proposed scheme and the optimal solution in Tables 1, 2, and 3.As shown in these three tables, the performance loss is only between 0.1 dB and 0.3 dB.Note that the computation complexity and the communication overhead to obtain the optimal solution are extremely high.The proposed distributed scheme can achieve similar video quality by requiring much lower computation and communication overhead.

Conclusions
In this paper, we propose the cooperative video transmission protocols using auction theory.The source broadcasts its information in the first stage.The relay can either retransmit the low quality video packets or transmit the coded parity bits instead.The destination uses this relay information as side information to improve the quality of video transmission.We formulate the problem as to minimize the estimated distortion under the power and bandwidth constraints.Four different cooperative schemes are compared for the performance improvement over different scenarios and for the implementation concerns.The proposed video cooperative scheme has the best performance among all schemes, if the source and relay are closely located together.For multiuser case, we further propose the resource allocation for the relay to improve the multiuser cooperative video transmission using quasishare auction.Specifically, based on the observation of available information, we propose a quasishare auction for the relay to allocate the transmission time slots with improved signaling and convergence.Compared to the performance upper bound which is complicated and unpractical, the proposed quasishare auction can reduce the complexity, while the performance gap is only 0.1 dB to 0.3 dB.

Figure 2 :
Figure 2: Multiple User Resource Allocation in Relay.

Figure 5 :
Figure 5: RS Code Rate for Cooperative Protocol with Parity Check.

Figure 7 :
Figure 7: PSNR versus Bandwidth for Different Motion Activities.
codec to compress video sequence in QCIF resolution (176 × 144) with refresh rate 30 frames per second.The GOP is set to 16, and each source node will transmit 10 GOPs to its corresponding destination node.To evaluate the performance under different video content and different level of motion activity in the video sequence, we compare three different sets of video sequences.The first set consists of low motion video sequences: news, grandma, and akiyo.
The second set contains high motion video sequences stefan, foreman, and coastguard.The third set contains mixed level of motion video sequences, including silent, foreman, and news.