• Journal of the Institute of Convergence Signal Processing
• /
• v.7 no.2
• /
• pp.45-52
• /
• 2006

Mobile Ad-hoc Network(MANET) could be applied to various applications by virtue of its characteristics such as self-organizing and infrastructure-free network. This paper proposes a multimedia application service model for MANET, called multi-hop Relay(mRelay) system. It supports a multi-hop communication-based multimedia service interworked with Internet by using an unmanned moving robot with wireless multimedia communication function as a mRelay terminal. The modified AODV routing protocol was applied to the terminal and it was verified that composition and maintenance of mobile Ad-hoc network in mRelay system under the various indoor scenarios were successful and stable multi-hop multimedia services were possible. The mRelay system can be applicable to various application services of mobile Ad-hoc networks.

• Journal of Communications and Networks
• /
• v.17 no.1
• /
• pp.84-92
• /
• 2015

Multi-hop relay networks have been widely considered as a promising solution to extend the coverage area and to reduce the deployment cost by deploying the relay stations (RSs) in mobile communication systems. Suitable deployment for the RSs is one of the most important features of the demand nodes (DNs) to obtain a high data transmission rate in such systems. Considering a tradeoff among the network throughput, the deployment budget, and the overall coverage of the systems, efficient RS deployment schemes and corresponding algorithms must be developed and designed. A novel cluster-based RS deployment scheme is proposed in this paper to select the appropriate deployment locations for the relay stations from the candidate positions. To make an ideal cluster distribution, the distances between the DNs are calculated when deploying the RSs. We take into account the traffic demands and adopt a uniform cluster concept to reduce the data transmission distances of the DNs. On the basis of the different candidate positions, the proposed scheme makes an adaptive decision for selecting the deployment sites of the RSs. A better network throughput and coverage ratio can be obtained by balancing the network load among the clusters. Simulation results show that the proposed scheme outperforms the previously known schemes in terms of the network throughput and the coverage ratio. Additionally, a suitable deployment budget can be implemented in multi-hop relay networks.

• Journal of Communications and Networks
• /
• v.15 no.1
• /
• pp.45-53
• /
• 2013

Multi-hop cellular networks (MCNs), which reduce the transmit power, mitigate the inter-cell interference, and improve the system performance, have been widely studied nowadays. The relay selection scheme is a key technique that achieves these advantages, and inappropriate relay selection causes frequent relay switchings, which deteriorates the overall performance. In this study, we analyze the conditions for relay switching in MCNs and obtain the expressions for the relay switching rate and relay activation time. Two mobile-based relay selection schemes are proposed on the basis of this analysis. These schemes select the relay node with the longest relay activation time and minimal relay switching rate through mobility prediction of the mobile node requiring relay and available relay nodes. We compare the system performances via simulation and analyze the impact of various parameters on the system performance. The results show that the two proposed schemes can obtain a lower relay switching rate and longer relay activation time when there is no reduction in the system throughput as compared with the existing schemes.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.2A
• /
• pp.133-138
• /
• 2011

This paper presents an information theoretic outage analysis for physical layer of a cooperative multihop wireless network. Our analysis shows that cooperation by selecting a proper relay at each hop increases the coverage or data rate of the network. In our analysis we consider both symmetric and asymmetric network model. We also investigate the availability of cooperative relay at each hop and show that end-to-end performance of the network depends on the relay selection procedure at each hop. We also verify our analytical results with simulations.

• 한국정보통신설비학회:학술대회논문집
• /
• 2008.08a
• /
• pp.394-397
• /
• 2008

Recently WiBro network is installed for high speed wireless internet service by telecommunication service provider, however WiBro service is not provided in the region of mountain or difficult region to install network infra. Fixed repeater is used to resolve those shadow area problem in current WiBro network. This paper study introducing Ad-hoc based multi-hop relay instead of using fixed repeater in order to resolve those shadow area problem. Cost down of fixed repeater and active network expansion is possible to resolve shadow area problem by introducing multi-hop relay technology.

• ETRI Journal
• /
• v.39 no.5
• /
• pp.729-736
• /
• 2017

This work investigates secure cluster-aided multi-hop randomize-and-forward networks. We present a hop-by-hop multi-hop transmission scheme with relay selection, which evaluates for each cluster the relays that can securely receive the message. We propose an analytical model to derive the secure connectivity probability (SCP) of the hop-by-hop transmission scheme. For comparison, we also analyze SCPs of traditional end-to-end transmission schemes with two relay-selection policies. We perform simulations, and our analytical results verify that the proposed hop-by-hop scheme is superior to end-to-end schemes, especially with a large number of hops or high eavesdropper channel quality. Numerical results also show that the proposed hop-by-hop scheme achieves near-optimal performance in terms of the SCP.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.5 no.3
• /
• pp.477-493
• /
• 2011

The IEEE 802.16 mobile multi-hop relay (MMR) task group 'j' (TGj) has introduced the multi-hop relaying concept in the IEEE 802.16 Wireless MAN, wherein a relay station (RS) is employed to improve network coverage and capacity. Several RSs can be deployed between a base station and mobile stations, and configured to form a tree-like multi-hop topology. In such architecture, we consider the problem of a path selection through which the mobile station in and outside the coverage can communicate with the base station. In this paper, we propose a new path selection algorithm that ensures more efficient distribution of resources such as bandwidth among the relaying nodes for improving the overall performance of the network. Performance of our proposed scheme is compared with the path selection algorithms based on loss rate and the shortest path algorithm. Based on the simulation results using ns-2, we show our proposal significantly improves the performance on throughput, latency and bandwidth consumption.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2010.10a
• /
• 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.

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

In this paper, we investigate traffic scheduling for a delay-sensitive multi-hop relay network, and aim to minimize the priority-based end-to-end delay of different data packet via joint relay selection, subcarrier assignment, and power allocation. We first derive the priority-based end-to-end delay based on queueing theory, and then propose a two-step method to decompose the original optimization problem into two sub-problems. For the joint subcarrier assignment and power control problem, we utilize an efficient particle swarm optimization method to solve it. For the relay selection problem, we prove its convexity and use the standard Lagrange method to deal with it. The joint relay selection, subcarriers assignment and transmission power allocation problem for each hop can also be solved by an exhaustive search over a finite set defined by the relay sensor set and available subcarrier set. Simulation results show that both the proposed routing scheme and the resource allocation scheme can reduce the average end-to-end delay.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.9
• /
• pp.3276-3292
• /
• 2015

Relay-assisted D2D communication extends the communication range of the D2D pairs and helps users to form D2D pairs effectively. However, due to the introduction of the multi-hop relaying, the D2D communication has to occupy extra transmission time, which may decrease the efficiency of the communication system. In this paper, we propose a scheme to make node receive D2D signal and BS signal at overlapping time to improve the spectrum efficiency according to ZigZag decoding and successive-interference-cancellation (SIC). In this way, more data can be delivered during the same duration, thus the network throughput can be further improved. Numerical results verify the performance improvement of the proposed scheme when compared with a baseline scheme. Moreover, we expand the proposed scheme from one-hop relay scenario to multi-hop relay scenario.