Year-end Sale % OFF 
Abstract
This paper studies node cooperation in a wireless network from the MAC layer perspective. A simple relay channel with a source, a relay, and a destination node is considered where the source can transmit a packet directly to the destination or transmit through the relay. The tradeoff between average energy and delay is studied by posing the problem as a stochastic dynamical optimization problem. The following two cases are considered: 1) nodes are cooperative and information is decentralized, and 2) nodes are strategic and information is centralized. With decentralized information and cooperative nodes, a structural result is proven that the optimal policy is the solution of a Bellman-type fixed-point equation over a time invariant state space. For specific cost functions reflecting transmission energy consumption and average delay, numerical results are presented showing that a policy found by solving this fixed-point equation outperforms conventionally used time-division multiple access (TDMA) and random access (RA) policies. When nodes are strategic and information is common knowledge, it is shown that cooperation can be induced by exchange of payments between the nodes, imposed by the network designer such that the socially optimal Markov policy corresponding to the centralized solution is the unique subgame perfect equilibrium of the resulting dynamic game.
Accepted Version
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
