• Journal of Korean Physical Therapy Science
• /
• v.25 no.3
• /
• pp.61-67
• /
• 2018

Background: The purpose of this study is to report the effect of balance training through various ankle inclination on dynamic balance in healthy adults. Methods: This study was participated in 20 healthy subjects. Twenty healthy adults were randomly divided into 10 ankle inclination group and 10 flat group, 3 kinds of exercised were performed in $30^{\circ}$ of the plantar flexion, $0^{\circ}$ of the neutral angle and $30^{\circ}$ of the dorsiflexion. Above 3 kinds of exercises were also performed in the flat group. Dynamic balance of each group was evaluated using a Figure-of-8 hop test, Up-down hop test, and Functional reach test before and after the experiment. Results: In the ankle inclination, the post-experiment showed a significant difference in Figure-of-8 hop test, Up-down hop test, and Functional reach test in comparison to pre-experiment(p<.05). Conclusion: The exercise applied in the ankle inclination is effective in improvement of the dynamic balance.

• Journal of Information Processing Systems
• /
• v.17 no.1
• /
• pp.63-74
• /
• 2021

According to the double-phase cluster-head election method (DCE), the final cluster heads (CHs) sometimes are located at the edge of cluster. They have a long distance from the base station (BS). Sensor data is directly transmitted to BS by CHs. This makes some nodes consume much energy for transmitting data and die earlier. To address this problem, energy efficient multi-hop cluster-head election strategy (EEMCE) is proposed in this paper. To avoid taking these nodes far from BS as CH, this strategy first introduces the distance from the sensor nodes to the BS into the tentative CH election. Subsequently, in the same cluster, the energy of tentative CH is compared with those of other nodes, and then the node that has more energy than the tentative CH and being nearest the tentative CH are taken as the final CH. Lastly, if the CH is located at the periphery of the network, the multi-hop method will be employed to reduce the energy that is consumed by CHs. The simulation results suggest that the proposed method exhibits higher energy efficiency, longer stability period and better scalability than other protocols.

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

• KIPS Transactions on Software and Data Engineering
• /
• v.10 no.8
• /
• pp.319-330
• /
• 2021

Recently, in the field of open domain natural language question answering, multi-task, multi-hop question answering has been studied extensively. In this paper, we propose a novel deep neural network model using hierarchical graphs to answer effectively such multi-task, multi-hop questions. The proposed model extracts different levels of contextual information from multiple paragraphs using hierarchical graphs and graph neural networks, and then utilize them to predict answer type, supporting sentences and answer spans simultaneously. Conducting experiments with the HotpotQA benchmark dataset, we show high performance and positive effects of the proposed model.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.17 no.10
• /
• pp.2732-2749
• /
• 2023

Device-to-Device (D2D) communication has received increasing attention and been studied extensively thanks to its advantages in improving spectral efficiency and energy efficiency of cellular networks. This paper proposes a novel relay selection algorithm for multi-hop full-duplex D2D communications underlaying cellular networks. By selecting the relay of each hop in a reverse manner, the proposed algorithm reduces the heavy signaling overhead that traditional relay selection algorithms introduce. In addition, the social domain information of mobile terminals is taken into consideration and its influence on the performance of D2D communications studied, which is found significant enough not to be overlooked. Moreover, simulations show that the proposed algorithm, in absence of social relationship information, improves data throughput by around 70% and 7% and energy efficiency by 64% and 6%, compared with two benchmark algorithms, when D2D distance is 260 meters. In a more practical implementation considering social relationship information, although the proposed algorithm naturally achieves less throughput, it substantially increases the energy efficiency than the benchmarks.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2012.05a
• /
• pp.758-760
• /
• 2012

The wireless sensor network is used to get information that location tracing or data of surrounding areas. Unnecessary retransmission request or many energy consumption because the transmission over the wireless links. In order to select the link of reliable and energy efficient to estimate the quality of radio link technique is required using RSSI, LQI, and so on. In this paper, each path between the sensor nodes, a small in the path within standard deviation of shall be determined the priority. Each path a high priority of the node values, respectively LQI is accumulated. Node can be selected the high LQI value path. Among them the less hop count to select the path is proposed. The proposed algorithm is removed the paths of shorten life using high the LQI value of the entire and high hop count even less variation. So its advantage that the sensor nodes can be selected more reliable path.

• Journal of Digital Convergence
• /
• v.10 no.9
• /
• pp.363-368
• /
• 2012

The Cluster-based routing protocol is consumed the energy consumption efficiently, but there are many isolated nodes while clustering, so these are impeding energy efficiency. Hop-by-hop based routing protocol is suitable large-scaled network or dynamic environment. However, with the periodic flooding signal and rapid energy loss of near sink nodes, the network life time become shorter. In this paper, We propose the hybrid routing protocol that combine the cluster based routing method for energy efficiency of nodes and hop-by-hop method for re-joining the isolated nodes and load balance of nodes in the near cluster using fibonacci sequence. Based on the analysis, it is proved that the hybrid routing protocol provided higher energy efficiency and less the isolated nodes than previous methods.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39B no.11
• /
• pp.763-770
• /
• 2014

In traditional routing protocols including LEACH for wireless sensor networks, nodes suffer from unbalanced energy consumption because the nodes require large transmission energy as the distance to the sink node increase. Multi-hop based routing protocols have been studied to address this problem. In existing protocols, each cluster head usually chooses the closest head as a relay node. We propose LEACH-CHT, in which cluster heads choose the path with least energy consumption to send data to the sink node. In our research, each hop, a cluster head selects the least cost path to the sink node. This method solves the looping problem efficiently as well as make it possible that a cluster head excludes other cluster heads placed farther than its location from the path, without additional energy consumption. By balancing the energy consumption among the nodes, our proposed scheme outperforms existing multi-hop schemes by up to 36% in terms of average network lifetime.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.5B
• /
• pp.539-548
• /
• 2011

We propose an efficient cooperative ARQ (Automatic Repeat reQuest) scheme for single-hop and multi-hop underwater acoustic communications, in which cooperative nodes are used to provide more reliable alternative paths for a specific source-to-destination connection. This alternative path has higher channel quality than that of the direct source-destination path. In addition, during a packet-relay through multiple hops, the typical acknowledgement (ACK) signal is replaced with overhearing data packet returned back from the next hop. The usage of overhearing as an ACK improves the system performance. In this paper, we evaluate the proposed scheme by comparing it with a conventional S&W ARQ in terms of throughput efficiency. Computer simulation results show that the proposed cooperative retransmission scheme can significantly improve the throughput by increasing the probability of successful retransmission.

• The Journal of the Korea Contents Association
• /
• v.8 no.7
• /
• pp.43-52
• /
• 2008

The AODV routing algorithm in a mobile ad-hoc networks broadcasts RREQ packet to find a route from a source to a destination. An attacker node may intercept a RREQ packet and attack by falsifying a field in that packet. In this paper, we propose a simply modified method which can protect a routing table from an attack to falsify the hop count field in the RREQ packet. When establishing a connection between a source and a destination, we update routing table of each node on the connection based on minimum delay instead of minimum hop count. By doing this, we can protect routing table from an attack to falsify a hop count Our simulation is implemented in Network Simulator(NS-2). We analyze how an attacker affects the mobile ad-hoc networks. The result of the simulation shows that the proposed mechanism transfers a data securely.