Research Article | Open Access
Hypergraph Modeling and Approximation Algorithms for the Minimum Length Link Scheduling in Multiuser MIMO Networks
This paper investigates the problem of the minimum length link scheduling (MLLS) in multiuser MIMO (MU-MIMO) networks. Generally, in the networks with MU-MIMO capability, the number of concurrent transmissions can be as large as that of antenna elements at the receiver. As a result, link interference is no longer binary but demonstrates a strong correlation among multiple links, which cannot be captured by the conventional conflict graph interference model. Hence, we propose a novel hypergraph interference model, which can accurately and efficiently characterize the relationship of multiple interferences induced by concurrent transmissions, and provide a tractable formalization of the minimum length link scheduling in MU-MIMO networks (MU-MIMO MLLS). Afterwards, we prove that the MU-MIMO MLLS problem is NP-hard and introduce two approximation algorithms to find the near-optimal feasible schedule. Finally, extensive simulation experiments are presented.
Link scheduling in wireless networks is one of the key and classical research topics for the communication and network communities. In wireless networks, nodes communicate with each other through a shared common channel. On one hand, to shorten the communication latency, node pairs are required to communicate concurrently as much as possible; on the other hand, concurrent transmissions induce the cochannel interference, which results in severe deterioration or even interruption of an ongoing transmission. To control the cochannel interference, link scheduling is required to coordinate the transmission of different links. A good schedule not only avoids communication failures by silencing the interferers of every receive node in each time slot but also minimizes the number of time slots and hence the communication latency. To sum up, link scheduling in wireless networks usually requires the minimum length conflict-free assignment of time slots in which each communication link is activated at least once [1, 2] and the link scheduling problem is difficult because many subsets of nonconflicting nodes are candidates for each time slot, and the subset selected for transmission in one slot affects the number of concurrent transmissions in the next time slot.
The interference model, which characterizes the interference relationship of communication links, has a major impact on the complexity of wireless link scheduling. The conflictgraph based interference model, as a simple and powerful modeling tool, has been widely employed [3, 4]. In , Hajek and Sasaki consider the MLLS problem and propose an optimal scheduling scheme with polynomial time complexity. However, they consider only the primary interference; that is, two links are interfered with each other when they are neighboring. In practice, the transmission of a link can interrupt that of the other even when they are not neighboring. At this time, link scheduling is shown as an NP-hard problem. Just recently, constant factor approximation bounds have emerged for link scheduling under the conflictgraph interference model with -hop interference .
The conventional conflict graph interference model cannot capture the interference when multiple-input multiple-output (MIMO) is deployed. As a revolutionary technology from an information theoretic perspective and physical layer communications, MIMO has been introduced as a de facto component of wireless standards [5, 6]. In the networks with multiuser MIMO capability (MU-MIMO networks), a node with multiple antenna elements can decode a composite signal from different transmitters. Therefore, more communication links are permitted to transmit concurrently. In general, the number of concurrent transmissions can be as large as that of antenna elements at the receiver. For example, given a network consisting of a receiver with two antenna elements, and three senders , , and with single antenna, respectively, consider the interference of on : when is silent, there is no interference; however, when is active, and cannot transmit simultaneously. That is, the interference relationship between and has strong correlation with the activity of . Such dependence has not been characterized in the binary conflict graph model.
Recently there is a few existing works in the literature trying to explore the optimal link scheduling problem in MU-MIMO networks. Chu and Wang  presented an integer linear programming (ILP) formulation of the optimal link scheduling problem in MU-MIMO networks, and proposed an opportunistic scheduling algorithm that can adaptively select different transmission strategies. Blough et al.  considered the same problem in MU-MIMO networks with interference suppression capabilities, and formulized the one-shot optimal link scheduling problem as an integer linear programming. However, all of them cannot be applied directly to the MLLS with MU-MIMO capability: on one hand, the goal of [7, 8] is maximizing throughput while the objective of MU-MIMO MLLS is minimizing the schedule length; on the other hand, both work in [7, 8] model the optimal link scheduling problem in MU-MIMO networks as an ILP formulation, which is well-defined in mathematics while difficult to find approximation algorithms providing a guaranteed performance.
In this paper, we address the issue of the minimum length link scheduling in MU-MIMO networks, aiming for providing at least one transmission time slot for every communication link with a minimum schedule length. Firstly, we propose a novel interference model based on hypergraph to characterize multiple interferences in MU-MIMO networks. The concept of hypergraph is extended from graph, and is a nature way for representing multiple interferences among multiple links. Afterwards, two algorithms for the problem of MU-MIMO MLLS are proposed: the first one is a performance guaranteed approximation algorithm whose approximation ratio is at most ; the second one is a time efficient heuristic algorithm based on degrees of interference (DOI) greedy. Extensive simulations are presented to test how well the proposed algorithms based hypergraph model may be applied in practice.
The remainder of this paper is organized as follows. Section 2 presents the integer programming formalization and the proposed hypergraph interference model of MU-MIMO MLLS. Section 3 introduces two algorithms to approximate the optimal solution. Section 4 shows the extensive simulation results. Finally, in Section 5, conclusions are given.
2. System Model
2.1. Problem Statement
Consider a wireless network of communication links, and stationary nodes, each of which is equipped with antenna elements. A link with transmit node and receive node is denoted by . We assume that: (i) nodes work in the half-duplex mode, that is a node can either transmit or receive, but not at the same time; (ii) every link is of a single data stream as to enhance as many concurrent transmissions as possible.
The use of a MIMO antenna array is typically modeled as degree of freedom (DOF) model . For simplicity, a receive node with antenna elements has up to DOFs, which can be used for multiplexing desired data streams and suppressing () interferences from other neighboring concurrent transmission links. And if and only if the number of the concurrent transmission link in vicinity of receive node , including link , does not exceed , then receive node can successfully decode the data stream carried by link .
2.2. Integer Programming Formulization
Firstly, notations used in the IP formulation are specified as follows: : set of transmission time slots for link scheduling; : set of communication links to be scheduled; : set of wireless nodes; : set of links incident into node ; : transmit node and receive node of link , respectively; : set of links interfered by ; : an integer variable, equals to 1 iff link is active at the th time slot, otherwise equals 0.
The proposed IP formulation for MU-MIMO MLLS is as follows
The objective function (1) states that we aim to minimize the length of scheduling time slots. Constrain (2) ensures that each of communication links is assigned at least one transmission time slot in a schedule period. The next constraint (3) provides that every active communication link does not suffer too much cochannel interference. And to make constrain (3) always feasible when , the constant parameter needs to be set large enough. A sufficiently large value is . From constraint (4), we know that the size of search space is , rising at an exponential rate with the network size .
The disadvantage of the IP formulation is that it is difficult to find approximation algorithms, but the IP formulation provides a way to calculate the optimal solution through exhaustive searching in cases of networks with a small size.
2.3. Hypergraph Modeling MU-MIMO MLLS
Typically, a wireless network can be modeled as a directional graph . The set includes all the nodes in the network, and is a link set, of which for a pair of nodes , a directional edge is a member of if node ’s signals can be decoded successfully at node in the absence of interference. Further, the interference relationship between transmission links is modeled as a conflict graph , where is the set of links (in fact, is the set in the graph ) and is the set of conflicts; that is, means that the concurrent transmission of link and is invalid. However, the conflictgraph interference model is restrictive and cannot descript the interference relationship among three links or more. For example, even when , , and are given, we cannot conclude whether the concurrent transmission of link , , and is valid or not. While generally the interference relationship in MU-MIMO networks involves multiple communication links. Thus, the conflict graph interference model is not appropriate to handle the case of MU-MIMO networks.
2.3.1. Hypergraph Model
Construct. Here, we present a new graph model, hypergraph [10, 11], to characterize the interference relationship in MU-MIMO networks. Let denote a hypergraph, where is the set of links, the same as and , and is also the set of conflicts, similar to . The difference between and is that the element of is limited to 2-tuple of , while the element of , named as hyperedge, is extended to a subset of . And for any link set , if and only if satisfies three rules as follows. R1: (Invalidity Rule). When all the links of are assigned in a same transmission time slot, there is at least one link in failing to transmit data successfully. R2: (Minimality Rule). If any link in is removed, no failure will occur if only the remaining links in are scheduled. R3: (Integrality Rule). All link set , satisfying conditions R1 and R2, must be contained in .
2.3.2. Hypergraph Model
Problem Formalization. Given a hypergraph model , the problem of MU-MIMO MLLS can be transformed to the problem of finding the optimal coloring of the hypergraph : give all node in a color, and for every hyperedge , having at least two nodes as endpoints, the nodes of this hyperedge that connect are not all of the same color. Denote the hypergraph coloring solution by , where is the link set with the same color . Then, the coloring solution with the least number of colors is the optimal solution to the problem of MU-MIMO MLLS. And the problem of MU-MIMO MLLS could be formulized as follows: where colors() means the number of colors appeared in the hyperedge .
Example 1. Consider the network in Figure 1, where there are four communication links and seven nodes, all of which are equipped with two antenna elements. According to the proposed hypergraph model, we can model the network as hypergraph showed in Figure 2, in which and . And we can easily find a coloring solution , ; thus, all the four communication links are assigned in two transmission time slots.
2.3.3. Hypergraph Model
Lemma 2. Given a MU-MIMO hypergraph , then, for any , the cardinality of S is ; that is is -uniform hypergraph.
Proof. We adopt the counterexample method: (1) if there is any hyperedge , satisfying (card denotes the cardinality of ), then, according to the receive condition in the DOF model, all links in could concurrently transmit together; that is, the link set is a feasible link set, which evidently conflicts with the Invalidity Rule R1; (2) if there is any hyperedge , satisfying card, then after removing one link in , card() equals and is still an infeasible link set, which directly conflicts with the Minimality Rule R2. Considering (1) and (2) together, we can conclude that, for any , .
Lemma 3. The MU-MIMO MLLS problem is NP-hard.
Proof. We reduce the problem of finding the chromatic number of a -uniform hypergraph to the MU-MIMO MLLS problem. The chromatic number of a hypergraph is the smallest number such that is -colorable and is -colorable if its vertices can be colored using different colors in such a way that for every hyperedge in , the nodes of this hyperedge are not all of the same color. According to the hypergraph modeling above mentioned and Lemma 2, we know that every link scheduling solution corresponds to a coloring solution of hypergraph . Meanwhile, due to the three construction rules, every hypergraph coloring is also a link scheduling solution. Thus, the minimum scheduling length is equal to the chromatic number of the -uniform hypergraph . And several results [12, 13] show that it is NP-complete to optimally color -uniform hypergraphs, for various values of (). Specific statements can be found in the corresponding papers.
In this section, two algorithms based on the uniform hypergraph coloring for the problem of MU-MIMO MLLS are proposed. Here, we firstly give some definitions: given a -uniform hypergraph , a link set is called independent if does not contain any hyperedge in . An -coloring of is a mapping : such that no hyperedge of with one single color. Equivalently, an -coloring of is a partition of the vertex set into independent sets. The chromatic number of , denoted by , is the minimal , for which admits an -coloring.
3.1. Performance-Guaranteed () Approximation Algorithm
Similar to Wigderson’s paper , we find an independent set with the following algorithm, named as performance-guaranteed () algorithm, whose approximation ratio is . It is worth noting that the idea of partitioning the vertex set of a -colorable hypergraph on into groups of size and performing an exhaustive search for an independent set of size in each group is due to Berger and Rompel’s paper .
Proof. If is -colorable, it contains an independent set of size . Then, for some , we have . Checking all subsets of of size will reveal an independent set of size (). The number of subsets of size to be checked by the algorithm does not exceed .
The idea of our proposed Algorithm is simple: as long as there are some uncolored vertices (their union is denoted by ), call Procedure 1 for finding an independent set in the subhypergraph spanned by , denoted by , give the output a fresh color, and update .
Lemma 5. Algorithm outputs a coloring solution in time polynomial in (see, Algorithm 1).
Proof. Inevitably, any hypergraph is -colorable; thus, Procedure 1 is called at most times, and according to Lemma 4, the time complexity of Procedure 1 is ; hence, the time complexity of Algorithm is polynomial in .
Lemma 6. The approximation ratio of Algorithm is at most (see, Algorithm 1).
Proof. For a hypergraph , we denote the chromatic number of by ; that is, is -colorable. Furthermore, the optimal coloring of is the solution of coloring by colors. In addition, for any subhypergraph of , which is spanned by the subset and denoted by as above mentioned, due to , it is obvious that is also -colorable. Through Procedure 1, the size of the independent set picked by Algorithm is at least . And we know that is a positive, nondecreasing function. Then, Algorithm produces a coloring with at most colors, since each link in contributes at most colors, where is the number of links remaining in the subhypergraph at the time when the link was assigned a color. It is proofed that when grows no faster than (), is at most . Specifically in our proposed Algorithm , grows no faster than . Thereby, Algorithm colors the -colorable hypergraph on vertices in at most , then the approximation ratio of Algorithm is at most . Finally, () is decreasing function that is .
3.2. DOI-Based Greedy () Heuristic Algorithm
Although Algorithm can provide a guaranteed performance, its time complexity is . The distinguishing time complexity promotes us to design another time efficient heuristic coloring algorithm.
Recall that the goal of link scheduling is to keep the cochannel interference at a proper level. Here, the concept of degree of interference, denoted by DOI (), is defined to measure the interferences induced by a link and presents the impact of the link brought to the other links. DOI () is equal to the amount of communication links affected by the link when link is in activation. The main idea of Algorithm is to assign the link with maximum degrees-of-interference as early as possible; hence, the interferences in the whole network would reduce drastically and then a relative larger independent link set might be picked in next scheduling time slots. To improve the performance, we refresh the DOI information every time after picking an independent link set.
Lemma 7. The time complexity of Algorithm is (see, Algorithm 2).
Proof. The bottleneck of Algorithm is the procedure of QuickSort (), which is called at most times, and the expected running time of QuickSort () is .
4. Simulation and Discussion
We evaluate the performance of our proposed Algorithms and via extensive simulations. The network settings include wireless nodes that are distributed in a square area of 1250 m × 1250 m and form an ad hoc network with random or grid topology; each node is equipped with antennas and has a communication range of 250 m and an interference range of 400 m (Figure 3). A simulation result is obtained by averaging over 50 runs of simulations, and all simulations run on a 2.8 GHz Intel Core Duo machine with 4 GB of RAM.
Four algorithms are implemented and compared in our simulations: (1) the algorithm of exhaustive searching () to compute the optimal solution of MU-MIMO MLLS; (2) the centralized algorithm of opportunistic scheduling () modified from ; (3) the approximation algorithm of performance guaranteed () illustrated in Section 3.1; and (4) the heuristic algorithm of DOI-based greedy () in Section 3.2. Algorithm and Algorithm use the IP formulation presented in Section 2.2, while Algorithm and Algorithm are based on the proposed hypergraph model in Section 2.3. And the later three algorithms only produce suboptimal solutions. To be noted here, our simulation experiments were only partially successful. In certain cases, where the networks are of a small size (refer to the number of links), Algorithm converged quickly to the optimal solution. While in other cases, convergence was much slower and in some cases memory usage rose dramatically preventing the optimal solution from being found. In addition, slow convergence also occurred in the cases with a large network size when executing the approximation or heuristic algorithms. Hence, we set the network size to network cases with a small or medium size.
Here, two performance metrics are considered for the evaluation of the scheduling algorithms: (a) average scheduling length (ASL) is defined as the average number of time slots required for assigning all the communication links at least once in a schedule period; (b) average running time (ART) is defined as the average time spendt in executing the simulation one time. We investigate three impact factors, namely, network size, network topology, and degree of freedom. For each factor, both the average scheduling length and the average running time are compared. If not otherwise specified, wireless networks are with random topology, and the node’s degree of freedom are 2, that is, each wireless node is equipped with two antenna elements.
Next, we discuss the results from our simulation experiments.
4.1. Impact of Network Size
In this section, we represent the network size as the number of communication links. The impact of network size is shown in Figures 4(a) and 4(b). As above mentioned, the calculation of the exact optimal solution for the large or even medium scale network is infeasible with our machine, while the proposed approximation Algorithm and the heuristic Algorithm can scale to quite large number of communication links and produce suboptimal solutions that are not too bad. Irrespective of the network size, our proposed two algorithms perform better than the reference algorithm (Algorithm ) in terms of average scheduling length, and the performance gain is between 7% and 15%. Besides, Algorithm has the closest performance to that of the optimal solution when the network is of medium or large number of communication links (the ASL performance curves of Algorithm and intersect when the number of links is around 50). The main reason for the performance improvement is that in every schedule time slot, the concurrent link set selected by Algorithm is guaranteed to be of a certain size, and the size increases along with the network size. Although Algorithm has ASL performance advantage, the performance difference between Algorithm and Algorithm is less than 10% when the network size is controlled below 115 communication links.
(a) Average scheduling length
(b) Average running time
The comparison of the ART performance of three algorithms is shown in Figure 4(b). To represent the performance difference more effectively, we adopt the denary logarithm value of average running times. The results verify that the running time of Algorithm is rising at an exponential rate with the network size; thus, Algorithm can be only executed in the case of very small networks; Algorithm , Algorithm , and Algorithm are of polynomial time complexity, while Algorithm is of orders-of-magnitudes advantage over Algorithm and Algorithm in terms of ART performance.
4.2. Impact of Network Topology
We perform extensive simulations with two types of network topology: a randomly generated topology and a grid. In both two networks, the number of communication links to be scheduled is set to the same value, . And the compared algorithms are Algorithm , Algorithm , and Algorithm . From Figure 5, we see that the efficiency of all the three algorithms is higher with random topology: with random topology, fewer transmission time slots and little running time are required. The reason is that in a grid topology, each wireless node is equidistant from its neighbors; hence, the distribution of communication links is more homogeneous and the signals of neighbors arrive at a receiver node with similar powers; this limits the choices for the scheduling policies, especially for Algorithm . Besides, we find that in both networks, Algorithm is of a huge ART performance benefits, compared with Algorithm and Algorithm .
(a) Average scheduling length
(b) Average running time
4.3. Impact of Degree of Freedom
Finally, we turn to perform simulations in networks with varied degree of freedom. The networks are with a rand generated topology and 112 communication links to be scheduled. As shown in Figure 6, the value of degree of freedom impacts the ASL performance significantly while it has relative little impact to the ART performance. That is because as the number of antenna elements (degree of freedom) is increased, the receive node is more effective and, thus, more communication links can be grouped in a same schedule time slot.
(a) Average scheduling length
(b) Average running time
In this paper, we study the issue of the minimum length link scheduling in a wireless network with the MU-MIMO capability. Firstly, we formulate the MU-MIMO MLLS problem as an integer programming problem. Secondly, we introduce a novel and straight hypergraph method to model the multiple interferences, which cannot be captured by the traditional conflict graph model, and then we reformulate the MU-MIMO MLLS problem based on the new hypergraph model. And, we show that, the scheduling problem is NP-hard. Thirdly, we propose two efficient approximation solutions. For the first algorithm, named as Algorithm , we show that the approximation ratio is at most . To reduce the time complexity, we also present a time efficient heuristic algorithm based on degree of interference greedy (Algorithm ). Finally, extensive simulation results show that (1) both Algorithm and Algorithm can scale to quite a large number of links and produce satisfying suboptimal solutions; (2) generally, Algorithm has a better ASL performance than Algorithm , while the time complexity of Algorithm is largely reduced compared with that of Algorithm .
This work was supported in part by the National Natural Science Foundation of China under Grant no. 61070203, No. 61202484, the Ph.D. Program Foundation of Ministry of Education of China under Grant no. 20124307120033, and the Excellent Graduate Innovation Foundation of NUDT under Grant No. B120608.
- R. Nelson and L. Kleinrock, “Spatial TDMA: a collision-free multihop channel access protocol,” IEEE Transactions on Communications, vol. 33, no. 9, pp. 934–944, 1985.
- S. C. Ergen and P. Varaiya, “TDMA scheduling algorithms for wireless sensor networks,” Wireless Networks, vol. 16, no. 4, pp. 985–997, 2010.
- B. Hajek and G. Sasaki, “Link scheduling in polynomial time,” IEEE Transactions on Information Theory, vol. 34, no. 5, part 1, pp. 910–917, 1988.
- G. Sharma, R. R. Mazumdar, and N. B. Shroff, “On the complexity of scheduling in wireless networks,” in Proceedings of the 12th Annual International Conference on Mobile Computing and Networking (MOBICOM '06), pp. 227–238, September 2006.
- “Wireless LAN Medium Access Control (MAC) and Physical Layer (PHY) specifications: Amendment 5: Enhancements for Higher Throughput,” IEEE P802.11n Standard, 2009.
- “Proposed TGac Draft to Wireless LAN Media Access Control (MAC) and Physical Layer (PHY) Specifications: Enhancements for Higher Throughput,” IEEE P802.11ac/D0, 2011.
- S. Chu and X. Wang, “Adaptive and distributed scheduling in heterogeneous MIMO-based ad hoc networks,” in Proceedings of the IEEE 6th International Conference on Mobile Adhoc and Sensor Systems (MASS '09), pp. 217–226, October 2009.
- D. M. Blough, G. Resta, P. Santi, R. Srinivasan, and L. M. Cortés-Pena, “Optimal one-shot scheduling for MIMO networks,” in Proceedings of the 8th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks (SECON '11), pp. 404–412, June 2011.
- L. Zheng and D. N. C. Tse, “Diversity and multiplexing: a fundamental tradeoff in multiple-antenna channels,” IEEE Transactions on Information Theory, vol. 49, no. 5, pp. 1073–1096, 2003.
- C. Berge, Graphs and Hypergraphs, Elservier, New York, NY, USA, 1973.
- C. Berge, Hypergraphs: The Theory of Finite Set, vol. 45, North-Holland Publishing, Amsterdam, The Netherlands, 1989.
- I. Dinur, O. Regev, and C. Smyth, “The hardness of 3-uniform hypergraph coloring,” in Proceedings of the 34rd Annual IEEE Symposium on Foundations of Computer Science, pp. 33–40, November 2002.
- S. Khot, “Hardness results for approximate hypergraph coloring,” in Proceedings of the 34th Annual ACM Symposium on Theory of Computing, pp. 351–359, May 2002.
- A. Wigderson, “Improving the performance guarantee for approximate graph coloring,” Journal of the Association for Computing Machinery, vol. 30, no. 4, pp. 729–735, 1983.
- B. Berger and J. Rompel, “A better performance guarantee for approximate graph coloring,” Algorithmica, vol. 5, no. 4, pp. 459–466, 1990.
- M. M. Halldórsson, “A still better performance guarantee for approximate graph coloring,” Information Processing Letters, vol. 45, no. 1, pp. 19–23, 1993.
Copyright © 2013 Hu Shen et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.