in this thesis, we analyze the performance of wireless lan networks subject to random loss. in this regard, we use a congestion control technique that has been introduced in a previous study, titled tcp congestion control enhancement for random loss (tcp cerl). tcp cerl is a sender-side modification of tcp reno protocol. tcp cerl is an end-to-end technique that achieves high performance over wireless links and does not decrease the congestion window and slow start threshold if the random loss is detected. tcp cerl assumes a static threshold (a) equal to 0.55 which does not perform well when considering a heavy traffic load compared to new protocols. in this thesis, we propose a modified version of tcp cerl, called tcp cerl plus (tcp cerl+, in short). tcp cerl+ works similarly as tcp cerl, but its main idea is to use a dynamic threshold (a) in terms of round-trip time (rtt) rather than static threshold. by doing so, we employ the average rtt and the minimum rtt measurements made over the connection to evaluate the queue length of the bottleneck link. in this thesis, we compare tcp cerl and tcp cerl+ with tcp new jersey+, tcp mveno, tcp westwood+, tcp cubic, tcp yeah, and tcp newreno by using network simulation ns-2. the results will show that cerl+ outperforms cerl when there are many users and two-way transmission.