The congestion on the internet is the main issue that affects the performance of transition data over the network. An algorithm for congestion control is required to keep any network efficient and reliable for transfer traffic data of the users. Many Algorithms had been suggested over the years to improve the control of congestion that occurs in the network such as drop tail packets. Recently there are many algorithms have been developed to overcome the drawback of the drop tail procedure. One of the important algorithms developed is active queue management (AQM) that provides efficient congestion control by reducing drop packets, this technique considered as a base for many other congestion control algorithms schema. It works at the network core (router) for controlling the drop and marking of packets in the router's buffer before the congestion inception. In this study, a comprehensive survey is done on the AQM Algorithm schemas that proposed and modification these algorithms to achieve the best performance, the classification of AQM algorithms based on queue length, queue delay, or both. The advantages and limitations of each algorithm have been discussed. Also, debate the intelligent techniques procedure with AQM algorithm to achieve optimization in performance of algorithm operation. Finally, the comparison has been discussed among algorithms to find the weakness and powerful of each one based on different metrics.

<span>The present work was an attempt to address a challenge of energy utilization or consumption in WBSN, it used a proposed routing algorithm based on ant optimization technique to distribute energy utilization efficiently on nodes. Thus reducing consumed energy and extending the life cycle of nodes, as well as avoiding damages might be occurred in tissues of patient`s body. At the beginning the proposed protocol was compared with conventional routing protocol LEACH to prove it`s efficiency in the extending of the life cycle of node, then it was used with experimental network was employed to examine energy utilizations. The obtained results were compared with others attained by conventional and developed routing protocols, there was considerable minimizing in the energy consumption that proved efficiency of proposed algorithm.</span>

Congestion control plays an essential role on the internet to manage overload, which affects data transmission performance. The random early detection (RED) algorithm belongs to active queue management (AQM), which is used to manage internet traffic. The RED is used to eliminate weakness in default control of the Transport Control Protocol (TCP) drop-tail mechanism. The drawback of RED is parameter tuning, while adaptive RED (ARED) automatically adjusts these parameters. In this study, the suggested algorithm, the Markov decision process RED (MDPRED) uses the Markov decision process (MDP) to suitably adapt values for queue weight in the RED algorithm based on average queue length to enhance the performance of the traditional RED during TCP Slow Startup phase. This study is conducted based on fluctuations among the rate of service, queuing weight, and the mean queue length by using open-source network simulator NS3. The study shows efficient results by fluctuating end-to-end packet throughput and fast response to the inception of congestion in the network. The modified algorithm achieves a low level of drop packets by evaluating the results with other five algorithms, which is done by increasing the algorithm’s response when the average queue size becomes close to the maximum queue length threshold.

The cost-effectiveness of the operation of Wireless Sensor Network (WSN) in manufacturing and administrative projects can highly boost the production of lower goods and services that in turn enhance the marketing ability. The lifetime increase of the batteries by reducing energy wastage is the main challenge and hence, in the current paper, there is an attempt to save energy via transmitting packets as quickly as can be expected while avoiding congestion and drop packets. The time synchronization allows nodes to sleep and wake at the same time to avoid consuming energy. The suggested algorithm, would, successfully deliver a packet with a fairly high rate and reduce dropping packets. Besides, it manages to avoid congestion and saves energy when reduce the retransmission the dropped packets.