Loading...
Search for: constrained-markov-decision-process--cmdp
0.007 seconds

    Optimal relaying in a slotted aloha wireless network with energy harvesting nodes

    , Article IEEE Journal on Selected Areas in Communications ; Volume 33, Issue 8 , 2015 , Pages 1680-1692 ; 07338716 (ISSN) Moradian, M ; Ashtiani, F ; Sharif University of Technology
    Institute of Electrical and Electronics Engineers Inc  2015
    Abstract
    In this paper, we derive optimal policies for cooperation of a wireless node in relaying the packets of a source node, in a random access environment. In our scenario, the source node sends its packets by its harvested energy and the relay node exploits its harvested energy in relaying the source packets not detected successfully at the destination. The relaying policies determine whether the relay node accepts or rejects the unsuccessfully transmitted source packets and how the relay node prioritizes the accepted source packets to its own packets. The optimization goal is to minimize the average transmission delay of source packets with and without a constraint on the average transmission... 

    On tradeoff between collision and cooperation in a random access wireless network with energy harvesting nodes

    , Article IEEE Transactions on Vehicular Technology ; Volume 67, Issue 3 , 2018 , Pages 2501-2513 ; 00189545 (ISSN) Moradian, M ; Ashtiani, F ; Sharif University of Technology
    Institute of Electrical and Electronics Engineers Inc  2018
    Abstract
    In this paper, we investigate an energy harvesting cooperative network in which the cooperation is done in a random access environment. Although the cooperation provides an extra harvested energy supply for transmissions of the source, it causes probable collisions for the transmitted source packets. Thus, this kind of cooperation can improve or degrade the QoS of the source packets. We find the optimal policy in such a scenario to maximize the source throughput and derive the necessary and sufficient condition for no-cooperation policy to be throughput-optimal. Then, we prove that the maximum throughput is obtained by considering no-cooperation or full-cooperation policy depending on the...