In this paper, game theory is exploited to derive a novel solution to manage virtual antenna array based transmissions in an ad hoc wireless network consisting of selfish nodes. In the proposed strategy each node decides, in an autonomous fashion, whether and when transmitting data packets over a shared wireless channel. The resulting transmission scheme results to be functionally equivalent to a distributed transmission selection scheme, managed, however, in a fully distributed fashion. This approach offers an higher throughput level and an higher efficiency than other communication protocols implementing selection diversity in distributed multi-antenna systems.

In this paper, the problem of node management in the presence of randomized cooperation is tackled. First, game theory is exploited to model the problem of setting up a cluster of cooperative nodes in a wireless network as a multiplayer noncooperative game. In this game the set of players is made of all the nodes belonging to a potential relay cluster an d the set of actions for each player consists of two options only (characterized by different payoffs), namely transmitting a data packet or remaining silent. Then, a novel strategy for the management of node participation to a distributed cooperative link is derived. The proposed solution is fully distributed, is characterized by autonomous choices made by each potential relay and is of significant practical interest since it guarantees the participation of a proper number of nodes to a virtual antenna array (so avoiding an energy waste associated with an excessive number of cooperating nodes) without requiring any overhead for node management.

This paper proposes a new architecture for cooperative communication in wireless ad-hoc networks particularly suitable to emergency and safety applications. The proposed solution is characterized by the following relevant features: (a) a wireless connection between each couple of network nodes is established via multiple relays; (b) each source-to-destination link is characterized by a double string topology allowing the use of specific transmit diversity techniques for reliable communications; (c) a novel utility-based and distributed routing algorithm providing a fair exploitation of the available resources is employed. Simulation results evidence that our solution offers substantial energy savings with respect to traditional ad-hoc architectures.

In this paper game theory is exploited to derive an optimal solution to the problem of cooperative data transmission based on distributed selection diversity in an ad hoc wireless network consisting of selfish nodes. First, a credit-based micro-economical model is proposed to manage node interaction; then, a transmission strategy maximizing node utility is derived. In the proposed strategy each node decides, in an autonomous fashion, whether and when transmitting data packets over a shared wireless channel. Numerical results evidence that this approach can ensure both fairness in the access to a shared medium and excellent network efficiency. In particular, it offers an higher throughput level than other communication protocols implementing selection diversity in distributed multi-antenna systems.