• Proceedings of the Korea Information Processing Society Conference
• /
• 2023.11a
• /
• pp.113-114
• /
• 2023

본 논문은 다양한 방향성과 멀티 홉을 고려하여 최적의 콘텐츠 제공을 위한 릴레이 차량 선택 방안을 제안한다. 도로변 기지국의 제한성으로 인해 자율 주행 차량에 탑승한 승객들이 콘텐츠를 충분히 전달받는 데에 있어서, 지연시간과 버퍼링 등의 문제가 발생할 수 있다. 따라서, 도로변 기지국의 보조를 위하여 주위의 다른 차량들을 활용하여 요청된 콘텐츠를 원활하게 제공할 수 있다. 하지만, 기존 방안들은 한 대 또는 너무 많은 차량을 무분별하게 선택함으로써 최적화된 성능을 도출할 수 없었다. 그러므로, 본 논문은 요청 차량과 같은 방향으로 이동하는 1 차 릴레이 차량을 선발하는 데에 있어서 반대쪽에서 오는 2 차 릴레이 차량의 사전 캐싱량을 활용하는 방안을 제안한다. 1차 릴레이 차량의 충분한 요청 차량과의 연결 시간에 비교하여 부족한 사전 캐싱량을 2 차 릴레이 차량들로 보충함으로써 지연시간과 버려지는 패킷을 최소화할 수 있다.

• Journal of Advanced Navigation Technology
• /
• v.18 no.3
• /
• pp.236-241
• /
• 2014

In a mobile ad hoc networks, multi-hop transmission is used to transfer data from source node to destination node and the routing protocol is the one of the important technical issues. The links between nodes can be unstable due to the changes of node location and channel conditions, and it can induce link error. To solve this problem, multipath routing was proposed. Multipath routing can reduce the data congestion and increase data throughput. In the multipath routing, however, each path can be interfered by the other path, and it can aggravate network performance. In this paper, we propose the multipath routing technique in the multi-rate MANET. The proposed multipath routing can avoid interference without the knowledge of node location. Simulation results show that the proposed multipath routing can reduce transmission delay and error.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.13 no.5
• /
• pp.249-258
• /
• 2013

In multi-hop ad hoc networks, multi-interface multi-channel architecture is being noticing as methodology to improve the effective bandwidth and end-to-end throughput, But since existing routing metrics designed for networks based on single-interface exactly can not reflects the nature of networks based on multi-interface multi-channel, we are not expected the effect of throughput improvement. there had been proposal of MCR that discover high throughput by using metrics such as channel diversity and interface switching cost. however, MCR have an problem that is degraded it's performance in congested networks, because it not reflects the impact of traffic load. in this paper, we propose MAMCR metric, which select high throughput paths under congested conditions by combination MCR with channel access time metric, and conform it's the effect of performance improvement by ns-2 simulation.

• Proceedings of the Korean Information Science Society Conference
• /
• 2006.06d
• /
• pp.115-117
• /
• 2006

IEEE 802.11 표준은 채널 상태에 따라 다양한 전송 속도를 지원하며, 무선랜 환경에서 이러한 특성을 활용하는 연구들이 진행되어 왔다. 그러나, 모바일 애드 혹 네트워크 환경에서 다중전송속도를 활용하는 연구는 거의 이루어지지 않았다. 본 논문은 모바일 애드 혹 네트워크에서 동적으로 다중전송속도를 활용하여 채널 효율을 높이는 알고리즘을 제안한다. 제안 기법은 MAC 계층과 네트워크 계층 중간에 위치하며 각 계층에 독립적으로 동작한다. 라우팅 프로토콜에서 결정한 다음 홉에 더불어, 제안 기법은 더 빠른 전송 속도를 갖는 중계 경로를 탐색한다. 또한, 패킷의 크기에 따라 경쟁 부하를 고려하여 선택적으로 전송 경로를 변경한다. 모의 실험을 통한 성능 평가는 제안 기법의 우수한 성능을 입증한다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38A no.7
• /
• pp.612-622
• /
• 2013

In this paper, we propose a coding packet group-based ARQ scheme (rNC) for file delivery in wireless networks. rNC assumes multiple network coding points between the source and the destination. Each network coding point gathers and codes a group of packets according to the queue polling system. A queue polling system makes a few or several packets available for coding in a queue while polling the other queues in the system. Thus, we assuem a queue polling system at each network coding point. We call this group of packets as coded packet group. Each coding point acknowledges the reception of every code packet group to its previous coding point for reliable delivery. Thus, the intermediate coding points including the source can release its buffer before the packet is delivered to the destination. To guarantee the ultimate file delivery to the destination, the destination sends acknowledgement to the sender. We evaluate our proposed scheme using ns-2 and compare the performance with CodeCast. The results show that rNC works better than CodeCast in terms of packet delivery ratio and control overhead in unreliable wireless networks.

