Energy-efficient power allocation for selfish cooperative communication networks using bargaining game

In commercial networks,user nodes operating on batteries are assumed to be selfish to consume their energy solely to maximize their own benefits,e.g.,data rates.In this paper,we propose a bargaining game to perform the power allocation for the selfish cooperative communication networks.In our system,two partner nodes can act as a source as well as a relay for each other,and each node is with an energy constraint to transmit one frame.Consider a selfish node is willing to seek cooperative transmission only if the data rate achieved through cooperation will not lower than that achieved through noncooperation by using the same amount of energy.The energy-efficient power allocation problem can be modeled as a cooperative game.We proved that there exists a unique Nash bargaining solution (NBS) for the game by verifying that the game is indeed a bargaining problem.Thus,the two objectives,i.e.,system efficiency and user fairness specified in the selfish networks can be achieved.Simulation results show that the NBS scheme is efficient in that the performance loss of the NBS scheme to that of the maximal overall rate scheme is small while the maximal-rate scheme is unfair.The simulation results also show that the NBS result is fair in that both nodes could experience better performance than they work independently and the degree of cooperation of a node only depends on how much contribution its partner can make to improve its own performance.     

Bargaining game theoretic power control in selfish cooperative relay networks

Wireless cooperative communications require appropriate power allocation (PA) between the source and relay nodes. In selfish cooperative communication networks, two partner user nodes could help relaying information for each other, but each user node has the incentive to consume his power solely to decrease its own symbol error rate (SER) at the receiver. In this paper, we propose a fair and efficient PA scheme for the decode-and-forward cooperation protocol in selfish cooperative relay networks. We formulate this PA problem as a two-user cooperative bargaining game, and use Nash bargaining solution (NBS) to achieve a win-win strategy for both partner users. Simulation results indicate that the NBS is fair in that the degree of cooperation of a user only depends on how much contribution its partner can make to decrease its SER at the receiver, and efficient in the sense that the SER performance of both users could be improved through the game.     

Pareto optimal time-frequency resource allocation for selfish wireless cooperative multicast networks

In selfish wireless cooperative multicast networks （WCMNs）, a source node wants to achieve the optimal benefit （i.e., rate gain）, while the relaying nodes are willing to get fairness rewards （i.e., rate gains） from the source for the cooperative relaying. In this paper, we implement these two different objectives for the source and the relays through the Pareto optimal resource allocation. Define the cooperative strategy of a node as the fraction of a data-frame that it is willing to contribute to its cooperative partners. Consider the rational decision made by one node will definitely affect its cooperative partners＇ choice. Then, we can formulate this resource sharing problem as a Nash bargaining problem （NBP）, and the Nash bargaining solution （NBS） to the NBP encapsulates the Pareto optimality naturally. Finally, to enable the nodes to be capable of computing the NBS cooperative strategies rapidly as the wireless channel changes, we propose a fast particle swarm optimizer （PSO） algorithm to search for the NBS. Simulation results show that the two specified objectives of the source and the relays can be implemented in the Pareto optimal sense, i.e., the source can achieve a significant performance gain in comparison with direct multicast and the relays can get a fair reward by the source according to the level of contribution it has made to improve the performance of the source.     

Game Theoretic subcarrier and power allocation for wireless OFDMA networks

This paper proposes a bargaining game theoretic resource(including the subcarrier and the power) allocation scheme for wireless orthogonal frequency division multiple access(OFDMA) networks.We define a wireless user s payoff as a function of the achieved data-rate.The fairness resource allocation problem can then be modeled as a cooperative bargaining game.The objective of the game is to maximize the aggregate payoffs for the users.To search for the Nash bargaining solution(NBS) of the game,a suboptimal subcarrier allocation is performed by assuming an equal power allocation.Thereafter,an optimal power allocation is performed to maximize the sum payoff for the users.By comparing with the max-rate and the max-min algorithms,simulation results show that the proposed game could achieve a good tradeoff between the user fairness and the overall system performance.     

Outage probability analysis for superposition coded symmetric relaying

Superposition coded symmetric relaying is a bandwidth-efficient cooperative scheme where each source node simultaneously transmits both its own "local" packet and "relay" packet that originated at its partner by adding the modulated local and relay signals in Euclidean space. This paper investigates the power allocation and outage probability of a superposition coded symmetric relaying system with finite-constellation signaling. We first derive the mutual information (MI) metrics for the system. The derived MI metrics consist of two parts: one represents the MI conveyed by the modulated signal corresponding to its own data, and the other represents the MI conveyed by the modulated signal corresponding to its partner’s data. Using MI based effective signal-to-noise ratio mapping technique, we attain expressions for the outage probability. Furthermore, we discuss power allocation policies that minimize the outage probability. Simulation results are presented to verify the correctness of the outage probability analysis and the benefits of the power allocation.     

