• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.19 no.5
• /
• pp.1091-1096
• /
• 2015

In this paper, WiMedia Distributed-MAC protocol is adopted for development of multi-hop N-screen wireless services. Furthermore, to provide the multi-hop OSMU (One Source Multi Use) N-screen service through P2P streaming in the D-MAC protocol, a new multi-hop resource reservation scheme is proposed and analyzed to reduce end to end delay. For this Multi-hop resource reservation scheme, a new MSCDRP (Multi-Stage Cooperative DRP) IE is proposed. Simulation results show that our multi-hop MSCDRP scheme reduces the end to end delay and increases throughput at various multi-hop N-screen network environment.

• Electronics and Telecommunications Trends
• /
• v.31 no.6
• /
• pp.57-66
• /
• 2016

통신망은 향후 통신 및 셀기반 통신망에 필요한 고속, 데이터 속도 및 투명성(transparency) 그리고 유연성(flexibility)을 제공하기 위해 빠르게 진화하고 있다. 전광 패킷 스위칭 망(all optical packet switching) 구조는 향후 급속도로 증가하는 데이터 통신 트래픽을 원활히 수용하기 위해서 싱글 홉 및 멀티 홉 전광 패킷 스위치 망의 요구사항을 만족하는 스위칭 속도, 성능, 확장성, 경제성 등을 고려한 실제 구현 가능한 구조의 필요성이 최근 대두되고 있다. 본 논문에서는 기존의 광 패킷 스위칭 기술의 한계를 극복할 수 있는 전광 멀티 홉 네트워크 기술을 기반으로 포토닉 패킷 스위칭 망을 구현하고자 세계적으로 연구되고 있는 전광 멀티 홉 네트워크 구조, 포토닉 패킷 스위칭 구조 그리고 시간동기 방법에 대해 최근의 연구동향을 분석한다.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2017.10a
• /
• pp.609-610
• /
• 2017

Cognitive radio communication techniques have been attracting attention to efficiently use the scarce spectrum as the wireless communication service increases. In cognitive radio communication, efforts to minimize interference to the primary user are important technical factors. In a multi-hop wireless ad hoc network, multi-hop transmission requires path and channel selection considering channel interference as well as collision with primary users. In the multi-channel environment, cognitive radio network has different capacities depending on the inter-channel interference and collision with the main users. In this paper, we propose a multi-hop transmission scheme that minimizes inter-channel interference and reduce collision with primary users.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.26 no.11
• /
• pp.1679-1685
• /
• 2022

In this paper, we propose an optimal multi-hop transmission scheme to maximize the end-to-end data rate from the source to the destination node in a wireless powered communication network. The frame structure for multi-hop transmission is presented to transmit multi-hop data while harvesting energy. Then, the transmission time of each node that maximizes the end-to-end transmission rate is determined through mathematical analysis in consideration of different harvested energy and link quality among nodes. We derive an optimization problem through system modeling of the considered wireless powered multi-hop transmission, and prove that there is a global optimal solution by verifying the convexity of this optimization problem. This analysis facilitates to find the optimal solution of the considered optimization problem. The proposed optimal multi-hop transmission scheme maximizes the end-to-end rate by allocating the transmission time for each node that equalizes the transmission rates of all links.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.16 no.7
• /
• pp.1406-1415
• /
• 2012

Though WiMedia supports the higher data rates than other WPAN technologies, a WiMedia device cannot reach other devices which are apart from it more than 10 meter; the limited transmission range of the WiMedia protocol. In this paper, we propose a multi-hop QoS routing protocol to enable WiMedia devices to transmit real-time data to devices that is located out of transmission range. The proposed routing protocol is a hybrid routing protocol, which is the mixed protocol of table-driven and on-demand routing algorithm. In the proposed protocol, a route for a device within 2-hop is established by using the table-driven routing algorithm and a route for the device beyond 2-hop is established by using the on-demand routing algorithm. We perform ns-2 simulation to investigate the performance of the proposed routing protocol with AODV and DSDV. The simulation results show that the proposed protocol's performance is better than AODV and DSDV in terms of the throughput and delay.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.21 no.1
• /
• pp.35-41
• /
• 2017

To solve the shortage of radio spectrum and utilize spectrum resource more efficiently, cognitive radio technologies are proposed, and many studies on cognitive radio have been conducted. Multi-hop routing is one of the important technologies to enable the nodes to transmit data further with lower power in ad-hoc cognitive radio networks. In a multi-channel cognitive radio networks, each channel should be allocated to minimize interference to primary users. In the multi-hop routing, channel allocation should consider the inter-channel interference to maximize network throughput. In this paper, we propose multi-channel scheduling scheme which minimizes inter-channel interferences and avoids collision with primary users for the multi-hop multi-channel cognitive radio networks. The proposed scheduling is designed to determine both of routing path and channel selection. The performance of proposed channel allocation scheme is evaluated by the computer simulation in the aspect of capacity and collision rate.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.7A
• /
• pp.706-714
• /
• 2010

In wireless sensor networks, real-time data delivery schemes typically achieve a desired delivery speed by performing one-hop lookahead. Recently, to reduce the deadline miss ratio against the desired delivery speed, a study has proposed a real-time routing protocol based on proactively performing two-hop lookahead. However, the study might cause heavy message exchange overhead and high computing complexity to carry out obtainment of two-hop neighborhood speed information in the entire sensor nodes whether data are delivered or not. Moreover, although multi-hop lookahead provides the least deadline miss ratio, due to the restriction from the overhead and the complexity, the recent study merely adopts the two-hop lookahead manner. In this paper, we propose a novel real-time routing protocol that adopts on-demand neighborhood multi-hop information obtainments only around data forwarding paths. Simulation results prove that the proposed routing protocol offers better performances with respect to deadline miss ratio, total communication costs, energy efficiency, and network lifetime.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.12 no.6
• /
• pp.111-116
• /
• 2012

Vehicular communication is one of main convergence technologies which combines information and communication technology (ICT) with vehicle and road industries. In general, vehicular communication adopts IEEE 802.11p standard which is commonly referred as wireless access in vehicular environments (WAVE). In this paper, we investigate a multi-hop communication scheme for IEEE 802.11p based communication systems which support both vehicle-to-infrastructure (V2I) and vehicle-to-vehicle (V2V) communications. First, we briefly overview the performance of IEEE 802.11p based communication systems. Then, a multi-hop communication scheme is introduced for both broadcast and unicast. The performance of proposed scheme is presented via experimental measurements.

• Proceedings of the Korean Institute of Communication Sciences Conference
• /
• 2004.11a
• /
• pp.309-309
• /
• 2004

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2017.05a
• /
• pp.77-80
• /
• 2017

One of the fundamental limits of Bluetooth Low Energy(BLE) is that the data transmission is available via singlehop connection. In this research, we suggested the stable multihop transmission method to overcome this limitation. In multihop connection situation, multiple singlehop connection should be made and disconnected dynamically. Therefore, we stored the data within the GATT layer and tried to send it dynamically. We divided whole process as 4 states, and let each nodes transfers around each states to make data connection safely. Also, we set the transfer policy between each states during the transmission to make a robust system. From the experiment in real-time environment, we proved that our method showed high rate of packet delivery in a multihop network, which consists of more than 3 nodes.