Relay selection for energy harvesting relay networks using a repeated game

Bahbahani, Mohammed S.; Alsusa, Emad

doi:10.1109/wcnc.2016.7564745

Cited by 9 publications

(6 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Also, the authors proposed a stable game cost factor that offers tradeoff between network performance and complexity. In [7], a multi-relay selection scheme for energy-harvesting cooperative networks with a single source-destination pair is studied via a repeated Stackelberg game with only statistical knowledge of channel gains and energy profiles. Particularly, AF relays are selected based on repeated interactions with the source, which updates its payment offers to sequentially induce utility-maximizing relays to participate in the transmission.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Multi-relay selection in energy-harvesting cooperative wireless networks: game-theoretic modeling and analysis

et al. 2019

Self Cite

View full text Add to dashboard Cite

This paper studies distributed multi-relay selection in energy-harvesting cooperative wireless networks and models it as an Indian Buffet Game (IBG). Particularly, the IBG is utilized to model the multirelay selection decisions of network source nodes, while account for negative network externality. Two scenarios are considered: (1) constrained selections (CS), and (2) unconstrained selections (US). In the former scenario, each source is constrained to a maximum number of relay selections; while in the latter scenario, the source nodes can select as many relays as possible. Since the relays are energy-harvesting-and thus intermittently harvest random amounts of energy-the accumulated energy at each relay is unknown to the source nodes, leading to uncertain relays' energy states. In turn, a non-Bayesian learning (NBL) algorithm is devised for the source nodes to learn the relays' energy states. After that, two distributed best-response (BR) recursive algorithms, namely BR-CS and BR-US, are proposed to allow the source nodes to make multi-relay selection decisions, while guaranteeing subgame perfect Nash equilib-This work is partially supported by the Kuwait Foundation for the Advancement of Sciences (KFAS), under project code PN17-15EE-02.

show abstract

Section: Introductionmentioning

confidence: 99%

“…It is noteworthy the learning process of each relay state θ r k is independent of the other relays, which significantly decreases computational costs 7. The more accurate the belief is, the better the relay selections of each source node are (i.e.…”

mentioning

confidence: 99%

Multi-relay selection in energy-harvesting cooperative wireless networks: game-theoretic modeling and analysis

et al. 2019

Self Cite

View full text Add to dashboard Cite

show abstract

“…proposed in [22] a noncooperative bargaining game to optimize the goodput of OFDM-based relaying networks with energy harvesting. Repeated non-cooperative Bayesian Stackelberg game has been employed in [23] for relay selection in EH relay networks. Stackelberg game is also used in [24] to manage the exchange of transmitted data and harvested energy in two-hop wireless networks where the base stations are able to wirelessly power the relays.…”

Section: A State-of-the-art Reviewmentioning

confidence: 99%

“…Approaches based on mere mathematical optimization and a-priori fixed relaying protocols like those of [15], [16] [17], [18], and [19] may lack of flexibility in addressing the QoS fluctuations due to unstable power supply and/or may be computationally expensive. Noncooperative game solutions of [22], [23] [24], [25], and [26], considering bargaining games or Stackelberg games, are inspired to centralized and strictly normative concepts aimed at disciplining the selfish behavior of agents. Such an approach does not seem the best way to model the distributed cooperation typical of MIMO-based relaying with energy harvesting, where agents should harmonize their behavior in order to exploit at their best the radio resources and the limited energy reserves.…”

Section: B Contribution Of the Papermentioning

confidence: 99%

MIMO-OFDM Based Energy Harvesting Cooperative Communications Using Coalitional Game Algorithm

Bannour¹,

Sacchi

Sun

2017

IEEE Trans. Veh. Technol.

View full text Add to dashboard Cite

In this paper, we consider the problem of cooperative communication between relays and base station in an advanced MIMO-OFDM framework, under the assumption that the relays are supplied by electric power drawn from energy harvesting (EH) sources. In particular, we focus on the relay selection, with the goal to guarantee the required performance in terms of capacity. In order to maximize the data throughput under the EH constraint, we model the transmission scheme as a non-transferable coalition formation game, with characteristic function based on an approximated capacity expression. Then, we introduce a powerful mathematical tool inherent to coalitional game theory, namely: the Shapley value (Sv) to provide a reliable solution concept to the game. The selected relays will form a virtual dynamically-configured MIMO network that is able to transmit data to destination using efficient space-time coding techniques. Numerical results, obtained by simulating the EH-powered cooperative MIMO-OFDM transmission with Algebraic Space-Time Coding (ASTC), prove that the proposed coalitional game-based relay selection allows to achieve performance very close to that obtained by the same system operated by guaranteed power supply. The proposed methodology is finally compared with some recent related state-of-the-art techniques showing clear advantages in terms of link performance and goodput.

show abstract

“…To this end, a number of researchers have investigated the problems of resource allocation and relay selection for battery powered networks [17] and EH networks [18] at the physical layer. Cooperation at the MAC layer was also shown to provide higher transmission rates and lower delays particularly in fading channels [19].…”

Section: Introductionmentioning

confidence: 99%

A Cooperative Clustering Protocol With Duty Cycling for Energy Harvesting Enabled Wireless Sensor Networks

Bahbahani

Alsusa

2018

IEEE Trans. Wireless Commun.

Self Cite

View full text Add to dashboard Cite

Abstract-This paper proposes a cooperative clustering protocol based on the low energy adaptive clustering hierarchy (LEACH) approach to enhance the longevity of energy harvesting based wireless sensor networks (EH-WSN). In the proposed protocol, to ensure that any energy consumption associated with the role of the cluster head (CH) is shared between the nodes, the CH role is alternated between the nodes using duty cycling as a function of their individual energy harvesting capabilities. Furthermore, to maintain an energy neutral operation when not acting as a CH, the nodes adopt a data transmission duty cycle and any excess energy is invested in relaying other nodes' packets. To optimize the relaying performance, a novel crosslayer cooperative TDMA scheme is also presented. The optimal number of clusters in an EH-WSN is analyzed in terms of energy consumption, latency and bandwidth utilization. Simulations, performed using GreenCastalia, demonstrate tangible performance enhancements in adopting the proposed protocol over benchmark schemes in terms of throughput and lifetime, particularly under highly constrained energy conditions.

show abstract

Relay selection for energy harvesting relay networks using a repeated game

Cited by 9 publications

References 17 publications

Multi-relay selection in energy-harvesting cooperative wireless networks: game-theoretic modeling and analysis

Multi-relay selection in energy-harvesting cooperative wireless networks: game-theoretic modeling and analysis

MIMO-OFDM Based Energy Harvesting Cooperative Communications Using Coalitional Game Algorithm

A Cooperative Clustering Protocol With Duty Cycling for Energy Harvesting Enabled Wireless Sensor Networks

Contact Info

Product

Resources

About