• Journal of electromagnetic engineering and science
• /
• v.10 no.2
• /
• pp.50-55
• /
• 2010

Orthogonal Frequency Division Multiplexing(OFDM) dual-hop systems can take full advantages of the techniques of both multi-hop communication and OFDM. To achievethis end, we propose a joint subcarrier matching, power allocation and bit loading algorithm operating under a total power constraint and the same Bit Error Rate(BER) threshold over all subcarriers. Simulation results demonstrated system throughput improvement compared to single-hop systems and dual-hop systems with different bit loading algorithms for each relay position, power constraint, and required BER.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.7 no.4
• /
• pp.800-818
• /
• 2013

Supporting video streaming over multi-hop wireless networks is particularly challenging due to the time-varying and error-prone characteristics of the wireless channel. In this paper, we propose a joint optimization scheme for video streaming over multi-hop wireless networks. Our coding scheme, called Joint Source/Network Coding (JSNC), combines source coding and network coding to maximize the video quality under the limited wireless resources and coding constraints. JSNC segments the streaming data into generations at the source node and exploits the intra-session coding on both the source and the intermediate nodes. The size of the generation and the level of redundancy influence the streaming performance significantly and need to be determined carefully. We formulate the problem as an optimization problem with the objective of minimizing the end-to-end distortion by jointly considering the generation size and the coding redundancy. The simulation results demonstrate that, with the appropriate generation size and coding redundancy, the JSNC scheme can achieve an optimal performance for video streaming over multi-hop wireless networks.

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

• Journal of Korean Orthopaedic Sports Medicine
• /
• v.2 no.1
• /
• pp.50-55
• /
• 2003

Purpose: To investigate the effects of an 8 weeks of plyometric training on the total work of knee and ankles Joint. Methods: Nine university man aged 20$\~$22 years was divided in 2 group. Exercisers (N=5) performing plyometrics (pike jump, double leg hop, double leg bound, single leg hop, stride jump cross over, alternate leg bound, box jump) for 8 weeks. Controls (N=4) maintained their usual activities. The total work of knee and ankle joint were tested prior to and after the training. Results: Plyometric training resulted in significantly greater in the total work of high speed of knee and ankle motion(p<0.05). Conclusions: The plyometric training were partially improved the total work of flexion and extension on the ankle joint. Also plyometric training could influence athletic performance.

• Korean Journal of Applied Biomechanics
• /
• v.34 no.2
• /
• pp.93-103
• /
• 2024

Objective: The purpose of this study was to investigate whether dancers with chronic ankle instability (CAI) exhibit different characteristics in dynamic postural control ability and ankle joint laxity compared to dancers without CAI and non-dancers with CAI. Method: Twelve dancers with CAI, 14 dancers without CAI, and 12 non-dancers with CAI participated in the study. Dynamic balance was evaluated using the Star Excursion Balance Test (SEBT) and the single-leg hop balance. The laxity of the ankle joint was evaluated through the anterior drawer test and the talar tilt test. SEBT measured maximum reach distances in anterior, posteromedial, and posterolateral directions. Single-leg hop assessed center of pressure (COP) and time-to-boundary (TTB) outcomes. One-way ANOVA and Chi-square tests were performed to compare the outcome variables among the three groups. Results: Dancers with CAI demonstrated greater reach distance in the posterolateral direction compared to non-dancers with CAI during SEBT (p=.014). Secondly, dancers without CAI showed greater reach distance in the posterolateral (p<.001) and posteromedial (p=.001) directions during SEBT compared to non-dancers with CAI. Additionally, dancers without CAI exhibited better postural control with higher TTB AP mean of minima (p=.003) and TTB AP standard deviation of minima (p=.012) during single-leg hop compared to nondancers with CAI. Thirdly, dancers with CAI showed a lower positive rate during the anterior drawer test compared to non-dancers with CAI (p=.019). Conclusion: Dancers with CAI demonstrated better ankle function and reduced mechanical instability compared to non-dancers with CAI. Therefore, to elucidate the underlying mechanisms of lateral ankle sprain and CAI development exacerbation in dancers, additional factors that can affect ankle sprain, such as visual dependence during postural control and evaluation in dance movements, should be explored.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.7A
• /
• pp.646-653
• /
• 2010

