• Proceedings of the KIEE Conference
• /
• 2006.04a
• /
• pp.57-59
• /
• 2006

In this paper, we investigate the wireless TCP protocol for throughput improvement in wireless Broadband. If the burst error duration of a wireless link is significantly long, retransmissions of lost packets by Snoop TCP are fulfilled mainly not by the receipt of duplicate acknowledgement (DUPACKs) but by local timer expiration. With the proposed scheme, Snoop TCP recovers packet losses fast by shortening the interval of local retransmissions based on the channel status. From the simulation results, we can show that the proposed scheme can improve TCP throughput considerably.

• Proceedings of the KSR Conference
• /
• 2004.10a
• /
• pp.1751-1756
• /
• 2004

It will say as sense of this research that aid in new design system on our country South Korea type rapid that is developed continuously forward while increase step that do creation with rapid and environment that can not fall in the name of contemporary writings presenting universal color image self-acknowledgement being most nationality that is color image word that is intention enemy the future that image of rapid through such series process thinks.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2004.05a
• /
• pp.1355-1358
• /
• 2004

This paper describes a modification to the SACK (Selective Acknowledgement) Transmission Control Protocol's (TCP), called SACK TCP with Probing Device, SACK works in conjunction with Probing Device, for improving SACK TCP performance when more than half a window of data lost that is typical in handoff as well as unreliable media. It shows that by slightly modifying the congestion control mechanism of the SACK TCP, it can be made to better performance to multiple packets lost from one window of data.

• Journal of KIISE:Computing Practices and Letters
• /
• v.9 no.2
• /
• pp.205-212
• /
• 2003

Recently, as electronic commerce service via the Internet has expanded over the world, the standardization for the e-commerce has been strongly required. Therefore UN/CEFACT and OASIS adopted ebXML standard for the purpose of creating single global electronic marketplace. New e-Business systems should require ebXMl- based messaging system for reliable messaging delivery. In this paper, we have implemented Message Service Handler(MSH) packaging, transporting and managing e-Business messages for supporting ebXML messaging service. The MSH supports various system environments and allows high-level applications running either local or remote hosts with Remote Method Invocation(RMI) interface. In addition, MSH guarantees reliable message delivery on internet since it retransmits message in case of delivery failure and handles duplicated message and applies acknowledgement message for secure message delivery. Nowadays MSH has applied to ebXML registry/repository.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.21 no.6
• /
• pp.1092-1099
• /
• 2017

