• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.6C
• /
• pp.403-411
• /
• 2011

This paper addresses a cooperative transmission scheme based on Alamouti coding for cognitive radio networks over frequency selective fading channels. In the proposed scheme, the Alamouti coded form at the destination node is constructed through a simple combination of symbols at the source node, instead of the time-reversal operation and the conjugate operation at the relay nodes used in the conventional scheme. Numerical results show that the proposed scheme achieves a higher order cooperative diversity than that of the conventional scheme.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2013.10a
• /
• pp.741-742
• /
• 2013

AODV algorithm is one of the widely used algorithm for wireless ad-hoc environment In AODV, the destination node selects the route with smallest hop count. Since AODV only consider hop count, the selected route could have low capacity link, and degrade QoS. In this paper, we propose a modified AODV algorithm that consider successful transmission rate of each link. Advantage of proposed algorithm is that AODV can support QoS without significant change of the algorithm using modified hop count.

• KIPS Transactions on Computer and Communication Systems
• /
• v.5 no.3
• /
• pp.47-54
• /
• 2016

In this paper, we propose a new opportunistic routing scheme based on timed bargaining game. The proposed algorithm effectively formulates the opportunistic routing mechanism as an repeated bargaining model using timed learning method. Additionally, we formulate a new contention window adjusting scheme for reduce collision rate. Simulation results indicate that the proposed scheme has excellent performance than other existing schemes under widely diverse VANET environments.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.11 no.6
• /
• pp.70-80
• /
• 2012

In this paper, we consider the amplify-and-forward relaying systems with the relay selection (AF-RS) using full channel information (FCI) and using partial channel information (PCI), respectively, in which the direct communication link between a source and a destination is available. And, the outage probabilities for the AF-RS using FCI and using PCI are investigated in Rayleigh fading channels, respectively. We provide exact outage probabilities, tight outage probability lower bounds, and asymptotic outage probabilities, respectively. And also, we present coding gains achievable by the AF-RS using FCI and using PCI. Through numerical investigation, all the analytic expressions are verified, and the coding gains are respectively evaluated with different average channel powers for the first and the second hop as well as different numbers of relays.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.13 no.6
• /
• pp.71-78
• /
• 2013

Recently, the opportunistic incremental relaying systems have been studied to improve the system performance effectively in wireless fading channel. Most of the performance analysis of the system includes a source-destination direct link. And there are few analysis which consider source-relay-destination indirect paths only. Therefore this paper proposes a transmission protocol which relays the source information using the selected relay from the partial channel information at the first stage in an opportunistic incremental relaying system. If the transmission fails, the selected best relay from the full channel information retransmits the information to the destination incrementally. The performance of the proposed system is derived analytically and verified from Monte Carlo simulation. The derived results can be applied to the system design and the performance estimation of the mobile systems and the bidirectional TV broadcasting systems which adapt an opportunistic incremental relaying system.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.17 no.1
• /
• pp.145-151
• /
• 2017

In this paper, we propose the design and implementation of the system that is predicting the failure of ballast water treatment system by analysing its sensor datum and is reserving the most effective service center for sellecting the repair location on the way to the destination port. These data are collected in real time during draining or filling up the sea water from/to the ship, and it is essential to preliminarily repair the equipment showing unstable characteristics by analyzing the normal and abnormal data characteristics. We proposed a software platform for predicting and repairing faults by selecting the most efficient repair center based on this e-Navigation while the vessel is navigating to the next destination port. This system, as announced by the IMO Convention for the Prevention of Marine Pollution in 2017, provides a stable economic impact from stable cargo operation and stable out/in from/to port and marine ecosystem.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.46 no.11
• /
• pp.25-31
• /
• 2009

In this paper we propose an improved energy aware greedy perimeter stateless routing protocol (EAGPSR) for wireless ad hoc network. The existing greedy perimeter stateless routine (GPSR) has some problems with overloaded node and void situation. The improved EAGPSR protocol is proposed to remedy these problems. It also gives the solution for the fundamental problem in geographical routine called void communication. It considers two parameters (Residual Energy of battery and distance to the destination) for the next hop selection. In order to use efficiently limited-energy of node in wireless ad hoc network, network lifetime is focused. To evaluate the performance of our protocol we simulated EAGPSR in ns-2. The simulation results show that the proposed protocol achieves longer network lifetime compared with greedy perimeter stateless routing (GPSR) and the existing Energy aware greedy perimeter stateless routing protocol (EAGPSR).

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.46 no.2
• /
• pp.36-43
• /
• 2009

In this paper, we propose a Cooperative Routing using ARQ-based Transmission (CRARQ) in Mobile Ad-hoc Wireless Sensor Networks (MAWSN). The goals of the CRARQ are to improve both the efficiency of transmission and the reliability of transmission together. The main features and contributions of the proposed CRARQ for supporting these goals are as follows. First, CRARQ uses a reactive concept to construct a route from a source to a destination. Second, CRARQ chooses the most stable relay at each hop along the route by mobility-based strategy. Third, cooperative transmission using the ARQ technique which can improve reliability is used at each hop to send data packets from source to destination. Finally, we present a theoretical analysis model for the proposed CRARQ. The performance evaluation of our protocol is implemented via simulation using Optimized Network Engineering Tool (OPNET) and analysis. The results of both simulation and analysis show that CRARQ achieves the improved packet delivery ratio (PDR) and outage probability.

• Convergence Security Journal
• /
• v.10 no.1
• /
• pp.41-48
• /
• 2010

Greedy protocols show good performance in Vehicular Ad-hoc Networks (VANETs) environment in general. But they make longer routes causing by surroundings or turn out routing failures in some cases when there are many traffic signals which generate empty streets temporary, or there is no merge roads after a road divide into two roads. When a node selects the next node simply using the distance to the destination node, the longer route is made by traditional greedy protocols in some cases and sometimes the route ends up routing failure. Most of traditional greedy protocols just take into account the distance to the destination to select a next node. Each node needs to consider not only the distance to the destination node but also the direction to the destination while routing a packet because of geographical environment. The proposed routing scheme considers both of the distance and the direction for forwarding packets to make a stable route. And the protocol can configure as the surrounding environment. We evaluate the performance of the protocol using two mobility models and network simulations. Most of network performances are improved rather than in compared with traditional greedy protocols.

• Journal of the Korea Society of Computer and Information
• /
• v.12 no.5
• /
• pp.19-27
• /
• 2007

We have implemented a WWW homepage which finds an optimal route for users. There already exist many web sites which provide the optimal route when a start and a destination cities are given. However, none of them can find the optimal route when a number of cities to be visited. The problem of finding the optimal route starting at a given start city and visiting through all the given intermediate cities and finally returning to the start city is called Travelling Sales Person(TSP) problem. TSP is a well known exponential time complexity problem. We have implemented an artificial intelligent search algorithm for TSP on our homepage. The main feature of our algorithm is that the destination may not be the same as the start city whereas all of the existing heuristic algorithms for TSP assume that the start and the destination cities are the same. The web page asks a user to select all the cities he or she wants to visit(including start and destination city), then it finds a sequence of the cities such that the user would travel minimum distance if he or she visits the cities in the order of the sequence. This paper presents algorithms used in the homepage.