This paper provides a unified framework for the joint optimal subchannel and power allocation in multi-hop relay network, where each node in the network has multiple parallel subchannels such as in OFDM or MIMO system. When there are multiple parallel subchannels between nodes, the relay node decides how to match the subchannel at the first hop with the one at the second hop aside from determining the power allocation. Joint optimal design of subchannel matching and power allocation is, in general, known to be very difficult to solve due to the combinatorial nature involved in subchannel matching. Despite this difficulty, we use a simple rearrangement inequality and show that seemingly difficult problems can be efficiently solved. This includes several existing solution methods as special cases. We also provide various design examples to show the effectiveness of the proposed framework.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.8 no.1
• /
• pp.82-91
• /
• 2009

Routing (or path selection) is one of the key issues of multi-hop relay networks such as the IEEE 802.16j. Moreover, the allocation of appropriate resource such as bandwidth should not only be made in accordance with the paths selected, but the utilization of radio resource of an entire cell should also be maximized. Due to this interdependency between the problems of resource allocation and routing, it is desired these two problems are addressed simultaneously. In this paper, we propose a joint resource allocation and routing scheme for an OFDMA-based multi-hop cellular system. This scheme uses a polynomial time heuristic algorithm called Multi-Dimensional Multi-choice Knapsack Problem (MMKP) in order to find an approximate solution maximizing the total downlink throughput. In the simulation results, we show that the proposed scheme finds a sub-optimal solution which is superior to a link quality-based routing scheme, but slightly worse than the optimal solution.

• Proceedings of the Korean Information Science Society Conference
• /
• 2012.06d
• /
• pp.297-299
• /
• 2012

In this paper, we introduce a joint flow control and scheduling algorithm for multi-hop cognitive radio networks with spectrum underlay. Our proposed algorithm maximizes the total utility of secondary users while stabilizing the cognitive radio network and still satisfies the total interference from secondary users to primary network is less than an accepted level. Based on Lyapunov optimization technique, we show that our scheme is arbitrarily close to the optimal.

• IEIE Transactions on Smart Processing and Computing
• /
• v.6 no.3
• /
• pp.200-209
• /
• 2017

In this paper, we investigate the tradeoff between security and reliability for a multi-hop protocol in cluster-based underlay cognitive radio networks. In the proposed protocol, a secondary source communicates with a secondary destination via the multi-hop relay method in the presence of a secondary eavesdropper. To enhance system performance under the joint impact of interference constraint required by multiple primary users and hardware impairments, the best relay node is selected at each hop to relay the source data to the destination. Moreover, the destination is equipped with multiple antennas and employs a selection combining (SC) technique to combine the received data. We derive closed-form expressions of the intercept probability (IP) for the eavesdropping links and the outage probability (OP) for the data links over a Rayleigh fading channel. Finally, the correction of our derivations is verified by Monte-Carlo simulations.

• ETRI Journal
• /
• v.36 no.6
• /
• pp.960-967
• /
• 2014

In this paper, an analytical framework is proposed for the optimization of network performance through joint congestion control, channel allocation, rate allocation, power control, scheduling, and routing with the consideration of fairness in multi-channel wireless multihop networks. More specifically, the framework models the network by a generalized network utility maximization (NUM) problem under an elastic link data rate and power constraints. Using the dual decomposition technique, the NUM problem is decomposed into four subproblems - flow control; next-hop routing; rate allocation and scheduling; power control; and channel allocation - and finally solved by a low-complexity distributed method. Simulation results show that the proposed distributed algorithm significantly improves the network throughput and energy efficiency compared with previous algorithms.