Performance Evaluation of Successful Transmission Probability and Throughput for DSRC MAC Protocol for Next Generation Connected Vehicles Network

2021 ◽  
Author(s):  
Shaik Ashfaq Hussain ◽  
Kamaludin Mohamad Yusof ◽  
Shaik Mazhar Hussain ◽  
Ajay Vikram Singh ◽  
Rolito Asuncion
Keyword(s):  
Performance Evaluation ◽  
Mac Protocol ◽  
Transmission Probability ◽  
Connected Vehicles ◽  
Next Generation ◽  
Successful Transmission ◽  
Successful Transmission Probability

scholarly journals THE VALUE OF COMMUNICATION AND COOPERATION WHEN SERVERS ARE STRATEGIC

2019 ◽  
Vol 61 (4) ◽  
pp. 349-367
Author(s):  
M. FACKRELL ◽  
C. LI ◽  
P. G. TAYLOR ◽  
J. WANG
Keyword(s):  
Nash Equilibrium ◽  
Optimal Strategies ◽  
Transmission Probability ◽  
Equilibrium Strategy ◽  
Bayesian Game ◽  
Successful Transmission ◽  
Nash Equilibrium Strategy ◽  
The Social ◽  
Unique Nash Equilibrium ◽  
Successful Transmission Probability

In 2015, Guglielmi and Badia discussed optimal strategies in a particular type of service system with two strategic servers. In their setup, each server can be either active or inactive and an active server can be requested to transmit a sequence of packets. The servers have varying probabilities of successfully transmitting when they are active, and both servers receive a unit reward if the sequence of packets is transmitted successfully. Guglielmi and Badia provided an analysis of optimal strategies in four scenarios: where each server does not know the other’s successful transmission probability; one of the two servers is always inactive; each server knows the other’s successful transmission probability and they are willing to cooperate.Unfortunately, the analysis by Guglielmi and Badia contained some errors. In this paper we correct these errors. We discuss three cases where both servers (I) communicate and cooperate; (II) neither communicate nor cooperate; (III) communicate but do not cooperate. In particular, we obtain the unique Nash equilibrium strategy in Case II through a Bayesian game formulation, and demonstrate that there is a region in the parameter space where there are multiple Nash equilibria in Case III. We also quantify the value of communication or cooperation by comparing the social welfare in the three cases, and propose possible regulations to make the Nash equilibrium strategy the socially optimal strategy for both Cases II and III.

scholarly journals The value of communication and cooperation when servers are strategic

2020 ◽  
Vol 61 ◽  
pp. 349-367
Author(s):  
Mark Fackrell ◽  
Cong Li ◽  
Peter Taylor ◽  
Jiesen Wang
Keyword(s):  
Nash Equilibrium ◽  
Optimal Strategies ◽  
Transmission Probability ◽  
Equilibrium Strategy ◽  
Bayesian Game ◽  
Successful Transmission ◽  
Nash Equilibrium Strategy ◽  
The Social ◽  
Unique Nash Equilibrium ◽  
Successful Transmission Probability

In 2015, Guglielmi and Badia discussed optimal strategies in a particular type of service system with two strategic servers. In their setup, each server can be either active or inactive and an active server can be requested to transmit a sequence of packets. The servers have varying probabilities of successfully transmitting when they are active, and both servers receive a unit reward if the sequence of packets is transmitted successfully. Guglielmi and Badia provided an analysis of optimal strategies in four scenarios: where each server does not know the other’s successful transmission probability; one of the two servers is always inactive; each server knows the other’s successful transmission probability and they are willing to cooperate. Unfortunately, the analysis by Guglielmi and Badia contained some errors. In this paper we correct these errors. We discuss three cases where both servers (I) communicate and cooperate; (II) neither communicate nor cooperate; (III) communicate but do not cooperate. In particular, we obtain the unique Nash equilibrium strategy in Case II through a Bayesian game formulation, and demonstrate that there is a region in the parameter space where there are multiple Nash equilibria in Case III. We also quantify the value of communication or cooperation by comparing the social welfare in the three cases, and propose possible regulations to make the Nash equilibrium strategy the socially optimal strategy for both Cases II and III. doi:10.1017/S1446181120000048

scholarly journals Opportunistic DF-AF Selection Relaying in Hybrid Wireless and Power Line Communication for Indoor IoT Networks

Sensors ◽  
2021 ◽  
Vol 21 (16) ◽  
pp. 5469
Author(s):  
Hoang Thien Van ◽  
Quyet-Nguyen Van ◽  
Danh Hong Le ◽  
Hoang-Phuong Van ◽  
Jakub Jalowiczor ◽  
...  
Keyword(s):  
System Performance ◽  
Transmission Probability ◽  
Power Line ◽  
Power Line Communication ◽  
Power Splitting ◽  
Amplify And Forward ◽  
Decode And Forward ◽  
Successful Transmission ◽  
The Impact ◽  
Successful Transmission Probability

This manuscript investigates the system performance of hybrid wireless and power line communication networks for indoor Internet of Things applications. Differentiating itself from the existing literature, the performance of the direct link and dual-hop energy harvesting relay-aided links is analyzed under the condition of indoor fading modeled by log-normal distribution. Moreover, the manuscript presents the analytical expressions of the successful transmission probability of the deployed opportunistic decode-and-forward and amplify-and-forward relay selection scheme, and validates them with Monte Carlo simulations. Moreover, the impact of different system parameters on the successful transmission probability is revealed. For the considered hybrid system, in general, the opportunistic decode-and-forward relaying scheme outperforms the opportunistic amplify-and-forward relaying scheme. As importantly, increasing the source to relay distance and power splitting ratio over certain limits significantly deteriorates the system performance, indicated by the decrease in the successful transmission probability.

A Novel CARQ Algorithm for TDMA-Based Single Source Single Relay Wireless Networks

2014 ◽  
Vol 608-609 ◽  
pp. 521-525
Author(s):  
Wei Qiang Lai
Keyword(s):  
Wireless Networks ◽  
Transmission Probability ◽  
Time Frame ◽  
Frame Structure ◽  
System Throughput ◽  
Automatic Repeat Request ◽  
Single Source ◽  
Successful Transmission ◽  
Single Relay ◽  
Successful Transmission Probability

An efficient Single Source Single Relay Cooperative Automatic Repeat Request (CARQ) protocol for TDMA-based High Delay Wireless Networks is proposed in this paper, which enables both of the Source and the Relay to retransmit packets to the Destination based on the special nature of TDMA-based time frame structure, and increases the successful transmission probability of a packet from the Source to the Delay using the high delay between the Source and the Relay.. By means of comparison of the system throughput between the two ARQ algorithms (the traditional and the proposed algorithms), we proved that the proposed protocol gave a better performance in poor channel conditions.

Sign in / Sign up

Export Citation Format

Share Document