In this paper, we propose a novel geographical on-demand routing protocol for a mobile ad-hoc network (MANET) that resolves the broadcast storm problem of ad-hoc on-demand distance vector (AODV) routing protocol. The candidates relaying route request (RREQ) packet are geographically restricted by the locations of the destination and a (RREQ sender. Then, the duplicate RREQs, which are generally discarded in the protocols that follow the principle of the AODV, are parsed to avoid redundant RREQ rebroadcasts and to perform passive acknowledgement with respect to a RREQ rebroadcast. The proposed routing protocol is implemented by modifying the source code of the AODV in QualNet. It is shown through QualNet simulations that the proposed routing protocol significantly improves the packet delivery ratio and the latency of the AODV in high-density and heavy traffic network scenarios.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.7 no.4
• /
• pp.741-746
• /
• 2012

Transmission control protocol(TCP) widely used as a transport protocol in the Internet includes a loss recovery function that detects and recovers packet losses by retransmissions. The loss recovery function consists of the two algorithms; fast retransmit and fast recovery. There have been researches to avoid nonnecessary retransmission timeouts (RTOs), which leads to selective acknowledgement (SACK) option and limited transmit scheme that are standardized by IETF (Internet Engineering Task Force). Recently, a method that covers the case in which a retransmitted packet is lost again has been propsed. The method, however, is not proved in terms of the additive increase multiplicative decrease (AIMD) principle of TCP congestion control. In this paper, therefore, we analyzed the method in terms of the principle by ns-simulations.

• Journal of the Korean Society for information Management
• /
• v.27 no.3
• /
• pp.189-206
• /
• 2010

This research analysed 73 samples to find out the recognition of librarians working in domestic public libraries from the information user's views. This research analyzed public library user's usual recognition level of librarian's work attitude, qualification, and service lever based of group of gender. For this, this research stands on the basis of previous researches and 3 types of modified questionnaire; recognition level of librarian's work attitude, recognition level of librarian's qualification, and recognition level of communication between librarians and information users using on nominal scale and interval scale. The research's result showed study outcome of librarian's work attitude was generally low with the mean of 2.81. Second, librarian's qualification of being a specialist was low with the mean of 2.84. Lastly, satisfaction of communication service level between information users and librarians was low with the mean of 2.89. Male and Female groups showed the difference of acknowledgement between each questions.

• Journal of Communications and Networks
• /
• v.12 no.4
• /
• pp.366-374
• /
• 2010

Coded cooperation is a promising user cooperation scheme. In this paper, we first propose a novel network-coding-based coded cooperation scheme. When a user decodes its partner's information correctly in the first frame, it transmits the combination of the partner's parity bits and its own parity bits through network coding in the second frame. This is distinct from the classical scheme, where the user only transmits the partner's parity bits during cooperation. We analyze the outage probability of the proposed scheme, and show that it achieves a full diversity order. Numerical evaluations reveal that the proposed scheme outperforms the classical scheme when the inter-user channel is poor, yet is worse when the inter-user channel is strong. Also, the results show that the proposed scheme always outperforms that of no cooperation in various channel conditions while the performance of classical scheme is worse than that of no cooperation with the poor inter-user channels. This means that the performance of the proposed scheme is more stable than the classical scheme and the proposed scheme is more tolerant to the poor inter-user channels. To combine the advantages of the proposed scheme and the classical scheme under different inter-user channel conditions, we propose an adaptive solution. This adaptive scheme enhances the system performance considerably in all channel conditions in spite of the inter-user channel quality, at the expense of only one acknowledgement or non-acknowledgement bit.

• Journal of Institute of Control, Robotics and Systems
• /
• v.19 no.7
• /
• pp.653-660
• /
• 2013

This paper deals with the problem of unfairness among uplink TCP (Transmission Control Protocol) flows associated with frame aggregation employed in IEEE 802.11n WLANs (Wireless Local Area Networks). When multiple stations have uplink TCP flows and transmit TCP data packets to an AP (Access Point), the AP has to compete for channel access with stations for the transmission of TCP ACK (acknowledgement) packets to the stations. Due to this contention-based channel access, TCP ACKs tend to be accumulated in the AP's downlink buffer. We show that the frame aggregation in the MAC (Medium Access Control) layer increases TCP ACK losses in the AP and leads to the serious unfair operation of TCP congestion control. To resolve this problem, we propose the TAC (TCP ACK Compression) mechanism operating at the top of the AP's interface queue. By exploiting the properties of cumulative TCP ACK and frame aggregation, TAC serves only the representative TCP ACK without serving redundant TCP ACKs. Therefore, TAC reduces queue occupancy and prevents ACK losses due to buffer overflow, which significantly contributes to fairness among uplink TCP flows. Also, TAC enhances the channel efficiency by not transmitting unnecessary TCP ACKs. The simulation results show that TAC tightly assures fairness under various network conditions while increasing the aggregate throughput, compared to the existing schemes.

• Journal of Internet Computing and Services
• /
• v.11 no.2
• /
• pp.17-30
• /
• 2010

Many applications in Wireless Sensor Networks require collecting all data without loss from nodes. End-to-End data retransmission, which is used in the Internet for reliable transport, becomes very inefficient in Wireless Sensor Networks, since wireless communication, and constrained resources pose new challenges. We look at factors affecting reliability, and search for efficient combinations of the possible options. This paper proposes an efficient Overhearing based reliable transfer protocol in Wireless Sensor Networks by introducing Selective and implicit Acknowledgement. Finally, it is clarified that the proposed scheme is efficient for reliable data transfer in WSN.