Transmission scheduling in a multi‐channel wireless network with bidirectional relaying links. Issue 9 (27th April 2015)

• Record Type: Journal Article
• Authors: Mohseni, Maryam; Zhao, Dongmei
• Is Part Of: Wireless communications and mobile computing. Volume 16:Issue 9(2016)
• Page Start: 1095
• Page End: 1108
• Publication Date: 2015-04-27
• Subjects: network coding -- channel allocation -- scheduling; Wireless communication systems -- Periodicals; Mobile communication systems -- Periodicals; 621.38205
• DOI: 10.1002/wcm.2595
• Languages: English
• ISSNs: 1530-8669

Abstract

Abstract: Using network coding in a wireless network can potentially improve the network throughput. On the other hand, it increases the complexity of resource allocations as the quality of one transmission is affected by the link conditions of the transmitter to multiple receivers. In this work, we study time slot scheduling and channel allocations jointly for a network with bidirectional relaying links, where the two end nodes of each link can exchange data through a relay node. Two scenarios are considered when the relay node forwards packets to the end nodes. In the first scenario, the relay node always forwards network‐coded packets to both end nodes simultaneously; in the second scenario, the relay node opportunistically uses network coding for two‐way relaying and traditional one‐way relaying. For each scenario, an optimization problem is first formulated for maximizing the total network throughput. The optimum scheduling is not causal because it requires future information of channel conditions. We then propose heuristic scheduling schemes. The slot‐based scheduling maximizes the total transmission rate of all the nodes at each time slot, and the node‐based scheduling schedules transmissions based on achievable transmission rates of individual nodes at different channels. The node‐based one has lower complexity than the slot‐based one. Our results indicate that although the node‐based scheduling achieves slightly lower throughput than the slot‐based one, both the proposed scheduling schemes are very effective in the sense that the difference between their throughput and the optimum scheduling is relatively small in different network settings. Copyright © 2015 John Wiley & Sons, Ltd. Abstract : We study time slot scheduling and channel allocations jointly for a network with bidirectional relaying links in order to maximize the total network throughput. Different scheduling schemes are proposed. The slot‐based scheduling maximizes the total transmission rate of all nodes at each time slot, and the node‐based scheduling schedules transmissions based on achievable transmission rates of individual nodes at different channels. Our results indicate that both the proposed schemes can achieve close‐to‐optimum throughput in different network settings.