• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.43 no.9 s.351
• /
• pp.88-98
• /
• 2006

VANET has several different characteristics from MANET such as high mobility of nodes and frequent change of node density and network topology. Due to these characteristics, the network topology based protocol, often used in MANET, can not be applied to VANET. In this paper, we propose an emergency warning message broadcast protocol using range based relay node selecting algorithm which determines the minimal waiting time spent by a given node before rebroadcasting the received warning message. Because the time is randomly calculated based on the distance between sender node and receiver node, a node chosen as a relay node is assured to have a minimal waiting time, even though it is not located at the border of radio transmission range. The proposed emergency warning message broadcast protocol has low network traffic because it does not need to exchange control messages for message broadcasting. In addition, it can reduce End-to-End delay under circumstances of low node density and short transmission range in VANET.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.8A
• /
• pp.1160-1168
• /
• 2000

This paper presents a real-time integrated traffic management (RITM) scheme that can effectively manage variable bit rate (VBR) and available bit rate (ABR) traffics having unpredictable characteristics in asynchronous transfer mode (ATM) networks. An unique feature of this scheme is that it has a special ATM cell control block which makes it possible to monitor bursty traffics in real-time so that the delay incurred to measure cell arrival rate is minimized. Additionally, the proposed scheme intends to dynamically reassign the leftover network resources to VBR/ABR connections without any deterioration in quality of service (QoS) of the existing connections. The RITM scheme has been verified to reliably monitor incoming traffics and to efficiently manage network resources by computer simulations. The capability of managing the incoming ATM traffics in real-time helps determine an optimal acceptable number of user connections for a given network condition. We can use this value as a threshold to protect the network from being congested and to find out a cost-effective buffer design method.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.8A
• /
• pp.1238-1246
• /
• 2000

In a multi-channel network based on wavelength division multiplexing (WDM), an efficient protocol is needed for transmitter and receiver to be tuned to same wavelength during message transmission time. This paper proposes a message scheduling protocol that can efficiently support variable-sized messages, where tunable transceiver has nonzero tuning time. In this protocol, once a node reserves one data channel, it can persistently use the reserved channel till message transmission is finished. Therefore, overhead due to tuning time of the tunable transceiver can be reduced. Moreover, the protocol does not require any global information. Therefore, it can operate independently of the change of the number of nodes, and any new node can join the network at anytime without requiring network initialization. With this protocol, one can avoid data channel and destination conflicts. The protocol is analyzed with a finite population model and the throughput-delay characteristics are investigated as performance measures.

• The KIPS Transactions:PartC
• /
• v.14C no.2
• /
• pp.129-138
• /
• 2007

AAA(Aluthentieation, Authorization, Accounting) protocol is an information securitv technology that offer secure and reliable user Authentication, Authorization, Accounting function systematically in various services. protocol and wireless network work as well as win network. Currently IETF(Internet Engineering Task Force) AAA Working Group deal with about AAA protocol and studying with activity, But, recently it exposing much problems side to user's anonymity and privacv violation. Therefore, in this paper, AAAH(Home Authentication Server) authenticaters Mobile device, after that, use ticket that is issued from AAAH even if move to outside network and can be serviced offering authentication in outside network without approaching by AAAH, Also, we study mechanism that can offer user's privacy and anonymousness to when use service. Our mechanism is using Time Synchronization OTP and focusing authentication and authorization. Therefore, our mechanism is secure from third party attack and offer secure and effective authentication scheme. Also only right user can offer services by using ticket. can reduce signal and reduce delay of message exchanged, can offer persistent service and beighten security and efficiency.

• The Journal of the Convergence on Culture Technology
• /
• v.9 no.3
• /
• pp.677-682
• /
• 2023

A large number of motors and sensors are used to drive a humanoid robot. In order to solve the wiring problem that occurs when connecting multiple actuators, a controller based on a communication network has been used, and CAN, which is advantageous in terms of cost and a highly reliable communication protocol, was mainly used. In terms of the structure of the controller, a torque control type structure that is easy to implement an advanced algorithm into the upper controller is preferred. In this case, the low communication bandwidth of CAN becomes a problem, and in order to obtain sufficient communication bandwidth, a communication network is configured by separating into a plurality of CAN networks. In this study, a stability analysis on transmission time delay is performed for a multi-motor control system in which high-speed FlexRay and low-speed CAN communication networks are hierarchically connected in order to obtain a high communication bandwidth, and sensor information and driving signals are delivered within the allowed transmission time. The proposed hierarchical network-based control system is expected to improve control performance because it can implement multiple motor control systems with a single network.

• Journal of Communications and Networks
• /
• v.16 no.3
• /
• pp.344-354
• /
• 2014

