A new cooperative diversity algorithm with quality of service （QoS） awareness for wireless local area network （WLAN） is proposed. According to this protocol, cooperation is invoked only if a direct transmission cannot meet user-specific QoS requirements. If cooperation is implemented, partner choice depends on who can achieve the minimum data rate required to have a successful transmission. The closed-form expressions for the system throughput and the power consumption are provided. Theoretical analysis and simulation results indicate that the QoS-aware cooperative scheme can significantly improve the system performance in terms of throughput and energy efficiency by avoiding negative effect of unconditional cooperation.
In order to resolve the relay selection problem in wireless mobile relay networks （WMRNs）, a novel balanced energy-efficient mobile relay selection scheme is proposed in this paper. Compared with traditional counter-based algorithm, distance and energy consumption are considered from network respect to provide a better network lifetime performance in the proposed scheme. Also, it performs well when nodes move freely at high speed. A random assessment delay （RAD） mechanism is added to avoid collisions and improve transmission efficiency. Simulation results reveal that, the proposed scheme has advantages in prolonging network lifetime, balancing energy compared with existing counter-based scheme. consumption and reducing the total energy consumption
We formulate the subcarrier and power allocation problem in cognitive radio networks employing orthogonal frequency division multiplexing （OFDM） as a non-linear optimization problem with the objective of maximizing sum capacity under constraints of available subcarriers, interference temperature, power budget, etc. A close-to-optimal solution with much reduced complexity is proposed to separate the problem into two steps, which also considers fairness among secondary users. A fair al- gorithm for subcarrier allocation （FA_SA） is firstly presented. Secondly, a fast iterative water-filling algorithm for power allocation （FIWFA_PA） is also proposed to maximize the sum capacity. Exten- sive simulation results show that sum capacity performance of our low-complexity solution is very close to the optimal one, while significantly improving fairness and reducing computation complexity compared with the existing solutions.
In order to improve the performance of peer-to-peer files sharing system under mobile distributed en- vironments, a novel always-optimally-coordinated （AOC） criterion and corresponding candidate selection algorithm are proposed in this paper. Compared with the traditional min-hops criterion, the new approach introduces a fuzzy knowledge combination theory to investigate several important factors that influence files transfer success rate and efficiency. Whereas the min-hops based protocols only ask the nearest candidate peer for desired files, the selection algorithm based on AOC comprehensively considers users＇ preferences and network requirements with flexible balancing rules. Furthermore, its advantage also expresses in the independence of specified resource discovering protocols, allowing for scalability. The simulation results show that when using the AOC based peer selection algorithm, system performance is much better than the rain-hops scheme, with files successful transfer rate improved more than 50% and transfer time re- duced at least 20%.
