Serguei Primak

Dr. Serguei Primak

Department of Electrical and Computer Engineering, The University of Western Ontario, London, Canada

Research Focus & Metrics

Academic Career Length

14Years (2013-Present)

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

Representative Publications

View All Publications
19 August 2016 in IEEE Wireless Communications Letters
Verified
Journal Article
Closed access
KHKarim Ahmed Hammad
Karim Ahmed Hammad
Abdallah MoubayedAbdallah Moubayed
Abdallah Moubayed
ASAbdallah Shami
Abdallah Shami
SPSerguei Primak
Serguei Primak
Delay jitter of data packets is known to be a crucial quality of service (QoS) measure especially for realtime applications (e.g., VoIP). It takes place as a result of the queuing, scheduling and routing latencies within the network. However, control schemes that directly tackle the jitter problem in today’s advanced wireless systems are rare. To enable such schemes, proper modeling of the packet delay jitter is an essential preliminary step. This letter presents a comprehensive mathematical modeling for the packet delay jitter in a simple queuing system with one traffic buffer of infinite length, one server and single hop. In contrast to independent and identically distributed (iid) models, our analysis focuses on the correlated nature of service intervals. The presented models study different scenarios and parameters for the queue in terms of the system’s utilization and the probability distribution of data packets’ service and interarrival times, respectively. Numerical simulations demonstrate the high accuracy achieved by the presented models.

9 November 2017 in IEEE Transactions on Mobile Computing
Verified
Journal Article
Closed access
KHKarim Ahmed Hammad
Karim Ahmed Hammad
Abdallah MoubayedAbdallah Moubayed
Abdallah Moubayed
SPSerguei Primak
Serguei Primak
ASAbdallah Shami
Abdallah Shami
Energy-efficient communications have become one of the fundamental aspects for todays cutting-edge wireless technologies. This is due to its valuable impact, from both the users and the network operators perspectives, on the environment. In this paper, we augment our earlier study for the user equipments energy efficiency (EE) in the LTE downlink by looking at real-time heterogeneous traffic QoS requirements. In particular, we utilize the previously proposed cloud radio access network (C-RAN) and ray tracing (RT)-based scheduling model to optimize both of the EE and the packet delay jitter for real-time applications with fixed packet delay budget subject to other traffic types requirements. Using the utility-based scheduling approach, we formulate the resource allocation problem as a weighted sum binary integer programming (BIP) problem. Due to the inherent complexity of the problem formulation which hinders finding its solution directly, four heuristic algorithms are proposed to solve the optimization problem. Numerical simulations are conducted on three different traffic types each belonging to one of the popular QoS classes; best-effort class, rate and delay-constrained classes. The obtained results demonstrate a substantial improvement in the systems performance achieved by our proposed schemes compared to other existing schemes.

9 July 2019 in IEEE Transactions on Vehicular Technology
Verified
Journal Article
Closed access
GDGleb Dubosarskii
Gleb Dubosarskii
SPSerguei Primak
Serguei Primak
Xianbin WangXianbin Wang
Xianbin Wang
One of the challenges related to the investigation of vehicular networks is associated with predicting a network state and studying the short-term and long-term network evolutionary changes. This paper investigates a case in which vehicles are located on a straight road, and the connectivity state between two consecutive cars is determined by the Markov chain model with two states. The transition probabilities of the considered model are explicitly expressed in terms of known parameters of the network using the Wang-Moayery model. Within the presented model, the network evolution is described in terms of determinative parameters, such as average link duration, average cluster lifetime, and a clusters' existence probability between two fixed moments of time. In support of the theoretically obtained probabilistic distributions, the results of numerical simulations are provided.

12 November 2021 in Electronics
Verified
Journal Article
Open access
PDF file
GDGleb Dubosarskii
Gleb Dubosarskii
SPSerguei Primak
Serguei Primak
Anti-jamming games have become a popular research topic. However, there are not many publications devoted to such games in the case of vehicular ad hoc networks (VANETs). We considered a VANET anti-jamming game on the road using a realistic driving model. Further, we assumed the quadratic power function in both vehicle and jammer utility functions instead of the standard linear term. This makes the game model more realistic. Using mathematical methods, we expressed the Nash equilibrium through the system parameters in single-channel and multi-channel cases. Since the network parameters are usually unknown, we also compared the performance of several reinforcement learning algorithms that iteratively converge to the Nash equilibrium predicted analytically without having any information about the environment in the static and dynamic scenarios.

22 May 2013 in arXiv
Verified
Preprint
Open access
PDF file
OROscar Filio Rodriguez
Oscar Filio Rodriguez
SPSerguei Primak
Serguei Primak
VKValeri Kontorovich
Valeri Kontorovich
ASAbdallah Shami
Abdallah Shami
In this paper a new multiple access algorithm for cognitive radio networks based on game theory is presented. We address the problem of a multiple access system where the number of users and their types are unknown. In order to do this, the framework is modelled as a non-cooperative Poisson game in which all the players are unaware of the total number of devices participating (population uncertainty). We propose a scheme where failed attempts to transmit (collisions) are penalized. In terms of this, we calculate the optimum penalization in mixed strategies. The proposed scheme conveys to a Nash equilibrium where a maximum in the possible throughput is achieved.

28 September 2019 in arXiv
Verified
Preprint
Open access
PDF file
GDGleb Dubosarskii
Gleb Dubosarskii
SPSerguei Primak
Serguei Primak
Xianbin WangXianbin Wang
Xianbin Wang
One of the challenges related to the investigation of vehicular networks is associated with predicting a network state regarding both short-term and long-term network evolutionary changes. This paper analyzes a case in which vehicles are located on a straight road, and the connectivity state between two consecutive cars is determined by the Markov chain model with two states. The transition probabilities of the considered model are explicitly expressed in terms of known parameters of the network using the Wang-Moayery model. Within the presented model, the network evolution is described in terms of determinative parameters, such as average link duration, average cluster lifetime, and a clusters' existence probability between two fixed moments of time. In support of the theoretically obtained probabilistic distributions, the results of numerical simulations are provided.