Search

In this letter, a channel switching problem is investigated in the presence of jamming based on a game theoretic approach. First, a convex formulation of the optimal channel switching problem is proposed for a given jamming strategy. Then, considering a fixed channel switching strategy, an explicit solution of the optimal jammer power allocation problem is obtained. Consequently, a game theoretic formulation is proposed and the existence of a pure-strategy Nash equilibrium is shown for the proposed channel switching game between the transmitter and the jammer.

In this letter, a channel switching problem is investigated in the presence of jamming based on a game theoretic approach. First, a convex formulation of the optimal channel switching problem is proposed for a given jamming strategy. Then, considering a fixed channel switching strategy, an explicit solution of the optimal jammer power allocation problem is obtained. Consequently, a game theoretic formulation is proposed and the existence of a pure-strategy Nash equilibrium is shown for the proposed channel switching game between the transmitter and the jammer.

Two user Gaussian interference channel (GIC) consists of two source-destination pairs which transmit independent messages and interfere with each other. The best achievable rate region, referred to HK sum rate bound, requires the sources to split the information into public messages and private messages. As Gaussian signaling holds the potential of approaching the capacity, finding the HK sum rate achieved by Gaussian signaling is of great importance. However, The optimal power allocation over messages for Gaussian signaling are not known yet This work clearly describes the optimal power allocation and corresponding sum rate achieved by Gaussian signaling without time sharing (TS) in closed form. It lays a foundation for finding the TS strategy achieving the optimal sum rate. The obtained power allocation indicates that without TS, message splitting may not be always necessary. Besides, the conditions for using and not using message splitting are also characterized in detail. © 2014 IEEE.

Two user Gaussian interference channel (GIC) consists of two source-destination pairs which transmit independent messages and interfere with each other. The best achievable rate region, referred to HK sum rate bound, requires the sources to split the information into public messages and private messages. As Gaussian signaling holds the potential of approaching the capacity, finding the HK sum rate achieved by Gaussian signaling is of great importance. However, The optimal power allocation over messages for Gaussian signaling are not known yet This work clearly describes the optimal power allocation and corresponding sum rate achieved by Gaussian signaling without time sharing (TS) in closed form. It lays a foundation for finding the TS strategy achieving the optimal sum rate. The obtained power allocation indicates that without TS, message splitting may not be always necessary. Besides, the conditions for using and not using message splitting are also characterized in detail. © 2014 IEEE.

Two user Gaussian interference channel (GIC) consists of two source-destination pairs which transmit independent messages and interfere with each other. The best achievable rate region, referred to HK sum rate bound, requires the sources to split the information into public messages and private messages. As Gaussian signaling holds the potential of approaching the capacity, finding the HK sum rate achieved by Gaussian signaling is of great importance. However, The optimal power allocation over messages for Gaussian signaling are not known yet This work clearly describes the optimal power allocation and corresponding sum rate achieved by Gaussian signaling without time sharing (TS) in closed form. It lays a foundation for finding the TS strategy achieving the optimal sum rate. The obtained power allocation indicates that without TS, message splitting may not be always necessary. Besides, the conditions for using and not using message splitting are also characterized in detail. © 2014 IEEE.

The problem of reliable communication over the Gaussian two-way relay channel is considered and a new achievable rate region by combining structured lattice-and random Gaussian codes is presented. It is then demonstrated that the new bound can outperform previously known rate regions. In particular, having found the optimal time-sharing and power allocation policies, it is established that the proposed strategy achieves the symmetric capacity to within 1/4e approximate to 0.092 [nat] approximate to 0.133 [bit], which improves on earlier bounds., QC 20130806

The bidirectional broadcast channel with random states known at the encoder denotes a broadcast channel with two receivers where each receiver knows the message intended for the other and the transmitter knows the channel state. For such a channel we derive an Arimoto-Blahut-like algorithm to compute the weighted-rate sum maxima. To this end we provide an equivalent characterization of the achievable rate region using Shannon's method of transmit strategies, which we use to show that the optimal coding does not gain from time-sharing. Finally, the trade-off of the input distribution and the impact of the random state is discussed in two examples., QC 20110224

The deadlock avoidance problem may be defined informally as the determination, from some a priori information about the processes, resources, operating system, etc. of the “safe situations” which may be realized without endangering the smooth running of the system. When each process specifies its future needs by a flowchart of need-defined steps, a global approach to the phenomenon and its interpretation as a game between the operating system and the processes allows formalization of risk and safety concepts. The bipartite graph representation of this game may then be used to construct explicitly the set of safe states and to study their properties., SCOPUS: ar.j, info:eu-repo/semantics/published

This is a description of a logical approach to the problem of selecting a commercial time-sharing system for a specific application. Supporting information was gathered from current technical literature and from discussions with both vendors and users. The final result is a blend of the principles of economic analysis and the realities of data processing., http://archive.org/details/measurementevalu00call, Lieutenant, United States Coast Guard, Approved for public release; distribution is unlimited.

Verfasserin: Verena Moritz, Diplomarbeit Universität Innsbruck 2018

A GPSS model of the CP/CMS time-sharing computer system at the Naval Postgraduate School was constructed, and was used in three experiments to investigate the performance of the system under a variety of conditions. In each of the experiments the model generated auto-correlated sequences of observations which were analyzed using techniques adapted from spectral analysis. An experiment to determine the effect of an increased number of terminals on average response time revealed that the system adequately could support a 25% increase in the number of terminals, and that the number of terminals was limited by the magnetic disk I/O capability. In a second experiment it was found that increasing the number of disks from four to eight would enable the system to support up to 20 terminals. A final experiment involving the examination of a new scheduling algorithm showed no significant changes in average response times., http://archive.org/details/asimulationstudy1094513044, Lieutenant, United States Navy, Lieutenant, United States Naval Reserve, Approved for public release; distribution is unlimited.

Verfasserin: Verena Moritz, Diplomarbeit Universität Innsbruck 2018