Mustafa Tekinay
Mustafa Tekinay has a total of 8 co-authors. Here are the top co-authors by number of shared publications:
- Cory Beard
University of Missouri-Kansas City
3 shared publications - Appie Van De Liefvoort
Department of Computer Science Electrical Engineering, University of Missouri-Kansas City, Kansas City, MO, 64110 USA
1 shared publication - Ganesh Thiagarajan
Division of Natural and Built Environment, University of Missouri-Kansas City , Kansas City, MO 64110
1 shared publication Matthew Brunton
1 shared publication- Matthew Brunton
Integrated Roadways LLC, Kansas City, USA
1 shared publication Thiagarajan Ganesh
1 shared publication
Latest Publications
- Open Access
- 26 June 2026
- Published by Secretariat of Defence Industries of the Republic of Türkiye in Journal of Defence and Security Industries: Strategy and Technology
- Vol. 1 (2) , 59-87
Volume Over Lethality: A Matrix-Exponential Framework for Defending Drone Swarms
We study large, heterogeneous drone swarms composed of both threat and decoy drones. The defender's engagement is modelled as a multi-stage stochastic process that captures uncertainty and variability in response times. A non-discriminatory defender is considered in which threat and decoy drones are treated identically. We adopt a matrix-exponential framework that yields tractable, closed-form expressions for key performance measures. The results indicate that swarm size has a substantially stronger impact on defence success than threat-decoy composition. For a typical defender, swarms exceedingly roughly ten drones may exceed single-defender swarm-size capacity under the baseline modelling assumptions, even with high decoy fractions. While a typical defender can reliably handle seven threat drones, augmenting the swarm with seven decoys reduces the probability of successful defence from 0.93 to 0.09. From a cost perspective, heterogeneous drone swarms can reduce overall cost by up to 67% when decoy drones are priced at approximately one tenth of the cost of threat drones. Finally, performance depends not only on aggregate rates but also on individual stage bottlenecks. Under idealised conditions where each engagement stage completes in approximately one second on average, single-defender capacity increases to approximately 35-40 drones.
- 26 June 2026
- Published by Secretariat of Defence Industries of the Republic of Türkiye in Journal of Defence and Security Industries: Strategy and Technology
- Vol. 1 (2) , 59-87
Open AccessVolume Over Lethality: A Matrix-Exponential Framework for Defending Drone Swarms
We study large, heterogeneous drone swarms composed of both threat and decoy drones. The defender's engagement is modelled as a multi-stage stochastic process that captures uncertainty and variability in response times. A non-discriminatory defender is considered in which threat and decoy drones are treated identically. We adopt a matrix-exponential framework that yields tractable, closed-form expressions for key performance measures. The results indicate that swarm size has a substantially stronger impact on defence success than threat-decoy composition. For a typical defender, swarms exceedingly roughly ten drones may exceed single-defender swarm-size capacity under the baseline modelling assumptions, even with high decoy fractions. While a typical defender can reliably handle seven threat drones, augmenting the swarm with seven decoys reduces the probability of successful defence from 0.93 to 0.09. From a cost perspective, heterogeneous drone swarms can reduce overall cost by up to 67% when decoy drones are priced at approximately one tenth of the cost of threat drones. Finally, performance depends not only on aggregate rates but also on individual stage bottlenecks. Under idealised conditions where each engagement stage completes in approximately one second on average, single-defender capacity increases to approximately 35-40 drones.
- 4 February 2023
- Published by Springer Nature in Innovative Infrastructure Solutions
- Vol. 8 (3) , 1-18
Applications of fiber optic sensors in traffic monitoring: a review
- 4 February 2023
- Published by Springer Nature in Innovative Infrastructure Solutions
- Vol. 8 (3) , 1-18
Applications of fiber optic sensors in traffic monitoring: a review
- Open Access
- 15 March 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in TechRxiv
Applications of Fiber Optic Sensors in Traffic Monitoring: A Review
Fiber optic sensors are becoming key tools in building more robust and accurate traffic monitoring systems. In this survey, we present various preliminary implementations and a discussion about some of the key design points. The scanning rates of the sensors should be at least 500 Hz to correctly capture the moving vehicles. The size of the sensors should not be larger than approximately 50 cm to enable individual axle detection. A minimum of 1με sensor resolution is required to detect light weight vehicles. Adaptive filtering, Wavelet denoising and neural networks are some of the tools used to improve the performance. Sensors that reside on the surface of the pavement might lead to biased data and cause destructive implementation. There is yet to be a unified solution. We need a global, user-friendly, consistent, durable, environment-friendly solution with high system availability that would work on bridges, in urban areas and in tunnels. We believe precast slabs of road pavement embedded with sensors that are manufactured at a facility would give us the best opportunity to meet those demands.
- 15 March 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in TechRxiv
Open AccessApplications of Fiber Optic Sensors in Traffic Monitoring: A Review
Fiber optic sensors are becoming key tools in building more robust and accurate traffic monitoring systems. In this survey, we present various preliminary implementations and a discussion about some of the key design points. The scanning rates of the sensors should be at least 500 Hz to correctly capture the moving vehicles. The size of the sensors should not be larger than approximately 50 cm to enable individual axle detection. A minimum of 1με sensor resolution is required to detect light weight vehicles. Adaptive filtering, Wavelet denoising and neural networks are some of the tools used to improve the performance. Sensors that reside on the surface of the pavement might lead to biased data and cause destructive implementation. There is yet to be a unified solution. We need a global, user-friendly, consistent, durable, environment-friendly solution with high system availability that would work on bridges, in urban areas and in tunnels. We believe precast slabs of road pavement embedded with sensors that are manufactured at a facility would give us the best opportunity to meet those demands.
- 10 March 2020
- Published by Springer Nature in Annals of Telecommunications
- Vol. 75 (7-8) , 447-459
Moments of the quadrivariate Rayleigh distribution with applications for diversity receivers
- 10 March 2020
- Published by Springer Nature in Annals of Telecommunications
- Vol. 75 (7-8) , 447-459
Moments of the quadrivariate Rayleigh distribution with applications for diversity receivers
- 5 March 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Vehicular Technology
- Vol. 69 (5) , 5652-5656
Partial Packet Duplication: Control of Fade and Non-Fade Duration Outages Using Matrix Exponential Distributions
We propose partial packet duplication; when cellular dual connectivity is available we propose to duplicate only some portion of the time as needed. This satisfies reliability constraints defined as (1) the probability of fades staying shorter than a certain duration and (2) the probability of non-fades (i.e., time back above the SINR threshold) lasting longer than a certain duration. Fade durations and non-fade durations have been estimated in the literature to fit exponential distributions. We also choose exponential random variables to control duplication processes, which allows Markov chain modeling of the entire process. Using matrix exponential distribution formulations of the Markov chain in the context of partial packet duplication, we fully describe the partial packet duplication behavior, examine asymptotic performance, and define ranges of duplication parameters that meet both fade and non-fade duration constraints. Then we choose the best parameters that minimize resources used on the secondary link for packet duplication.
- 5 March 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Vehicular Technology
- Vol. 69 (5) , 5652-5656
Partial Packet Duplication: Control of Fade and Non-Fade Duration Outages Using Matrix Exponential Distributions
We propose partial packet duplication; when cellular dual connectivity is available we propose to duplicate only some portion of the time as needed. This satisfies reliability constraints defined as (1) the probability of fades staying shorter than a certain duration and (2) the probability of non-fades (i.e., time back above the SINR threshold) lasting longer than a certain duration. Fade durations and non-fade durations have been estimated in the literature to fit exponential distributions. We also choose exponential random variables to control duplication processes, which allows Markov chain modeling of the entire process. Using matrix exponential distribution formulations of the Markov chain in the context of partial packet duplication, we fully describe the partial packet duplication behavior, examine asymptotic performance, and define ranges of duplication parameters that meet both fade and non-fade duration constraints. Then we choose the best parameters that minimize resources used on the secondary link for packet duplication.
- 10 July 2019
- Published by Springer Nature in Wireless Networks
- Vol. 25 (7) , 4259-4274
Reducing computation time of a wireless resource scheduler by exploiting temporal channel characteristics
- 10 July 2019
- Published by Springer Nature in Wireless Networks
- Vol. 25 (7) , 4259-4274
Reducing computation time of a wireless resource scheduler by exploiting temporal channel characteristics