• 한국정보통신학회:학술대회논문집
• /
• 한국해양정보통신학회 2010년도 추계학술대회
• /
• pp.465-467
• /
• 2010

This paper proposes MIMO two-way cooperative relay scheme to optimize the end to end capacity in wireless multi-hop mesh network. The basic idea is to perform data transmission via multi-hop relay nodes, in equidistant topology, this method is quite efficient. However, on one hand this topology is very rare in practical situation, on the other hand, in real practical situation where the topology is most likely non equidistant, the end to end capacity significantly degrades due to bottleneck link caused by uneven SNR. Moreover, the end to end capacity degrades at high SNR due to overreach interference from far nodes existing in multi-hop relay networks. In this paper, MIMO two-way cooperative relay in the region of non equidistant nodes is found efficient to improve the end to end capacity. The proposed scheme is validated using numerical simulation.

• 방송공학회논문지
• /
• 제21권1호
• /
• pp.109-112
• /
• 2016

본 논문에서는 다수의 간섭자로부터의 간섭 신호가 존재할 때 양방향 중계 네트워크의 불능 확률을 분석하였다. 양방향 중계 네트워크에서 한사용자는 다른 선택된 사용자와 세 단계로 통신한다. 제안된 네트워크에서 사용자 선택 기준을 제시하였으며 불능 확률을 수식적으로 유도하였다. 컴퓨터 모의 실험을 통해 제안된 분석과 모의실험이 잘 일치함을 확인하였으며 유저 수와 간섭자의 수의 불능 확률에의 영향을 보였다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제10권11호
• /
• pp.5455-5475
• /
• 2016

In this article, we model the distributed relay assignment network as a many-to-one matching market with peer effects. We discuss two scenarios for throughput optimization of relay networks: the scenario of aggregate throughput optimization and the scenario of fairness performance optimization. For the first scenario, we propose a Mutual Benefit-based Deferred Acceptance (MBDA) algorithm to increase the aggregate network throughput. For the second scenario, instead of using the alternative matching scheme, a non-substitution matching algorithm (NSA) is designed to solve the fairness problem. The NSA improves the fairness performance. We prove that both two algorithms converge to a globally stable matching, and discuss the practical implementation. Simulation results show that the performance of MBDA algorithm outperforms existing schemes and is almost the same with the optimal solution in terms of aggregate throughput. Meanwhile, the proposed NSA improves fairness as the scale of the relay network expands.

• Journal of information and communication convergence engineering
• /
• 제11권4호
• /
• pp.229-234
• /
• 2013

Diversity-multiplexing tradeoff (DMT) characterizes the fundamental relationship between the diversity gain in terms of outage probability and the multiplexing gain as the normalized rate parameter r, where the limiting transmission rate is give by rlog SNR (here, SNR denote the received signal-to-noise ratio). In this paper, we analyze the DMT and performance of an underwater network with a cooperative relay. Since over an acoustic channel, the propagation delay is commonly considerably higher than the processing delay, the existing transmission protocols need to be explained accordingly. For this underwater network, we briefly describe two well-known relay transmissions: decode-and-forward (DF) and amplify-and-forward (AF). As our main result, we then show that an instantaneous DF relay scheme achieves the same DMT curve as that of multiple-input single-output channels and thus guarantees the DMT optimality, while using an instantaneous AF relay leads at most only to the DMT for the direct transmission with no cooperation. To validate our analysis, computer simulations are performed in terms of outage probability.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제16권4호
• /
• pp.1373-1391
• /
• 2022

We investigate mobile multiple-input multiple-output (MIMO) molecular communication via diffusion (MCvD) system which is consisted of two source nodes, two destination nodes and one relay node in the mobile three-dimensional channel. First, the combinations of decode-and-forward (DF) relaying protocol and network coding (NC) scheme are implemented at relay node. The adaptive thresholds at relay node and destination nodes can be obtained by maximum a posteriori (MAP) probability detection method. Then the mathematical expressions of the average bit error probability (BEP) of this mobile MIMO MCvD system based on DF and NC scheme are derived. Furthermore, in order to minimize the average BEP, we establish the optimization problem with optimization variables which include the ratio of the number of emitted molecules at two source nodes and the initial position of relay node. We put forward an iterative scheme based on block coordinate descent algorithm which can be used to solve the optimization problem and get optimal values of the optimization variables simultaneously. Finally, the numerical results reveal that the proposed iterative method has good convergence behavior. The average BEP performance of this system can be improved by performing the joint optimizations.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제9권8호
• /
• pp.2894-2909
• /
• 2015

