2011/07/11 by Hong‐Ning Dai, Hong-Ning Dai, Dai, Hong-Ning +4
Computer Science · Engineering · #Advanced Wireless Network Optimization #Cooperative Communication and Network Coding #FOS: Computer and information sciences #Mobile Ad Hoc Networks #Networking and Internet Architecture (cs.NI) #cs.NI
paper · pdf · doi:10.48550/arxiv.1107.1941
This manuscript is an extention of our previous paper with the same title, which is accepted by IEEE LCN 2011
arxiv created 2011/07/11 · openalex publication_date 2011/07/11 · arxiv updated 2011/07/12 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
This paper investigates the problem of link scheduling to meet traffic demands with minimum airtime in a multi-transmit-receive (MTR) wireless network. MTR networks are a new class of networks, in which each node can simultaneously transmit to a number of other nodes, or simultaneously receive from a number of other nodes. The MTR capability can be enabled by the use of multiple directional antennas or multiple channels. Potentially, MTR can boost the network capacity significantly. However, link scheduling that makes full use of the MTR capability must be in place before this can happen. We show that optimal link scheduling can be formulated as a linear program (LP). However, the problem is NP-hard because we need to find all the maximal independent sets in a graph first. We propose two computationally efficient algorithms, called Heavy-Weight-First (HWF) and Max-Degree-First (MDF) to solve this problem. Simulation results show that both HWF and MDF can achieve superior performance in terms of runtime and optimality.