• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• v.9 no.2
• /
• pp.553-556
• /
• 2005

It is analyzed that WAP packet transmission time to improve performance of WAP using SAR algorithm in Bluetooth channel. The order for SAR 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 DM1, DM3 or DM5 packet type using SAR algorithm in Bluetooth piconet environment. This SAR algorithm decreases WAP packet transmission time of L2CAP baseband packets by sending packet which are spanning multiple slots.

• Journal of Institute of Control, Robotics and Systems
• /
• v.17 no.10
• /
• pp.967-982
• /
• 2011

This paper presents a FTNCS (Fault-Tolerant Networked Control System) that can tolerate control surface failure and packet delay/loss in an UAV (Unmanned Aerial Vehicle). The proposed method utilizes the benefits of self-diagnosis by smart actuators along with the control allocation technique. A smart actuator is an intelligent actuation system combined with microprocessors to perform self-diagnosis and bi-directional communications. In the event of failure, the smart actuator provides the system supervisor with a set of actuator condition data. The system supervisor then compensate for the effect of faulty actuators by re-allocating redundant control surfaces based on the provided actuator condition data. In addition to the compensation of faulty actuators, the proposed FTNCS also includes an efficient algorithm to deal with network induced delay/packet loss. The proposed algorithm is based on a Lagrange polynomial interpolation method without any mathematical model of the system. Computer simulations with an UAV show that the proposed FTNCS can achieve a fast and accurate tracking performance even in the presence of actuator faults and network induced delays.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2001.05a
• /
• pp.119-124
• /
• 2001

A new WDM-based protocol for scheduling a variable-length message is proposed in this paper. Two control slots, Pre-reservation slot and Reservation Slot, are used to coordinate transmission and diminish the collisions of packet to minimize the access delay. When there is an idle reservation slot, a control packet is transmitted on that slot and message is transferred. And the node continues to transmit its control packet through the corresponding slot every cycle, until the message is completely transmitted. If an idle reservation slot is not available, the node schedules the transmission time of message in earliest available time using Pre-reservation slots. The proposed scheduling protocol has several advantages; any new node can join the network anytime without network re-initialization. Moreover, with the pre-reservation slots, we can avoid the packet collisions and destination conflicts, and we can improve the access delay time for message transmissions.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.11 no.2
• /
• pp.137-145
• /
• 1986

The contention resolution algorithm with the limited packet delay time as well stable distribution as the packet delay time is proposed and implementes for improving the mean packet delay time in the network employing CSMA/CD as the access method. The implementation of node controller is based on IEEE 802.2 standard logical link control(LLC) and IEEE 802.3 standard medium access control(MAC). Some portion of IEEE 802.3 Standard MAC, and the Binary Exponential Back-off(BEB) algorithm is replaced by the proposed algorithm. From the view of normalized mean packet transmission delay time, the controller implemented here can be applicable to the office-automation system, and the factory-and laboratory-automation environment where the limited time criterion is very significant.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38B no.10
• /
• pp.785-800
• /
• 2013

In MANET, AODV(Ad hoc On-demand Distance Vector) has its advantages as on-demand approach but it also has a disadvantage that the control packet overhead is high compared to other routing protocols. This paper improves the problem caused by Hello messages that are broadcasted periodically to detect the local connectivity and maintain neighbor list. Periodic hello messages reduce the Packet delivery ratio and the efficiency in the limited bandwidth. And its increased Control packet overhead leads to decrease the Residual battery capacity and the Network lifetime. Further, non-reactive nature of periodic hello messages in AODV has also been the source of numerous controversies. In order to solve these problems, this paper improves the performance by using the interrupt driven approach which removes periodic hello messages and decreases the Control packet overhead. Performance comparisons between the traditional AODV and proposed mod_AODV done with network simulator QualNet 5.0 show that the mod_AODV performs better in most performance metrics under scenarios with various values of simulation parameters.

• Journal of Internet of Things and Convergence
• /
• v.1 no.1
• /
• pp.1-4
• /
• 2015