As the number of mobile devices such as smart phones and tablets explodes, the need for new services or applications is also rapidly increasing. Smart class application is one of the emerging applications, in which most of contents are distributed to all members of a class simultaneously. It is highly required to select relay nodes to cover shadow area of radio as well as extend coverage, but existing algorithms in a smart class environment suffer from high control packet overhead and delay for exchanging topology information among all pairs of nodes to select relay nodes. In addition, the relay selection procedure should be repeated in order to adapt to the dynamic topology changes caused by link status changes or device's movement. This paper proposes the learning based relay selection algorithm to overcome aforementioned problems. The key idea is that every node keeps track of its relay quality in a fully distributed manner, where RQI (Relay Quality Indicator) is newly defined to measure both the ability of receiving packets from content source and the ability of successfully relaying them to successors. The RQI of each node is updated whenever it receives or relays broadcast packet, and the node having the higher RQI is selected as a relay node in a distributed and run-time manner. Thus, the proposed algorithm not only removes the overhead for obtaining prior knowledge to select relay nodes, but also provides the adaptability to the dynamic topology changes. The network simulation and experimental results prove that the proposed algorithm provides efficient and reliable content distribution to all members in a smart class as well adaptability against network dynamics.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2000년도 하계학술대회 논문집 A
• /
• pp.212-214
• /
• 2000

The distance relay technique used for transmission line protection operates overreach and underreach to the self protection region because the power system becomes complex and fault conditions are different. To solve these problems, this paper describes new technique to set the reliable self protection lesion. The trip region of the quadrilateral distance relay is set by training of multi layer recurrent elman network. The proposed network is able to reach the trip zone for the fault impedance, fault initial angle and source impedance variance correctly.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제8권12호
• /
• pp.4451-4466
• /
• 2014

We present joint radio selection and relay scheme that delivers data from a source to a sink in heterogeneous stationary sensor networks consisting of various radio interfaces. The proposed scheme finds the optimal relay nodes and their corresponding radio interfaces that minimize energy consumption throughout the network while satisfying the end-to-end packet deadline requirement. We formulate the problem of routing through radio interface selection into binary integer programs, and obtain the optimal solution by solving with an optimization solver. We examine a trade-off relationship between energy consumption and packet delay based on network level simulations. We show that given the end-to-end deadline requirement, our routing algorithm finds the most energy-efficient routing path and radio interface across mesh hops. We demonstrate that the proposed routing scheme exploits the given packet delivery time to turn into network benefit of reducing energy consumption compared to routing based on single radio interface.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2007년도 하계종합학술대회 논문집
• /
• pp.3-4
• /
• 2007

Wireless Sensor Network is a form of network which consumes relatively less data trasmisson rate and energy. In this type of network, minimizing the consumption of energy so that it maximizes life time is very important. To be able to improve the energy comsumption, we propose the mechnism to trasmit broadcasted packet according to level value with priority assiagned to each relay node.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제14권8호
• /
• pp.3399-3419
• /
• 2020

In the Vehicular Ad-hoc Network (VANET), the data transmission of time-sensitive applications requires low latency, such as accident warnings, driving guidance, etc. However, frequent changes of topology in VANET will result in data transmission failures. In order to improve the efficiency of VANETs data transmission and increase the timeliness of data, this paper proposes a relay scheme based on Recurrent Neural Network (RNN) trajectory prediction, which can be used to select the optimal relay vehicle to transmit data. The proposed scheme learns vehicle trajectory in a distributed manner and calculates the predicted trajectory, and then the optimal vehicle can be selected to complete the data transmission, which ensures the timeliness of the data. Finally, we carry out a set of simulations to demonstrate the performance of the algorithm. Simulation results show that the proposed scheme enhances the timeliness of the data and the accuracy of the predicted driving trajectory.