• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.41 no.6 s.324
• /
• pp.69-78
• /
• 2004

This paper proposes architecture and characteristics of a multi-ring based optical network with single-hop between edge nodes using the concept of circuit switching and multi-wavelength label switching to solve delay problem caused by applying crossconnectors as transit nodes in the wavelength division multiplexing(WDM) network. We suggest multi-ring based architecture composed single and multiple wavelength-bands with multi-wavelength labels, and analyze characteristics of two models. To avoid the packet collision in output ports of edge nodes due to output contention, the static and dynamic allocation scheme, which packets are allocated in time slots, is provided. Based on our analysis, it shows that delay only occur in not core nodes but edge nodes in the proposed architecture. In addition, we evaluate the probabilities of delay, packet loss, and call blocking in the proposed optical packet network.

• Korean Journal of Applied Biomechanics
• /
• v.21 no.5
• /
• pp.611-619
• /
• 2011

The purpose of this study was to analyze the kinematics of the men's triple jump at the 2011 Daegu World Championships by comparing the results to those at the 2009 Berlin World Championships. The kinematic data were gathered from two steps before take off to the landing using a seven panorama system, and these data were divided into 3 phases for 8 participants. The average jump for the finalists was longer in the Daegu championships (17.46 m) than in the Berlin championships (17.28 m). The longest jump record was increased by 23 cm. The step was the longest at 36% of the total distance, followed by the hop at 30% and the jump at 34%. The first and third phases were substantially longer than the second phase (the step). The horizontal speed at take-off increased in the order hop, step, and jump. Overall, in comparison with the results from Berlin, the horizontal velocity increased, the vertical velocity decreased, and the landing angle decreased.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.8 no.5
• /
• pp.113-119
• /
• 2008

Conventional 1-1-1 cooperative protocol offers path-loss gain as advantage of multi-hop and spatial diversity which is equivalent to MIMO system. This protocol is enable to get higher reliability and reduction of power consumption than those of the single-hop or multi-hop. But the 1-1-1 cooperative protocol get only the diversity order 2 and limited path-loss reduction gain because this protocol has a single cooperative relay. We propose 1-2-1 cooperative protocol using two cooperative relays R1, R2. The 1-2-1 cooperative protocol can improve path-loss reduction and increase diversity order 3. Moreover, the cooperative relay R2 attains diversity order 2. The signaling method in transmission uses DF (Decode and Forward) or DR (Decode and Reencode) and 1-2-1 DF/DR cooperative protocol are applied to clustering based wireless sensor networks (WSNs). Simulations are performed to evaluate the performance of the protocols under Rayleigh fading channel plus AWGN (Additive White Gaussian Noise).

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.48 no.10
• /
• pp.29-34
• /
• 2011

We present a network coding scheme which is designed for improving throughput in multi-hop wireless network with multi-radio multi-channel. The co-channel interference and unreliability of wireless transmissions cause the wireless network to reduce throughput. In wireless network, multi-radio multi-channel technology shows benefit to cut down channel interferences and contentions. And network coding can reduce the complexity of scheduling and improve throughput by increasing usage of links in wireless network. In this paper, we propose a method of channel assignment and transmission scheduling in intra-session network coding that efficiently improve throughput for multi-hop wireless network by using mathematical modeling and linear programming. Moreover, we evaluate the performance of the intra-session network coding scheme by using AMPL with CPLEX. The simulation results show that intra-session network coding can achieve better throughput than traditional routing.

• The KIPS Transactions:PartC
• /
• v.11C no.7 s.96
• /
• pp.879-888
• /
• 2004

Ad Node transmits packets to a destination node using routing function of intermediate nodes on the path in Ad Hoc networks. When the link to a next hop node in a path is broken due to the next hop node's mobility, a new route search process is required for continuing packets transmission. The node which recognizes link fault starts a local route recovery or the source node starts a new route search in the on demand routing protocol AODV. In this case, the new route search or the local route search brings packet delays and bad QoSs by packet delay. We propose RPAODV that the node predicts a link fault selects a possible node in neighbor nodes as a new next hop node for the path. The proposed protocol can avoid path faults and improve QoS.

