| 1. |
- Arghavani, Mahdi, et al.
(författare)
-
StopEG : Detecting when to stop exponential growth in TCP slow-start
- 2020
-
Ingår i: Proceedings of the 2020 IEEE 45th Conference on Local Computer Networks (LCN 2020). - 9781728171586 - 9781728171593 ; , s. 77-87
-
Konferensbidrag (refereegranskat)abstract
- TCP slow-start grows the congestion window exponentially, aims to quickly probe the throughput of the network path. Stopping this growth at the wrong time can affect the overall network performance. In this paper, we introduce StopEG, an efficient mechanism to accurately and quickly detect when to stop this exponential growth. StopEG reacts to the changes on congestion window size rather than traditional congestion signals such as packet loss. We show that theoretically the number of inflight packets in the forward path is no more than 56.8% of all the inflight packets when the bottleneck link is unsaturated, and use this value as the threshold to stop the exponential growth. StopEG is evaluated through simulations in ns-3 by incorporating it into Google's BBR congestion control algorithm. Simulation results demonstrate its effectiveness in BBR, with a reduction of ≈68% in the length of the bottleneck queue when new connections are initiated.
|
|
| 2. |
- Arghavani, Abbas, et al.
(författare)
-
A Game-theoretic Approach to Covert Communications in the Presence of Multiple Colluding Wardens
- 2021
-
Ingår i: 2021 IEEE WIRELESS COMMUNICATIONS AND NETWORKING CONFERENCE (WCNC). - : Institute of Electrical and Electronics Engineers (IEEE). - 9781728195056
-
Konferensbidrag (refereegranskat)abstract
- In this paper, we address the problem of covert communication under the presence of multiple wardens with a finite blocklength. The system consists of Alice, who aims to covertly transmit to Bob with the help of a jammer. The system also consists of a Fusion Center (FC), which combines all the wardens' information and decides on the presence or absence of Alice. Both Alice and jammer vary their signal power randomly to confuse the FC. In contrast, the FC randomly changes its threshold to confuse Alice. The main focus of the paper is to study the impact of employing multiple wardens on the trade-off between the probability of error at the FC and the outage probability at Bob. Hence, we formulate the probability of error and the outage probability under the assumption that the channels from Alice and jammer to Bob are subject to Rayleigh fading, while we assume that the channels from Alice and jammer to the wardens are not subject to fading. Then, we utilize a two-player zero-sum game approach to model the interaction between joint Alice and jammer as one player and the FC as the second player. We derive the pay-off function that can be efficiently computed using linear programming to find the optimal distributions of transmitting and jamming powers as well as thresholds used by the FC. The benefit of using a cooperative jammer is shown by means of analytical results and numerical simulations to neutralize the advantage of using multiple wardens at the FC.
|
|
| 3. |
- Arghavani, Abbas, et al.
(författare)
-
Covert Outage Minimization in the Presence of Multiple Wardens
- 2023
-
Ingår i: IEEE Transactions on Signal Processing. - : IEEE. - 1053-587X .- 1941-0476. ; 71, s. 686-700
-
Tidskriftsartikel (refereegranskat)abstract
- The idea of covert communication is to conceal the presence of a transmission from an illegitimate receiver, known as a warden. This paper tackles the problem of finite blocklength covert communication in the presence of multiple colluding wardens. The system consists of Alice, who aims to covertly transmit to Bob with the help of a cooperative jammer (henceforth known as Jammer), and a Fusion Center (FC) in charge of combining the wardens' information and deciding on the presence of Alice's transmission accordingly. In our proposed approach, we utilize a two-player zero-sum game to model the interaction between Alice and Jammer jointly as one player and FC as the second player. In this game, Alice and Jammer cooperatively randomize over a range of transmitting and jamming powers to confuse FC. In contrast, FC randomly changes the detection threshold to confuse Alice. The main focus of the paper is to study the impact of employing multiple wardens on the trade-off between the probability of error at FC and the outage probability at Bob. We derive a pay-off function that can be efficiently computed using linear programming to find the optimal distributions of transmitting and jamming powers as well as thresholds used by FC. The benefit of using a cooperative jammer in neutralizing the advantage of employing multiple wardens is shown by analytical results and numerical simulations.
|
|
| 4. |
- Arghavani, Abbas, et al.
(författare)
-
Power-Adaptive Communication With Channel-Aware Transmission Scheduling in WBANs
- 2024
-
Ingår i: IEEE Internet of Things Journal. - : Institute of Electrical and Electronics Engineers (IEEE). - 2327-4662. ; 11:9, s. 16087-16102
-
Tidskriftsartikel (refereegranskat)abstract
- Radio links in wireless body area networks (WBANs) are highly subject to short and long-term attenuation due to the unstable network topology and frequent body blockage. This instability makes it challenging to achieve reliable and energy-efficient communication, but on the other hand, provides a great potential for the sending nodes to dynamically schedule the transmissions at the time with the best expected channel quality. Motivated by this, we propose improved Gilbert-Elliott Markov chain model (IGE), a memory-efficient Markov chain model to monitor channel fluctuations and provide a long-term channel prediction. We then design adaptive transmission power selection (ATPS), a deadline-constrained channel scheduling scheme that enables a sending node to buffer the packets when the channel is bad and schedule them to be transmitted when the channel is expected to be good within a deadline. ATPS can self-learn the pattern of channel changes without imposing a significant computation or memory overhead on the sending node. We evaluate the performance of ATPS through experiments using TelosB motes under different scenarios with different body postures and packet rates. We further compare ATPS with several state-of-the-art schemes, including the optimal scheduling policy, in which the optimal transmission time for each packet is calculated based on the collected received signal strength indicator (RSSI) samples in an off-line manner. The experimental results reveal that ATPS performs almost as efficiently as the optimal scheme in high-date-rate scenarios and has a similar trend on power level usage.
|
|
