• Journal of Communications and Networks
• /
• v.11 no.6
• /
• pp.589-598
• /
• 2009

In wireless sensor networks, a node that reports information gathered from adjacent assets should relay packets appropriately so that its location context is kept private, and thereby helping ensure the security of the assets that are being monitored. Unfortunately, existing routing methods that counter the local eavesdropping-based tracing deal with a single asset, and most of them suffer from the packet-delivery latency as they prefer to take a separate path of many hops for each packet being sent. In this paper, we propose a routing method, greedy perimeter stateless routing-based source-location privacy with crew size w (GSLP-w), that enhances location privacy of the packet-originating node (i.e., active source) in the presence of multiple assets. GSLP-w is a hybrid method, in which the next-hop node is chosen in one of four modes, namely greedy, random, perimeter, and retreat modes. Random forwarding brings the path diversity, while greedy forwarding refrains from taking an excessively long path and leads to convergence to the destination. Perimeter routing makes detours that avoid the nodes near assets so that they cannot be located by an adversary tracing up the route path. We study the performance of GSLP-w with respect to crew size w (the number of packets being sent per path) and the number of sources. GSLP-w is compared with phantom routing-single path (PR-SP), which is a notable routing method for source-location privacy and our simulation results show that improvements from the point of the ratio of safety period and delivery latency become significant as the number of source nodes increases.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.45 no.10
• /
• pp.29-39
• /
• 2008

Greedy routing which is easy to apply to geographic wireless sensor networks is frequently used. Greedy routing works well in dense networks whereas in sparse networks it may fail. When greedy routing fails, it needs a recovery algorithm to get out of the communication void. However, additional recovery algorithm causes problems that increase both the amount of packet transmission and energy consumption. Communication void is a condition where all neighbor nodes are further away from the destination than the node currently holding a packet and it therefore cannot forward a packet using greedy forwarding. Therefore we propose a VODUA(Virtually Ordered Distance Upgrade Algorithm) as a novel idea to improve and solve the problem of void. In VODUA, nodes exchange routing graphs that indicate information of connection among the nodes and if there exist a stuck node that cannot forward packets, it is terminated using Distance Cost(DC). In this study, we indicate that packets reach successfully their destination while avoiding void through upgrading of DC. We designed the VODUA algorithm to find valid routes through faster delivery and less energy consumption without requirement for an additional recovery algorithm. Moreover, by using VODUA, a network can be adapted rapidly to node's failure or topological change. This is because the algorithm utilizes information of single hop instead of topological information of entire network. Simulation results show that VODUA can deliver packets from source node to destination with shorter time and less hops than other pre-existing algorithms like GPSR and DUA.

• Journal of Korean Orthopaedic Sports Medicine
• /
• v.7 no.2
• /
• pp.95-121
• /
• 2008

Purpose: The goal is to identify the effectiveness of the IKDC subjective score in the clinical outcome study after reconstruction of the anterior cruciate ligament. Materials and Methods: Twenty-four patients after ACL reconstructions using twelve hamstring autografts and twelve Achilles allografts were evaluated. Lysholm knee score, IKDC subjective score, Knee Outcome Survey score and Tegner activity score were evaluated for the subjective outcome value. Static instability tests, Biodex dynamometer and one-legged hop for distance tests were done for the objective outcome value. Three functional performance tests (FPTs) including Carioca test, Shuttle run test and Co-contraction test were performed for deciding the final results. Each scale was compared with FPTs results and Pearson's correlation test was used to test the correlation between the parameters. Results: IKDC subjective score, single hop test, and quadriceps power in low velocity of Biodex dynamometer tests had a positive correlation with the total FPTs results. Conclusion: IKDC subjective score can be an effective test to evaluate the functional status as well as the subjective outcome after ACL reconstruction.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.45 no.9
• /
• pp.13-19
• /
• 2008

