Matthew Hawes
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Matthew Hawes has a total of 5 co-authors. Here are the top co-authors by number of shared publications:
- Hayder M. Amer
Technical Institute of Basra Southern Technical University‐Iraq Basra Iraq
2 shared publications - Lyudmila Mihaylova
School of Electrical and Electronic Engineering University of Sheffield Sheffield UK
2 shared publications - Wei Liu
Hong Kong Polytechnic University
2 shared publications Christos Tsotskas
Transport Systems Catapult, Milton Keynes, United Kingdom
1 shared publication- Patrizia Franco
Modelling and Appraisal Connected Places Catapult Milton Keynes United Kingdom of Great Britain and Northern Ireland
1 shared publication
Latest Publications
- Open Access
- 1 October 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-6
A game theory approach for congestion control in vehicular ad hoc networks
The continuous transfer of messages in vehicular ad hoc networks leads to a heavy network traffic load. This causes congestion in the wireless channel which degrades the reliability of the network and significantly affects the Quality of Service (QoS) parameters such as packet loss, throughput and average delay. Therefore, it is vital to adapt the transmitting data rates in a way that ensure that acceptable performance is achieved and that there is reliable communication of information between vehicles in smart cities. This means the information will be delivered in a timely manner to the drivers, which in turn allows implementation of efficient solutions for improved mobility and comfort in intelligent transportation systems. In this paper, congestion control in the communication channel has been formulated as a non-cooperative game approach and the vehicles act as players in the game to request a high data rate in a selfish way. The solution of the optimal game is presented by using Karush-Kuhn-Tucker conditions and Lagrange multipliers. Simulation results show that the proposed method improves network efficiency in the presence of congestion by an overall average of 50.40%, 49.37%, 58.39% and 36.66% in terms of throughput, average delay, number of lost packets and total channel busy time as compared to Carrier-Sense Multiple Access with Collision Avoidance mechanism.
- 1 October 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-6
Open AccessA game theory approach for congestion control in vehicular ad hoc networks
The continuous transfer of messages in vehicular ad hoc networks leads to a heavy network traffic load. This causes congestion in the wireless channel which degrades the reliability of the network and significantly affects the Quality of Service (QoS) parameters such as packet loss, throughput and average delay. Therefore, it is vital to adapt the transmitting data rates in a way that ensure that acceptable performance is achieved and that there is reliable communication of information between vehicles in smart cities. This means the information will be delivered in a timely manner to the drivers, which in turn allows implementation of efficient solutions for improved mobility and comfort in intelligent transportation systems. In this paper, congestion control in the communication channel has been formulated as a non-cooperative game approach and the vehicles act as players in the game to request a high data rate in a selfish way. The solution of the optimal game is presented by using Karush-Kuhn-Tucker conditions and Lagrange multipliers. Simulation results show that the proposed method improves network efficiency in the presence of congestion by an overall average of 50.40%, 49.37%, 58.39% and 36.66% in terms of throughput, average delay, number of lost packets and total channel busy time as compared to Carrier-Sense Multiple Access with Collision Avoidance mechanism.
- Open Access
- 1 July 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 215, 1-8
Traffic state estimation via a particle filter over a reduced measurement space
- 1 July 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 215, 1-8
Open AccessTraffic state estimation via a particle filter over a reduced measurement space
- Open Access
- 9 April 2015
- Published by Wiley in International Journal of Antennas and Propagation
- Vol. 2015, 1-9
Design of Fixed Beamformers Based on Vector-Sensor Arrays
Vector-sensor arrays such as those composed of crossed dipole pairs are used as they can account for a signal’s polarisation in addition to the usual direction of arrival information, hence allowing expanded capacity of the system. The problem of designing fixed beamformers based on such an array, with a quaternionic signal model, is considered in this paper. Firstly, we consider the problem of designing the weight coefficients for a fixed set of vector-sensor locations. This can be achieved by minimising the sidelobe levels while keeping a unitary response for the main lobe. The second problem is then how to find a sparse set of sensor locations which can be efficiently used to implement a fixed beamformer. We propose solving this problem by converting the traditionalnorm minimisation associated with compressive sensing into a modifiednorm minimisation which simultaneously minimises all four parts of the quaternionic weight coefficients. Further improvements can be made in terms of sparsity by converting the problem into a series of iteratively solved reweighted minimisations, as well as being able to enforce a minimum spacing between active sensor locations. Design examples are provided to verify the effectiveness of the proposed design methods.- 9 April 2015
- Published by Wiley in International Journal of Antennas and Propagation
- Vol. 2015, 1-9
Open AccessDesign of Fixed Beamformers Based on Vector-Sensor Arrays
Vector-sensor arrays such as those composed of crossed dipole pairs are used as they can account for a signal’s polarisation in addition to the usual direction of arrival information, hence allowing expanded capacity of the system. The problem of designing fixed beamformers based on such an array, with a quaternionic signal model, is considered in this paper. Firstly, we consider the problem of designing the weight coefficients for a fixed set of vector-sensor locations. This can be achieved by minimising the sidelobe levels while keeping a unitary response for the main lobe. The second problem is then how to find a sparse set of sensor locations which can be efficiently used to implement a fixed beamformer. We propose solving this problem by converting the traditionalnorm minimisation associated with compressive sensing into a modifiednorm minimisation which simultaneously minimises all four parts of the quaternionic weight coefficients. Further improvements can be made in terms of sparsity by converting the problem into a series of iteratively solved reweighted minimisations, as well as being able to enforce a minimum spacing between active sensor locations. Design examples are provided to verify the effectiveness of the proposed design methods. - 1 August 2014
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 15461874,p. 426-430
A quaternion-valued reweighted minimisation approach to sparse vector sensor array design
In this work, the design of sparse vector sensor arrays is studied based on quaternionic formulations, which is a further extension of the recently proposed compressive sensing (CS) based design methods. As with the traditional case, sparsity of the solution can be improved by converting the problem into a series of iteratively solved reweighted minimisations, where locations with a small absolute coefficient value are more heavily penalised compared to those with a larger absolute value. Moreover, this reweighted scheme is further modified to incorporate a size constraint into the design so that practical antennas with a non-zero size can fit into the designed locations.
- 1 August 2014
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 15461874,p. 426-430
A quaternion-valued reweighted minimisation approach to sparse vector sensor array design
In this work, the design of sparse vector sensor arrays is studied based on quaternionic formulations, which is a further extension of the recently proposed compressive sensing (CS) based design methods. As with the traditional case, sparsity of the solution can be improved by converting the problem into a series of iteratively solved reweighted minimisations, where locations with a small absolute coefficient value are more heavily penalised compared to those with a larger absolute value. Moreover, this reweighted scheme is further modified to incorporate a size constraint into the design so that practical antennas with a non-zero size can fit into the designed locations.