• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.25 no.12
• /
• pp.1960-1963
• /
• 2021

In this paper, we propose a multiplay Thompson sampling algorithm in multipath communication system. Multipath communication system has advantages on communication capacity, robustness, survivability, and so on. It is important to select appropriate network path according to the status of individual path. However, it is hard to obtain the information of path quality simultaneously. To solve this issue, we propose Thompson sampling which is popular in machine learning area. We find some issues when the algorithm is applied directly in the proposal system and suggested some modifications. Through simulation, we verified the proposed algorithm can utilize the entire network paths. In summary, our proposed algorithm can be applied as a path allocation in multipath-based communications system.

• Journal of Institute of Control, Robotics and Systems
• /
• v.11 no.9
• /
• pp.816-821
• /
• 2005

The remote operation of $4\~5$ cranes for container loading/unloading at a port by one operator will dramatically improve loading/unloading efficiency through productivity increase, cost reduction, and so on. This study develops a remote crane control system for container loading/unloading yard cranes. First, a wireless video and audio system to transmit views and sounds of the working field is designed by using 3 web cameras and a microphone. Next, a RSVP-based multi-path reservation method is presented with a view to improving the quality of service in the communication network for remote control. Simulation results show that a RSVP-based multi-path reservation can enhance the reservation success rate in the TCP/IP network.

• Annual Conference of KIPS
• /
• 2011.04a
• /
• pp.597-600
• /
• 2011

멀티패스 전송은 단대 노드간 다중 경로를 동시에 사용함으로써 효과적인 대용량 전송을 실현하는 미래 인터넷 설계의 한 부분이다. 이에 따라 draft-‘TCP Extensions for Multipath Operation with Multiple Addresses'에서 MPTCP 가 언급되었으며 기존 TCP 를 활용한 다중 전송에서 발생할 수 있는 다양한 오픈 이슈가 나오게 되었다. 본 논문에서는 위 논의로부터 나온 다양한 오픈 이슈 중 수신측에서 발생 할 수 있는 패킷의 재조합(packet reordering)을 줄이는데 초점을 둔다. 패킷의 재조합은 불필요한 에너지 소비와 빈번한 패킷 재전송(packet retransmission) 문제를 초래하며, 특히 에너지 효율이 중요한 모바일기기에 있어 반드시 해결되어야 문제라 할 수 있다. 이를 해결하기 위해 본 논문에서는 전송 경로들의 RTT 값을 비교하여 패킷의 스케줄링 하는 기법을 제안하였으며 시뮬레이션을 통해 성능을 검증하였다.

• Journal of Korea Multimedia Society
• /
• v.12 no.11
• /
• pp.1593-1608
• /
• 2009

If a certain relay node in multi-hop wireless networks might become a malicious node that does not cooperate with other nodes or a selfish node, network throughput will be dramatically decreased. Most of existing ad hoc routing protocols assuming that the nodes will fully cooperate with other nodes do not resolve the problem of network performance degradation due to malicious and selfish nodes. This paper presents the CARE (Cooperative Ad hoc routing protocol based REputation) scheme incorporating the reputation management that can achieve a multi-hop wireless network with high throughput performance. The proposed scheme provides the horizontal cross-layer approach which can identify misbehaving malicious, selfish nodes dropped out of the hop-by-hop based packet processing in the network and then set up an optimal packet routing path that will detour misbehaving nodes. And the vertical cross-layer approach contained in the CARE scheme attempts to improve the quality of routing paths by exploiting the quality of link information received from the MAC layer. Besides, it provides high TCP throughput by exploiting the reputation values of nodes acquired from the network layer into the transport layer. A case study on experiments and simulations shows that the CARE scheme incorporating vertical and horizontal cross-layer approaches yields better performance in terms of the low rate of packet loss, fast average packet delivery time, and high TCP throughput between end-to-end nodes.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.43 no.10 s.352
• /
• pp.79-89
• /
• 2006