• KIPS Transactions on Computer and Communication Systems
• /
• v.5 no.11
• /
• pp.385-392
• /
• 2016

Recently, Expectation Area-based Real-time Routing (EAR2) protocol has been proposed to support real-time routing in wireless sensor networks. EAR2 considers the expectation area of a mobile sink and uses flooding within the expectation area. However, flooding leads to excessive energy consumption and causes long delay against real-time routing. Moreover, since EAR2 uses single path to the expectation area, it is difficult to support reliable routing in sensor networks with high link failures. Thus, to overcome these limitation of EAR2, this paper proposes a reliable and real-time routing protocol based on virtual grids and multipath for mobile sinks. To support real-time routing, the proposed protocol considers expectation grids belonged to the expectation area. Instead of flooding within the expectation area, the proposed protocol uses multicasting to the expectation grids and single hop forwarding in an expectation grid because the multicasting can save much energy and the single hop forwarding can provide short delay. Also, the proposed protocol uses multipath to the expectation grids to deal with link failures for supporting reliable routing. Simulation results show that the proposed protocol is superior to the existing protocols.

• Journal of Broadcast Engineering
• /
• v.15 no.2
• /
• pp.157-162
• /
• 2010

In this paper, We propose that the adaptive cooperative relay transmission technique using closed-loop MIMO scheme for duplex communication system. As the mobility between relay and base station is little, closed-loop MIMO is better diversity gain than open-loop MIMO. At this time, more than one relaying terminals are included in one cooperative group to share their transmission and take precoding weight feedback. For minimization of throughput reduction caused by increasing feedback bits, we use codebook-based MRT that limit the number of feedback bits. Among the cooperative relay group, the best relays are selected from the base stataion and get the feedback. A protocol senarios are also proposed for this relay system.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37 no.1C
• /
• pp.54-62
• /
• 2012

A Wi-Fi mesh network providing multi-hop wireless connections based on IEEE 802.11 PHY/MAC technology has recently received a significant attention as a network infrastructure that interconnects RFID systems and wireless sensor networks (WSNs). However, the current IEEE 802.11 contention-based MAC protocol cannot fully utilize the network capacity due to eithor frame collisions or unused network resources. In this paper, we propose a novel multi-channel scheduling MAC (MCS-MAC) protocol for Wi-Fi mesh networks. Under the secondary interference model of Wi-Fi mesh networks, the MCS-MAC protocol can maximize the network throughput via activation of collision-free links that has a maximal link weight. Through the simulations, we show that the throughput of the MCS-MAC protocol is at least three times higher than that of existing MAC protocols in Wi-Fi mesh networks.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.11 no.4
• /
• pp.39-45
• /
• 2011

In this paper, we propose an efficient multichannel MAC protocol with idle nodes assistance to avoid the multi-channel hidden terminal problem in cognitive radio ad hoc network and further to improve the performance of the network. The proposed MAC protocol can be applied to the cognitive radio adhoc network where every node is equipped with the single transceiver and one common control channel exists for control message negotiation. In the proposed protocol, the idle nodes available in the neighbour of communication nodes are utilized because the idle nodes have the information about the channels being utilized in their transmission range. Whenever the nodes are negotiating for the channel, idle nodes can help the transmitting and receiving nodes to select the free data channel for data transfer. With the proposed scheme, we can minimize the hidden terminal problem and decrease the collision between the secondary users when selecting the channel for data transfer. As a result, the performance of the network is increased.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.17 no.6
• /
• pp.211-223
• /
• 2018

Mobile relay systems have been adopted by $4^{th}$ generation mobile systems as an alternative method to extend cell coverage as well as to enhance the system throughput at cell-edges. In order to achieve such performance gains, the mobile relay systems require path selection and resource allocation schemes that are specifically designed for these systems which make use of additional radio resources not needed in single-hop systems. This paper proposes an integrated path selection and resource allocation scheme for LTE-Advanced relay systems using collaborative communication. We first define the problem of maximizing the downlink throughput of LTE-Advanced relay systems using collaborative communication and transform it into a multi-dimensional multi-choice backpacking problem. The proposed Lagrange multiplier-based heuristic algorithm is then applied to derive the approximate solution to the maximization problem. It is shown through simulations that the approximate solution obtained by the proposed scheme can achieve a near-optimal performance.