Joint relay selection and power allocation for amplify-and-forward two-path relaying networks

This paper presents a joint relay selection and power allocation scheme for amplify-and-forward two-path relaying networks,in which diferent relay nodes forward information symbols alternatively in adjacent time slots.Our approach is based on the maximization of the received signal-to-noise ratio under total power consumption by the transmission of the symbol.We show that in spite of inter-relay interferences,the maximization problem has a closed-form solution.Simulation results explicitly indicate that the performance of proposed approach outmatches the existing methods including equal power allocation and one-path relaying.     

Reliability and Feedback of Multiple Hop Wireless Networks

This paper analyzes fault-tolerance over the entire design life of a class of multiple-hop wireless networks, where cooperative transmission schemes are used. The networks are subject to both node failure and random channel fading. A node lifetime distribution is modeled with an increasing failure rate, where the node power consumption level enters the parameters of the distribution. A method for assessing both link and network reliabilities projected at the network's design life is developed. Link reliability is enhanced through use of redundant nodes. The number of redundant nodes is restricted by the cooperative transmission scheme used. The link reliability is then used to establish a re-transmission control policy that minimizes an expected cost involving power, bandwidth expenditures, and packet loss. The benefit and cost of feedback in network operations are examined. The results of a simulation study under specific node processing times are presented. The study quantifies the effect of loop closure frequency, acknowledgment deadline, and nodes' storage capacity on the performance of the network in terms of network lifetime, packet loss rate, and false alarm rate. The study concludes that in a network where energy is severely constrained, feedback must be applied judiciously.     

Utility-based bandwidth allocation algorithm for heterogeneous wireless networks

In next generation wireless network (NGWN), mobile users are capable of connecting to the core network through various heterogeneous wireless access networks, such as cellular network, wireless metropolitan area network (WMAN), wireless local area network (WLAN), and ad hoc network. NGWN is expected to provide high-bandwidth connectivity with guaranteed quality-of-service to mobile users in a seamless manner; however, this desired function demands seamless coordination of the heterogeneous radio access network (RAN) technologies. In recent years, some researches have been conducted to design radio resource management (RRM) architectures and algorithms for NGWN; however, few studies stress the problem of joint network performance optimization, which is an essential goal for a cooperative service providing scenario. Furthermore, while some authors consider the competition among the service providers, the QoS requirements of users and the resource competition within access networks are not fully considered. In this paper, we present an interworking integrated network architecture, which is responsible for monitoring the status information of different radio access technologies (RATs) and executing the resource allocation algorithm. Within this architecture, the problem of joint bandwidth allocation for heterogeneous integrated networks is formulated based on utility function theory and bankruptcy game theory. The proposed bandwidth allocation scheme comprises two successive stages, i.e., service bandwidth allocation and user bandwidth allocation. At the service bandwidth allocation stage, the optimal amount of bandwidth for different types of services in each network is allocated based on the criterion of joint utility maximization. At the user bandwidth allocation stage, the service bandwidth in each network is optimally allocated among users in the network according to bankruptcy game theory. Numerical results demonstrate the efficiency of the proposed algorithm.     

A novel threshold-based quadrature signaling scheme for cooperative networks

Presented is a novel threshold-based quadrature signaling(TQS)scheme for cooperative networks.By assigning different components of the quadrature signaling to different cooperative users and letting each user node decide whether to relay information for the other in the assigned component based on a threshold or not,independently,the TQS scheme effectively integrated the advantages of both quadrature signaling and threshold techniques.The authors investigate the end-to-end bit error rate(BER)performance and obtain its closed-form expression.According to our theoretical analysis,the TQS scheme can enhance the diversity gain of a cooperative system and,meanwhile,reduce the complexity of its implementation to a great extent.In addition,the communication system,using TQS scheme,has the feature of easily switching between cooperative and non-cooperative patterns.Finally,the numerical and simulation results show that the scheme has excellent performance as expected.     

Optimal Relay Assignment and Power Allocation for Cooperative Communications

Cooperative communication for wireless networks has gained a lot of recent interest due to its ability to mitigate fading with exploration of spatial diversity. In this paper, we study a joint optimization problem of jointly considering transmission mode selection, relay assignment and power allocation to maximize the capacity of the network through cooperative wireless communications. This problem is much more challenging than relay assignment considered in literature work which simply targets to maximize the transmission capacity for a single transmission pair. We formulate the problem as a variation of the maximum weight matching problem where the weight is a function over power values which must meet power constraints (VMWMC). Although VMWMC is a non-convex problem whose complexity increases exponentially with the number of relay nodes, we show that the duality gap of VMWMC is virtual zero. Based on this result, we propose a solution using Lagrange dual decomposition to reduce the computation complexity. We do simulations to evaluate the performance of the proposed solution. The results show that our solution can achieve maximum network capacity with much less computation time compared with exhaustive search, and our solution outperforms existing sub-optimal solutions that can only achieve much lower network capacity.     

