In this letter, a timing-offset estimation scheme is proposed for cooperative networks. The estimation scheme consists of coarse timing-offset estimation and fine timing-offset estimation. The presented scheme relies on periodic training data and linear mean square estimation for efficient estimation. The simulation results indicate that the performance of the proposed approach is better than or comparable to that of the conventional methods with lower computational complexity in the fine estimation.

We propose a distributed node selection (DNS) scheme that guarantees quality of service (QoS) of the scalable video broadcasting system over wireless channels. The proposed DNS scheme chooses the destination node based on the SVC layer information, and it selects the best relay from a set of competing candidate nodes by considering two factors: 1) wireless channel conditions between destination and relay candidates and 2) scalable video's layer information. In simulations, the performance of the proposed scheme in terms of quality gains, complexity (overhead) and applicability was examined.

In this paper, we present a cognitive relay network with two primary transceivers that communicate via several distributed relay terminals. Spectrum sensing is deployed at the relays to sense the absence/presence of the primary transceivers based on energy detection. The primary network utilizes a two-step two-way amplify-and-forward (AF) scheme by using the cognitive radio (CR) terminals as its relay nodes when the primary network is not in operation, in contrast, the CRs communicate with their own base station (BS). In the first relaying step, the primary transceivers send their signal to the CRs/relays. Distributed beamforming is then performed in the second relaying step. Our aim is to set the beamforming weights so as to minimize the total power dissipated in the relay network while satisfying a target signal-to-noise ratio (SNR) at the primary transceivers and at the cognitive BS. This is achieved by solving an optimization problem that we formulate as a nonconvex quadratically constrained quadratic program (QCQP). This problem is solved efficiently by semidefinite relaxation (SDR) and Lagrangian duality. Simulation results are provided to demonstrate the superiority of our proposed technique, compared to classical beamforming techniques, in terms of power reduction.

Overlay networks, such as P2P, Grid, and CDN, have been widely deployed over physical IP networks. Since simultaneous overlay networks compete for network resources, their selfish behaviors to improve their application-oriented QoS disrupt each other. To enhance the collective performance and improve the QoS at the application level, we consider so-called the overlay network symbiosis where overlay networks cooperate with each other. In this paper, we proposed a cooperative mechanism for hybrid P2P file-sharing networks, where peers can find more files and exchange files with more peers. Through simulation experiments, we verified the effectiveness of cooperation from view points of application and system.