GNGam D. Nguyen

Gam D. Nguyen

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Gam D. Nguyen has a total of 8 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Top Cited Papers

    On the Age of Information With Packet Deadlines

    by Clement Kam, Sastry Kompella, Gam D. Nguyen, Jeffrey E. Wieselthier, Anthony Ephremides

    We study the age of information, which is a measure of the freshness of a continually updated piece of information as observed at a remote monitor. The age of information metric has been studied for a variety of different queueing systems, and in this work, we introduce a packet deadline as a control mechanism to study its impact on the average age of information for an M/M/1/2 queueing system. We analyze the system for the cases of a fixed deadline and a random exponential deadline and derive closed-form expressions for the average age. We also derive a closed-form expression for the optimal average deadline for the random exponential case. Our numerical results show the relationship of the age performance to that of the M/M/1/1 and M/M/1/2 systems, and we demonstrate that using a deadline can outperform both the M/M/1/1 and M/M/1/2 without deadline.


  • Impact of Hostile Interference on Wireless Link Connectivity

    by Gam D. Nguyen, Sastry Kompella, Clement Kam, Jeffrey E. Wieselthier, Anthony Ephremides

    We formulate the interaction between link connectivity and hostile interference in a wireless system as a non-zero-sum two-player game. One player is the transmitter aiming to maintain the connections to its receivers, while the other player is the interferer aiming to disrupt the connections. The players' strategies are their transmitted power levels. We focus on the case in which the ratio of the averages of the channel power gains for the transmitter and interferer are the same at all receivers. We then provide closed-form expressions for the Nash and Stackelberg equilibria. When the channel is affected by Rayleigh fading, we show that both players have the same power cost at Nash equilibria. In addition, the Stackelberg strategies dominate the Nash strategies, i.e., the utility functions of the Stackelberg equilibria exceed or equal those of the Nash equilibria.


  • Achievable Throughput under BER Constraints via Transmission Scheduling and Multiuser Detection

    by Gam D. Nguyen, Sastry Kompella, Clement Kam

    We evaluate the throughput that can be achieved under BER constraints by combined use of transmission scheduling and multiuser detection. A schedule is a rule that specifies which subset of users is allowed to simultaneously transmit in a time slot. These subsets of overlapping transmissions, which can vary in different time slots of the transmission frame, are decoded by receivers equipped with multiuser detection. The goal is to find the largest such subsets under the requirement that each transmission satisfies a BER constraint. The joint problem of scheduling and multiuser-detection is highly complex in general. However, for certain class of multiuser detectors, the problem has efficient and optimal solution. By constructing transmission schedules that directly reflect the performance and exploit the capability of the multiuser detection receivers, as expected, multiuser detection-based scheduling significantly outperforms other methods such as TDMA and the conventional single-user detection-based scheduling.


  • Frequency Selection and Relay Placement for Energy Efficiency in Underwater Acoustic Networks

    by Clement Kam, Sastry Kompella, Gam D. Nguyen, Anthony Ephremides, Zaihan Jiang

    When planning the deployment of an underwater network, the frequency-dependent nature of the underwater acoustic channel has a significant impact on network performance. The quality of acoustic communication in the underwater medium is heavily dependent on the choice of frequency and link length. In this paper, we consider the problems of choosing the proper frequency and node locations for minimizing energy consumption in the network. First, we look at the single frequency that minimizes the transmission power for a network with links of varying lengths. We propose approximate models for this frequency for cases when the link lengths are known exactly and when only probabilistic knowledge of the link lengths is available. Second, to better understand the importance of the actual locations of nodes, we study the problem of relay placement in a multihop line network. We demonstrate that utilizing different frequencies has an impact on the optimal relay placement, and we provide conditions for which the optimal placement is equidistant on the line. Finally, we solve the problem of jointly optimizing the relay placement and the single-frequency choice for a line network. To validate our results, we test our models using simulations of network deployment, and we test our optimal relay placement strategy for a variety of underwater channel settings.


  • Parallel TDMA Scheduling for Multiple-Destination Wireless Networks

    by Gam D. Nguyen, Sastry Kompella, Jeffrey E. Wieselthier, Anthony Ephremides

    We study transmission strategies in a multiple-source, multiple-destination wireless network. Each source transmits packets that are intended for a particular destination. However, a transmitted packet can cause interference at other destinations. Our primary performance measure is throughput, which we define to be the average number of packets that are successfully received per intended destination per time slot. The sources are first divided into groups, based on the intended destination of their packets. In our parallel method, each group operates according to its own local protocol (e.g., TDMA), concurrently with and independently of the other groups. Our results show the impact of transmission schedules, channel fading, receiver noise, and other-user interference on network performance. We then show that, for given channel statistics and topology configurations, the network performance can be significantly improved when the groups in the network coordinate their transmissions according to an optimal schedule. Further, in many cases, even the use of randomly generated parallel schedules can provide considerably higher performance than traditional TDMA.

  • Impact of relay placement on energy efficiency in Underwater Acoustic Networks

    by Clement Kam, Sastry Kompella, Gam D. Nguyen, Anthony Ephremides, Zaihan Jiang

    In spite of the body of work in modeling the underwater channel, there is still considerable lack of fundamental understanding that is required to enable the widespread deployment of Underwater Acoustic Networks (UANs). In this paper we study one such aspect, namely the impact of relay placement on the overall transmit power required to maintain a certain quality of communication between two nodes, in a multi-hop underwater line network. We start by analyzing a simple case involving one relay and a common signal frequency over all hops. We then extend the analysis to include different signal frequencies over different hops. Specifically, in each case, we find through analysis and numerical evaluation the optimal relay placement that minimizes total transmit power, thereby improving energy efficiency. We observe that the optimal relay locations are not always equidistant, especially when each hop can choose from a set of signal frequencies for transmission.


  • Fast CRCs

    by Gam D. Nguyen

    CRCs have desirable properties for effective error detection. But their software implementation, which relies on many steps of the polynomial division, is typically slower than other codes such as weaker checksums. A relevant question is whether there are some particular CRCs that have fast implementation. In this paper, we introduce such fast CRCs as well as an effective technique to implement them. For these fast CRCs, even without using table lookup, it is possible either to eliminate or to greatly reduce many steps of the polynomial division during their computation.