• Journal of Internet Computing and Services
• /
• 제11권1호
• /
• pp.1-13
• /
• 2010

It is not easy to set RED(Random Early Detection) parameter according to environment in managing Network Device. Especially, it is more difficult to set parameter in the case of maintaining the constant service rate according to the change of environment. In this paper, we hypothesize the router that has Multi-core CPU in output queue and propose AI RED(Artificial Intelligence RED), which directly induces Genetic Algorithm of Artificial Intelligence in the output queue that is appropriate to the optimization of parameter according to RED environment, which is automatically adaptive to workload. As a result, AI RED Is simpler and finer than FuRED(Fuzzy-Logic-based RED), and RED parameter that AI RED searches through simulations is more adaptive to environment than standard RED parameter, providing the effective service. Consequently, the automation of management of RED parameter can provide a manager with the enhancement of efficiency in Network management.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• 제40권12호
• /
• pp.83-93
• /
• 2003

Differentiated service networks, based on bandwidth broker, perform the control and management of QoS provisioning for the QoS guaranteed services, However, the centralized bandwidth broker model has a scalability problem since it has centralized resource management for the admission control function of all call attempts, Therefore, in this paper, we proposea novel adaptive admission control mechanism according to the attempted call status for enhancing the scalability under the centralized bandwidth broker model in IP differentiated service networks, The proposed mechanism decouples the function of admission control from the bandwidth broker, So, the ingress edge node performs the admission control and the bandwidth broker performs the resource management and QoS provisioning, We also introduce an edge-to-edge path concepts and the ingress edge node performs the admission control under the allocated bandwidth to eachpath. The allocated bandwidth per path adaptively varies according to the status of the attempted calls, This mechanism can significantly reduce the number of communication message between the bandwidth broker and each edge node in the network and increase the bandwidth utilization via adaptable resource allocation, In this paper we study the adaptive admission control operation and show the efficient and extensive improvement through the performance evaluation.

• Journal of Korea Multimedia Society
• /
• 제19권11호
• /
• pp.1871-1877
• /
• 2016

In this paper, a Wireless USB (WUSB) protocol is adopted for development of ASMD (Adaptive Source Multi Device) N-screen wireless services. WUSB is the USB technology merged with WiMedia PHY and Distributed-MAC (D-MAC). However, the current WUSB protocol can't provide seamless N-screen streaming services to moving WUSB devices in home network environment. Therefore, to provide the ASMD N-screen services through WUSB based on D-MAC protocol, a channel management scheme is proposed to support seamless mobility between adjacent ASMD groups for wireless IPTV N-screen services. In simulation results, proposed ASMD channel management (ACM) scheme is compared with conventional WUSB channel management scheme in view points of throughput, average path interference and energy consumption according to various numbers of nodes and elapsed simulation times. Through simulation results, it is explained that proposed ASMD channel management (ACM) scheme should be adopted in the WUSB protocol to realize ASMD N-screen wireless services.

• International Journal of Computer Science & Network Security
• /
• 제22권10호
• /
• pp.191-200
• /
• 2022

Constrained Application Protocol (CoAP) is a standardized protocol by the Internet Engineering Task Force (IETF) for the Internet of things (IoT). IoT devices have limited computation power, memory, and connectivity capabilities. One of the significant problems in IoT networks is congestion control. The CoAP standard has an exponential backoff congestion control mechanism, which may not be adequate for all IoT applications. Each IoT application would have different characteristics, requiring a novel algorithm to handle congestion in the IoT network. Unnecessary retransmissions, and packet collisions, caused due to lossy links and higher packet error rates, lead to congestion in the IoT network. This paper presents an adaptive congestion control protocol for CoAP, Adaptive Congestion Control with a Backoff algorithm (ACCB). AACB is an extension to our earlier protocol AdCoCoA. The proposed algorithm estimates RTT, RTTVAR, and RTO using dynamic factors instead of fixed values. Also, the backoff mechanism has dynamic factors to estimate the RTO value on retransmissions. This dynamic adaptation helps to improve CoAP performance and reduce retransmissions. The results show ACCB has significantly higher goodput (49.5%, 436.5%, 312.7%), packet delivery ratio (10.1%, 56%, 23.3%), and transmission rate (37.7%, 265%, 175.3%); compare to CoAP, CoCoA+ and AdCoCoA respectively in linear scenario. The results show ACCB has significantly higher goodput (60.5%, 482%,202.1%), packet delivery ratio (7.6%, 60.6%, 26%), and transmission rate (40.9%, 284%, 146.45%); compare to CoAP, CoCoA+ and AdCoCoA respectively in random walk scenario. ACCB has similar retransmission index compare to CoAp, CoCoA+ and AdCoCoA respectively in both the scenarios.

• Proceedings of the IEEK Conference
• /
• 대한전자공학회 1999년도 하계종합학술대회 논문집
• /
• pp.110-113
• /
• 1999

