• Journal of the Korea Society of Computer and Information
• /
• v.14 no.1
• /
• pp.107-115
• /
• 2009

The cryptological key which is used in WiMAX environment is used at regular intervals by mobile nodes (laptop computer, PDA, cell-phone) which is in the range of base station coverage. But it is very weak at local attack like man-in-the-middle when the mobile node is off the range of base station or enters into the range to communicate with base station because the communication section is activated wirelessly. This paper proposes a distribution key building protocol which can reuse security key used by nodes to reduce cryptological security attack danger and communication overhead which occurs when mobile node tries to communicate with base station. The proposed distribution key establishing protocol can reduce overhead which occurs between base station and mobile node through key reusing which occurs during the communication process and also, makes security better than IEEE 802.16 standard by creating shared key which is required for inter-certification through the random number which node itself creates.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.44 no.10
• /
• pp.37-46
• /
• 2007

In wireless sensor networks, one of the most important goals of designing protocols is to extend the network lifetime. A node has lots of duplication in sensing and communication range with surrounding nodes after many of nodes are randomly scattered. Such a heavy duplication overhead affects on the network lifetime seriously so usually all nodes need not activated constantly to carry out sensing and communication operation. One of the optimal methods of prolonging the network lifetime is finding the number of surrounding nodes necessary to maintain the network coverage and connectivity. It has been studied till the current date in wireless networks. If the neighbor necessary can be acquired to satisfy the probability using the ideal number of neighbors necessary and the acquired number of neighbors m to guarantee network coverage and connectivity. We use the result that F. Xue et al and S. Song et al derive previously in finding the neighbor necessary to guarantee the network connectivity and cany out the computer simulation to verify the necessary number. We present that our scheme satisfy the network coverage and connectivity. We present the simulation results compared with constant probability scheme through computer simulation.

• KOREAN JOURNAL OF CROP SCIENCE
• /
• v.53 no.2
• /
• pp.196-202
• /
• 2008

To establish a cultivation system of Sedum sarmentosum using a rice nursery tray ($30{\times}60{\times}3\;cm$) in non-heating plastic film house, cuttings of two local strains (Wanju and Keumsan) were prepared and planted at different planting densities (40, 60 and 80 cuttings per tray) on September 7th, and subsequent growth and yield at pre- and post-winter season were investigated. When pre-wintering growth were measured at 60 days after planting, high planting density (80 cuttings/tray) decreased leaf length and lateral shoot number per plant compared to 40 cuttings/tray. When post-wintering growth were measured on April 20th, no significant growth differences as affected by planting density were observed in Keumsan strain, while decreased stem diameter, node number and leaf number were observed in Wanju strain planted at 80 cuttings/tray compared to 40 cuttings/tray. Fresh and dry weights were not significantly different as affected by planting density, but those were significantly increased in Wanju strain compared to Keumsan strain. When regrowth characteristics followed by the first harvest were measured on June 5th, significantly increased stem number was observed at 80 cuttings/tray compared to 40 cuttings/ tray. Fresh and dry weight were significantly increased in Keumsan strain planted at 80 cuttings/tray compared to 40 cuttings/tray, and dry weight were increased in Wanju strain compared to Keumsan strain. Wanju strain showed higher shoot yield, thicker stem, shorter node and larger leaf, and non-succulent stem under high planting density compared to Keumsan strain. Accordingly, the optimum density was 40 cuttings per tray, and Wanju strain was adequate for the cultivation system using a rice nursery tray.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.12 no.2
• /
• pp.775-782
• /
• 2011

This study was designed to clarify the morphometrical change of lymph node, deep cortex and lymph follicles in draining lymph nodes of young mice in response to local injection of lipopolysaccharide(LPS). 1. In the group stimulated with LPS, aged 0 day and 3 days, the number of lymph follicles were not significantly different from those of control group. 2. In the group two to four weeks after injection with LPS, aged five days and one week, the number of lymph follicles were significantly increased from those of control group. 3. In the group one to four weeks after injection with LPS, aged 0 day, three days, five days and one week, the area of lymph node and deep cortex increased about 1.5-3 times more than that of the control group. 4. In the group two to four weeks after injection with LPS, aged three days, five days and one week, the lymph follicles(the area: larger than 0.1 mm2) were increased from those of control group. 5. In the group two to four weeks after injection with LPS, aged five days and one week, the lymph follicles(the area: smaller than 0.01 mm2) were increased from those of control group. In view of these experimental findings, the formation of lymph follicles were induced by LPS stimulation from 5 days to one week after birth. The newley formed lymph follicles area in response to LPS may be less than $0.01mm^2$.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.12 no.3
• /
• pp.99-114
• /
• 2012

Proxy Mobile IPv6 (PMIPv6) has received considerable attention between telecommunications and the Internet communities and does not require active participation of the Mobile Node (MN) by way of network-based mobility management. The PMIPv6 domain is studying establishment in progress to support extensively a number of MN by using a low handover latency. In this research, we are propose a novel 3S scheme for building Scalable and Secure and Seamless PMIPv6 domains. In the proposed scheme, all of Mobility Access Gateway (MAG) are acting as the Local Mobility Anchor (LMA) and composing a virtual ring with another MAG. General hashing is used in the efficient distribution-mapping between each MN and the MN's LMA of all MAGs. And, MAG and MN are authenticated using the symmetric key. Through mathematical analysis, we verifies the safety, scalability, and seamless service for 3S. Also, we're propose a handover procedure of 3S and show better than the existing schemes in terms of handover latency.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.11A
• /
• pp.1173-1181
• /
• 2007