• The KIPS Transactions:PartC
• /
• v.12C no.6 s.102
• /
• pp.809-816
• /
• 2005

MANET(mobile ad hoc network) cn be one of the access networks of BcN(broadband convergence network), and an user node requires address auto-configuration protocol for mu14i-hop environment. Some address auto-configuration protocols are proposed for independent MANET, but they don't consider BcN-accessable MANET environment. In this paper, new address auto-configuration protocol for wireless nodes is proposed. With this proposal, they ran configure their global addresses automatically in hybrid MANETs as BcN access networks. The autoconfiguration protocol modifies IPv6 NDP(neighbor discovery protocol) messages to deliver global prefix information to all wireless nodes, and avoids message boradcasting to minimize network overhead.

• Journal of KIISE:Computer Systems and Theory
• /
• v.29 no.9
• /
• pp.503-513
• /
• 2002

Since CC-NUMA architecture has to access remote memory, the interconnection network determines the performance of the CC-NUMA system. Bus which has been used as a popular interconnection network has many limits in a large-scale system because of the limited physical scalability and bandwidth. The dual ring interconnection network, composed of high-speed point-to-point links, is made to resolve the defects of the bus for the large-scale system. However, it also has a problem, in that the response latency is rapidly increased when many nodes are attached to the snooping based CC-NUMA system with the dual ring. In this paper, we propose a ring architecture with repeater nodes in order to overcome the problem of the dual ring on a snooping based CC-NUMA system, and design a repeater node adapted to this architecture. We will also analyze the effects of proposed architecture on the system performance and the response latency by using a probability-driven simulator.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.4A
• /
• pp.291-301
• /
• 2009

In this paper, the effect of ISI(Inter-Symbol Interference) and ICI(Inter-Carrier Interference) due to time difference of arrival on OFDMA-based mobile multi-hop relay (MMR) systems is analyzed. Analyses are performed for the ISI caused by the previous OFDMA symbol transmitted from neighboring macro or relay cell as well as the ISI caused by the next OFDMA symbol transmitted from neighboring macro or relay cell. Then, an effective SINR(Signal to Interference plus Noise Ratio) estimation method and a path selection method considering time difference of arrival are proposed to minimize the effect of ISI and ICI. It is shown by simulation that the performance degradation caused by time difference of arrival can be significantly mitigated when the proposed path selection method is applied to the uplink of OFDMA-based MMR systems.

• Journal of the Institute of Convergence Signal Processing
• /
• v.14 no.1
• /
• pp.45-50
• /
• 2013

Sensors have limited resources in sensor networks, so efficient use of energy is important. Representative clustering methods, LEACH, LEACHC, TEEN generally use direct transmission methods from cluster headers to a sink node to pass collected data. If clusters are located at a long distance from the sink node, the cluster headers exhaust a lot of energy in order to transfer the data. As a consequence, the life of sensors is shorten and re-clustering is needed. In the process of clustering, sensor nodes consume some energy and the energy depletion of the cluster headers meet another energy exhaustion. A method of transferring data from cluster headers to the sink using neighbor clusters is needed for saving energy. In this paper, we propose a novel routing method using a multi-hop transmission method in cluster sensor networks. This method uses the topology matrix which presents cluster topology. One-hop routing and two-hop routing are proposed in order to increase the energy efficiency.

• Journal of Internet Computing and Services
• /
• v.10 no.5
• /
• pp.27-32
• /
• 2009

Colored thread algorithm, suggested to be used for the label switching network, needs to be modified for the packet switching network. In this paper, it is recommended to add a merged state, besides the 3 states - null, colored and transparent - which are resulted from the behaviors of extend, rewind, stall, withdraw and merge events. The original colored thread algorithm is designed to generate a new thread and extend it to the downstream direction with unknown hop count when the thread has revisited the node that was visited. It also suggested rewinding the thread to the downstream direction by the source node, instead of rewinding it upstream direction by the revisited node. If a node received multiple threads which had a same forward equivalent class, then it checks first whether the hop counts are ascending or not. If it is in ascending order, then threads are merged. Otherwise the later thread is stalled until the former thread's color is to be changed to transparent or it is removed. This idea removes the effort of generating a new thread with unknown hop count.