• Journal of KIISE:Computer Systems and Theory
• /
• v.32 no.11_12
• /
• pp.654-662
• /
• 2005

Mobile portable devices for wireless network solely depend on a limited battery power. Therefore, we need to design for wireless communication protocols with an energy efficiency. TCP-Westwood is one of the most important approaches on TCP performance improvement in wireless environments that estimates the available bandwidth by using the sampling mechanism. The advantage is that data can be transmitted efficiently using the estimation of available bandwidth. However, when the sender with TCP-Westwood is in a wireless environment, it does not consider of the sampling mechanism operation. In this thesis, a new energy saving transport protocol, called E2TP(Energy Efficient Transport Protocol), is proposed to solve problems which occur when the sender with TCP-Westwood is in a wireless environment. Also, when there are packet loss while doing frequent link error in a wireless environment, E2TP provides the instantaneous segment size adjustment for a more efficient data retransmission. The simulation result proves that the proposed E2TP has better performance in energy efficiency and throughput than both TCP and TCP-Westwood.

• Journal of KIISE:Information Networking
• /
• v.32 no.1
• /
• pp.12-19
• /
• 2005

Reliable transport protocols such as TCP are tuned to Perform well in traditional networks where packet losses occur mainly because of congestion. In a wireless network, however, packet losses will occur more often due to reasons such as the high bit error rate and the handoff rather than due to congestion. When using TCP over wireless network, TCP responds to losses due to the high bit error rate and the handoff by invoking congestion control and avoidance algorithms, resulting in the degraded end-to-end performance in the wireless network. There have been several schemes for improving TCP performance over wireless links. Among them, SNOOP Is a very promising scheme because of the localized retransmission. In this thesis, an efficient scheme is proposed by modifying SNOOP scheme. The invocation of congestion control mechanism is now minimized by knowing the cause of packet loss.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.12A
• /
• pp.1136-1144
• /
• 2010

In this paper, the effects of HARQ feedback error are evaluated in IEEE 802.16m system when the HARQ and ARQ interactions that utilize the HARQ feedback information is used. Also, the HARQ and ARQ interaction scheme considering HARQ feedback errors are proposed. The HARQ and ARQ interaction scheme improve the system throughput by using the HARQ feedback information instead of the ARQ feedback message, which reduce retransmission time. However, errors in the HARQ feedback information generate severe performance degradation. Especially, the local NAK errors between HARQ feedback error critically degrade the performance, because the local NAK errors lead the loss of ARQ blocks. We propose a channel state-based schemes for HARQ and ARQ interactions to mitigate the throughput degradation due to HARQ feedback errors. Simulation results show that the proposed scheme improves the throughput and the delay performance.

• Journal of Internet Computing and Services
• /
• v.3 no.2
• /
• pp.79-85
• /
• 2002

In open communication architecture, application systems consist of objects distributed in lots of computing nodes. To reduce complexity of development. and management of distributed software, to manage efficiently distributed objects and to provide realtime service, the mechanisms for object group management and communication are needed in distributed environment. In this paper we compose object groups and provide reliable group communication mechanism based on CORBA which can adopt a new service without lots of changes on existing system. Group consist of some subgroups that subgroup manager manages for improving the efficiency of group management and message ordering is kept by using sequencer, Communication method among groups uses multicast based on paint to point communication as well as IP multicast and we provide high performance by using selective retransmission of message through message history, We analyze the performance of the proposed mechanism through simulation in distributed environment.

• Journal of KIISE:Information Networking
• /
• v.33 no.5
• /
• pp.369-379
• /
• 2006

In recent years, there have been many researches about Ad-hoc Networks which is available to communicate freely between mobile devices by using multi-hop without any support of relay base or access point. TCP that used the most widely transport protocol in the Internet repeats packet loss and retransmission because it increases congestion window size by using reactive congestion control until packet loss occurs. As a result of this, energy of mobile device is wasted unnecessarily. In this paper, we propose TCP-New Veno in order to improve the energy efficiency of mobile device. According to the state of network, the scheme adjusts appropriate size of congestion window. Therefore, the energy efficiency of mobile device and utilization of bandwidth are improved by the scheme. From the simulation by using ns-2, we could see more improved energy efficiency with TCP-New Veno than those with TCP in Ad-hoc Networks.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.21 no.3
• /
• pp.664-674
• /
• 1996

