Langford B. White
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Langford B. White has a total of 13 co-authors. Here are the top co-authors by number of shared publications:
- Duong D. Nguyen
The University of Adelaide Adelaide Australia
3 shared publications - Francesco Carravetta
IASI-CNR, IASI-CNR, Roma, Italy Italy 00185
2 shared publications - Hung Tan Nguyen
New Mexico State University
2 shared publications - Riley Bruce-Doust
Univ Adelaide, Sch Elect & Elect Engn, Adelaide, SA 5005, Australia
2 shared publications - Belinda A. Chiera
University of Adelaide, Australia
1 shared publication - En Cheng
Key Laboratory of Underwater Acoustic Communication and Marine Information Technology, Ministry of Education, Xiamen University, Xiamen, China
1 shared publication
Latest Publications
- Open Access
Satisfaction and Regret in Stackelberg Games
This paper introduces the new concept of (follower) satisfaction in Stackelberg games and compares the standard Stackelberg game with its satisfaction version. Simulation results are presented which suggest that the follower adopting satisfaction generally increases leader utility. This important new result is proven for the case where leader strategies to commit to are restricted to be deterministic (pure strategies). The paper then addresses the application of regret based algorithms to the Stackelberg problem. Although it is known that the follower adopts a no-regret position in a Stackelberg solution, this is not generally the case for the leader. The report examines the convergence behaviour of unconditional and conditional regret matching (RM) algorithms in the Stackelberg setting. The paper shows that, in the examples considered, that these algorithms either converge to any pure Nash equilibria for the simultaneous move game, or to some mixed strategies which do not have the "no-regret" property. In one case, convergence of the conditional RM algorithm over both players to a solution "close" to the Stackelberg case was observed. The paper argues that further research in this area, in particular when applied in the satisfaction setting could be fruitful.
Open AccessSatisfaction and Regret in Stackelberg Games
This paper introduces the new concept of (follower) satisfaction in Stackelberg games and compares the standard Stackelberg game with its satisfaction version. Simulation results are presented which suggest that the follower adopting satisfaction generally increases leader utility. This important new result is proven for the case where leader strategies to commit to are restricted to be deterministic (pure strategies). The paper then addresses the application of regret based algorithms to the Stackelberg problem. Although it is known that the follower adopts a no-regret position in a Stackelberg solution, this is not generally the case for the leader. The report examines the convergence behaviour of unconditional and conditional regret matching (RM) algorithms in the Stackelberg setting. The paper shows that, in the examples considered, that these algorithms either converge to any pure Nash equilibria for the simultaneous move game, or to some mixed strategies which do not have the "no-regret" property. In one case, convergence of the conditional RM algorithm over both players to a solution "close" to the Stackelberg case was observed. The paper argues that further research in this area, in particular when applied in the satisfaction setting could be fruitful.
- 1 November 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 65 (11) , 4854-4859
A Forgetting Property of Reciprocal Chains
- 1 November 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 65 (11) , 4854-4859
A Forgetting Property of Reciprocal Chains
- 29 April 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 65 (1) , 389-396
State-Space Realizations and Optimal Smoothing for Gaussian Generalized Reciprocal Processes
This technical note derives stochastic realisation and optimal smoothing algorithms for a class of Gaussian Generalised Reciprocal Processes (GGRP). The note exploits the interplay between reciprocal processes and Markov bridges which underpin the GGRP model. A forwards-backwards algorithm for stochastic realisation of GGRP is described. The form on the inverse covariance matrix for the GGRP is used, via Cholesky factorisation, to derive a procedure for optimal (MMSE) smoothing of GGRP observed in noise. The note demonstrates that the associated smoothing error is also a GGRP with known covariance which may be used to assess the performance of smoothing as a function of the model parameters. A numerical example is provided to illustrate the performance of the MMSE smoother compared to those derived from compatible Markov and Reciprocal model based algorithms.
- 29 April 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 65 (1) , 389-396
State-Space Realizations and Optimal Smoothing for Gaussian Generalized Reciprocal Processes
This technical note derives stochastic realisation and optimal smoothing algorithms for a class of Gaussian Generalised Reciprocal Processes (GGRP). The note exploits the interplay between reciprocal processes and Markov bridges which underpin the GGRP model. A forwards-backwards algorithm for stochastic realisation of GGRP is described. The form on the inverse covariance matrix for the GGRP is used, via Cholesky factorisation, to derive a procedure for optimal (MMSE) smoothing of GGRP observed in noise. The note demonstrates that the associated smoothing error is also a GGRP with known covariance which may be used to assess the performance of smoothing as a function of the model parameters. A numerical example is provided to illustrate the performance of the MMSE smoother compared to those derived from compatible Markov and Reciprocal model based algorithms.
- Open Access
- 11 October 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 6, 61212-61222
Evaluating Performance of RAT Selection Algorithms for 5G Hetnets
Next generation 5G cellular networks will consist of multiple technologies for devices to access the network at the edge. One of the keys to 5G is therefore the ability for devices to intelligently select its Radio Access Technology (RAT). There have been several proposals for RAT selection in the last few years. Understanding the performance and limitation of these RAT selection solutions is important for their deployment in future 5G heterogeneous networks. In this article, we provide a taxonomy and comparative performance analysis of recent RAT selection algorithms, including the different network models that were used to evaluate these works. We combine these different network models to build a benchmark for evaluating RAT selection algorithms in a 5G environment. We implement the representative algorithms of different approaches and cross compare them in our benchmark. From the experiments conducted, we illustrate how the different network parameters such as the number of base stations visible to a user, and the available link bandwidths could impact the performance of these algorithms.
- 11 October 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 6, 61212-61222
Open AccessEvaluating Performance of RAT Selection Algorithms for 5G Hetnets
Next generation 5G cellular networks will consist of multiple technologies for devices to access the network at the edge. One of the keys to 5G is therefore the ability for devices to intelligently select its Radio Access Technology (RAT). There have been several proposals for RAT selection in the last few years. Understanding the performance and limitation of these RAT selection solutions is important for their deployment in future 5G heterogeneous networks. In this article, we provide a taxonomy and comparative performance analysis of recent RAT selection algorithms, including the different network models that were used to evaluate these works. We combine these different network models to build a benchmark for evaluating RAT selection algorithms in a 5G environment. We implement the representative algorithms of different approaches and cross compare them in our benchmark. From the experiments conducted, we illustrate how the different network parameters such as the number of base stations visible to a user, and the available link bandwidths could impact the performance of these algorithms.
- 1 December 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 70-73
Broadband sonar waveform design with rational orthogonal wavelet
The paper proposes a new family of broadband sonar pulses. Each pulse is formed by a combination of orthogonal wavelet basis functions as subpulses with variable scaling factor and shifts. The wavelet adopted is a complex rational orthogonal wavelet (CROW) with a fractional scale dilation factor valued between 1 and 2. The number of subpulses, scaling factor and their time shifts are designed to ensure that the sonar pulse conforms to a designated signal spectrum. The issue of peak-to-average power ratio (PAPR) of the sonar pulse is explored and design example is presented with minimized PAPR. The proposed waveform design features efficient detection algorithm based on CROW analysis filter bank (FB). The detection performance is analyzed regarding Doppler resistance, noise mitigation and multipath by simulations. Preliminary results show that the designed detection system is able to cope with severe multipath, high ambient noise and sever Doppler dispersion.
- 1 December 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 70-73
Broadband sonar waveform design with rational orthogonal wavelet
The paper proposes a new family of broadband sonar pulses. Each pulse is formed by a combination of orthogonal wavelet basis functions as subpulses with variable scaling factor and shifts. The wavelet adopted is a complex rational orthogonal wavelet (CROW) with a fractional scale dilation factor valued between 1 and 2. The number of subpulses, scaling factor and their time shifts are designed to ensure that the sonar pulse conforms to a designated signal spectrum. The issue of peak-to-average power ratio (PAPR) of the sonar pulse is explored and design example is presented with minimized PAPR. The proposed waveform design features efficient detection algorithm based on CROW analysis filter bank (FB). The detection performance is analyzed regarding Doppler resistance, noise mitigation and multipath by simulations. Preliminary results show that the designed detection system is able to cope with severe multipath, high ambient noise and sever Doppler dispersion.
- 18 August 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 63 (4) , 1097-1104
Track Extraction With Hidden Reciprocal Chains
This Technical Note (TN) develops Bayesian track extraction algorithms for targets modelled as hidden reciprocal chains (HRC). HRC are a class of finite-state random process models that generalise the familiar hidden Markov chains (HMC). HRC are able to model the “intention” of a target to proceed from a given origin to a destination, behaviour which cannot be properly captured by a HMC. While Bayesian estimation problems for HRC have previously been studied, this TN focuses principally on the problem of track extraction, that is, confirming target existence in a set of observations of uncertain origin. Simulation examples are presented which show that the additional model information contained in a HRC, measured in terms of Kullback-Leibler divergence, improves detection performance when compared to HMC models.
- 18 August 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 63 (4) , 1097-1104
Track Extraction With Hidden Reciprocal Chains
This Technical Note (TN) develops Bayesian track extraction algorithms for targets modelled as hidden reciprocal chains (HRC). HRC are a class of finite-state random process models that generalise the familiar hidden Markov chains (HMC). HRC are able to model the “intention” of a target to proceed from a given origin to a destination, behaviour which cannot be properly captured by a HMC. While Bayesian estimation problems for HRC have previously been studied, this TN focuses principally on the problem of track extraction, that is, confirming target existence in a set of observations of uncertain origin. Simulation examples are presented which show that the additional model information contained in a HRC, measured in terms of Kullback-Leibler divergence, improves detection performance when compared to HMC models.
- 27 June 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Wireless Communications
- Vol. 16 (9) , 6062-6076
Reinforcement Learning With Network-Assisted Feedback for Heterogeneous RAT Selection
Future wireless networks (e.g., 5G) will consist of multiple radio access technologies (RATs). In these networks, deciding which RAT users should connect to is not a trivial problem. Current fully distributed algorithms although guaranteeing convergence to equilibrium states, are often slow, require high exploration times and may converge to undesirable equilibria. To overcome these limitations, this paper develops a network feedback framework that uses limited network-assisted information to improve efficiency of distributed algorithms for RAT selection problem. We prove theoretically that a fully distributed algorithm developed within this framework is guaranteed to converge to a set of correlated equilibria. Our framework guarantees convergence in self-play even when only a single user applies the algorithm. Simulation results demonstrate that our solution: 1) is highly efficient with fast convergence time and low signaling overheads while achieving competitive, if not better, performance both in fairness and utility, as well as achieving lower per-user switchings than state-of-the-art algorithms; and 2) can flexibly support a wide range of network-assisted feedback. The simulations demonstrate the effectiveness of our solution in a heterogeneous environment, where users may potentially apply a number of different RAT selection procedures.
- 27 June 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Wireless Communications
- Vol. 16 (9) , 6062-6076
Reinforcement Learning With Network-Assisted Feedback for Heterogeneous RAT Selection
Future wireless networks (e.g., 5G) will consist of multiple radio access technologies (RATs). In these networks, deciding which RAT users should connect to is not a trivial problem. Current fully distributed algorithms although guaranteeing convergence to equilibrium states, are often slow, require high exploration times and may converge to undesirable equilibria. To overcome these limitations, this paper develops a network feedback framework that uses limited network-assisted information to improve efficiency of distributed algorithms for RAT selection problem. We prove theoretically that a fully distributed algorithm developed within this framework is guaranteed to converge to a set of correlated equilibria. Our framework guarantees convergence in self-play even when only a single user applies the algorithm. Simulation results demonstrate that our solution: 1) is highly efficient with fast convergence time and low signaling overheads while achieving competitive, if not better, performance both in fairness and utility, as well as achieving lower per-user switchings than state-of-the-art algorithms; and 2) can flexibly support a wide range of network-assisted feedback. The simulations demonstrate the effectiveness of our solution in a heterogeneous environment, where users may potentially apply a number of different RAT selection procedures.
- 31 March 2006
- Published by Elsevier in Digital Signal Processing
- Vol. 16 (2) , 164-179
Analysing the convergence behaviour of the PIC detector
- 31 March 2006
- Published by Elsevier in Digital Signal Processing
- Vol. 16 (2) , 164-179
Analysing the convergence behaviour of the PIC detector
- Open Access
- 30 March 2006
- Published by National Institute of Telecommunications in Journal of Telecommunications and Information Technology
- No. 1,p. 30-37
An adaptive LQG TCP congestion controller for the Internet
This paper addresses the problem of congestion control for transmission control protocol (TCP) traffic in the Internet. The method proposed builds on the ideas of TCP Vegas, a true feedback control approach to congestion management of TCP traffic. The new method is based on an adaptive linear quadratic Gaussian (LQG) formulation which uses an extended least squares system identification algorithm com- bined with optimal LQG control. Simulation experiments indicate that the new technique inherits good equilibrium properties from TCP Vegas, but has much superior transient responses which, the paper argues, is important for good dynamic congestion control.
- 30 March 2006
- Published by National Institute of Telecommunications in Journal of Telecommunications and Information Technology
- No. 1,p. 30-37
Open AccessAn adaptive LQG TCP congestion controller for the Internet
This paper addresses the problem of congestion control for transmission control protocol (TCP) traffic in the Internet. The method proposed builds on the ideas of TCP Vegas, a true feedback control approach to congestion management of TCP traffic. The new method is based on an adaptive linear quadratic Gaussian (LQG) formulation which uses an extended least squares system identification algorithm com- bined with optimal LQG control. Simulation experiments indicate that the new technique inherits good equilibrium properties from TCP Vegas, but has much superior transient responses which, the paper argues, is important for good dynamic congestion control.