Computer Science – Networking and Internet Architecture
Scientific paper
2011-07-11
Computer Science
Networking and Internet Architecture
This manuscript is an extention of our previous paper with the same title, which is accepted by IEEE LCN 2011
Scientific paper
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.
Dai Hong-Ning
Fu Liqun
Liew Soung Chang
No associations
LandOfFree
Link Scheduling in Multi-Transmit-Receive Wireless Networks does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Link Scheduling in Multi-Transmit-Receive Wireless Networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Link Scheduling in Multi-Transmit-Receive Wireless Networks will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-137350