• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.1A
• /
• pp.109-114
• /
• 2007

A new space-time cooperative communication relaying strategy with assistant or management terminals is proposed in multi-hop wireless communication systems. More than one relaying terminals are included in one cooperative group to share the state information such as frame error rate and channel information. Among the cooperative group, the best ones are selected to send bit information using space-time codes. An implementation for the proposed scheme is also presented using a TDMA cooperative protocol. Receive signal to transmit signal ratio($E_r/E_s$) and computer simulation show the strategy outperform the conventional cooperative system.

• The Journal of the Korea Contents Association
• /
• v.18 no.3
• /
• pp.611-625
• /
• 2018

With innovative advances in wireless communication technology, many researches for extending network lifetime in maximum by using energy harvesting have been actively performed on the area of network resource optimization, QoS-guaranteed transmission, energy-intelligent routing and etc. As known well, it is very hard to guarantee end-to-end network delay due to uncertainty of the amount of harvested energy in multi-hop RF(radio frequency) energy harvesting wireless networks. To minimize end-to-end delay in multi-hop RF energy harvesting networks, this paper proposes an energy efficient routing metric based on interference aware and protocol which takes account of various delays caused by co-channel interference, energy harvesting time and queuing in a relay node. The proposed method maximizes end-to-end throughput by performing avoidance of packet congestion causing load unbalance, reduction of waiting time due to exhaustion of energy and restraint of delay time from co-channel interference. Finally simulation results using ns-3 simulator show that the proposed method outperforms existing methods in respect of throughput, end-to-end delay and energy consumption.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.11B
• /
• pp.1030-1037
• /
• 2008

This paper presents an algorithm for the path-finding problem in unknown environments with cooperative and commutative multi-robots. To verify the algorithm, we investigate the problem of escaping through the exit of a randomly generated maze by muti-robots. For the purpose, we adopt the so called frontier cells and cell utility functions, which were used in the exploration problem for the multi-robots. For the wireless communications among the mobile robots, we modify and utilize the so called the random basket routing, a kind of hop-by-hop opportunistic routing. A mobile robot, once it finds the exit, will choose its next action, either escape immediately or stay-and-relay the exit information for the others, where the robot takes one action based on a given probability. We investigate the optimal probability that minimizes the average escaping time (out of the maze to the exit) of a mobile robot.

• Journal of Digital Convergence
• /
• v.12 no.1
• /
• pp.339-345
• /
• 2014

This study has a purpose that improves efficiency of energy management and adaptation followed by movement of node better than the various early studied routing techniques. The purpose of this paper is the technique that uses RSSI value and location of sensor that is received by each sensor node to routing. This sduty does not save node information of 1-hop distance. And it solves energy-inefficient traffic problem that happens during data exchange process for middle node selection in close range multi hop transmission technique. The routing protocol technique that is proposed in this study selects a node relevant to the range of transmission which is set for RSSI value that is received by each node and selects the closest node as a middle node followed by location data. Therefore, it is for not exhaustion of node's energy by managing energy efficiently and cutting data transmission consuming until the destination node.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.41 no.6 s.324
• /
• pp.69-78
• /
• 2004

This paper proposes architecture and characteristics of a multi-ring based optical network with single-hop between edge nodes using the concept of circuit switching and multi-wavelength label switching to solve delay problem caused by applying crossconnectors as transit nodes in the wavelength division multiplexing(WDM) network. We suggest multi-ring based architecture composed single and multiple wavelength-bands with multi-wavelength labels, and analyze characteristics of two models. To avoid the packet collision in output ports of edge nodes due to output contention, the static and dynamic allocation scheme, which packets are allocated in time slots, is provided. Based on our analysis, it shows that delay only occur in not core nodes but edge nodes in the proposed architecture. In addition, we evaluate the probabilities of delay, packet loss, and call blocking in the proposed optical packet network.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.43 no.9 s.351
• /
• pp.60-68
• /
• 2006

Using the wireless communication among unacquainted vehicles, an intelligent vehicle safety system can be constructed to exchange vehicle safety-related information, such as urgency stop, traffic accident and road obstacles. In the majority of vehicle safety applications, vehicle safety messages are propagated in the form of broadcast. However, this approach causes some effectiveness and performance problems with massive radio collision, multi-hop propagation. This paper presents a priority based relay node selection method for propagating vehicle safety messages of traffic accident protection system. With this method, vehicle safety messages are relayed by a node that locates in proper distance out of the nodes that are included in the radio transmission range. By decreasing the number of duplicated messages, the packet overhead is lessened while the communication performance is raised. The proposed method was proven to be better than other schemes through network simulations.

• 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.

• Proceedings of the Korean Information Science Society Conference
• /
• 2005.11a
• /
• pp.304-306
• /
• 2005

이동 애드혹 네트워크(Mobile Ad Hoc Network: MANET)는 유선 인프라 없이 구축된 무선 네트워크로 멀티 홉 통신을 수행할 수 있다. 인터넷 노드와 통신하고자 하는 MANET 노드에게 인터넷 연결을 가능하게 하는 방법이 요구되며 인터넷 연결은 인터넷과 MANET을 중계하는 인터넷 게이트웨이를 통해 지원된다. 게이트웨이들 간의 부하를 잘 분배한다면 네트워크 성능 향상을 얻을 수 있으므로, MANET 내에 여러 개의 인터넷 게이트웨이가 존재할 경우 이들 간의 부하균등화는 중요한 이슈이다. 본 연구에서는 부하균등화 기법을 제어 메시지의 플러딩 방법과 인터넷 게이트웨이를 선택하는 주체에 따라 4가지로 분류하며, 부하균등화 문제를 해결하기 위한 새로운 메트릭(metric)을 제안한다. 시뮬레이션을 통하여 홉 수와 라우팅 엔트리의 수를 메트릭으로 이용하는 새로운 기법의 성능이 기존 기법에 비하여 향상되었음을 보인다.

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

Recently smart phone and tablet PC are regarded as the most valuable mobile devices, so the demand of customers for multimedia supporting has been greatly increased. The network operators are now considering the deployment of relay stations ensuring low installation costs for its service cell to improve the cell capacity. Enhancing the relay stations, however, increases intra-cell interference, which is affecting the quality of service and outage ratio. In this paper, we present MPFR(Multihop Partial Frequency reuse) as the new frequency reuse scheme to increase cell throughput while maintaining low outage ratio for the OFDMA cellular multihop networks. Dynamic power control is also introduced to improve cell capacity. Overall cell throughput and outage ratio are observed by the simulation, and comparison between MPFR and conventional multihop frequency reuse schemes is convincing the performance enhancement.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39B no.4
• /
• pp.216-227
• /
• 2014

Mechanical Relay (McR) is a relaying architecture to enable data communications, where it can endure the transportation delay and intermittent disconnection. Every kind of vehicular infrastructures can be readily utilized for the mechanical relaying in the manner of moving natures, which brings the most significant consequences compared to conventional relaying schemes. In this paper, we analyze the ergodic network throughput of McR in wireless line networks (WLN) to compare the results between employing McRs and direct multi-hopping through the users without McRs. We demonstrate the McR scheme that are not only Ve-SISO but also Ve-SIMO/MISO. The numerical results of ergodic network throughputs contribute to the trade-off relation depending on the speed v of McRs, intensity factors ${\lambda}_u$ and ${\lambda}_r$, and the methods of how McRs are utilized.