Zobrazeno 1 - 10
of 28
pro vyhledávání: '"Kriouile, Saad"'
In this paper, we investigate the impact of denial-of-service attacks on the status updating of a cyber-physical system with one or more sensors connected to a remote monitor via unreliable channels. We approach the problem from the perspective of an
Externí odkaz:
http://arxiv.org/abs/2409.16794
In this paper, we investigate denial-of-service attacks against status updating. The target system is modeled by a Markov chain and an unreliable wireless channel, and the performance of status updating in the target system is measured based on two m
Externí odkaz:
http://arxiv.org/abs/2403.04489
To accommodate low latency and computation-intensive services, such as the Internet-of-Things (IoT), 5G networks are expected to have cloud and edge computing capabilities. To this end, we consider a generic network setup where devices, performing an
Externí odkaz:
http://arxiv.org/abs/2304.05355
Autor:
Kriouile, Saad, Assaad, Mohamad
The age of information minimization problems has been extensively studied in Real-time monitoring applications frameworks. In this paper, we consider the problem of monitoring the states of unknown remote source that evolves according to a Markovian
Externí odkaz:
http://arxiv.org/abs/2210.09681
Autor:
Kriouile, Saad, Assaad, Mohamad
The age of Information (AoI) has been introduced to capture the notion of freshness in real-time monitoring applications. However, this metric falls short in many scenarios, especially when quantifying the mismatch between the current and the estimat
Externí odkaz:
http://arxiv.org/abs/2202.02878
Autor:
Kriouile, Saad, Assaad, Mohamad
The age of Incorrect Information (AoII) has been introduced recently to address the shortcomings of the standard Age of information metric (AoI) in real-time monitoring applications. In this paper, we consider the problem of monitoring the states of
Externí odkaz:
http://arxiv.org/abs/2102.03245
This paper examines the average age minimization problem where only a fraction of the network users can transmit simultaneously over unreliable channels. Finding the optimal scheduling scheme, in this case, is known to be challenging. Accordingly, th
Externí odkaz:
http://arxiv.org/abs/2102.02528
In this paper, we consider the average age minimization problem where a central entity schedules M users among the N available users for transmission over unreliable channels. It is well-known that obtaining the optimal policy, in this case, is out o
Externí odkaz:
http://arxiv.org/abs/2001.03096
In this paper, we introduce a new performance metric in the framework of status updates that we will refer to as the Age of Incorrect Information (AoII). This new metric deals with the shortcomings of both the Age of Information (AoI) and the convent
Externí odkaz:
http://arxiv.org/abs/1907.06604
In this paper, we consider a queueing system with multiple channels (or servers) and multiple classes of users. We aim at allocating the available channels among the users in such a way to minimize the expected total average queue length of the syste
Externí odkaz:
http://arxiv.org/abs/1902.02277