This paper aims to present the mathematical model to find the mean web object transfer latency in the slow-start phase of TCP congestion control mechanism, which is one of the main control techniques of Internet. Mean latency is an important service quality measure of end-user in the network. The application area of the proposed latency model is the narrowband environment including multi-hop wireless network and Internet of Things(IoT), where packet loss occurs in the slow-start phase only due to small window. The model finds the latency considering initial window size and the packet loss rate. Our model shows that for a given packet loss rate, round trip time and initial window size mainly affect the mean web object transfer latency. The proposed model can be applied to estimate the mean response time that end user requires in the IoT service applications.

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

Network-based computing such as cluster computing requires a reliable high-speed transport protocol. TCP is a representative reliable transport protocol on the Internet, which implements many mechanisms, such as flow control, congestion control, and retransmission, for reliable packet delivery. This paper, however, finds out that Myrinet does not incur any packet losses caused by network congestion. In addition, we ascertain that Myrinet supports reliable and ordered packet delivery. Consequently, most of reliable routines implemented in TCP produce unnecessarily additional overheads on Myrinet. In this paper, we show that we can attain the reliability only by flow control on Myrinet and propose a new reliable protocol based on UDP named RUM (Reliable UDP on Myrinet) that performs a flow control. As a result, RUM achieves a higher throughput by 45% than TCP and shows a similar one-way latency to UDP.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.25 no.7
• /
• pp.923-929
• /
• 2021

TCP communication and packet communication require transmission control technology to ensure high quality and high reliability. However, in the case of real-time data transmission, an inefficient transmission problem occurs. In order to overcome this problem and transmit the packet reliability, in general, early congestion control using the buffer level as an index was used. Control of the congestion control point and the cancellation point is delayed because the point at which congestion is controlled is based on the buffer level. Therefore, in this paper, not only the buffer level indicator, but also the ideal buffer level, which determines the packet discard probability, is classified so that the transmission rate and buffer level that measure network congestion are close to the level above the optimal setting. As a result, it was shown that the average buffer level can be directly controlled by maintaining the average buffer level by the ideal buffer level set in the experiment to prove the proposed method.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.15 no.4
• /
• pp.2382-2392
• /
• 2014

In this paper, a new data frame structure for wavelength routing in optical ring access network(ORAN) is designed and the functions of each field in the frame are defined. In addition, the IP packet transmission to the network layer corresponding to the newly proposed structure of the protocol stack is newly presented. Tha data transmission protocol design techniques of ORAN was proposed. IP packet and broadcasting packet transmission within the sub-network, and the IP packet transmission to other sub-network was shown through the process illustration. In the process, the encapsulation and framing process of the wavelength information to routing has been described in detail. And each step takes place in a packet transfer process is demonstrated. A ring type optical access network protocol is not yet research field. ORAN data transfer protocol to send/receive module structure of a subscriber node and a control node of the two rings which analyzed the results are shown. The high-speed Internet solution is proposed that by using wavelength routing the packet transport protocol for ORAN is designed.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.6A
• /
• pp.506-514
• /
• 2009

To minimize energy consumption, most of MAC Protocols in WSNs exploit low duty cycling. Among those, RMAC [4] allows a node to transmit a data packet for multiple hops in a single duty cycle, which is made possible by exploiting a control frame named Pioneer (PION) in setting up the path. In this paper, we present a MAC Protocol called Hop Extended MAC (HE-MAC) that transmits the data packet for more multiple hops in a single duty cycle. It employs an EXP (Explorer) frame to set up the multiple hop transmission, which contains the information of the maximum hop that a packet can be transmitted. With the use of the information in EXP and an internal state of Ready to Receive (RTR), HEMAC extends the relay of the packet beyond the termination of the data period by two more hops compared to RMAC. Along with our proposed adaptive sleeping method, it also reduces power consumption and handles heavy traffic efficiently without experiencing packet inversion observed in RMAC. We analytically obtain the packet delivery latency in HE-MAC and evaluate the performance through ns-2 simulations. Compared to RMAC, HE-MAC achieves 14% less power consumption and 20% less packet delay on average for a random topology of 300 nodes.