• ETRI Journal
• /
• v.36 no.6
• /
• pp.960-967
• /
• 2014

In this paper, an analytical framework is proposed for the optimization of network performance through joint congestion control, channel allocation, rate allocation, power control, scheduling, and routing with the consideration of fairness in multi-channel wireless multihop networks. More specifically, the framework models the network by a generalized network utility maximization (NUM) problem under an elastic link data rate and power constraints. Using the dual decomposition technique, the NUM problem is decomposed into four subproblems - flow control; next-hop routing; rate allocation and scheduling; power control; and channel allocation - and finally solved by a low-complexity distributed method. Simulation results show that the proposed distributed algorithm significantly improves the network throughput and energy efficiency compared with previous algorithms.

• Journal of IKEEE
• /
• v.27 no.4
• /
• pp.379-385
• /
• 2023

Distributed congestion control (DCC) is a technology that mitigates channel congestion and improves communication performance in high-density vehicular networks. Traditional DCC techniques operate to reduce channel congestion without considering quality of service (QoS) requirements. Such design of DCC algorithms can lead to excessive DCC actions, potentially degrading other aspects of QoS. To address this issue, we propose a deep reinforcement learning-based QoS-adaptive DCC algorithm. The simulation was conducted using a quasi-real environment simulator, generating dynamic vehicular densities for evaluation. The simulation results indicate that our proposed DCC algorithm achieves results closer to the targeted QoS compared to existing DCC algorithms.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.18 no.5
• /
• pp.125-132
• /
• 2017

Vehicular safety service reduces traffic accidents and traffic congestion by informing drivers in advance of threats that may occur while driving using vehicle-to-vehicle (V2V) communications in a wireless environment. For vehicle safety services, every vehicle must broadcasts a Basic Safety Message(BSM) periodically. In congested traffic areas, however, network congestion can easily happen, reduce the message delivery ratio, increase end-to-end delay and destabilize vehicular safety service system. In this paper, to solve the network congestion problem in vehicle safety communications, we approximate the relationship between channel busy ratio and the number of vehicles and use it to estimate the total network congestion. We propose a new context-aware transmit power control algorithm which controls the transmission power based on total network congestion. The performance of the proposed algorithm is evaluated using Qualnet, a network simulator. As a result, the estimation of total network congestion is accurately approximated except in specific scenarios, and the packet error rate in vehicle safety communication is reduced through transmit power control.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.35S no.10
• /
• pp.42-51
• /
• 1998