A number of routing algorithms have been studied for wireless mobile ad-hoc network. Among them, the AODV routing algorithm with on-demand method periodically transmits hello message and monitors link state during data transmission in order to maintain routing paths. When a path is disconnected, a node that senses it transmits a RERR packet to the transmitting node or transmits a RREQ locally so that the path could be repaired. With that, the control packet such as a RREQ is broadcast, which causes the consumption of bandwidth and incurs data latency. This paper proposes a LRRLBP algorithm that locally repairs a path by predicting link state before disconnecting the path based on the AODV routing protocol for solving such problems. Intensive simulations with the results using NS-2 simulator are shown for verifying the proposed protocol.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.14 no.12
• /
• pp.2783-2790
• /
• 2010

In this paper, we first review LDPC codes in general and a belief propagation algorithm that works in logarithm domain. LDPC codes, which is chosen 802.11n for wireless local access network(WLAN) standard, require a large number of computation due to large size of coded block and iteration. Therefore, we presented three kinds of low computational algorithms for LDPC codes. First, sequential decoding with partial group is proposed. It has the same H/W complexity, and fewer number of iterations are required with the same performance in comparison with conventional decoder algorithm. Secondly, we have apply early stop algorithm. This method reduces number of unnecessary iterations. Third, early detection method for reducing the computational complexity is proposed. Using a confidence criterion, some bit nodes and check node edges are detected early on during decoding. Through the simulation, we knew that the iteration number are reduced by half using subset algorithm and early stop algorithm is reduced more than one iteration and computational complexity of early detected method is about 30% offs in case of check node update, 94% offs in case of check node update compared to conventional scheme. The LDPC decoder have been implemented in Xilinx System Generator and targeted to a Xilinx Virtx5-xc5vlx155t FPGA. When three algorithms are used, amount of device is about 45% off and the decoding speed is about two times faster than convectional scheme.

• Journal of Korea Multimedia Society
• /
• v.21 no.6
• /
• pp.667-677
• /
• 2018

Since sensor networks consist of sensor nodes with limited energy resources, so efficient energy use of sensor nodes is very important in the design of sensor networks. Sensor nodes consume a lot of energy for data transmission. Clustering technique is used to efficiently use energy in data transmission. Recently, mobile sink techniques have been proposed to reduce the energy load concentrated on the cluster header near a sink node. The CMS(Cluster-based Mobile sink) technique minimizes the generation of control messages by creating a data transmission path while creating clusters, and supports the inter-cluster one-hop transmission. But, there is a case where there is no connectivity between neighbor clusters, it causes a problem of having a long hop data transmission path regardless of local distance. In this paper, we propose a SCBC(Strong connection balancing cluster) to support the path of the minimum number of hops. The proposed scheme minimizes the number of hops in the data transmission path and supports efficient use of energy in the cluster header. This also minimizes a number of hops in data transmission paths even when the sink moves and establishes a new path, and it supports the effect of extending the life cycle of the entire sensor network.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.2
• /
• pp.901-923
• /
• 2017

Efficient key distribution and management mechanisms as well as lightweight ciphers are the main pillar for establishing secure wireless sensor networks (WSN). Several symmetric based key distribution protocols are already proposed, but most of them are not scalable, yet vulnerable to a small number of compromised nodes. In this paper, we propose an efficient and scalable key management and distribution framework, named KMMR, for large scale WSNs. The KMMR contributions are three fold. First, it performs lightweight local processes orchestrated into upward and downward tiers. Second, it limits the impact of compromised nodes to only local links. Third, KMMR performs efficient secure node addition and revocation. The security analysis shows that KMMR withstands several known attacks. We implemented KMMR using the NesC language and experimented on Telosb motes. Performance evaluation using the TOSSIM simulator shows that KMMR is scalable, provides an excellent key connectivity and allows a good resilience, yet it ensures both forward and backward secrecy. For a WSN comprising 961 sensor nodes monitoring a 60 hectares agriculture field, KMMR requires around 2.5 seconds to distribute all necessary keys, and attains a key connectivity above 96% and a resilience approaching 100%. Quantitative comparisons to earlier work show that KMMR is more efficient in terms of computational complexity, required storage space and communication overhead.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.14 no.4
• /
• pp.1562-1578
• /
• 2020

Vector data compression algorithm can meet requirements of different levels and scales by reducing the data amount of vector graphics, so as to reduce the transmission, processing time and storage overhead of data. In view of the fact that large threshold leading to comparatively large error in Douglas-Peucker vector data compression algorithm, which has difficulty in maintaining the uncertainty of shape features and threshold selection, a segmented Douglas-Peucker algorithm based on node importance is proposed. Firstly, the algorithm uses the vertical chord ratio as the main feature to detect and extract the critical points with large contribution to the shape of the curve, so as to ensure its basic shape. Then, combined with the radial distance constraint, it selects the maximum point as the critical point, and introduces the threshold related to the scale to merge and adjust the critical points, so as to realize local feature extraction between two critical points to meet the requirements in accuracy. Finally, through a large number of different vector data sets, the improved algorithm is analyzed and evaluated from qualitative and quantitative aspects. Experimental results indicate that the improved vector data compression algorithm is better than Douglas-Peucker algorithm in shape retention, compression error, results simplification and time efficiency.