• Journal of Advanced Navigation Technology
• /
• v.6 no.2
• /
• pp.158-167
• /
• 2002

In this paper, it is analyzed that WAP packet transmission time to improve performance of WAP using SAR-QT algorithm in Bluetooth channel. The order for SAR-QT algorithm to improve the transfer capability, it is fragmented in WTP total messages that are coming down from upper layer and then the packets are sent one at time in baseband. And it is studied that transmission time for WAP over Bluetooth according to DMI, DM3 or DM5 packet type using SAR-QT algorithm in Bluetooth piconet environment. This SAR-QT algorithm decreases WAP packet transmission time of L2CAP baseband packets by sending packet that are spanning multiple slots. From the results, in WAP over Bluetooth channels, it is found out that WTP packet size ought to be increased to decrease transmission time of WAP packet. In addition, considering BER in wireless channel, optimal WTP packet size is achieved for WAP over Bluetooth in a Rician fading environment.

• Journal of Convergence for Information Technology
• /
• v.10 no.6
• /
• pp.41-48
• /
• 2020

The sensor nodes in underwater IoT networks have practical limitations in power supply. Thus, the reduction of power consumption is one of the most important issues in underwater environments. In this regard, AMC(Adaptive Modulation and Coding) techniques are used by using the relation between SNR and BER. However, according to our hands-on experience, we observed that the relation between SNR and BER is not that tight in underwater environments. Therefore, we propose a deep learning based MLP classification model to reflect multiple underwater channel parameters at the same time. It correctly predicts BER with a high accuracy of 85.2%. The proposed model can choose the best parameters to have the highest throughput. Simulation results show that the throughput can be enhanced by 4.4 times higher than the conventionally measured results.

• The KIPS Transactions:PartC
• /
• v.9C no.4
• /
• pp.563-572
• /
• 2002

Wireless mobile networks tend to drop a large portion of packets due to propagation errors rather than congestion. To Improve reliability over noisy wireless channels, wireless networks can employ forward error correction (FEC) techniques. Static FEC algorithms, however, can degrade the performance by poorly matching their overhead to the degree of the underlying channel error, especially when the channel path loss rate fluctuates widely. This paper investigates the benefits of an adaptable FEC mechanism for wireless networks with severe packet loss by analytical analysis or measurements over a real wireless network called sensor network. We show that our adaptive FEC named FECA (FEC-level Adaptation) technique improves the performance by dynamically tuning FEC strength to the current amount of wireless channel loss. We quantify these benefits through a hybrid simulation integrating packet-level simulation with bit-level details and validate that FECA keeps selecting the appropriate FEC-level for a constantly changing wireless channel.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.4
• /
• pp.1211-1216
• /
• 2000

Asynchronous transfer mode (ATM) can be efficiently used to transport packet data services. The switching system will support voice and packet data services simultaneously from end to end applications. To guarantee quality of service (QoS) of the offered services, source rateot send packet data is needed to control the network overload condition. Most existing control algorithms are shown to provide the threshold-based feedback control technique. However, real-time voice calls can be dynamically connected and released during data services in the network. If the feedback control information delays, quality of the serviced voice can be degraded due to a time delay between source and destination in the high speed link. An adaptive algorithm based on the optimal least mean square error technique is presented for the predictive feedback control technique. The algorithm attempts to predict a future buffer size from weight (slope) adaptation of unknown functions, which are used fro feedback control. Simulation results are presented, which show the effectiveness of the algorithm.

• Journal of Internet Computing and Services
• /
• v.3 no.3
• /
• pp.67-74
• /
• 2002

Asynchronous transfer mode (ATM) can be efficiently used to transport packet data services. The switching system will support voice and packet data services simultaneously from end to end applications. To guarantee quality of service (QoS) of the offered services, source rate to send packet data is needed to control the network overload condition. Most existing control algorithms are shown to provide the threshold-based feedback control technique. However, real-time voice calls can be dynamically connected and released during data services in the network. If the feedback control information delays, quality of the serviced voice can be degraded due to a time delay between source and destination in the high speed link, An adaptive algorithm based on the optimal least mean square error technique is presented for the predictive feedback control technique. The algorithm attempts to predict a future buffer size from weight (slope) adaptation of unknown functions, which are used for feedback control. Simulation results are presented, which show the effectiveness of the algorithm.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.9 no.3
• /
• pp.69-74
• /
• 2009

A novel protocol is proposed to achieve sub-carner-based rate adaptation in OFDM-based wireless systems. The protocol requires the addition of one OFDM symbol to the Clear-to-Send (CTS) packet defined in the IEEE 802.11 standard_ When receiving a Ready-To-Send (RTS) packet, the receiver determines the number of bits to be allocated in each sub-carrier through channel estimation. This decision is delivered to the sender using an additional OFDM symbol. That is, bit-allocation over sub-carriers is achieved using only one additional OFDM symbol. The protocol also provides an error recovery process to synchronize the bit-allocation information between the sender and receiver. The protocol enhances the channel efficiency in spite of the overhead of one additional OFDM symbol.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.6B
• /
• pp.553-562
• /
• 2003