This paper suggests a congestion control scheme for CL (ConnectionLess) overlay network using the feedback loops between CL user and CL server, between CL servers, and between end-to-end CL users, and the header translation table of CL server. The CL overlay network for CBDS(Connectionless Broadhand Data Service) defined by ITU-T((International Telecommunication Union-Telecommunication) consists of CL servers which route frames and links which connect between CL user and CL server or between CL servers. In the CL overlay network, two kinds of congestion, CL link congestion and CL server congestion, may occur. We considered the schemes to solve the congestion. link-by-link method[18] has used the ABR feedback loops of ATM layer between CL user and CL server or between CL servers, and the congestion table using header translation table of CL server. As in congestion of output virtual channel this method has an effect on all the traffic transmitting through the link, then it has an effect on the traffic that has not caused the congestion. As a result, the link utilization of output virtual channel that does not bring the congestion and outputs the traffic is decreased. To overcome this drawback of link-by-link, we proposed the hybrid method that are using the ABR feedback loops of link-by-link method, the feedback loop between CL users in end-to-end, the congestion table using and the header translation table. This scheme deals with teh congestion immediately by link-by-link loops and the header translation table, and then regulates the sending rate of CL user that causes the congestion by end-to-end loop.

• Journal of Korea Multimedia Society
• /
• v.11 no.12
• /
• pp.1716-1721
• /
• 2008

Currently, Wireless Networks have some nice characteristics such as multi-hop, multi-channel, multi-radio, etc but these kinds of resources are not fully used. The most difficulty to solve this issue is to solve mixed integer optimization. This paper proposes a method to solve a class of mixed integer optimization for wireless networks by using AMPL modeling language with CPLEX solver. The result of method is scheduling and congestion control in multi-channel multi-radio wireless networks.

• Journal of the Korean Institute of Navigation
• /
• v.22 no.3
• /
• pp.43-50
• /
• 1998

This study aims at estimating the in-and-out traffic volume and improving the main channel in Kwangyang Harbour, by utilizing measurement of congestion, i.e, the bumper model. In 2011, the traffic volume of the main channel is 11.96 ships per hour and its traffic density is evaluated 9.53% of the basic traffic capacity. Therefore the existing width of the main channel, 850m is safe enough but the channel requires the traffic separation scheme as suggested in order to secure the safe of the transit vessel.

• Journal of Digital Contents Society
• /
• v.16 no.3
• /
• pp.381-388
• /
• 2015

TCP, which performs congestion control in congestion condition, is able to help a reliable transmission. However, packet loss can be increased because congestion window is increased by the time the packet is dropped in the process of congestion avoidance. In this paper, to solve the above problem, we propose a new congestion estimation based TCP congestion control scheme using the weighted average value of the RTT. After measuring a SRTT, which means the weighted average value of RTTs, at this point of time when a buffer overflow is occurred by an overloaded packet, the proposed scheme estimates the time, when the same SRTT is made in packet transmission, as a congestion time and then decreases the congestion window. The simulation results show that the proposed schem has a good performance in terms of packet loss rate and throughput when the packet loss due to buffer overflow is larger than that due to wireless channel.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2004.05b
• /
• pp.399-403
• /
• 2004

In this paper, we have analyzed the TCP throughput of Portable Internet system in 2.3GHz wireless environment with considering user's mobility speed. As the Portable Internet uses large cells compared to wireless LAM and supports user's nobility, we have adapted different wireless channel model to derive the TCP throughput of the system. We have assumed wireless channel is Rayleigh fading channel and the channel is modeled as two-state Markov model with which user's nobility speed can be considered by varying transition matrix of the model. from the simulation results, we have known that higher TCP throughput under the slow fading than under the fast fading. Because the TCP throughput is closely related to the sender's congestion control, the more congestion control is done by the sender, the lower TCP throughput we have. The more congestion control is caused in the sender under the fast fading than the slow fading so the lower TCP throughput is resulted in the fast fading environment.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2007.05a
• /
• pp.1291-1293
• /
• 2007

Due to dense deployment and innumerable amount of traffic flow in wireless sensor networks (WSNs), congestion becomes more common phenomenon from simple periodic traffic to unpredictable bursts of messages triggered by external events. Even for simple network topology and periodic traffic, congestion is a likely event due to dynamically time varying wireless channel condition and contention caused due to interference by concurrent transmissions. In this paper, we have proposed three mechanisms: upstream source count and buffer based rate control and snoop based MAC level ACK scheme to avoid congestion. The simulation results show that our proposed mechanism achieves around 80% delivery ratio even under bursty traffic condition

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.46 no.4
• /
• pp.46-55
• /
• 2009

In RFID field, when the neighboring readers try to occupy the same or adjacent channel simultaneously, there exists reader-to-reader interference; it calls reader collision. From the reader collision, the tags cannot response correctly query from the reader. Reader anti-collision schemes have been developed, and particularly, the Listen-Before-Talk(LBT) scheme is proposed to avoid reader collision in ETSI in multi channel environment. However, in ETSI, there is a drawback that the reader collision does not decreases effectively because the reader selects randomly a channel without considering the channel environment and readers try to occupy the channel concurrently. In this paper, we propose a algorithm based on LBT scheme considering multi channel environment as well as made up for the drawbacks of LBT The proposed algorithm applies random backoff, the collision avoidance mechanism. And it can reduce delay because of our proposed estimation mechanism Simulation using OPNET shows that the proposed algorithm achieves higher superiority than that of the simple algorithms in sparse and dense reader mode.