• Journal of Electrical Engineering and Technology
• /
• v.7 no.2
• /
• pp.151-156
• /
• 2012

The current study presents a zero-one integer programming approach to determine the minimum break point set for the coordination of directional relays. First, the network is reduced if there are any parallel lines or three-end nodes. Second, all the directed loops are enumerated to reduce the iteration. Finally, the problem is formulated as a set-covering problem, and the break point set is determined using the zero-one integer programming technique. Arbitrary starting relay locations and the arbitrary consideration of relay sequence to set and coordinate relays result in navigating the loops many times and futile attempts to achieve system-wide relay coordination. These algorithms are compared with the existing methods, and the results are presented. The problem is formulated as a setcovering problem solved by the zero-one integer programming approach using LINGO 12, an optimization modeling software.

• Journal of Communications and Networks
• /
• v.18 no.4
• /
• pp.629-638
• /
• 2016

In this paper, we investigate an energy-efficient resource allocation problem in a two-way relay (TWR) network consisting of multiple user pairs and an amplify-and-forward (AF) relay. As the users and relay have individual energy efficiencies (EE), we formulate a multi-objective optimization problem (MOOP). A single-objective optimization problem (SOOP) of the MOOP is introduced using a weighted-sum method, which achieves a single Pareto optimal point of the MOOP. To derive the algorithm for the SOOP, we propose a more tractable equivalent problem using the Karush-Kuhn-Tucker conditions of the SOOP, which guarantees convergence at the local optimal points. The proposed equivalent problem can be efficiently solved by the proposed iterative algorithm. Numerical results demonstrate the effectiveness of the proposed algorithm in achieving the optimal EE in multi-user AF TWR networks.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37B no.12
• /
• pp.1128-1137
• /
• 2012

In this paper, we propose an improved MPR selection method considering mobility and density of nodes for ad-hoc networks. In Optimized Link State Routing(OLSR), a node selects 1-hop Multi-Point Relay(MPR) nodes to cover all 2-hop neighbor nodes. In a high population area, many nodes are likely to be selected as MPR nodes by their neighbors. This leads to increase in contention among MPR nodes and may decrease overall performance of the network. In addition, when an MPR node leaves the communication range of its MPR selector node, it can no longer perform as the MPR node and the performance of the network may also decrease. In this paper, we propose an MPR selection method which measures the mobility and density of nodes by exchanging the hello messages and gives the priorities to the nodes for MPR selection. Performance evaluation results using OPNET show that the proposed method is superior to OLSR or the MPR candidate method in terms of connectivity and throughput.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.16 no.9
• /
• pp.3152-3171
• /
• 2022

This work investigates the physical layer secrecy of a multi-antenna hybrid satellite-terrestrial relay networks (HSTRN) with jamming, in which a satellite aims to make communication with a destination user by means of a relay, along with spatially random eavesdroppers. In order to weaken the signals of eavesdroppers, the conventional relay can also generate intentional interference, besides forwarding the received signal. Shadowed-Rician fading is adopted in satellite link, while Rayleigh fading is adopted in terrestrial link, eavesdropper link and jamming link. The analytical and asymptotic formulas for the system secrecy outage probability (SOP) are characterized. Practical insights on the diversity order of the network are revealed according to the asymptotic behavior of SOP at high signal-to-noise ratio (SNR) regime. Then, analysis of the system throughput is examined to assess the secrecy performance. In the end, numerical simulation results are presented to validate the theoretical analysis and point out: (1) The secrecy performance of the considered network is affected by the channel fading scenario, the system configuration; (2) Decrease of the relay coverage airspace can provide better SOP performance; (3) Jamming from the relay can improve secrecy performance without additional network resources.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.12
• /
• pp.4967-4986
• /
• 2015

Multi-hop relaying communications have great potentials in improving transmission performance by deploying relay nodes. The benefit is critically dependent on the accuracy of the channel state information (CSI) of all the transmitting links. However, the CSI has to be estimated. In this paper, we investigate the channel estimation problem in one-way multi-hop MIMO amplify-and-forward (AF) relay system, where both the two-hop and three-hop communication link exist. Traditional point-to-point MIMO channel estimation methods will result in error propagation in estimating relay links, and separately tackling the channel estimation issue of each link will lose the gain as part of channel matrices involved in multiple communication links. In order to exploit all the available gains, we develop a novel channel estimation model by structuring different communication links using the PARAFAC and PARATUCK2 tensor analysis. Furthermore, a two-stage fitting algorithm is derived to estimate all the channel matrices involved in the communication process. In particular, essential uniqueness is further discussed. Simulation results demonstrate the advantage and effectiveness of the proposed channel estimator.

• Journal of information and communication convergence engineering
• /
• v.12 no.2
• /
• pp.67-74
• /
• 2014

