Cooperation in wireless networks allows single antenna devices to improve their performance by fo... more Cooperation in wireless networks allows single antenna devices to improve their performance by forming virtual multiple antenna systems. However, performing a distributed and fair cooperation constitutes a major challenge. In this work, we model cooperation in wireless networks through a game theoretical algorithm derived from a novel concept from coalitional game theory. A simple and distributed merge-and-split algorithm is constructed to form coalition groups among single antenna devices and to allow them to maximize their utilities in terms of rate while accounting for the cost of cooperation in terms of power. The proposed algorithm enables the users to self-organize into independent disjoint coalitions and the resulting clustered network structure is characterized through novel stability notions. In addition, we prove the convergence of the algorithm and we investigate how the network structure changes when different fairness criteria are chosen for apportioning the coalition worth among its members. Simulation results show that the proposed algorithm can improve the individual user's payoff up to 40.42% as well as efficiently cope with the mobility of the distributed users.
Relay transmission or cooperative communication is an advanced technique that can improve the per... more Relay transmission or cooperative communication is an advanced technique that can improve the performance of data transmission among wireless nodes. However, while the performance (e.g., throughput) of a source node can be improved through cooperation with a number of relays, this improvement comes at the expense of a degraded performance for the relay nodes due to the resources that they dedicate for helping the source node in its transmission. In this paper, we formulate a coalitional game among the wireless nodes that seek to improve their performance by relaying each other's data. The game is classified as a coalition formation game in which the nodes can take individual and distributed decisions to join or split from a given coalition while ensuring that their individual throughput is maximized. A Markov chain model is proposed to investigate the stability of the resulting coalitional structures. Further, we consider the practical case in which the wireless nodes do not have an exact and perfect knowledge of the parameters (e.g., channel quality) in coalition formation. For this scenario, we analyze the stability of the partitions resulting from the proposed coalition formation game under uncertainty. We also define the conditions needed for obtaining the stable and unstable coalitional structures among the nodes that are performing cooperative transmission.
Cooperation in wireless networks allows single antenna devices to improve their performance by fo... more Cooperation in wireless networks allows single antenna devices to improve their performance by forming virtual multiple antenna systems. However, performing a distributed and fair cooperation constitutes a major challenge. In this work, we model cooperation in wireless networks through a game theoretical algorithm derived from a novel concept from coalitional game theory. A simple and distributed merge-and-split algorithm is constructed to form coalition groups among single antenna devices and to allow them to maximize their utilities in terms of rate while accounting for the cost of cooperation in terms of power. The proposed algorithm enables the users to self-organize into independent disjoint coalitions and the resulting clustered network structure is characterized through novel stability notions. In addition, we prove the convergence of the algorithm and we investigate how the network structure changes when different fairness criteria are chosen for apportioning the coalition worth among its members. Simulation results show that the proposed algorithm can improve the individual user's payoff up to 40.42% as well as efficiently cope with the mobility of the distributed users.
Relay transmission or cooperative communication is an advanced technique that can improve the per... more Relay transmission or cooperative communication is an advanced technique that can improve the performance of data transmission among wireless nodes. However, while the performance (e.g., throughput) of a source node can be improved through cooperation with a number of relays, this improvement comes at the expense of a degraded performance for the relay nodes due to the resources that they dedicate for helping the source node in its transmission. In this paper, we formulate a coalitional game among the wireless nodes that seek to improve their performance by relaying each other's data. The game is classified as a coalition formation game in which the nodes can take individual and distributed decisions to join or split from a given coalition while ensuring that their individual throughput is maximized. A Markov chain model is proposed to investigate the stability of the resulting coalitional structures. Further, we consider the practical case in which the wireless nodes do not have an exact and perfect knowledge of the parameters (e.g., channel quality) in coalition formation. For this scenario, we analyze the stability of the partitions resulting from the proposed coalition formation game under uncertainty. We also define the conditions needed for obtaining the stable and unstable coalitional structures among the nodes that are performing cooperative transmission.
Uploads
Papers by W SAAD