Gordon Sutton

Dr. Gordon Sutton


Research Focus & Metrics

Academic Career Length

27Years (2000-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
6 February 2019 in IEEE Communications Surveys & Tutorials
Verified
Journal Article
Closed access
GSGordon Sutton
Gordon Sutton
JZJie Zeng
Jie Zeng
Ren Ping LiuRen Ping Liu
Ren Ping Liu
WNWei Ni
Wei Ni
DNDiep Nguyen
Diep Nguyen
TLTiejun Lv
Tiejun Lv
Future 5th generation (5G) networks are expected to enable three key services -enhanced mobile broadband (eMBB), massive machine type communications (mMTC) and ultra-reliable and low latency communications (URLLC). As per the 3rd generation partnership project (3GPP) URLLC requirements, it is expected that the reliability of one transmission of a 32 byte packet will be at least 99.999% and the latency will be at most 1 ms. This unprecedented level of reliability and latency will yield various new applications such as smart grids, industrial automation and intelligent transport systems. In this survey we present potential future URLLC applications, and summarize the corresponding reliability and latency requirements. We provide a comprehensive discussion on physical (PHY) and medium access control (MAC) layer techniques that enable URLLC, addressing both licensed and unlicensed bands. The paper evaluates the relevant PHY and MAC techniques for their ability to improve the reliability and reduce the latency. We identify that enabling long-term evolution (LTE) to coexist in the unlicensed spectrum is also a potential enabler of URLLC in the unlicensed band, and provide numerical evaluations. Lastly, the paper discusses the potential future research directions and challenges in achieving the URLLC requirements.

17 June 2010 in IEEE Transactions on Wireless Communications
Verified
Journal Article
Closed access
Ren Ping LiuRen Ping Liu
Ren Ping Liu
GSGordon Sutton
Gordon Sutton
Iain CollingsIain Collings
Iain Collings
Quality of Service (QoS) and queue management are important issues for IEEE 802.11 systems. However, existing 2-dimensional (2-D) Markov chain models of 802.11 systems are unable to capture the complete QoS performance and queueing behavior due to the lack of an adequate finite buffer model. We present a 3-dimensional (3-D) Markov chain that integrates the 802.11 system contention resolution and queueing processes into one model. The 3rd dimension, that models the queue length, allows us to accurately capture important QoS measures, delay and loss, plus throughput and queue length, for realistic 802.11 systems with finite buffer under finite load. We derive an efficient method for solving the steady state probabilities of the Markov chain. Our 3-D Markov chain is the first finite buffer model defined and solved for 802.11 systems. The solutions, validated by extensive simulations, capture the system dynamics over a wide range of traffic load, buffer capacity, and network size. Our 3-D model points to the existence of an effective maximum throughput and shows its relationship with buffer capacity. We demonstrate that our 3-D model can also be used in resource allocation to determine adequate buffer sizes under a particular QoS constraint.

2 April 2018 in IEEE Network
Verified
Journal Article
Closed access
GSGordon Sutton
Gordon Sutton
JZJie Zeng
Jie Zeng
Ren Ping LiuRen Ping Liu
Ren Ping Liu
WNWei Ni
Wei Ni
DNDiep Nguyen
Diep Nguyen
ZZZhang Zhang
Zhang Zhang
In this article, we aim to address the question of how to exploit the unlicensed spectrum to achieve URLLC. Potential URLLC PHY mechanisms are reviewed and then compared via simulations to demonstrate their potential benefits to URLLC. Although a number of important PHY techniques help with URLLC, the PHY layer exhibits an intrinsic trade-off between latency and reliability, posed by limited and unstable wireless channels. We then explore MAC mechanisms and discuss multi-channel strategies for achieving low-latency LTE unlicensed band access. We demonstrate, via simulations, that the periods without access to the unlicensed band can be substantially reduced by maintaining channel access processes on multiple unlicensed channels, choosing the channels intelligently, and implementing RTS/CTS.

1 January 2000
Verified
Book Chapter
Closed access
PDF file
GSGordon Sutton
Gordon Sutton
RBRobert R. Bitmead
Robert R. Bitmead

2 September 2013 in Analytical Chemistry
Verified
Journal Article
Closed access
HSHelen Salouros
Helen Salouros
GSGordon Sutton
Gordon Sutton
JHJoanna Howes
Joanna Howes
DHD. Brynn Hibbert
D. Brynn Hibbert
MCMichael Collins
Michael Collins

21 March 2014 in IEEE Transactions on Wireless Communications
Verified
Journal Article
Closed access
Ren Ping LiuRen Ping Liu
Ren Ping Liu
GSGordon Sutton
Gordon Sutton
Iain CollingsIain Collings
Iain Collings
Large scale deployment of machine-to-machine (M2M) communication networks hinges on the cost and energy efficient design of the embedded devices. Standard WLAN power save mechanisms, which are designed for human communications, experience performance degradation and unbalanced energy consumptions in M2M communication networks. We develop a novel analytical model that takes into account the fundamentally different network architecture and traffic patterns of M2M communications. Our model accurately characterizes the high contention and long packet delay found in M2M communication networks, while previous models underestimate such measures. To combat such performance decline, we propose a new algorithm that enhances existing power save mechanisms to extend the lifetime of a M2M communication network. We call this the Offset ListenInterval (OLi) Algorithm. The OLi algorithm spreads the M2M traffic evenly with calculated offsets to alleviate network contention and reduce packet delay. Our analytical model is then used to evaluate the energy efficiency of our OLi algorithm and compare with the standard power save mechanisms. Our results show that the proposed OLi algorithm extends the lifetime by up to 40%, and scales up to thousands of nodes in a M2M communication network.