The development of self-interference (SI) cancelation technology makes full-duplex (FD) communication possible. Considering the quality of service (QoS) of flows in small cells densely deployed scenario with limited time slot resources, this paper introduces the FD communication into the concurrent scheduling problem of millimeter-wave wireless backhaul network. We propose a QoS-aware FD concurrent scheduling algorithm to maximize the number of flows with their QoS requirements satisfied. Based on the contention graph, the algorithm makes full use of the FD condition. Both residual SI and multi-user interference are considered. Besides, it also fully considers the QoS requirements of flows and ensures the flows can be transmitted at high rates. Extensive simulations at 60 GHz demonstrate that with high SI cancelation level and appropriate contention threshold, the proposed FD algorithm can achieve superior performance in terms of the number of flows with their QoS requirements satisfied and the system throughput compared with other state-of-the-art schemes.
Compared with the serial TDMA scheme, concurrent transmission scheduling can significantly increase the system throughput, and thus has been extensively studied @cite_7 , @cite_0 - @cite_19 . Cai @cite_0 proposed a scheduling algorithm based on exclusive region to support concurrent transmissions. To maximize the number of flows scheduled in the network so that the QoS requirement of each flow is satisfied, Qiao . @cite_4 proposed a flip-based scheduling algorithm. In @cite_7 , Zhu proposed a Maximum QoS aware Independent Set (MQIS) based scheduling algorithm for mmWave backhaul networks to maximize the number of flows with their QoS requirements satisfied. In MQIS, the concurrent transmission and the QoS aware priority are exploited to achieve more successfully scheduled flows and higher network throughput. In @cite_18 , based on Stackelberg game, Li proposed a distributed transmission power control solution for the concurrent transmission scheduling between interference D2D links to further enhance the network throughput. Niu @cite_19 proposed an energy efficient scheduling scheme for the mmWave backhaul network, which exploits concurrent transmissions to achieve higher energy efficiency. However, all the above scheduling algorithms assume the devices are HD.
@cite_18 @cite_4 @cite_7 @cite_0 @cite_19
2741082453 2042822440 2501770904 2118060203 2234862916
With the explosive growth of mobile data demand, small cells densely deployed underlying the homogeneous macro-cells are emerging as a promising candidate for the fifth generation (5G) mobile network. The backhaul communication for small cells poses a significant challenge, and with huge bandwidth available in the mmWave band, the wireless backhaul at mmWave frequencies can be a promising backhaul solution for small cells. In this paper, we propose the Maximum QoS-aware Independent Set (MQIS) based scheduling algorithm for the mmWave backhaul network of small cells to maximize the number of flows with their QoS requirements satisfied. In the algorithm, concurrent transmissions and the QoS aware priority are exploited to achieve more successfully scheduled flows and higher network throughput. Simulations in the 73 GHz band are conducted to demonstrate the superior performance of our algorithm in terms of the number of successfully scheduled flows and the system throughput compared with other existing schemes. In this paper, a concurrent transmission scheduling algorithm is proposed to enhance the resource utilization efficiency for multi-Gbps millimeter-wave (mmWave) networks. Specifically, we exploit spatial-time division multiple access (STDMA) to improve the system throughput by allowing both non-interfering and interfering links to transmit concurrently, considering the high propagation loss at mmWave band and the utilization of directional antenna. Concurrent transmission scheduling in mmWave networks is formulated as an optimization model to maximize the number of flows scheduled in the network such that the quality of service (QoS) requirement of each flow is satisfied. We further decompose the optimization problem and propose a flip-based heuristic scheduling algorithm with low computational complexity to solve the problem. Extensive simulations demonstrate that the proposed algorithm can significantly improve the network performance in terms of network throughput and the number of supported flows. Millimeter wave (mmWave) communication has been a promising technology of future fifth generation (5G) cellular networks. Due to the tremendous propagation loss of mmWave communication, device-to-device (D2D) communications are widely used over directional mmWave networks to improve the network throughput. In this paper, a new time resource sharing scheme is proposed based on Stackelberg game for interference D2D links to further enhance the network throughput. The D2D links causing interference can access to the time resource by paying higher price, while the D2D links causing no interference can also be scheduled in the scheme. Concurrent transmission scheduling between D2D links causing interference is formulated as a non-cooperative game, which achieves a distributed transmission power control solution among the interference D2D links. Moreover, the price strategy can be adjusted by setting the interference threshold such that the transmission quality can be guaranteed. The simulation results show that the proposed scheme can achieve significant network throughput gain compared with traditional concurrent transmission scheme. Heterogeneous cellular networks (HCNs) are emerging as a promising candidate for the fifth-generation (5G) mobile network. With base stations (BSs) of small cells densely deployed, the cost-effective, flexible, and green backhaul solution has become one of the most urgent and critical challenges. With vast amounts of spectrum available, wireless backhaul in the millimeter-wave (mmWave) band is able to provide transmission rates of several gigabits per second. The mmWave backhaul utilizes beamforming to achieve directional transmission, and concurrent transmissions under low interlink interference can be enabled to improve network capacity. To achieve an energy-efficient solution for mmWave backhauling, we first formulate the problem of minimizing the energy consumption via concurrent transmission scheduling and power control into a mixed integer nonlinear program (MINLP). Then, we develop an energy-efficient and practical mmWave backhauling scheme, which consists of the maximum independent set (MIS)-based scheduling algorithm and the power control algorithm. We also theoretically analyze the conditions that our scheme reduces energy consumption, as well as the choice of the interference threshold. Through extensive simulations under various traffic patterns and system parameters, we demonstrate the superior performance of our scheme in terms of energy efficiency and analyze the choice of the interference threshold under different traffic loads, BS distributions, and the maximum transmission power. Millimeter-wave (mmWave) transmissions are promising technologies for high data rate (multi-Gbps) Wireless Personal Area Networks (WPANs). In this paper, we first introduce the concept of exclusive region (ER) to allow concurrent transmissions to explore the spatial multiplexing gain of wireless networks. Considering the unique characteristics of mmWave communications and the use of omni-directional or directional antennae, we derive the ER conditions which ensure that concurrent transmissions can always outperform serial TDMA transmissions in a mmWave WPAN. We then propose REX, a randomized ER based scheduling scheme, to decide a set of senders that can transmit simultaneously. In addition, the expected number of flows that can be scheduled for concurrent transmissions is obtained analytically. Extensive simulations are conducted to validate the analysis and demonstrate the effectiveness and efficiency of the proposed REX scheduling scheme. The results should provide important guidelines for future deployment of mmWave based WPANs. Millimeter wave (mm-wave) frequencies provide orders of magnitude larger spectrum than current cellular allocations and allow usage of high dimensional antenna arrays for exploiting beamforming and spatial multiplexing. This paper addresses the problem of joint scheduling and radio resource allocation optimization in mm-wave heterogeneous networks where mm-wave small cells are densely deployed underlying the conventional homogeneous macro cells. Furthermore, mm-wave small cells operate in time division duplexing mode and share the same spectrum and air-interface for backhaul and access links. The scheme proposed in this paper can significantly enhance network throughput by exploiting space-division multiple access, i.e., allowing non-conflicting flows to be transmitted simultaneously. The optimization problem of maximizing network throughput is formulated as a mixed integer nonlinear programming problem. To find a practical solution, this is decomposed into three steps: concurrent transmission scheduling, time resource allocation, and power allocation. A maximum independent set based algorithm is developed for concurrent transmission scheduling to improve resource utilization efficiency with low computational complexity. Through extensive simulations, we demonstrate that the proposed algorithm achieves significant gain over benchmark schemes in terms of user throughput. The Long Term Evolution (LTE) is a high data rates and fully All-IP network. Scheduling and resource allocation are very important tasks in LTE network. So that, the optimization of the real-time services transmission is very essential. However, there are many challenges when deploying the live multimedia services such as VoIP, Video, etc. This paper proposes a new scheduling scheme which based on the Wideband (WB) E-model, Channeland QoS-Aware (known as WE-MQS scheduler) for voice traffic in LTE downlink direction. The voice traffic flow is very sensitive to network impairments such as delay, packet loss, jitter, etc. The proposed scheduling scheme is based on the extension of the WB E-model and the consideration of Maximum Queue Size (MQS) as a factor for the metric. Since this scheduling scheme considers Mean Opinion Score (MOS) values, thus, it gets higher user perception. The simulation results show that the proposed scheme has the performance which not only satisfies QoS requirements of voice services but also outperforms well-known schedulers such as Frame Level Scheduler (FLS), Modified Largest Weighted Delay First (MLWDF) and Exponential Proportional Fair (EXP PF) schedulers in terms of delay for all the number of user (NU) and Packet Loss Rate (PLR) when the NU is more than 47. For the cell throughput, Fairness Index (FI), and Spectral Efficiency, the proposed scheduler is always in the middle of the remaining schedulers. The performance evaluation is compared in terms of Delay, PLR, Throughput, FI, and FI for FLS, M-LWDF, EXP PF schedulers and the proposed one. Millimeter-wave (mmWave) communication is a promising technology to cope with the expected exponential increase in data traffic in 5G networks. mmWave networks typically require a very dense deployment of mmWave base stations (mmBS). To reduce cost and increase flexibility, wireless backhauling is needed to connect the mmBSs. The characteristics of mmWave communication, and specifically its high directional- ity, imply new requirements for efficient routing and scheduling paradigms. We propose an efficient scheduling method, so-called schedule-oriented optimization, based on matching theory that optimizes QoS metrics jointly with routing. It is capable of solving any scheduling problem that can be formulated as a linear program whose variables are link times and QoS metrics. As an example of the schedule-oriented optimization, we show the optimal solution of the maximum throughput fair scheduling (MTFS). Practically, the optimal scheduling can be obtained even for networks with over 200 mmBSs. To further increase the runtime performance, we propose an efficient edge-coloring based approximation algorithm with provable performance bound. It achieves over 80 of the optimal max-min throughput and runs 5 to 100 times faster than the optimal algorithm in practice. Finally, we extend the optimal and approximation algorithms for the cases of multi-RF-chain mmBSs and integrated backhaul and access networks. Long-distance multi-hop wireless networks have been used in recent years to provide connectivity to rural areas. The salient features of such networks include TDMA channel access, nodes with multiple radios, and point-to-point long-distance wireless links established using high-gain directional antennas mounted on high towers. It has been demonstrated previously that in such network architectures, nodes can transmit concurrently on multiple radios, as well as receive concurrently on multiple radios. However, concurrent transmission on one radio, and reception on another radio causes interference. Under this scheduling constraint, given a set of source-destination demand rates, we consider the problem of satisfying the maximum fraction of each demand (also called the maximum concurrent flow problem). We give a novel joint routing and scheduling scheme for this problem, based on linear programming and graph coloring. We analyze our algorithm theoretically and prove that at least 50 of a satisfiable set of demands is satisfied by our algorithm for most practical networks (with maximum node degree at most 5). Long Term Evolution (LTE) is the new generation wireless networks that support all IP transmission for multimedia services. One of the major challenges in LTE network is to provide the packet scheduling scheme that can supports the Quality-of-Service (QoS) requirements of multimedia services. In this paper, a Quality-of-Service (QoS) aware packet scheduler for Real Time (RT) downlink communication in LTE is proposed. A Resource Block (RB) preserver scheduling algorithm that has two layers is developed. The upper layer exploits the LTE frame features of aggregating multiple numbers of sub-frames. The lower layer adopts the concept of Proportional Fair (PF) algorithm to schedule the Non Real Time (NRT) flows. While for the real time flows, the Exponential Earliest Deadline (EXP ED) algorithm is utilized. Our simulation results show the proposed Resource Block Preserver (RBP) algorithm outperforms both the Exponential Proportional Fair (EXP PF) and Maximum-Largest Weighted Delay First (M-LWDF) scheduling algorithms in terms of lower Packet Loss Ratio (PLR) among users in the downlink 3GPP LTE system supports VoIP services. The maximum throughput of relaying information flows while concealing their presence is studied. The concealment is achieved by embedding transmissions of information flows into truly independent transmission schedules that resemble the normal transmission behaviors without any flow. Such embedding may reduce the throughput for delay-sensitive flows, and the paper provides a quantitative characterization of the level of reduction. Under a strict or average delay constraint, the maximum normalized throughput is measured by the efficiency of the optimal relay algorithms that embed the most flow into given transmission schedules. Exact analytical solutions and closed-form approximations are derived for renewal schedules, verified by simulations on both synthetic traffic and traces. The results reveal general relationships between the clandestine throughput and system parameters including delay constraints, traffic load, and traffic distributions. In particular, the throughput is found to be negatively related to the burstiness of the cover traffic. Moreover, simulations show that the throughputs of renewal traffic with certain power-law interarrival distributions can closely approximate those of actual traces. We define and study the scheduling complexity in wireless networks, which expresses the theoretically achievable efficiency of MAC layer protocols. Given a set of communication requests in arbitrary networks, the scheduling complexity describes the amount of time required to successfully schedule all requests. The most basic and important network structure in wireless networks being connectivity, we study the scheduling complexity of connectivity, i.e., the minimal amount of time required until a connected structure can be scheduled. In this paper, we prove that the scheduling complexity of connectivity grows only polylogarithmically in the number of nodes. Specifically, we present a novel scheduling algorithm that successfully schedules a strongly connected set of links in time O(logn) even in arbitrary worst-case networks. On the other hand, we prove that standard MAC layer or scheduling protocols can perform much worse. Particularly, any protocol that either employs uniform or linear (a node’s transmit power is proportional to the minimum power required to reach its intended receiver) power assignment has a Ω(n) scheduling complexity in the worst case, even for simple communication requests. In contrast, our polylogarithmic scheduling algorithm allows many concurrent transmission by using an explicitly formulated non-linear power assignment scheme. Our results show that even in large-scale worst-case networks, there is no theoretical scalability problem when it comes to scheduling transmission requests, thus giving an interesting complement to the more pessimistic bounds for the capacity in wireless networks. All results are based on the physical model of communication, which takes into account that the signal-tonoise plus interference ratio (SINR) at a receiver must be above a certain threshold if the transmission is to be received correctly. We investigate the problem of energy efficiency in TDMA link scheduling with transmission power control using a realistic SINR-based interference model, given packets of a set of links to be transmitted within a latency bound. First we formulate a fundamental optimization problem (TJSPC) that provides tunable tradeoffs between energy, throughput and latency through a single parameter β. We present both expo- nential and polynomial complexity solutions to this problem and evaluate their performance. Our results show that for moderate traffic loads, with appropriate tuning of parameters, major energy savings can be obtained without significantly sacrificing throughput. We then investigate the scheduling and power control problem with the objective of minimizing the total transmission energy cost under the constraint that all transmission requests are satisfied (JSPC-TR). We present an iterative approach to solve JSPC-TR that leverages the heuristics for TJSPC and converges rapidly to the setting of β which achieves energy efficiency while guaranteeing data delivery. In this paper, we propose a spacial time slot scheduling algorithm for relay operation to improve the throughput performance of millimeter-wave wireless personal area network (mmWave WPAN) systems which employ directional antenna. The upcoming mmWave WPAN is designed for high definition TV (HDTV) transmission, high speed wireless docking and gaming, etc. Based on the fact that the significant path loss of millimeter-wave environments provides good space isolation, we have proposed a coexistence mechanism by sharing time slots for relay with direct transmission to guarantee throughput for the above data-rate-greedy applications. This paper is an extension that addresses spacial time slot scheduling for relay operation taking the effect of directional antenna into consideration. We model the throughput maximization with scheduling as an integer optimization and solve it by transforming the problem to a max-weight matching problem of a bipartite graph. We propose a scheduling algorithm based on the Kuhn-Munkres algorithm which can be used to solve the max weight matching problem. Simulation results show that there is up to 25 throughput improvement achieved compared with random scheduling method. A major challenge in the design and operation of wireless networks is to jointly route packets and schedule transmissions to efficiently share the common spectrum among links in the same area. Due to the lack of central control in wireless networks, these algorithms have to be decentralized. It was recently shown that distributed (greedy) algorithms can usually guarantee only fractional throughput. It was also recently shown that if a set of conditions regarding the network topology (known as Local Pooling) is satisfied, simple distributed maximal weight (greedy) scheduling algorithms achieve 100 throughput. In this paper, we focus on networks in which packets have to undergo multihop routing and derive multihop local pooling conditions for that setting. In networks satisfying these conditions, a backpressure-based joint routing and scheduling algorithm employing maximal weight scheduling achieves 100 throughput. With the shortage of spectrum in conventional cellular frequencies, millimeter-wave (mmWave) bands are being widely considered for use in next-generation networks. Multihop relaying is likely to play a significant role in mmWave cellular systems for self backhauling, range extension and improved robustness from path diversity. However, designing scheduling policies for these systems is challenging due to the need to account for both adaptive directional transmissions and dynamic time-division duplexing schedules, which are key enabling features of mmWave systems. This paper considers the problem of joint scheduling and congestion control in a multihop mmWave network using a Network Utility Maximization (NUM) framework. Interference is modeled with an exact model and two auxiliar simplified models: actual interference (AI), with a graph-based calculation of the Signal to Interference plus Noise Ratio (SINR) depending on dynamic link activity and directivity, as well as upper and lower bounds computed from worst-case interference (WI) and interference free (IF) approximations. Throughput and utility optimal policies are derived for all interference models (AI, WI and IF) with both deterministic Maximum Weighted and randomized Pick and Compare scheduling algorithms, jointly with decentralized Dual Congestion Control. Results are evaluated with numerical simulations, using accurate mmWave channel and beamforming gain approximations based on measurement campaigns. The question of providing throughput guarantees through distributed scheduling, which has remained an open problem for some time, is addressed in this paper. It is shown that a simple distributed scheduling strategy, maximal scheduling, attains a guaranteed fraction of the maximum throughput region in arbitrary wireless networks. The guaranteed fraction depends on the ldquointerference degreerdquo of the network, which is the maximum number of transmitter-receiver pairs that interfere with any given transmitter-receiver pair in the network and do not interfere with each other. Depending on the nature of communication, the transmission powers and the propagation models, the guaranteed fraction can be lower-bounded by the maximum link degrees in the underlying topology, or even by constants that are independent of the topology. The guarantees are tight in that they cannot be improved any further with maximal scheduling. The results can be generalized to end-to-end multihop sessions. Finally, enhancements to maximal scheduling that can guarantee fairness of rate allocation among different sessions, are discussed. Many published algorithms used for scheduling transmissions in packet radio networks are based on finding maximal independent sets in an underlying graph. Such algorithms are developed under the assumptions of variations of the protocol interference model, which does not take the aggregated effect of interference into consideration. We provide a probabilistic analysis for the throughput performance of such graph based scheduling algorithms under the physical interference model. We show that in many scenarios a significant portion of transmissions scheduled based on the protocol interference model result in unacceptable signal-to-interference and noise ratio (SINR) at intended receivers. Our analytical as well as simulation results indicate that, counter intuitively, maximization of the cardinality of independent sets does not necessarily increase the throughput of a network. We introduce the truncated graph based scheduling algorithm (TGSA) that provides probabilistic guarantees for the throughput performance of the network. A comprehensive study of the problem of scheduling broadcast transmissions in a multihop, mobile packet radio network is provided that is based on throughput optimization subject to freedom from interference. It is shown that the problem is NP complete. A centralized algorithm that runs in polynomial time and results in efficient (maximal) schedules is proposed. A distributed algorithm that achieves the same schedules is then proposed. The algorithm results in a maximal broadcasting zone in every slot. > Providing packet-level quality of service (QoS) is critical to support both rate-sensitive and delay-sensitive applications in bandwidth-constrained, shared-channel, multihop wireless networks. Packet scheduling has been a very popular paradigm to ensure minimum throughput and bounded delay access for packet flows. This work describes a packet scheduling approach to QoS provisioning in multihop wireless networks. Besides minimum throughput and delay bounds for each flow, our scheduling disciplines seek to achieve fair and maximum allocation of the shared wireless channel bandwidth. However, these two criteria can potentially be in conflict in a generictopology multihop wireless network where a single logical channel is shared among multiple contending flows and spatial reuse of the channel bandwidth is possible. In this paper, we propose a new scheduling model that addresses this conflict. The main results of this paper are the following: (a) a two-tier service model that provides a minimum "fair" allocation of the channel bandwidth for each packet flow and additionally maximizes spatial reuse of bandwidth, (b) an ideal centralized packet scheduling algorithm that realizes the above service model, and (c) a practical distributed backoff-based channel contention mechanism that approximates the ideal service within the framework of the CSMA CA protocol.