Time synchronization of nodes in sensor network synchronizes sensor nodes to one time clock. This is very essential in sensor networks so that the information collected and reported from the sensor nodes becomes meaningful. If sensor nodes are not synchronized, disaster report with time information can be wrong analyzed and this may lead to big calamity. With the limitation of battery and computing power, time synchronization algorithm imported in sensor nodes has to be as simple as it doesn't need big complexity, nor generates many synchronization messages. To reduce the synchronization error, hop count should be kept small between reference node to initiate synchronization and sensor nodes to be synchronized. Therefore, multiple reference nodes are used instead of single reference node. The use of multiple reference nodes introduce the requirement of synchronization among reference nodes in the network. Several algorithms have been proposed till now, but the synchronization among reference nodes are not well considered. This paper proposes improved time synchronization for sensor networks by synchronizing multiple reference nodes inside the network. Through simulation, we validated the effects of new algorithm.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.6A
• /
• pp.555-567
• /
• 2010

Unlike single-hop systems, multi-hop systems that use relay nodes assign a part of the overall resources to relay communications. If efficient resource allocation schemes are not adopted, this leads to a loss of resources. Moreover, because we may not be able to guarantee high-link performance due to the adjacent-cell interference in relay-based cellular systems, resource efficiency can be severely decreased. In this paper, we propose efficient resource allocation schemes for downlink relay-based networks in 3GPP (3rd Generation Partnership Project) LTE (Long Term Evolution)-Advanced systems. Unlike conventional schemes that have static resource regions for each data link, the proposed schemes dynamically allocate the resources of each link to resource blocks, by considering the channel state and the capacity of each link. We also propose resource overlapping schemes in which two different links overlap at the same resource region, so as to improve cell or user throughput performance. The proposed resource overlapping schemes do not require additional processes such as interference cancellation in users, thank to considering additional interference from resource overlapping in advance.

• KIPS Transactions on Computer and Communication Systems
• /
• v.9 no.3
• /
• pp.67-76
• /
• 2020

With the fast development in wireless communications and vehicular technologies, vehicular ad hoc networks (VANETs) have enabled to deliver data between vehicles. Recently, VANETs introduce a Vehicular Cloud (VC) model for collaborating to share and use resources of vehicles to create value-added services. To construct a VC, a vehicle should search vehicles that intend to provide their own resource. The single-hop search cannot search enough provider vehicles due to a small coverage and non-line-of-sights of communications. On the other hand, the multi-hop search causes very high traffics for large coverage searching and frequent connection breakages. Recently, many Roadside Units (RSUs) have been deployed on roads to collect the information of vehicles in their own coverages and to connect them to Internet. Thus, we propose a RSU-aided vehicular resource search and cloud construction mechanism in VANETS. In the proposed mechanism, a RSU collects the information of location and mobility of vehicles and selects provider vehicles enabled to provide resources needed for constructing a VC of a requester vehicle based on the collected information. In the proposed mechanism, the criteria for determining provider vehicles to provide resources are the connection duration between each candidate vehicle and the requester vehicle, the resource size of each candidate vehicle, and its connection starting time to the requester vehicle. Simulation results verify that the proposed mechanism achieves better performance than the existing mechanism.

• Journal of Korean Foot and Ankle Society
• /
• v.16 no.2
• /
• pp.128-134
• /
• 2012

Purpose: To design novel balance tests to assess FAI and evaluate whether these tests are affected by BMI or gender, with the goal of developing reliable FAI assessment tests that are not influenced by these factors. Materials and Methods: Participants included 20 young, healthy volunteers, 12 males and 8 females, with a mean age of $24{\pm}4$ years and a mean BMI of $23{\pm}2.28$. None of the subjects had known ankle instability. The following tests were assessed in each participant: single leg balance (SLB), percentage of leg press (PLP), single leg cycling (SLC), one leg squat (OLS), multiple direction reach-front/back/side (MDR-F/B/S), single leg hop (SLH), two leg jump (TLJ) and side step (SS). Data were analyzed using the SPSS 12.0 software program with ANOVA and t-test used. Results: When grouped by BMI, we found that despite differences in BMI, the performances of all subjects were equivalent except for the one-leg-squat test, for which the mean ratios for underweight ($1.69{\pm}0$), normal weight ($1.05{\pm}0.19$), and overweight ($0.93{\pm}0.30$) individuals were significantly different (p=0.02); ratios for SLB (p=0.273), SLC (p=0.903), PLP (p=0.664), MDR-F/B/S (p=0.498, 0.908, and 0.503, respectively), SLH (p=0.332) were not significantly different. When calculated according to gender, we found that the OLS (p=0.013) and MDRS (p=0.034) were significantly different, while parameters for all the remaining tests were not affected. Conclusion: We found that the SLB, PLP, SLC, MDR-F/B, and SLH ratios were unaffected by BMI or sex and, therefore, are reliable parameters for assessing ankle instability.