In multi-hop communication systems, two-way relaying is one of the solutions to mitigate the spectral efficiency loss caused by a half-duplex transmission. In this paper, a simple two-way relaying scheme is proposed for two-hop two-user multiple input multiple output (MIMO) systems. In the proposed system, a base station and a relay station (RS), both equipped with two antennas, form a point-to-point MIMO channel, while the RS and two single-antenna mobile users form a point-to-multipoint multiuser (MU)-MIMO channel. Numerical examples show that the proposed system achieves a significant sum rate gain as compared to a one-way relaying system as the distance between a relay and the two users decreases. We also show that although we can expand the proposed scheme to more than two users, its performance gain as compared to that of one-way relaying decreases with an increase in the number of users.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.43 no.1 s.343
• /
• pp.133-142
• /
• 2006

This paper suggests an efficient method of protection ratio(PR) calculation and shows some results of point-to-point radio relay system for frequency coordination. The proposed PR can be expressed as a function of C/N of modulation scheme, noise-to-interference ratio(N/I), multiple interference allowance, fade margins of multi-Path and rain attenuation and net filter discrimination. And PR calculation is performed in view of fade margin, modulation scheme, distance, and interference for actual point-to-point radio relay frequency. According to results for 6.2 GHz, 64-QAM and 60 km at BER 10-6, fade margin and co-channel Protection ratio reveal 41.1dB and 74.9 dB, respectively The merit of presented method provides a systematic and easy calculation by means of PR correction factor related with various parameters and can apply the same concept to frequency coordination of millimeter wave radio relay system.

• Journal of Communications and Networks
• /
• v.13 no.5
• /
• pp.463-471
• /
• 2011

Cooperative communications using relays in wireless networks have similar effects of multiple-input and multiple-output without the need of multiple antennas at each node. To implement cooperation into a system, efficient protocols are desired. In IEEE 802.11 families such as a/b/g, mobile stations can automatically adjust transmission rates according to channel conditions. However throughput performance degradation is observed by low-rate stations in multi-rate circumstances resulting in so-called performance anomaly. In this paper, we propose active relay-based cooperative medium access control (AR-CMAC) protocol, in which active relays desiring to transmit their own data for cooperation participate in relaying, and it is designed to increase throughput as a solution to performance anomaly. We have analyzed the performance of the simplified AR-CMAC using an embedded Markov chain model to demonstrate the gain of AR-CMAC and to verify it with our simulations. Simulations in an infrastructure network with an IEEE 802.11b/g access point show noticeable improvement than the legacy schemes.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.17 no.6
• /
• pp.69-78
• /
• 2017

Shannon of the 5G smartphone and Fourier of the signal processing meet in the sampling theorem (2 times the highest frequency 1). In this paper, the initial Shannon Theorem finds the Shannon capacity at the point-to-point, but the 5G shows on the Relay channel that the technology has evolved into Multi Point MIMO. Fourier transforms are signal processing with fixed parameters. We analyzed the performance by proposing a 2N-1 multivariate Fourier-Jacket transform in the multimedia age. In this study, the authors tackle this signal processing complexity issue by proposing a Jacket-based fast method for reducing the precoding/decoding complexity in terms of time computation. Jacket transforms have shown to find applications in signal processing and coding theory. Jacket transforms are defined to be $n{\times}n$ matrices $A=(a_{jk})$ over a field F with the property $AA^{\dot{+}}=nl_n$, where $A^{\dot{+}}$ is the transpose matrix of the element-wise inverse of A, that is, $A^{\dot{+}}=(a^{-1}_{kj})$, which generalise Hadamard transforms and centre weighted Hadamard transforms. In particular, exploiting the Jacket transform properties, the authors propose a new eigenvalue decomposition (EVD) method with application in precoding and decoding of distributive multi-input multi-output channels in relay-based DF cooperative wireless networks in which the transmission is based on using single-symbol decodable space-time block codes. The authors show that the proposed Jacket-based method of EVD has significant reduction in its computational time as compared to the conventional-based EVD method. Performance in terms of computational time reduction is evaluated quantitatively through mathematical analysis and numerical results.

• Journal of KIISE:Information Networking
• /
• v.36 no.6
• /
• pp.528-535
• /
• 2009

This paper proposes a mechanism to increase performance using cooperative communications in IEEE 802.11 environment. Existing algorithms use one relay between a source and a destination, which is a 2 hop relay. The proposed algorithm utilizes more than one relay to complement inefficiency of using one relay. In the proposed mechanism, an AP manages network information (rate), which is used to select relays of a source by the AP. The AP notifies the selected relays to the source and neighbor nodes, and the source transmits data to the relays for cooperative communications. Moreover, relays are given to have an opportunity to send its own data right after relaying the source's data. So relays are compensated for the power to send the source's data and overall throughput is improved.