Praise for the Third Edition: "This is one of the best books available. Its excellent organizational structure allows quick reference to specific models and its clear presentation . . . solidifies the understanding of the concepts being presented."IIE Transactions on Operations EngineeringThoroughly revised and expanded to reflect the latest developments in the field, Fundamentals of Queueing Theory, Fourth Edition continues to present the basic statistical principles that are necessary to analyze the probabilistic nature of queues. Rather than presenting a narrow focus on the subject, this update illustrates the wide-reaching, fundamental concepts in queueing theory and its applications to diverse areas such as computer science, engineering, business, and operations research.This update takes a numerical approach to understanding and making probable estimations relating to queues, with a comprehensive outline of simple and more advanced queueing models. Newly featured topics of the Fourth Edition include:Retrial queuesApproximations for queueing networksNumerical inversion of transformsDetermining the appropriate number of servers to balance quality and cost of serviceEach chapter provides a self-contained presentation of key concepts and formulae, allowing readers to work with each section independently, while a summary table at the end of the book outlines the types of queues that have been discussed and their results. In addition, two new appendices have been added, discussing transforms and generating functions as well as the fundamentals of differential and difference equations. New examples are now included along with problems that incorporate QtsPlus software, which is freely available via the book's related Web site.With its accessible style and wealth of real-world examples, Fundamentals of Queueing Theory, Fourth Edition is an ideal book for courses on queueing theory at the upper-undergraduate and graduate levels. It is also a valuable resource for researchers and practitioners who analyze congestion in the fields of telecommunications, transportation, aviation, and management science.

Fundamentals of Queueing Theory

Elements of Information Theory (2nd ed.). Thomas M. Cover and Joy A. Thomas

一种高速调制解调器，它通过电话线发送和接收一载频集的数字数据。 该调制解调器包括在载波之间可变地分配数据和功率，以便补偿等效噪声和使数据速率最大的系统。 此外，也介绍不需要一个均衡网络、可自适应地分配信道的控制和可跟踪线上参数变化的系统。

Ensemble modem structure for imperfect transmission media

By employing the regularized block diagonalization (RBD) preprocessing technique, the MU-MIMO broadcast channel is decomposed into multiple parallel independent SU-MIMO channels and achieves the maximum diversity order at high data rates. The computational complexity of RBD, however, is relatively high due to two singular value decomposition (SVD) operations. In this letter, a low-complexity lattice reduction-aided RBD is proposed. The first SVD is replaced by a QR decomposition, and the orthogonalization procedure provided by the second SVD is substituted by a lattice-reduction whose complexity is mainly contributed by a QR decomposition. Simulation results show that the proposed algorithm can achieve almost the same sum-rate as RBD, substantial bit error rate (BER) performance gains and a simplified receiver structure, while requiring a lower complexity.

/pdf/low-complexity-lattice-reduction-aided-regularized-block-4fdxow8rze.pdf

Low-Complexity Lattice Reduction-Aided Regularized Block Diagonalization for MU-MIMO Systems

In this paper, we investigate the physical-layer security of cooperative communications relying on multiple two-way relays using the decode-and-forward (DF) protocol in the presence of an eavesdropper, where the eavesdropper appears to tap the transmissions of both the source and of the relay. The design tradeoff to be resolved is that the throughput is improved by invoking two-way relaying, but the secrecy of wireless transmissions may be degraded, since the eavesdropper may overhear the signals transmitted by both the source and relay nodes. We conceive an artificial noise aided two-way opportunistic relay selection (ANaTWORS) scheme for enhancing the security of the pair of source nodes communicating with the assistance of multiple two-way relays. Furthermore, we analyze both the outage probability and intercept probability of the proposed ANaTWORS scheme, where the security and reliability are characterized in terms of the intercept probability and the security outage probability. For comparison, we also provide the security–reliability tradeoff (SRT) analysis of both the traditional direct transmission and of the one-way relaying schemes. It is shown that the proposed ANaTWORS scheme outperforms both the conventional direct transmission, as well as the one-way relay methods in terms of its SRT. More specifically, in the low main-user-to-eavesdropper ratio (MUER) region, the proposed ANaTWORS scheme is capable of guaranteeing secure transmissions, whereas no SRT gain is achieved by conventional one-way relaying. In fact, the one-way relaying scheme may even be inferior to the traditional direct transmission scheme in terms of its SRT.

/pdf/security-reliability-tradeoff-analysis-of-artificial-noise-46hxkmsa5g.pdf

Security-Reliability Tradeoff Analysis of Artificial Noise Aided Two-Way Opportunistic Relay Selection