In high speed multi-wavelength networks, retransmission overhead due to desination conflict or control packet collision is one factor of performance degration because signal prpagation delay is much larger than the transmission time of data packet. In this paper, an efficient WDMA protocol with a collision avoidance mechanism is proposed for high speed WDM single-hop network with a passive star topology. In proposed protocol, each node has cource queues and routing table to store souting informatio. This architecture makes is possible to avoid any kind of collision when a node reserves the channel to transmit a data packet. High system thoughput and channel utilization can be achieved by proposed protocol since there are no discarded packets caused by any collision at transmission time. The performance of proposed protocol is evaluated in term of throughput and delay with variations in offered load. Simulation results show that the proposed protocol has superior performance to convertional protocols under nonuniform traffic as well as uniform traffic.

• Journal of the Korea Society of Computer and Information
• /
• v.4 no.4
• /
• pp.148-154
• /
• 1999

TCP has improved by many papers which suggest the new algorithms and modify the previous algorithms. This paper compares Tahoe, Reno, New-Reno, Vegas, and SACK. The first version is Tahoe and is globally used. Reno has optimal performance during occurring one packet loss within a window of data, but can suffer from performance when multiple packets are dropped from a window of data. New-Reno avoids some of the performance problems of Reno TCP when multiple packets are dropped from a window of data. but is occurring the problem of the necessary retransmission. SACK resolves the all above problems and is used in bandwidth delay product environment. Vegas uses network bandwidth more efficiently and is a new implementation of TCP that achieves between 40 and 70 better throughput, with one-fifth to one-half the losses, as compared to the implementation of Reno TCP.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.30 no.1
• /
• pp.29-37
• /
• 2020

Work to improve network throughput has been focused on network coding as the utilization of IoT-based application services increases and network usage increases rapidly. In network coding, nodes transform packets received from neighboring nodes into a combination of encoded packets for transmission and decoding at the destination. This scheme is based on trust among nodes, but in the IoT environment where nodes are free to join, a malicious node can fabricate the packet if it legally participates in the configuration. It is difficult to identify the authenticity of the encoded packet since the packet received at destination is not a single source but a combination of packets generated by several nodes. In this paper, we propose a method to detect "look-like-valid" packets that have been attacked and disguised in packets received at destination, and to identify valid messages in the reconstructions. This method shows that network coding performance is significantly improved because the destination can reconstruct a valid message with only received packets without retransmission with a high probability, despite the presence of disguised packets.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.5C
• /
• pp.493-505
• /
• 2003

A new inter-client synchronization framework for multicast media streaming is proposed employing a server-client coordinated adaptive playout control. The proposed adaptive player controls the playback speed of audio and video by adopting the time-scale modification of audio. Based on the overall synchronization status as well as the buffer occupancy level, the playout speed of each client is manipulated within a perceptually tolerable range. Additionally, the server implicitly helps increasing the time available for retransmission while the clients perform an interactive error recovery mechanism with the assistance of playout control. The network-simulator based simulations show that the proposed framework can reduce the playout discontinuity without degrading the media quality, and thus mitigate the client heterogeneity.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.1B
• /
• pp.144-153
• /
• 2010

Flooding based routing protocols are usually used to disseminate information in wireless sensor networks. Those approaches, however, require message retransmissions to all nodes and induce huge collision rate and high energy consumption. In this paper, HoGoP (Hop based Gossiping Protocol) in which all nodes consider the number of hops from sink node to them, and decide own gossiping probabilities, is introduced. A node can decide its gossiping probability according to the required average reception percentage and the number of parent nodes which is counted with the difference between its hop and neighbors' ones. Therefore the decision of gossiping probability for network topology is adaptive and this approach achieves higher message reception percentage with low message retransmission than the flooding scheme. Through simulation, we compare the proposed protocol with some previous ones and evaluate its performance in terms of average reception percentage, average forwarding percentage, and forwarding efficiency. In addition, average reception percentage is analyzed according to the application requirement.