• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.16 no.10
• /
• pp.2143-2149
• /
• 2012

DVB-S2 employs LDPC codes which approach to the Shannon's limit, since it has characteristics of a good distance, error floor does not appear. Furthermore it is possible to processes full parallel processing. However, it is very difficult to high speed decoding because of a large block size and number of many iterations. This paper present HSS algorithm to reduce the iteration numbers without performance degradation. In the flooding scheme, the decoder waits until all the check-to-variable messages are updated at all parity check nodes before computing the variable metric and updating the variable-to-check messages. The HSS algorithm is to update the variable metric on a check by check basis in the same way as one code draws benefit from the other. Eventually, LDPC decoding speed based on HSS algorithm improved 30% ~50% compared to conventional one without performance degradation.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2015.05a
• /
• pp.54-56
• /
• 2015

In this paper, we investigate a physical-layer network coding (PNC) in a two-way relay channel (TWRC) where two sources send and receive data with each other by help of a relay node with multiple antennas. We focus on the multiple-access phase of the TWRC in this paper. It is assumed that the source nodes do not know the wireless channel and the wireless channel independently varies in time, that is, fast fading environments. At the relay node, the channel is assumed to be perfectly known. The relay node utilizes the channel sate information and applies maximum likelihood ratio for detecting received signals. Through extensive simulations, it is shown that a bit error rate (BER) performance becomes improved as the number of antennas at the relay node increases.

• Composites Research
• /
• v.15 no.6
• /
• pp.1-7
• /
• 2002

In VARTM process where a sacrificial medium is used to facilitate the resin flow, the velocity of resin varies drastically between the sacrificial medium and the fiber preform. Although the thickness-to-length ratio of a VARTM product is usually small, a 3-D analysis is prerequisite to analyze the lead-lag flow in the two different media. The problem associated with the full 3-D analysis is the CPU time. A full 3-D numerical mesh comprising large number of nodes requires an impractical CPU time on average computer platforms. In this study, a dual-scale analysis technique was developed. The flow analysis for the entire calculation domain was conducted in 2.5-D, and the 3-D analysis was performed for a small area of special concern. In some numerical examples, the local 3-D analysis could discover an eccentric flow pattern as well as the lead-lag flow that will inevitably be neglected in 2.5-D simulations. The global-local analysis technique practiced in this study can be used to analyze the intricate flow of resin through non-uniform media in affordable CPU times.

• Journal of KIISE:Information Networking
• /
• v.32 no.1
• /
• pp.34-50
• /
• 2005

Recently, various proposals for supporting network mobility, which provides efficient Internet access when a network formed within a vehicle moves around as a unit, have emerged. The schemes in those proposals, though, manifest some major drawbacks with respect to scalability: If the number of mobile nodes within a mobile network is large, the handoff latency would increase greatly, causing communication disruption; Data delivery to a node within a nested mobile network nay suffer extremely inefficient pinball routing. We propose a scalable network mobility supporting mechanism named SNEMOS (Scalable NEtwork Mobility Support), which resolves the above two major problems of the existing schemes. The performance of SNEMOS is compared with the existing schemes through extensive simulations. The numerical results show that SNEMOS outperforms the existing schemes with respect to handoff latency hop counts of routing paths, packet delivery time, header overhead in data packets, and signaling overhead.

• Journal of the Korea Society of Computer and Information
• /
• v.13 no.4
• /
• pp.127-132
• /
• 2008

Wireless sensor network technologies applicable to various industrial fields are rapidly growing. Because it is difficult to change a battery for the once distributed wireless sensor network, energy efficient design is very critical. In order to achieve this purpose in network design, a number of studies have been examining the energy efficient routing protocol. The sensor network consumes energy in proportion to the distance of data transmission and the data to send. Cluster-based routing Protocols such as LEACH-C achieve energy efficiency through minimizing the distance of data transmission. In LEACH-C, however, the total distance between the nodes consisting the clusters are considered important in constructing clustering. This paper examines the cluster-head-selection-algorithm that reflect the distance between the base station and the cluster-head having a big influence on energy consumption. The Proposed method in this paper brought the result that the performance improved average $4{\sim}7%$ when LEACH-C and the base station are located beyond a certain distance. This result showed that the distance between cluster-head and the base station had a substantial influence on lifetime performance in the cluster-based routing protocol.