In this paper, a joint power and resource block (RB) allocation (JPRBA) algorithm with low complexity is proposed, which addresses the intra-and-inter-cell interference management problem for a multicell device-to-device (D2D) communication underlaying LTE-Advanced network. We first introduce a power control and resource allocation vector (PORAVdm) to each D2D transmitter, and the set of all PORAVdm has two functions: one is to select appropriate reused RBs for each D2D link, whereas the other is to determine the optimal power for D2D transmitters on each selected RB. To obtain the appropriate PORAVdms, we exploit the group sparse structure to formulate a sum rate maximization problem (referred to as the group least absolute shrinkage and selection operator programming). Then we derive the stationary solution by solving its equivalent sparse weighted mean square error minimization problem. Finally, simulation results show that the proposed JPRBA algorithm can efficiently improve the total throughput.

Group-Sparse-Based Joint Power and Resource Block Allocation Design of Hybrid Device-to-Device and LTE-Advanced Networks

The invention discloses a routing decision method for a delay tolerant network, which mainly solves the defects that the prior art can not sufficiently use network node motion regulation and link historical information to carry out routing selection. The routing decision method comprises the following specific processes: (1) discretizing time-varying link capacity functions and constructing a three-dimensional matrix for describing network topology transformation; (2) carrying out two-value quantification on link capacity to obtain a homogeneous Markov model of each link; (3) estimating a link connection and disconnection state arrival rate by using the node motion regulation and the link historical information; (4) calculating link connection probabilities at any moments according to the obtained link connection and disconnection state arrival rate; (5) defining the routing decision processes of the delay tolerant network as a stage-limited Markov decision model; and (6) defining a globally optimal equation according to a Markov decision theory and calculating an optimal decision sequence by adopting a backward iteration and recursion algorithm. The invention is capable of satisfying the requirements of the delay tolerant network with larger delay and selecting an optimal routing decision sequence for the delay tolerant network.

Routing decision method for delay tolerant network

Disclosed in the invention is a resource distribution method of device-to-device (D2D) communication in long term evolution-advanced (LTE-A) cellular network. A problem that large number of received D2D links and a high system frequency spectrum utilization rate can not be obtained at a D2D user intensive scene according to the existing resource distribution method can be solved. The method comprise the following steps: step one, calculating a maximum bearing interface of each uplink resource block (RB) at a first uplink time slot of each frame; step two, determining an alternative D2D link set that each uplink RB can receive for each uplink RB and constructing an interference pattern model; step three, executing a resource distribution flow for each uplink RB according to a number sequence of the RBs, solving interference degrees of D2D links in the alternative set, and receiving a D2D link meeting the requirement according to a minimum interference degree priority rule. According to the invention, on the premise that quality of service (QoS) of an existing cellular user of each RB is ensured, a plurality of D2D links are allowed to multiplex the same cellular user, thereby maximizing the number of received D2D links and substantially improving the frequency spectrum utilization rate of the cellular system.

Resource distribution method of D2D communication in LTE-A cellular network

In this paper, we investigate the interference alignment (IA) for the multiple-input–multiple-output (MIMO) multicell downlink networks in the context of a square channel matrix. We propose a novel joint user grouping and base station (BS) association algorithm. Furthermore, we design the transmit and receive beamforming matrices in closed forms by using a generalized eigenvalue decomposition (GEVD)-based IA scheme, which can exploit the special structure of a square channel matrix against the existing algorithm. Moreover, we provide three theorems to characterize the maximum achievable degrees of freedom (DoF) of the proposed GEVD-based IA scheme. Compared with the existing IA scheme, the proposed GEVD-based IA scheme can reduce the dimension of subspace occupied by the intercell interference (ICI) more efficiently, hence providing achievable DoF higher than or equal to that of the existing IA scheme.

Interference Alignment for MIMO Downlink Multicell Networks

The invention discloses a method for building a multidimensional interference space model, and the method comprises the steps: firstly selecting characteristic parameters CP of a plurality of interference signals as coordinate axes for building a multidimensional coordinate system; respectively determining the unit amount of the coordinate axes according to the resolutions corresponding to interference characteristic parameters; secondly building the multidimensional interference space model through employing the concept of mathematical space based on the coordinate system, calling the multidimensional interference space model as an interference characteristic space, and defining the multidimensional interference space model as HSI, wherein HIS=SPACE (CP1, CP2,...,CPN). The method can support the analysis, presentation and specific calculation of an interference signal of a wireless communication system through the built interference space mode and vector representation and calculation, thereby providing mathematic basis for the judgment, analysis and management of the interference signal for the system. On the basis of the multidimensional interference space model support, the guide and help can be provided for the interference management for the system through a mathematic method.

Wei Liu

Papers

Group-Sparse-Based Joint Power and Resource Block Allocation Design of Hybrid Device-to-Device and LTE-Advanced Networks

Routing decision method for delay tolerant network

Resource distribution method of D2D communication in LTE-A cellular network

Interference Alignment for MIMO Downlink Multicell Networks

Method for building multidimensional interference space model