A cooperation strategy based on bargaining solution in wireless sensor networks

This paper presents a symmetric cooperation strategy for wireless sensor networks, aiming to improve the transmission efficiency of the network. The cooperation strategy is implemented by partitioning the nodes into several cooperative groups. Then, in each group, the optimal cooperative bandwidth allocation is obtained based on Raiffa-KalaiSmorodinsky bargaining solution (RBS). Numerical results show that the symmetric cooperation strategy can improve the sensor node’s transmission efficiency dramatically.     

Statistically robust resource allocation for distributed multi-carrier cooperative networks

In this paper, we investigate joint subcarrier and power allocation scheme for distributed multicarrier cooperative networks with imperfect channel state information. Using practical channel estimation algorithms, the statistic model of the channel estimation error is first derived. Then based on the channel error model, the resource allocation scheme aims at maximizing the sum rate of the overall network. Specifically, both subcarrier allocation and power allocation are taken into account. In the subcarrier allocation, a realistic problem of the power leakage between neighboring subcarriers is also addressed. Furthermore, based on Lagrange dual-decomposition algorithm, a practical power allocation algorithm is proposed. Finally, the simulation results demonstrate the performance advantages of the proposed robust design.     

Joint subcarrier,code, and power allocation for parallel multi-radio access in heterogeneous wireless networks

In the heterogeneous wireless networks, it has been proved that the joint spectrum and power allocation can achieve network diversity gains for parallel multi-radio access in theory. This article aims to develop an effective and practical algorithm of joint subearrier, code, and power allocation for parallel multi- radio access of the downlink in heterogeneous wireless networks （e.g., CDMA and OFDMA）. Firstly, we propose a unified framework to formulate the subcarrier, code, and power allocation as an optimization problem. Secondly, we propose a resource element （subcarrier and code） scheme based on the threshold type. Simulation results show that the proposed scheme outperforms the existing algorithm for considered wireless scenarios.     

Joint adaptive power allocation and interference suppression algorithms based on theMSER criterion for wireless sensor networks

In this study, a two-hop wireless sensor network with multiple relay nodes is considered where the amplify-and-forward （AF） scheme is employed. Two algorithms are presented to jointly consider interference suppression and power allocation （PA） based on the minimization of the symbol error rate （SER） criterion. A stochastic gradient （SG） algorithm is developed on the basis of the minimum-SER （MSER） criterion to jointly update the parameter vectors that allocate the power levels among the relay sensors subject to a total power constraint and the linear receiver. In addition, a conjugate gradient （CG） algorithm is developed on the basis of the SER criterion. A centralized algorithm is designed at the fusion center. Destination nodes transmit the quantized information of the PA vector to the relay nodes through a limited-feedback channel. The complexity and convergence analysis of the proposed algorithms are carried out. Simulation results show that the proposed two adaptive algorithms significantly outperform the other previously reported algorithms.     

On power allocation for a cognitive radio network with hybrid spectrum sharing

In this study we propose a hybrid spectrum sharing scheme based on power control by combining Overlay with Underlay schemes,to improve radio spectrum efficiency.In the scheme,the secondary users dynamically switch their operational states between Overlay and Underlay according to the spectrum occupancy.Thus the dynamics of the primary network is first modeled with a discrete-state Markov process to find the time fraction of secondary users in the Overlay state and that in the Underlay state,which leads to the capacity model of the hybrid spectrum sharing system.Under the criterion of maximizing capacity,the power allocation of the cognitive network is researched and the optimum power allocation for secondary users is deduced.As a result,the maximum achievable capacity of the cognitive network is obtained.Simulations are given to prove the analysis further.Theoretical and simulated results indicate that hybrid spectrum sharing based on power control provides a higher capacity than single Overlay and Underlay systems for the cognitive network,i.e.,hybrid spectrum sharing can further improve radio spectrum efficiency.     

Reliable energy-efficient routing with novel route update in wireless sensor networks

In this paper we introduce a novel energy-aware routing protocol REPU (reliable, efficient with path update), which provides reliability and energy efficiency in data delivery. REPU utilizes the residual energy available in the nodes and the received signal strength of the nodes to identify the best possible route to the destination. Reliability is achieved by selecting a number of intermediate nodes as waypoints and the route is divided into smaller segments by the waypoints. One distinct advantage of this model is that when a node on the route moves out or fails, instead of discarding the whole original route, only the two waypoint nodes of the broken segment are used to find a new path. REPU outperforms traditional schemes by establishing an energy-efficient path and also takes care of efficient route maintenance. Simulation results show that this routing scheme achieves much higher performance than the classical routing protocols, even in the presence of high node density, and overcomes simultaneous packet forwarding.     