Transmission control protocol friendly rate control (TFRC) is designed to mainly provide optimal service for unicast applications, such as multimedia streaming in the best-effort Internet environment. However, high bandwidth networks with large delays present an environment where TFRC may have a problem in utilizing the full bandwidth. TFRC inherits the slow-start mechanism of TCP Reno, but this is a time-consuming process that may require many round-trip-times (RTTs), until an appropriate sending rate is reached. Another disadvantage inherited from TCP Reno is the RTT-unfairness problem, which severely affects the performance of long-RTT flows. In this paper, we suggest enhanced TFRC for high quality video streaming over high bandwidth delay product networks. First, we propose a fast startup scheme that increases the data rate more aggressively than the slow-start, while mitigating the overshooting problem. Second, we propose a bandwidth estimation method to achieve more equitable bandwidth allocations among streaming flows that compete for the same narrow link with different RTTs. Finally, we improve the responsiveness of TFRC in the presence of severe congestion. Simulation results have shown that our proposal can achieve a fast startup and provide fairness with competing flows compared to the original TFRC.

• Proceedings of the IEEK Conference
• /
• 2003.07b
• /
• pp.1169-1172
• /
• 2003

In this paper, a CLB-based CPLD low-power technology mapping algorithm consider area and delay time is proposed. To perform low power technology mapping for CPLD, a given Boolean network have to be represented to DAG. The proposed algorithm are consist of three step. In the first step, TD(Transition Density) calculation have to be performed. In the second step, the feasible clusters are generated by considering the following conditions: the number of output, the number of input and the number of OR-terms for CLB(Common Logic Block) within a CPLD. The common node cluster merging method, the node separation method, and the node duplication method are used to produce the feasible clusters. In the final step, low power technology mapping based on the CLBs is packing the feasible clusters into the several proper CLBs. The proposed algorithm is examined by using benchmarks in SIS. In the case of that the number of OR-terms is 5, the experiments results show that reduce the power consumption by 30.73% comparing with that of TEMPLA, and 17.11% comparing with that of PLAmap respectively.

• Journal of Ocean Engineering and Technology
• /
• v.19 no.6 s.67
• /
• pp.86-91
• /
• 2005

Regarding some of tire important works in tire shipyard, like tire production process, quality control, and material handling, there are many elements that disturb tire work-flaw. For example, there are mistakes in manufacturing, delay of production, and poor quality. These kinds of disturbances are from tire delay of communication time between tire production field and tire management. Therefore, it would be possible to strengthen tire competitiveness of shipbuilding industries by applying tire information technology based on Wireless Local Area Network (Wireless LAN), in order to establish tire multi-possession of real time production information in limited large shipbuilding yard. In this study, tire construction concept of tire information system, based on Wireless LAN, is proposed to build communication infrastructures in shipyards. The various information regarding shipbuilding inspection, process management, and material flaw are analyzed and constructed to databases in tire middle ware system, as tire platform for using Personal Display Agent (PDA). At last, tire middle ware system, which delivers tire information, is developed by tire C$\sharp$ and Microsoft.net; also, tire PDA application system is structured in WinCE O/S, and is tested and evaluated under tire server linked condition.

• Journal of the Korean Institute of Telematics and Electronics A
• /
• v.32A no.8
• /
• pp.31-38
• /
• 1995

In this paper, we consider the leaky bucket parameter dimensioning problem in the presence of the cell delay variation(CDV) which arises at the customer premises network dud to the multiplexing with other traffic streams. We consider an ATM multiplexer in which a single CBR stream and several heterogeneous VBR traffic streams are multiplexed. Choosing an MMPP model for the bursty traffic streams, we derive an (MMPP+DD)/D/1/K queueing model for the evaluation of the CDV experienced by the CBR stream. We first evaluate the equilibrium queue length distribution embedded at tagged-cell arrival-time instants, based on whcih we calcuate the inter-cell time distribution and the distribution kof the number of tagged-cell departures in an arbitrary interval. Then we apply the analysis to the dimensionging problem of the leaky bucket parameters, examining how the employed traffic model affects the determination of the bucket size. Through numerical examples, we confirm that the Poisson traffic model can underestimate the bucket size, thus causing a considerable blocking probability for compliant use cells while the MMPP model can optimally design the bucket size which keeps the blocking probability under the target value.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.4 no.5
• /
• pp.691-708
• /
• 2010

An important issue of supporting multi-users with diverse quality-of-service (QoS) requirements over wireless networks is how to optimize the systematic scheduling by intelligently utilizing the available network resource while, at the same time, to meet each communication service QoS requirement. In this work, we study the problem of a variety of communication services over multi-media heterogeneous cognitive OFDM system. We first divide the communication services into two parts. Multimedia applications such as broadband voice transmission and real-time video streaming are very delay-sensitive (DS) and need guaranteed throughput. On the other side, services like file transmission and email service are relatively delay tolerant (DT) so varying-rate transmission is acceptable. Then, we formulate the scheduling as a convex optimization problem, and propose low complexity distributed solutions by jointly considering channel assignment, bit allocation, and power allocation. Unlike prior works that do not care computational complexity. Furthermore, we propose the FAASA (Fairness Assured Adaptive Sub-carrier Allocation) algorithm for both DS and DT users, which is a dynamic sub-carrier allocation algorithm in order to maximize throughput while taking into account fairness. We provide extensive simulation results which demonstrate the effectiveness of our proposed schemes.