Journal Papers

Names in bold indicate graduate my students.

P. Jain, A. Sarabi, A. I. Matta, and V. R. Syrotiuk, “Design and Modeling of a New File Transfer Architecture to Reduce Undetected Errors Evaluated in the FABRIC Testbed,”Proceedings of the ACM on Measurement and Analysis of Computing Systems (POMACS),” Volume 9, Number 2, Article 19 (June 2025), 42 pages. https://doi.org/10.1145/3727111 (Winner of the “Golden Stitch Award — Best Paper,” at the FABRIC KNIT12 Workshop, Spring 2026.)
C. J. Colbourn and V. R. Syrotiuk, “Detecting Arrays for Effects of Multiple Interacting Factors,” Information and Computation, Volume 301, Part B, December 2024, 105202. doi https://doi.org/10.1016/j.ic.2024.105202
M. Ramamoorthy and V. R. Syrotiuk, “Learning Heuristics for Arc Routing Problems, in Intelligent Systems with Applications, (accepted November 2023). doi https://doi.org/10.1016/j.iswa.2023.200300
Y. Akhtar, F. Zhang, C. J. Colbourn, J. Stufken, and V. R. Syrotiuk, “Scalable Level-wise Screening Experiments using Locating Arrays,” Journal of Quality Technology, Volume 55, Number 5, pp. 584-597, November 2023. The data that support the findings of this study.
A. Sarabi, I. Matta, V. R. Syrotiuk, “MLED: A Layered Architecture for Reducing Undetected Error Probability in File Transfer,” IEEE Communications Letters, 25(11), 3542-3545, November 2021.
P. H. Isolani, D. J. Kulenkamp, J. M. Marquez-Barja, L. Z. Granville, S. Latré, V. R. Syrotiuk, “Support for 5G Mission-Critical Applications in Software-Defined IEEE 802.11 Networks,” Sensors, 21 (3), 693. January 2021. doi https://doi.org/10.3390/s21030693
M. J. Mellott, D. Garlisi, C. J. Colbourn, V. R. Syrotiuk, and I. Tinnirello, “Realizing Airtime Allocations in Multi-hop Wi-Fi Networks: A Stability and Convergence Study with Testbed Evaluation,” Computer Communications 145, 273–283, September 2019. doi https://doi.org/10.1016/j.comcom.2019.07.006
C. J. Colbourn and V. R. Syrotiuk, “On a Combinatorial Framework for Fault Characterization,” Mathematics in Computer Science, 12(4), 429-451, December 2018. doi http://link.springer.com/article/10.1007/s11786-018-0385-x
C. J. Colbourn, D. Horsley, and V. R. Syrotiuk, “A Hierarchical Framework for Recovery in Compressive Sensing,” Discrete Applied Mathematics 36 : 96-107, February 2018. doi https://doi.org/10.1016/j.dam.2017.10.004
J. Lutz, C. J. Colbourn, and V. R. Syrotiuk, “Variable-Weight Topology-Transparent Scheduling,” Computer Networks 122 : 16-28, July 2017. doi https://doi.org/10.1016/j.comnet.2017.04.023
A. N. Aldaco, C. J. Colbourn, and V. R. Syrotiuk, “Locating Arrays: A New Experimental Design for Screening Complex Engineered Systems,” SIGOPS Operating Systems Review, 49(1) : 31-40, January 2015. doi 10.1145/2723872.2723878
J. Lutz, C. J. Colbourn, and V. R. Syrotiuk, “ATLAS: Adaptive Topology- and Load-Aware Scheduling,” IEEE Transactions on Mobile Computing 13(10) : 2255-2268, October 2014. doi http://dx.doi.org/10.1109/TMC.2013.2296040
K. Shaukat and V. R. Syrotiuk, “Using Local Conditions to Reduce Control Overhead,” Ad Hoc Networks 11(5) : 1782-1795, August 2013. doi http://dx.doi.org/10.1016/j.adhoc.2013.04.003
J. Lutz, C. J. Colbourn, and V. R. Syrotiuk, “Topological Persistence for Medium Access Control,” IEEE Transactions on Mobile Computing 12(8) : 1598-1612, August 2013. doi http://dx.doi.org/10.1109/TMC.2012.134
C. J. Colbourn, D. Horsley, and V. R. Syrotiuk, “Strengthening Hash Families for Compressing Sensing,” Journal of Discrete Algorithms 16 : 170-186, 2012. doi http://dx.doi.org/10.1016/j.jda.2012.04.004
S. A. Obeidat, A. N. Aldaco, and V. R. Syrotiuk, “Cross-Layer Opportunistic Adaptation for Voice over Ad Hoc Networks,” Computer Networks 56(2) : 762-779, February 2012. doi http://dx.doi.org/10.1016/j.comnet.2011.11.002
C. J. Colbourn, A. C. H. Ling, G. Quattrocchi, and V. R. Syrotiuk, “Grooming Traffic to Minimize Load,” Discrete Mathematics 312(3) : 536-544, February 2012. doi http://dx.doi.org/10.1016/j.disc.2011.03.016
C. J. Colbourn, G. Quattrocchi, and V. R. Syrotiuk, “Grooming Traffic to Maximize Throughput in SONET Rings,” IEEE OSA Journal of Optical Communications and Networking 3 : 10-16, 2011. doi http://dx.doi.org/10.1364/JOCN.3.000010
D. W. McClary, V. R. Syrotiuk, and M. Kulahci, “Steepest-Ascent Constrained Simultaneous Perturbation for Multi-Objective Optimization,” ACM Transactions on Modeling and Computer Simulation 21(1) : Article 2, 22 pages, December 2010. doi http://dx.doi.org/10.1145/1870085.1870087
D. W. McClary, V. R. Syrotiuk, and M. Kulahci, “Profile Driven Regression for Modelling and Run-Time Optimization of Mobile Networks,” ACM Transactions on Modeling and Computer Simulation 20(3) : Article 17, 24 pages, September 2010. doi http://dx.doi.org/10.1145/1842713.1842720
M. Cui and V. R. Syrotiuk, “Time-Space Backoff for Fair Node Throughput in Wireless Networks using Power Control,” Ad Hoc Networks Journal 8 : 267-777, 2010. doi http://dx.doi.org/10.1016/j.adhoc.2010.02.007
Y. Moon and V. R. Syrotiuk, “A Cooperative CDMA-based Multi-channel MAC Protocol for Mobile Ad Hoc Networks,” Computer Communications 32(17) : 1810-1819, November 2009. doi http://dx.doi.org/10.1016/j.comcom.2009.07.001
S. A. Obeidat and V. R. Syrotiuk, “An Opportunistic Cross-Layer Architecture for Voice in Multi-hop Wireless LANs,” International Journal of Communication Systems 22 (4) : 419-439, April 2009. doi http://dx.doi.org/10.1002/dac.975
K. Shaukat and V. R. Syrotiuk, “Using Monitoring to Control a Proactive Routing Protocol,” Ad Hoc and Sensor Wireless Networks, An International Journal 6 (3-4) : 299-319, 2008.
C. J. Colbourn, G. Quattrocchi, and V. R. Syrotiuk, “Grooming for Two-Period Optical Networks,” Networks 52 (4) : 307-324, 2008. doi http://dx.doi.org/10.1002/net.20252
C. J. Colbourn, G. Quattrocchi, and V. R. Syrotiuk, “Lower Bounds for Two-Period Grooming via Linear Programming Duality,” Networks 52 (4) : 299-306, 2008. doi http://dx.doi.org/10.1002/net.20251
D. W. McClary, V. R. Syrotiuk, and V. Lecuire, “Adaptive Audio Streaming in Mobile Ad Hoc Networks using Neural Networks,” Ad Hoc Networks Journal 6 (4) : 524-538, June 2008. doi http://dx.doi.org/10.1016/j.adhoc.2007.04.005
V. R. Syrotiuk, C. J. Colbourn, and S. Yellamraju, “Rateless Forward Error Correction for Topology-Transparent Scheduling,” IEEE/ACM Transactions on Networking 16 (2) : 464-472, April 2008. doi http://dx.doi.org/10.1109/TNET.2007.899018
P. J. Dukes, C. J. Colbourn, and V. R. Syrotiuk, “Directed Complete Bipartite Graph Decompositions: Indirect Constructions,” Discrete Mathematics 308 : 367-374, 2008. doi http://dx.doi.org/10.1016/j.disc.2006.11.050
C. J. Colbourn, M. Cui, E. L. Lloyd, and V. R. Syrotiuk, “A Carrier Sense Multiple Access Protocol with Power Backoff (CSMA/PB),” Ad Hoc Networks 5 (8) : 1233-1250, November 2007. doi http://dx.doi.org/10.1016/j.adhoc.2007.02.017
V. R. Syrotiuk, Z. Zhang, and C. J. Colbourn, “Transport Schemes for Topology-Transparent Scheduling,” Journal of Combinatorial Optimization 14 (2-3) : 229-248, October 2007. doi http://dx.doi.org/10.1007/s10878-007-9058-4
P. J. Dukes, V. R. Syrotiuk, and C. J. Colbourn, “Ternary Schedules for Energy-Limited Sensor Networks,” IEEE Transactions on Information Theory 53 (8) : 2791-2798, August 2007. doi http://dx.doi.org/10.1109/TIT.2007.901156
J. W. Lee, Y.-H. Lee, and V. R. Syrotiuk, “The Performance of a Watchdog Protocol for Wireless Network Security,” International Journal of Wireless and Mobile Computing 2 (1) : 28-36, 2007. doi http://dx.doi.org/10.1504/IJWMC.2007.013793
K. K. Vadde, V. R. Syrotiuk, and D. C. Montgomery, “Optimizing Protocol Interaction using Response Surface Methodology,” IEEE Transactions on Mobile Computing 5 (6) : 627-639, June 2006. doi http://dx.doi.org/10.1109/TMC.2006.82
W. Chu, C. J. Colbourn, and V. R. Syrotiuk, “The Effects of Synchronization on Topology-Transparent Scheduling,” Wireless Networks (WINET) 12 (6) : 681-690, 2006. doi http://dx.doi.org/10.1007/s11276-006-6528-z
W. Chu, C. J. Colbourn, and V. R. Syrotiuk, “Slot Synchronized Topology-Transparent Scheduling for Sensor Networks,” Computer Communications 29 (4) : 421-428, February 2006. doi http://dx.doi.org/10.1016/j.comcom.2004.12.026
C. J. Colbourn and V. R. Syrotiuk, “Cover-Free Families and Topology-Transparency” Bayreuther Mathematische Schriften 73 : 86-106, 2005.
K. K. Vadde and V. R. Syrotiuk, “Quantifying Factors Impacting Quality-of-Service in Mobile Ad Hoc Networks,” Simulation 81 (8) : 547-560, August 2005. doi http://dx.doi.org/10.1177/0037549705060236
V. R. Syrotiuk, M. Cui, S. Ramkumar, and C. J. Colbourn, “Dynamic Spectrum Utilization in Ad Hoc Networks,” Computer Networks 46 (5) : 665-678, December 2004. doi http://dx.doi.org/10.1016/j.comnet.2004.06.021
K. K. Vadde and V. R. Syrotiuk, “Factor Interaction on Service Delivery in Mobile Ad Hoc Networks,” IEEE Journal on Selected Areas in Communications 22 (7) : 1335-1346, September 2004. doi http://dx.doi.org/10.1109/JSAC.2004.829351
C. J. Colbourn, A. C. H. Ling, and V. R. Syrotiuk, “Cover-free Families and Topology-Transparent Scheduling for MANETs,” Designs, Codes, and Cryptography 32 (1-3) : 65-96, May-July 2004. doi http://dx.doi.org/10.1023/B:DESI.0000029213.74879.e0
A. Faragó and V. R. Syrotiuk, “MERIT: A Scalable Approach for Protocol Assessment,” Mobile Networks and Applications 8 (5) : 567-577, 2003. doi http://dx.doi.org/10.1023/A:1025193929081
A. D. Myers, G. V. Záruba, and V. R. Syrotiuk, “An Adaptive Generalized Transmission Protocol for Mobile Ad Hoc Networks,” Mobile Networks and Applications 7 (6) : 493-502, December 2002. doi http://dx.doi.org/10.1023/A:1020773021569
S. Basagni, I. Chlamtac, and V. R. Syrotiuk, “Location Aware, Dependable Multicast for Mobile Ad Hoc Networks,” Computer Networks 35 (5-6), 659-670, 2001. doi http://dx.doi.org/10.1016/S1389-1286(01)00182-7
A. Faragó, A. D. Myers, V. R. Syrotiuk, and G. V. Záruba, “Meta-MAC Protocols: Automatic Combination of MAC Protocols to Optimize Performance for Unknown Conditions,” IEEE Journal on Selected Areas in Communications 18 (9) : 1670-1681, September 2000. doi http://dx.doi.org/10.1109/49.872955
V. R. Syrotiuk, C. J. Colbourn, and J. K. Pachl, “Wang Tilings and Distributed Verification on Anonymous Torus Networks,” Theory of Computing Systems 30 (2) : 145-163, January 1997. doi http://dx.doi.org/10.1007/BF02679446