• Journal of information and communication convergence engineering
• /
• v.10 no.4
• /
• pp.329-336
• /
• 2012

For designing broadcast protocols in mobile ad hoc networks (MANETs), one of the important goals is to reduce the rebroadcast packets redundancy while reaching all the nodes in network. In this paper, we propose a probabilistic broadcasting mechanism based on selfishness and additional coverage in MANETs. Our approach dynamically adjusts the rebroadcast probability according to the extra covered area and number of neighbor nodes. By these two factors, mobile hosts can be classified into three groups: normal, low selfishness, and high selfishness groups. The nodes in the normal group forward packets for other nodes with high probability, whereas the nodes in the low selfishness group rebroadcast packets with low probability and the nodes in the high selfishness group do not rebroadcast packets. We compared our approach with simple flooding and the fixed probabilistic approach. The simulation results show that the proposed schemes can significantly reduce the number of retransmissions by up to 40% compared simple flooding and fixed probabilistic scheme without significant reduction in the network reachability and end-to-end packet delay.

• 제어로봇시스템학회:학술대회논문집
• /
• 1991.10a
• /
• pp.726-729
• /
• 1991

In this paper it is discussed about the program which makes automatically the preprocessing data on the graphic editor of PC monitor. Three kinds of colors are used in order to make know a boundary_element, in_element, out_element. By initial mesh generation, three kinds of elements are made; the element with three nodes, four nodes, five nodes. The node of boundary element draw a vertical line to the boundary. At that time the element with three nodes is removed and the element with four nodes is changed to the element with four nodes. The domain graphic on this paper is compose of piecewise curves which has many lines and a hole. The data of element is written on the memory of PC computer. The program controls the memory address according to the change of element's quantity; disappearance and addition of element. All this work is operated on the PC computer.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.30 no.12 s.255
• /
• pp.1626-1633
• /
• 2006

In the present paper, in the context of the meshless interpolation of a moving least squares (MLS) type, a novel method which uses primary and secondary nodes in the domain and on the global boundary is introduced, in order to improve the accuracy of solution. The secondary nodes can be placed at any location where one needs to obtain a better resolution. The support domains for the shape functions in the MLS approximation are defined from the primary nodes, and the secondary nodes use the same support domains. The shape functions based on the MLS approximation, in an integration domain, have a single type of a rational function, which reduces the difficulty of numerical integration to evaluate the weak form. The present method is very useful in an adaptive calculation, because the secondary nodes can be easily added and moved without an additional mesh. Several numerical examples are presented to illustrate the effectiveness of the present method.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.9
• /
• pp.3468-3495
• /
• 2015

In this paper, we present a multi-chain based hierarchical topology control algorithm (MCHTC) for wireless sensor networks. In this algorithm, the topology control process using static clustering is divided into sensing layer that is composed by sensor nodes and multi-hop data forwarding layer that is composed by leader nodes. The communication cost and residual energy of nodes are considered to organize nodes into a chain in each cluster, and leader nodes form a tree topology. Leader nodes are elected based on the residual energy and distance between themselves and the base station. Analysis and simulation results show that MCHTC outperforms LEACH, PEGASIS and IEEPB in terms of network lifetime, energy consumption and network energy balance.

• Journal of Communications and Networks
• /
• v.13 no.4
• /
• pp.377-384
• /
• 2011

Cooperative beamforming has previously been proven to be an efficient way to improve the cooperative diversity. This method generally requires all relay nodes to participate in beamforming, which can be seen as "all participate" cooperative beamforming. However, not all relay nodes have constructive impacts on the end-to-end bit error rate (BER) performance. Based on this observation, we propose a new cooperative scheme which only selects those "appropriate" relay nodes to perform cooperative beamforming. Such relay nodes can be simply determined with mean channel gains. Therefore, the selection complexity is significantly reduced as global instantaneous channel state information is not required. This scheme guarantees that energy is only allocated to the "appropriate" relay nodes, and hence provides superior diversity. We also prove that power allocation among source and selected relay nodes is a convex problem, and can be resolved with lower computational complexity. Simulation results demonstrate that our scheme achieves an essential improvement in terms of BER performance for both optimal and limited feedback scenarios, as well as high energy-efficiency for the energy-constrained networks.

• Journal of the Korea Society of Computer and Information
• /
• v.22 no.5
• /
• pp.81-88
• /
• 2017