Acyclic orientation graph coloring for software-managed memory allocation

This paper presents a novel compiler algorithm,called acyclic orientation graph coloring(AOG coloring),for managing data objects in software-managed memory allocation.The key insight is that softwaremanaged memory allocation could be solved as an interval coloring problem,or equivalently,an acyclic orientation problem.We generalize graph coloring register allocation to interval coloring memory allocation by maintaining an acyclic orientation to the currently colored subgraph.This is achieved with some well-crafted heuristics,including Aggressive Simplify that does not necessarily preserve colorability and Best-Fit Select that assigns intervals(i.e.,colors)to nodes by possibly adjusting the colors already assigned to other nodes earlier.Our algorithm generalizes and subsumes as a special case the classical graph coloring register allocation algorithm without notably increased complexity:it deals with memory allocation while preserving the elegance and practicality of traditional graph coloring register allocation.We have implemented our algorithm and tested it on Appel’s 27921 interference graphs for scalars(augmented with node weights).Our algorithm outperforms Memory Coloring,the best in the literature,for software-managed memory allocation,on 98.64%graphs,in which,the gaps are more than 20%on 68.31%graphs and worse only on 0.29%graphs.We also tested it on all the 73 DIMACS weighted benchmarks(weighted graphs),AOG Coloring outperforms Memory Coloring on all of the benchmarks,in which,the gaps are more than 20%on 83.56%graphs.     

A simple fault-tolerant adaptive and minimal routing approach in 3-D meshes

In this paper we propose a sufficient codition for minimal routing in 3-dimensional (3-D) meshes with faulty nodes,It is based on an early work of the author on minial routing in 2-dimensional(2-D) meshes,Unlike many traditional models that assume all the nodes know global fault distribution or just adjacent fault information,our approach is based on the concept of limited global fault information,First,we propose a fault model called faulty cube in which all faulty nodes in the system are contained in a set of faulty cubes.Fault information is then distributed to limited number of nodes while it is still sufficeint to support minimal routing.The limited fault information collcted at each node is represented by a vector caaled extended safety level.The extended safety level associated with a node can be used to determine the existence of a minimal path from this node to a given destination .Specifically,we study the existence of minimal paths at a given source node,limited distribution of fault information,minimal routing,and deadlock-free and livelock-free routing.our results show that any minimal routing that is partially adaptive can be applied in our model as long as the dstination node meets a certain conditon.We also propose a dynamic planar-adaptive routing scheme that offers better fault tolerance and adaptivity than the planar-adaptive routing scheme in 3-D meshes.Our approach is the first attempt to address adaptive and minimal routing is 3-D meshes with faulty nodes using limited fault information.     

Resource allocation algorithm with limited feedback for multicast single frequency networks

The single frequency network (SFN) can provide a multimedia broadcast multicast service over a large coverage area. However, the application of SFN is still restricted by a large amount of feedback. Therefore, we propose a multicast resource allocation scheme based on limited feedback to maximize the total rate while guaranteeing the quality of service (QoS) requirement of real-time services. In this scheme, we design a user feedback control algorithm to effectively reduce feedback load. The algorithm determines to which base stations the users should report channel state information. We then formulate a joint subcarrier and power allocation issue and find that it has high complexity. Hence, we first distribute subcarriers under the assumption of equal power and develop a proportional allocation strategy to achieve a tradeoff between fairness and QoS. Next, an iterative water-filling power allocation is proposed to fully utilize the limited power. To further decrease complexity, a power iterative scheme is introduced. Simulation results show that the proposed scheme significantly improves system performance while reducing 68% of the feedback overhead. In addition, the power iterative strategy is suitable in practice due to low complexity.     

Multi-channel power allocation based on market competitive equilibrium in cognitive radio networks

Cognitive radios such as intelligent phones and Bluetooth devices have been considered essential goods in next-generation communication systems.Such devices will have to share the same frequency band owing to the limited bandwidth resource.To improve spectrum efciency,we formulate multi-channel power allocation as a market competitive equilibrium(CE)problem,and prove that its solution exists and is unique under the condition of weak interference.We then propose two distributed power allocation algorithms achieving CE,namely the fast convergent power allocation algorithm(FCPAA)and the social-fairness-aware FCPAA(SFAF).Theoretical analysis and simulation results demonstrate that the proposed algorithms lead to better system performance in terms of the guaranteed interference temperature constraint using the price mechanism instead of a strategy based on the Nash equilibrium.Moreover,it is shown that the FCPAA maximizes total utility,and converges more quickly than the method addressed in prior research with the help of improved round-robin rules.However,the FCPAA cannot ensure the same social fairness among secondary users as the SFAF scheme in both the non-fading channel and Rayleigh fading channel;the SFAF balances the individual utility by adjusting each user’s budget at the expense of a small quantity of system total throughput.