In bi-directional three-node cooperation, one regenerative strategy with network coding and power optimization is proposed for system sum-rate under a total energy constraint. In this paper, the network coding and pow...In bi-directional three-node cooperation, one regenerative strategy with network coding and power optimization is proposed for system sum-rate under a total energy constraint. In this paper, the network coding and power optimization are applied to improve system sum-rate. But max-rain optimization problem in power allocation is a NP-hard problem. In high Signal-to-Noise Ratio regime, this NP-hard problem is transformed into constrained polynomial optimization problem, which can be computed in polynomial time. Although it is a suboptimal solution, numerical simulations show that this strategy enhances the system sum-rate up to 45% as compared to a traditional four-phase strategy, and up to 13% as compared to the three-phase strategy without power optimization.展开更多
In this paper, the nonlinear optimization problems with inequality constraints are discussed. Combining the ideas of the strongly sub-feasible directions method and the s-generalized projection technique, a new algori...In this paper, the nonlinear optimization problems with inequality constraints are discussed. Combining the ideas of the strongly sub-feasible directions method and the s-generalized projection technique, a new algorithm starting with an arbitrary initial iteration point for the discussed problems is presented. At each iteration, the search direction is generated by a new s-generalized projection explicit formula, and the step length is yielded by a new Armijo line search. Under some necessary assumptions, not only the algorithm possesses global and strong convergence, but also the iterative points always get into the feasible set after finite iterations. Finally, some preliminary numerical results are reported.展开更多
基金Supported by the High Technology Research and Development Program of China (No. 2006AA01Z282 2007CB310608)
文摘In bi-directional three-node cooperation, one regenerative strategy with network coding and power optimization is proposed for system sum-rate under a total energy constraint. In this paper, the network coding and power optimization are applied to improve system sum-rate. But max-rain optimization problem in power allocation is a NP-hard problem. In high Signal-to-Noise Ratio regime, this NP-hard problem is transformed into constrained polynomial optimization problem, which can be computed in polynomial time. Although it is a suboptimal solution, numerical simulations show that this strategy enhances the system sum-rate up to 45% as compared to a traditional four-phase strategy, and up to 13% as compared to the three-phase strategy without power optimization.
基金supported by the National Natural Science Foundation of China under Grant Nos.71061002 and 10771040the Project supported by Guangxi Science Foundation under Grant No.0832052Science Foundation of Guangxi Education Department under Grant No.200911MS202
文摘In this paper, the nonlinear optimization problems with inequality constraints are discussed. Combining the ideas of the strongly sub-feasible directions method and the s-generalized projection technique, a new algorithm starting with an arbitrary initial iteration point for the discussed problems is presented. At each iteration, the search direction is generated by a new s-generalized projection explicit formula, and the step length is yielded by a new Armijo line search. Under some necessary assumptions, not only the algorithm possesses global and strong convergence, but also the iterative points always get into the feasible set after finite iterations. Finally, some preliminary numerical results are reported.