Solar-powered wireless sensor nodes can use extra energy to obtain additional data to increase the precision. However, if the amount of data sensed is increased indiscriminately, the overhead of relay nodes may increase, and their energy may be exhausted. In this paper, we introduce a sensing and compression rate selection scheme to increase the amount of data obtained while preventing energy exhaustion. In this scheme, the neighbor nodes of the sink node determine the limit of data to be transmitted according to the allocated energy and their descendant nodes, and the other nodes select a compression algorithm appropriate to the allocated energy and the limitation of data to be transmitted. A simulation result verifies that the proposed scheme gathers more data with a lower number of blackout nodes than other schemes. We also found that it adapts better to changes in node density and the amount of energy harvested.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.9B
• /
• pp.1775-1784
• /
• 1999

This paper proposes a method of removing unnecessary hidden nodes by a new cost function that evaluates the variance and the mean of hidden node outputs during training. The proposed cost function makes necessary hidden nodes be activated and unnecessary hidden nodes be constants. We can remove the constant hidden nodes without performance degradation. Using the CEDAR handwritten digit recognition, we have shown that the proposed method can remove the number of hidden nodes up to 37.2%, with higher recognition rate and shorter learning time.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.13 no.4
• /
• pp.115-123
• /
• 2017

The mutual cooperation among nodes is very important because mobile nodes participating in MANET communicate with limited resources and wireless environment. This characteristic is important especially in environment that supports group communication. In order to support the secure multicast environment, it is important enough to affect performance to provide accurate authentication method for multicast group members and increase the integrity of transmitted data. Therefore, we propose a technique to provide the multicast secure communication by providing efficient authentication and group key management for multicast member nodes in this paper. The cluster structure is used for authentication of nodes in the proposed technique. In order to efficient authentication of nodes, the reliability is measured using a combination of local trust information and global trust information measured by neighboring nodes. And issuing process of the group key has two steps. The issued security group key increases the integrity of the transmitted data. The superiority of the proposed technique was confirmed by comparative experiments.

• Journal of Plant Biotechnology
• /
• v.35 no.2
• /
• pp.127-132
• /
• 2008

In bioreactor cultures of plants, inoculum density is an important factor affecting growth and proliferation of the plantlets. To maximize shoot growth and proliferation of grape rootstock '5BB' in bioreactors, inoculum density varied at 15, 30, 45 and 60 single nodes in a 3-liter scale balloon type bioreactor, respectively and cultured for 40 days. Results suggested that the growth and the photosynthesis of the plantlet were greatly affected by inoculum density in the bioreactor. The inoculum density of 45 nodes resulted in the greatest growth (910.4 mg/shoot FW, 764.4 mg/root FW) followed by 30 nodes. $CO_2$ assimilation rate, stomatal conductance, transpiration rate of the plantlet were also highest at the inoculum density of 45 nodes. Significant reduces in shoot and root growth (426.5 mg/shoot FW, 248.4 mg/root FW) were observed at the inoculum density of 60 nodes. When the inoculum density decreased by 15 nodes, plantlets were malformed due to hyperhydricity, resulting in the highest transpiration rate and the lowest $CO_2$ assimilation rate. The plantlets stressed by the inoculum density at 15 nodes and 60 nodes showed larger number and irregular shape of stomata compared to the plantlets inoculated with 45 nodes.

• Fashion & Textile Research Journal
• /
• v.10 no.5
• /
• pp.660-667
• /
• 2008

The purpose of this study was to modify a Flared Skirt for women according to the somatotype of lower body. The subjects for the wear test were 3 students, who were in $mean{\pm}1{\sigma}$ each somatotype. The results of this study are as follows: First, the Flared Skirt pattern was modified according to each type. The front waist line rising measurement proposed for type 1 and type 2 were 0.5cm, because of lower front silhouette with waist shape. The back waist line rising measurement proposed for type 2 was 1cm and type 3 was 0.5cm, because of lower back shape with hip. Second, the wave-height of nodes were regular at front and back in type 1. Also, the wave-height of nodes were evenly distributed side and center. The variation ratio of wave-height of back nodes were lower than existing pattern in type 2 and type 3. It means the variation ratio of wave-height of back nodes were regular in modification pattern. Altogether, modification patterns were more regular and lower than existing pattern in the number of nodes, the distribution ratio of nodes, the wave-height of node, the variation ratio of wave height of nodes.