• 전자공학회논문지 IE
• /
• v.48 no.2
• /
• pp.61-70
• /
• 2011

IEEE 802.11 wireless network supports control frames like RTS/CTS(Request To Send / Clear To Send). Because they is defend to frame collection problems. It helps to solve the frame collection problem but decreases the throughput rate. Also, control frame makes False Node Problem. This problem is makes to other wireless nodes don't work and don't find channels in the same cell and near cells. We proposed a reformed new control frame for efficiency throughput rate and solution of False Node Problem. New control frame is to have added to 4 bytes of channel detection ability at the RTS frames. Channel detection ability supported to check channel at the wireless node start to transmit data frame, We expect that channel detection ability make prevent False Node Problem for increase to access number to channel. We perform comparative analysis in terms of delay(sec) and load(bits/sec) with reform RTS/CTS method which proves the efficiency of the proposed method.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37 no.4B
• /
• pp.219-226
• /
• 2012

In wireless sensor networks (WSNs), location-based multicast routing (LMR) technique can increase the network life time and the channel capacity by reducing the number of duplicated data transmissions and control messages. However, previous LMR techniques can suffer from significant performance degradation due to concrete walls or other interfering objects deployed in the real environment, since they transmit the packets by using only the locations of the sensor nodes. To solve this problem, we propose an interference-aware location based multicast algorithm for WSNs. In the proposed algorithm, each node adjusts the energy cost for each link adaptively considering the interference effect and uses it for multicast decision in order to minimize the interference impact. Experimental results show that the proposed algorithm improves the delivery and energy performance when the network is affected by interference.

• Journal of KIISE:Computing Practices and Letters
• /
• v.16 no.3
• /
• pp.331-335
• /
• 2010

Previous low-energy time synchronization methods have mainly focused on reducing the number of transmission or reception packets. However, this paper proposes a method that reduces the percentage of time a node has to be awake (the duty cycle), assuming that a periodic sleep-wake cycle is used to conserve energy. Based on our experience with actual WSN devices, a system model is proposed, and the potential performance of the proposed method, with different parameter values, is analyzed. To further demonstrate the feasibility of our method, experiments were conducted using nine WSN devices in a $3{\times}3$ grid network topology. The results show the average synchronization error is 107.57 $\mu{s}$ in duty cycle 5% and synchronization period 10 sec, and 130 $\mu{s}$ in duty cycle 2.5% and synchronization period 20 sec.

• KIPS Transactions on Computer and Communication Systems
• /
• v.8 no.3
• /
• pp.73-78
• /
• 2019

Due to frequent topology changes in wireless networks, inter-node link disconnection and path re-establishment occur, causing problems such as overloading control messages in the network. In this paper, to solve the problems such as link disconnection and control message overload, we perform path setup in three steps of the neighbor node discovery process, the route discovery process, and the route management process in the wireless network environment. The link stability value is calculated using the information of the routing table. Then, when the zone master monitors the calculated link value and becomes less than the threshold value, it predicts the link disconnection and performs the path reset to the corresponding transmitting and receiving node. The proposed scheme shows a performance improvement over the existing OLSR protocol in terms of data throughput, average path setup time, and data throughput depending on the speed of the mobile node as the number of mobile nodes changes.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.16 no.1
• /
• pp.105-114
• /
• 2006

Ubiquitous Sensor Network consists of a number of sensor nodes with a limited computation power and limited communication capabilities, and a sensor node is able to communicate with each other at anytime and in any place. Due to the rapid research and development in sensor networks, it will rapidly grow into environments where hmm beings can interact in an intuitive way with sensing objects which can be PDAs, sensors, or even clothes in the future. We are aiming at realizing an Unattended Secure Security System to apply it to Ubiquitous Sensor Network. In this paper, the vulnerabilities in the Unattended security system are identified, and a new protocol called OMAC-SNEP is proposed for the Unattended Secure Security System. Because the CBC-MAC in SNEP is not secure unless the message length is fixed, the CBC-MAC in SNEP was replaced with OMAC in SNEP. We have shown that the proposed protocol is secure for my bit length of messages and is almost as efficient as the CBC-MAC with only one key. OMAC-SNEP can be used not only in Unattended Security System, but also any other Sensor Networks.