Wireless Communications: Principles and Practice
Wireless Communications: Principles and Practice
Wireless Communications
Fundamentals of wireless communication
Fundamentals of wireless communication
rDCF: A Relay-Enabled Medium Access Control Protocol for Wireless Ad Hoc Networks
IEEE Transactions on Mobile Computing
Foundations and Trends® in Networking
Cooperative Communications and Networking
Cooperative Communications and Networking
An algorithm for wireless relay placement
IEEE Transactions on Wireless Communications
TDMA scheduling algorithms for wireless sensor networks
Wireless Networks
Error modeling schemes for fading channels in wireless communications: A survey
IEEE Communications Surveys & Tutorials
Cooperative communications with relay-selection: when to cooperate and whom to cooperate with?
IEEE Transactions on Wireless Communications
Capacity theorems for the relay channel
IEEE Transactions on Information Theory
Cooperative diversity in wireless networks: Efficient protocols and outage behavior
IEEE Transactions on Information Theory
CoopMAC: A Cooperative MAC for Wireless LANs
IEEE Journal on Selected Areas in Communications
Grouping and partner selection in cooperative wireless networks
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.00 |
In this paper we consider a scenario in which a set of source nodes wishes to transmit real-time data packets periodically to a central controller over lossy wireless links, while using a TDMA-based medium access control protocol. Furthermore, a number of relay nodes are present which can help the source nodes with packet retransmissions. The key question we consider in this paper is how to schedule the TDMA slots for retransmissions while taking advantage of the relay nodes, so that the average number of packets missing their deadlines is minimized. We provide a problem formulation for the general deadline-aware TDMA relay scheduling problem. Since the design space of the general problem is large, we also present one particular class of restricted TDMA relay scheduling problems. We suggest and numerically investigate a range of algorithms and heuristics, both optimal and suboptimal, of the restricted scheduling problem, which represent different trade-offs between achievable performance and computational complexity. Specifically, we introduce two different Markov Decision Process (MDP) based formulations for schedule computation of the restricted TDMA relay scheduling problem. One MDP formulation gives an optimal schedule, another (approximate) formulation gives a sub-optimal schedule which, however, comes very close to the optimal performance at much more modest computational and memory costs.