• BMB Reports
• /
• v.39 no.4
• /
• pp.432-440
• /
• 2006

A tuber lectin from Arisaema jacquemontii Blume belonging to family Araceae was purified by employing a single step affinity chromatography using column of asialofetuin-linked amino activated silica beads and the bound lectin was eluted with 100 mM glycine-HCl buffer pH 2.5. The purified A. jacquemontii lectin (AJL) showed a single protein band with an apparent molecular mass of 13.4 kDa when submitted to SDS-polyacrylamide gel electrophoresis under reducing as well as non-reducing conditions. The native molecular mass of AJL determined by gel filtration on a Biogel P-200 column was 52 kDa and its carbohydrate content was estimated to be 3.40%. Thus AJL is a tetrameric glycoprotein. The purified lectin agglutinated erythrocytes from rabbit but not from human. Its activity was not inhibited by any of the mono- and disaccharides tested except N-acetyl-D-lactosamine having minimal inhibitory sugar concentration (MIC) 25 mM. Among the glycoproteins tested only asialofetuin was found to be inhibitory (MIC $125\;{\mu}g/mL$). A single band was obtained in native PAGE at pH 4.5 while PAGE at pH 8.3 showed two bands. Isoelectric focusing of AJL gave multiple bands in the pI range of 4.6-5.5. When incorporated in artificial diet AJL significantly affected the development of Bactrocera cucurbitae (Coquillett) larvae indicating the possibility of using this lectin in a biotechnological strategy for insect management of cucurbits. Larvae fed on artificial diet containing sub-lethal dose of AJL showed a significant decrease in acid phosphatase and alkaline phosphatase activity while esterase activity markedly increased as compared to larvae fed on diet without lectin. Out of various human cancer cell lines employed in sulphorhodamine B (SRB) assay, this lectin was found to have appreciable inhibitory effect on the in vitro proliferation of HCT-15, HOP-62, SW-620, HT-29, IMR-32, SKOV-3, Colo-205, PC-3, HEP-2 and A-549 cancer cell lines by 82, 77, 73, 70, 41, 41, 37, 29, 21 and 21% respectively.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.8A
• /
• pp.1247-1253
• /
• 2000

To fully utilize the capabilities of a SONET/ADM network, traffic grooming is needed to multiplex a number of lower-rate traffic streams into a higher-rate stream, and vice versa. Although the capacity of a SONET ring network can be upgraded by operating it over multiple wavelengths, the corresponding network design may be costly if it employs a large number of ADMs. A cost-effective design attempts to minimize the total number of ADMs used in the network while carrying the offered traffic. We introduce and evaluate the performance characteristics of a new traffic-grooming approach for WDM ring networks, called multihop. The multihop implementation places an ADM at each node based on the requested traffic in the traffic-demand matrix then, it tries to groom the wavelengths which can be groomed. We select one of the nodes to be the "hub" node which has an ADM for each wavelength. The hub node, therefore, can "bridge" traffic between all of the wavelengths. The algorithm is specified and illustrated by a simple example. Our results demonstrate that it is beneficial to use a single-hop approach, but for a large grooming ratio and node number, we advocate the use of the multihop approach.e multihop approach.

• Journal of KIISE:Information Networking
• /
• v.32 no.4
• /
• pp.495-507
• /
• 2005

Measuring the end-to-end available bandwidth in the Internet is a useful tool for distributedapplication services or QoS (Quality-of-Service) guarantee. To measure the end-to-end available bandwidth, Single-hop Gap model-based packet train measurement techniques are well-known. However, the error of packet train output gap can happen by network topologies. This error of the output gap causes the inaccuracy of the available bandwidth measurement. In this paper, we propose a new end-to-end available bandwidth measurement technique with accurate capacity measurement and fast convergence methods. To solve the erroneous capacity measurement problem of the back-to-back packet train transmission, we propose a new available bandwidth measurement method by decoupling the capacity measurement with the initial gap of the packet train. Also, we propose a new technique to predict the proper initial gap of the packet train for faster convergence. We evaluate our proposed method by the simulation in various topologies comparing with previous methods.