Supporting QoS (Quality of Service) for the multimedia applications becomes an important issue as the demand of multimedia applications increases. Thus, it is necessary for the application layer to have an efficient congestion control algorithm, which can support the multimedia applications' QoS requirements. In this paper, we propose a new application layer congestion control algorithm, called RRC-OTT (Receiver-based Rate Control with One-way Trip Time). RRC-OTT algorithm differs from the previously proposed algorithms in that the receiver takes the responsibility of the network congestion control. Thus, RRC-OTT algorithm can not only precisely estimate the network congestion using OTT (one-way Trip Time), but reduce the work load from the sender (e.g., the web server). Our simulation study shows that RRC-OTT algorithm can maintain the comparable link utilization to the previously proposed algorithms and keep the packet jitter low, which thus can help enhance the quality of multimedia applications.

• Korean Journal of Weed Science
• /
• v.9 no.3
• /
• pp.183-200
• /
• 1989

An experiment was conducted at the greenhouse of the International Rice Research Institute in 1987 to find out the character of dry matter production, the potential seed production ability and the ecological and physiological strategies to adaptation. For these, two rice cultivars, IR64(lowland rice) and UPLRi-5(upland rice), and seven weed species were used ; Echinochloa glabrescens Munro ex Hook. f., E. cress-galls ssp. hispidula (Retz.) Honda, E. colons (L.) Link, Monochoria vaginalis (Burin. f.), Ludwigia octovalvis Jacq.) Raven, Fimbristylis miliacea Vahl and Cyperus difformis L. Adaptation strategies of weed species varied by species. However, they had efficient seed production strategy through different ways. In general, sedge weed species (F. miliacea and C. difformis) produced great amount of seeds at the expense of seed size through greater ratooning ability and low relative dry weight for flowering. For broadleaved weed species, greater number of descendants were obtained through high plasticity and low relative dry weight for flowering (M. vaginalis) or greater growth ability through effective photosynthetic efficiency (L. octovalvis). Grass weed species, on the other hand, produced their seeds through effective growth (net assimilation rate and relative growth rate), high ratooning ability (except E. crus-galls ssp. hispidula) or low relative dry weight to maximum dry weight for flowering (E. glabrescens). The harvest indices of the weed species were considerably lower than those of rice. Fimbristylis miliacea had the greatest ratooning ability followed by C. difformis, E. colons and E. glabrescens. The greatest seed productivity was recorded by C. difformis (279, 000) and L. octovalvis (268,000) while rice produced the least number of seeds (1300-6100). Log seed weight had a negative linear relationship with log seed number (y=6.30-1.48X, $R=-0.965^{**}$). For all species plant plasticity response was not directly correlated with mortality response.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.9 no.3
• /
• pp.12-19
• /
• 2010

In road network, especially in urban area, inefficiency of travel time is caused by signal control and turn maneuver at intersection and this inefficiency has substantial effects on travel time. When searching for the shortest path, this inefficiency which is caused by turn maneuver must be considered. Therefore, travel time, vehicle volume and delay for each link were calculated by using simulation package, PARAMICS V5.2 for adaptation of turn penalty at 16 intersections of Gangnam-gu. Turn penalty was calculated respectively for each intersection. Within the same intersection, turn penalty differs by each approaching road and turn direction so the delay was calculated for each approaching road and turn direction. Shortest path dealing with 16 intersections searched by Dijkstra algorithm using travel time as cost, considering random turn penalty, and algorithm considering calculated turn penalty was compared and analyzed. The result shows that by considering turn penalty searching the shortest path can decrease the travel time can be decreased. Also, searching the shortest path which considers turn penalty can represent reality appropriately and the shortest path considering turn penalty can be utilized as an alternative.

• Journal of KIISE:Information Networking
• /
• v.30 no.5
• /
• pp.668-675
• /
• 2003

In this paper, we propose an enhanced p-cycle (preconfigured protection cycle) scheme for WDM mesh networks with QoS constraints. In the previous researches on p-cycle, it is assumed that user's connection has a hi-directional connectivity and the same bandwidth on both direction. Therefore it is difficult to apply p-cycle based link protection to uni-directional connections for multicasting or asymmetric broadband multimedia communications with hi-directional connectivity. And it didn't consider QoS of backup path. We enhanced the p-cycles to accomodate uni-directional connections for multicasting or asymmetric bandwidth communications with hi-directional connectivity. And we propose a selection procedure of p-cycle to assure QoS of backup path. We were able to reduce a required backup bandwidth by applying a uni-directional p-cycle concept to asymmetric broadband multimedia communication environment. The proposed p-cycle selection procedure is applied to the U.S. sample network to evaluate whether the configured p-cycles can support QoS constraint of working path and backup path.