TCP is the most widely used transport protocol in Internet applications that guarantees a reliable data transfer. But, in the wireless multi-hop networks, TCP performance is degraded because it is designed for wired networks. The main reasons of TCP performance degradation are contention for wireless medium at the MAC layer, hidden terminal problem, exposed terminal problem, packet losses in the link layer, unfairness problem, reordering problem caused by path disconnection, bandwidth waste caused by exponential backoff of retransmission timer due to node's mobility and so on. Specially, in the mobile ad-hoc networks, discrepancy between a station's transmission range and interference range produces hidden terminal problem that decreases TCP performance greatly by limiting simultaneous transmission at a time. In this paper, we propose a new MAC algorithm for mobile ad-hoc networks to solve the problem that a node can not transmit and just increase CW by hidden terminal. In the IEEE 802.11 MAC DCF, a node increases CW exponentially when it fails to transmit, but the proposed algorithm, changes CW adaptively according to the reason of failure so we get a TCP performance enhancement. We show by ns-2 simulation that the proposed algorithm enhances the TCP performance by fairly distributing the transmission opportunity to the failed nodes by hidden terminal problems.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.3
• /
• pp.1406-1424
• /
• 2017

Recent advancements in network infrastructures provide increased opportunities to support data delivery over multiple paths. Compared with multi-homing scenario, overlay network is regarded as an effective way to construct multiple paths between end devices without any change on the underlying network. Exploiting multipath characteristics has been explored for TCP with multi-homing device, but the corresponding exploration with overlay network has not been studied in detail yet. Motivated by improving quality of experience (QoE) for reliable data delivery, we propose a multipath message transport protocol based on application level relay (MPMTP-AR). MPMTP-AR proposes mechanisms and algorithms to support basic operations of multipath transmission. Dynamic feedback provides a foundation to distribute reasonable load to each path. Common source decrease (CSD) takes the load weight of the path with congestion into consideration to adjust congestion window. MPMTP-AR uses two-level sending buffer to ensure independence between paths and utilizes two-level receiving buffer to improve queuing performance. Finally, the MPMTP-AR is implemented on the Linux platform and evaluated by comprehensive experiments.

• Journal of Korea Multimedia Society
• /
• v.10 no.12
• /
• pp.1632-1644
• /
• 2007

Wireless Mesh Networks aim to attain large connectivity with minimum performance degradation, as network size is increase. As such, scalability is one of the main characteristics of Wireless Mesh Networks that differentiates it from other wireless networks. This characteristic creates the need for bandwidth efficiency strategies to ensure that network performance does not degrade as the size of the network increase. Several researches have been done to realize mesh networks. However, the researches conducted were mostly focused on a per TCP/IP layer basis. Also, the studies on bandwidth efficiency and bandwidth improvement are usually dealt with as separate issues. This paper aims to simultaneously study bandwidth efficiency and improvement. Aside from optimizing the bandwidth given a fixed capacity, the capacity is also increased using results of physical layer studies. In this paper, the capacity is improved by using the concept of non-overlapping channels for wireless communication. A channel allocation scheme is conceptualized to choose the transmission channel that would optimize the network performance parameters with consideration of chosen Quality of Service (QoS) parameters. Network utility maximization is used to optimize the bandwidth after channel selection. Furthermore, a routing scheme is proposed using the results of the network utilization method and the channel allocation scheme to find the optimal path that would maximize the network gain.

• Journal of Communications and Networks
• /
• v.10 no.4
• /
• pp.455-464
• /
• 2008

To provide network services consistently under various network failures, enterprise networks increasingly utilize path diversity through multi-homing. As a result, multi-homed non-transit autonomous systems become to surpass single-homed networks in number. In this paper, we address an inevitable problem that occurs when networks with multiple entry points deploy firewalls in their borders. The majority of today's firewalls use stateful inspection that exploits connection state for fine-grained control. However, stateful inspection has a topological restriction such that outgoing and incoming traffic of a connection should pass through a single firewall to execute desired packet filtering operation. Multi-homed networking environments suffer from this restriction and BGP policies provide only coarse control over communication paths. Due to these features and the characteristics of datagram routing, there exists a real possibility of asymmetric routing. This mismatch between the exit and entry firewalls for a connection causes connection establishment failures. In this paper, we formulate this phenomenon into a state-sharing problem among multiple fire walls under asymmetric routing condition. To solve this problem, we propose a stateful inspection protocol that requires very low processing and messaging overhead. Our protocol consists of the following two phases: 1) Generation of a TCP SYN cookie marked with the firewall identification number upon a SYN packet arrival, and 2) state sharing triggered by a SYN/ACK packet arrival in the absence of the trail of its initial SYN packet. We demonstrate that our protocol is scalable, robust, and simple enough to be deployed for high speed networks. It also transparently works under any client-server configurations. Last but not least, we present experimental results through a prototype implementation.