In this paper. we propose an adaptive handover scheme in wireless network The proposed handover scheme is a hybrid type of virtual path extension and rerouting. The proposed handover scheme chooses the virtual path management scheme according to the service QoS instead of the network topology which is used in the previous hybrid handover schemes. The proposed scheme supports the seamless service and small buffering during virtual path rerouting handover through the multicasting service. To evaluate the performance of the proposed scheme. we compute the number of signaling message used for handover and perform computer simulation. The simulation results show that the proposed scheme provides more efficiency in the handover delay and seamless service than the previous methods.

• Smart Media Journal
• /
• 제13권1호
• /
• pp.45-51
• /
• 2024

Long Range Wide Area Network (LoRaWAN) is a widely adopted Internet of Things (IoT) protocol due to its high range and lower energy consumption. LoRaWAN utilizes Adaptive Data Rate (ADR) for efficient resource (e.g., spreading factor and transmission power) management. The ADR manages these two resource parameters on the network server side and end device side. This paper focuses on analyzing the ADR and Gaussian ADR performance of LoRaWAN. We have performed NS3 simulation under a static scenario by varying the antenna height. The simulation results showed that antenna height has a significant impact on the packet delivery ratio. Higher antenna height (e.g., 50 m) has shown an improved packet success ratio when compared with lower antenna height (e.g., 10 m) in static and mobility scenarios. Based on the results, it is suggested to use the antenna at higher allevation for successful packet delivery.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제13권5호
• /
• pp.2469-2490
• /
• 2019

A low-energy adaptive clustering hierarchy (LEACH) protocol is a low-power adaptive cluster routing protocol which was proposed by MIT's Chandrakasan for sensor networks. In the LEACH protocol, the selection mode of cluster-head nodes is a random selection of cycles, which may result in uneven distribution of nodal energy and reduce the lifetime of the entire network. Hence, we propose a new selection method to enhance the lifetime of network, in this selection function, the energy consumed between nodes in the clusters and the power consumed by the transfer between the cluster head and the base station are considered at the same time. Meanwhile, the improved FTBA algorithm integrating the curve strategy is proposed to enhance local and global search capabilities. Then we combine the improved BA with LEACH, and use the intelligent algorithm to select the cluster head. Experiment results show that the improved BA has stronger optimization ability than other optimization algorithms, which the method we proposed (FTBA-TC-LEACH) is superior than the LEACH and LEACH with standard BA (SBA-LEACH). The FTBA-TC-LEACH can obviously reduce network energy consumption and enhance the lifetime of wireless sensor networks (WSNs).

• The KIPS Transactions:PartC
• /
• 제13C권2호
• /
• pp.171-176
• /
• 2006

Bandwidth is an extremely valuable and scarce resource in a wireless network. Therefore, efficient bandwidth management is necessary in order to provide high qualify service to users with different requirements in a multimedia wireless/mobile network. In this paper, we propose an on-line bandwidth reservation algorithm that adjusts bandwidth reservations adaptively based on existing network conditions. The most important contribution of our work is an adaptive algorithm that is able to resolve conflicting performance criteria - bandwidth utilization, call dropping and call blocking probabilities. Our algorithm is quite flexible, is responsive to current traffic conditions in cellular networks, and tries to strike the appropriate performance balance between contradictory requirements for QoS sensitive multimedia services.

• International journal of advanced smart convergence
• /
• 제12권4호
• /
• pp.147-153
• /
• 2023

In recent times, an absence of effective crowd management has led to numerous stampede incidents in crowded places. A crucial component for enhancing on-site crowd management effectiveness is the utilization of crowd counting technology. Current approaches to analyzing congested scenes have evolved beyond simple crowd counting, which outputs the number of people in the targeted image to a density map. This development aligns with the demands of real-life applications, as the same number of people can exhibit vastly different crowd distributions. Therefore, solely counting the number of crowds is no longer sufficient. CSRNet stands out as one representative method within this advanced category of approaches. In this paper, we propose a crowd counting network which is adaptive to the change in the density of people in the scene, addressing the performance degradation issue observed in the existing CSRNet(Congested Scene Recognition Network) when there are changes in density. To overcome the weakness of the CSRNet, we introduce a system that takes input from the image's information and adjusts the output of CSRNet based on the features extracted from the image. This aims to improve the algorithm's adaptability to changes in density, supplementing the shortcomings identified in the original CSRNet.

• Journal of Electrical Engineering and Technology
• /
• 제3권2호
• /
• pp.285-291
• /
• 2008

Active Queue Management(AQM) has been widely used for congestion avoidance in Transmission Control Protocol(TCP) networks. Although numerous AQM schemes have been proposed to regulate a queue size close to a reference level, most of them are incapable of adequately adapting to TCP network dynamics due to TCP's non-linearity and time-varying stochastic properties. To alleviate these problems, we introduce an AQM technique based on a dynamic neural network using the Back-Propagation(BP) algorithm. The dynamic neural network is designed to perform as a robust adaptive feedback controller for TCP dynamics after an adequate training period. We evaluate the performances of the proposed neural network AQM approach using simulation experiments. The proposed approach yields superior performance with faster transient time, larger throughput, and higher link utilization compared to two existing schemes: Random Early Detection(RED) and Proportional-Integral(PI)-based AQM. The neural AQM outperformed PI control and RED, especially in transient state and TCP dynamics variation.