Spectrum Sharing between Cooperative Relay and Ad-hoc Networks: Dynamic Transmissions under Computation and Signaling Limitations

This paper studies a spectrum sharing scenario between a cooperative relay network (CRN) and a nearby ad-hoc network. In particular, we consider a dynamic spectrum access and resource allocation problem of the CRN. Based on sensing and predicting the ad-hoc transmission behaviors, the ergodic traffic collision time between the CRN and ad-hoc network is minimized subject to an ergodic uplink throughput requirement for the CRN. We focus on real-time implementation of spectrum sharing policy under practical computation and signaling limitations. In our spectrum sharing policy, most computation tasks are accomplished off-line. Hence, little real-time calculation is required which fits the requirement of practical applications. Moreover, the signaling procedure and computation process are designed carefully to reduce the time delay between spectrum sensing and data transmission, which is crucial for enhancing the accuracy of traffic prediction and improving the performance of interference mitigation. The benefits of spectrum sensing and cooperative relay techniques are demonstrated by our numerical experiments.Comment: 5 pages, 3 figures, to appear in IEEE International Conference on Communications (ICC 2011

Optimal Distributed Resource Allocation for Decode-and-Forward Relay Networks

This paper presents a distributed resource allocation algorithm to jointly optimize the power allocation, channel allocation and relay selection for decode-and-forward (DF) relay networks with a large number of sources, relays, and destinations. The well-known dual decomposition technique cannot directly be applied to resolve this problem, because the achievable data rate of DF relaying is not strictly concave, and thus the local resource allocation subproblem may have non-unique solutions. We resolve this non-strict concavity problem by using the idea of the proximal point method, which adds quadratic terms to make the objective function strictly concave. However, the proximal solution adds an extra layer of iterations over typical duality based approaches, which can significantly slow down the speed of convergence. To address this key weakness, we devise a fast algorithm without the need for this additional layer of iterations, which converges to the optimal solution. Our algorithm only needs local information exchange, and can easily adapt to variations of network size and topology. We prove that our distributed resource allocation algorithm converges to the optimal solution. A channel resource adjustment method is further developed to provide more channel resources to the bottleneck links and realize traffic load balance. Numerical results are provided to illustrate the benefits of our algorithm

Optimal Real-time Spectrum Sharing between Cooperative Relay and Ad-hoc Networks

Optimization based spectrum sharing strategies have been widely studied. However, these strategies usually require a great amount of real-time computation and significant signaling delay, and thus are hard to be fulfilled in practical scenarios. This paper investigates optimal real-time spectrum sharing between a cooperative relay network (CRN) and a nearby ad-hoc network. Specifically, we optimize the spectrum access and resource allocation strategies of the CRN so that the average traffic collision time between the two networks can be minimized while maintaining a required throughput for the CRN. The development is first for a frame-level setting, and then is extended to an ergodic setting. For the latter setting, we propose an appealing optimal real-time spectrum sharing strategy via Lagrangian dual optimization. The proposed method only involves a small amount of real-time computation and negligible control delay, and thus is suitable for practical implementations. Simulation results are presented to demonstrate the efficiency of the proposed strategies.Comment: One typo in the caption of Figure 5 is correcte

Complete initial solutions for iterative pose estimation from planar objects

Camera pose estimation from the image of a planar object has important applications in photogrammetry and computer vision. In this paper, an efficient approach to find the initial solutions for iterative camera pose estimation using coplanar points is proposed. Starting with homography, the proposed approach provides a least-squares solution for absolute orientation, which has a relatively high accuracy and can be easily refined into one optimal pose that locates local minima of the according error function by using Gauss-Newton scheme or Lu's orthogonal iteration algorithm. In response to ambiguities that exist in pose estimation from planar objects, we propose a novel method to find initial approximation of the second pose, which is different from existing methods in its concise form and clear geometric interpretation. Thorough testing on synthetic data shows that combined with currently employed iterative optimization algorithm, the two initial solutions proposed in this paper can achieve the same accuracy and robustness as the best state-of-the-art pose estimation algorithms, while with a significant decrease in computational cost. Real experiment is also employed to demonstrate its performance

Finite iterative algorithms for solving generalized coupled Sylvester systems – Part I: One-sided and generalized coupled Sylvester matrix equations over generalized reflexive solutions

AbstractThe generalized coupled Sylvester systems play a fundamental role in wide applications in several areas, such as stability theory, control theory, perturbation analysis, and some other fields of pure and applied mathematics. The iterative method is an important way to solve the generalized coupled Sylvester systems. In this two-part article, finite iterative methods are proposed for solving one-sided (or two-sided) and generalized coupled Sylvester matrix equations and the corresponding optimal approximation problem over generalized reflexive solutions (or reflexive solutions). In part I, an iterative algorithm is constructed to solve one-sided and coupled Sylvester matrix equations (AY−ZB,CY−ZD)=(E,F) over generalized reflexive matrices Y and Z. When the matrix equations are consistent, for any initial generalized reflexive matrix pair [Y1,Z1], the generalized reflexive solutions can be obtained by the iterative algorithm within finite iterative steps in the absence of round-off errors, and the least Frobenius norm generalized reflexive solution pair can be obtained by choosing a special kind of initial matrix pair. The unique optimal approximation generalized reflexive solution pair [Y^,Z^] to a given matrix pair [Y0,Z0] in Frobenius norm can be derived by finding the least-norm generalized reflexive solution pair [Y∼∗,Z∼∗] of two new corresponding generalized coupled Sylvester matrix equations (AY∼-Z∼B,CY∼-Z∼D)=(E∼,F∼), where E∼=E-AY0+Z0B,F∼=F-CY0+Z0D. Several numerical examples are given to show the effectiveness of the presented iterative algorithm