• The KIPS Transactions:PartC
• /
• v.15C no.3
• /
• pp.213-220
• /
• 2008

A MANET is an autonomous, infrastructureless system that consists of mobile nodes. In MANET, on-demand routing protocols are usually used because network topology changes frequently. The current approach in case of broken routes is to flag an error and re-initiate route discovery either at the source or at the intermediate node. Repairing these broken links is a costly affair in terms of routing overhead and delay involved. Therefore, this paper propose a NAODV(Neighbor-aware AODV) protocol that stands on the basis of an AODV. It sets up the route rapidly if it operates for setting the route directly by using sequence number of neighbor nodes without re-search the route when the route to destination node is broken. Also, it reduces loss of packets. We use NS-2 for the computer simulation and validate that the proposed scheme is better than general AODV in terms of packet delivery ratio and average end-to-end delay. Also, when the proposed protocol is applied to the large ad-hoc network with multiple nodes, the performance is more efficient.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.10 no.2
• /
• pp.184-191
• /
• 2017

This paper presents cluster based hybrid spectrum sensing system for M2M services. For each cluster, secondary nodes within the transmission radius of the primary node use hard decision method through local spectrum sensing to determine whether the primary node exists. And the other secondary nodes and the secondary nodes having poor radio channel conditions judge the existence of the primary node through the soft decision method of the values obtained by performing the cooperative spectrum sensing. In the proposed hybrid spectrum sensing system, the performance according to the number of secondary nodes is analyzed with the conventional system over Rayleigh fading channel. As the number of cooperative sensing users increased to 2, 3 and 4, the cluster error probability decreased to 0.5608, 0.5252 and 0.4001 at SNR of -10[dB] respectively. Since the proposed system uses less overhead traffic, it is found that it is more effective in terms of frequency usage than the conventional system using soft decision-soft decision and soft decision-hard decision methods.

• The KIPS Transactions:PartC
• /
• v.16C no.2
• /
• pp.245-256
• /
• 2009

Pastry overlay network is one of structured P2Ps using DHT(Distributed Hash Table). To reduce the number of messages among nodes, Rosary and LAR have been proposed by exploiting spatial locality and caching, respectively, in the Pastry. Rosary consists of Inter-Pastry and Intra-Pastry. A root node is assigned as a representative in each Intra-Pastry and it has the responsibility of Inter-Pastry and Intra-Pastry routing. Therefore, Rosary has several disadvantages; 1) low fault tolerance in case of root node failure 2) routing hop count increases because of the use of root nodes compared to the existing structured P2Ps, and 3) the communication load is concentrated in some specific areas. LAR has inefficient problems in that caching is not distributed among nodes in Intra-Pastry and caching is used by only nodes in the Intra-Pastry. In this paper, we propose an improved Pastry called Doughnut to overcome the above problems of Rosary and LAR. By dividing nodes with the local characteristics, the Doughnut consists of Inter-Pastry and Intra-Pastry, and all nodes have the responsibility of Inter-Pastry and Intra-Pastry routing. This results in that all nodes perform the role of the existing root node. This solves the problems of the reducing of fault-tolerance, the increasing of routing hop count, and the not-distributed communication load. Also Doughnut can use cache effectively because it guarantees the even cache distribution in local(Intra-Pastry) and the cache contents in local can be used in the other local. The proposed algorithm is implemented using simulator and the experimental results show the effectiveness of the proposed method compared to the existing method.

• IEMEK Journal of Embedded Systems and Applications
• /
• v.2 no.3
• /
• pp.138-144
• /
• 2007

Wireless Sensor Network(WSN) consists of a lot of light-weight sensor nodes with the capability of wireless communication. Studies have been done to improve stability and fault-tolerancy of WSN because the sensor nodes are basically vulnerable to the harsh environment. Specially, the time synchronization among sensor nodes becomes a challenging issue in WSN. All the local times should always keep the same with each other in the sensor field to perform data aggregation and energy-aware communication in WSN. In this paper, a new time synchronization technique is proposed to operate efficiently irrespective of the number of sensor nodes and the number of hops needed to cover all sensor nodes for synchronization. Simulation results show that the proposed technique has the lowest amount of packet traffic among the several time synchronization techniques.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.21 no.4
• /
• pp.893-910
• /
• 1996

Recently, there ary many researches on local area multichannel network as WDM technology developes. An ideal media access protocol in a multichannel network is one that shows short access delay under low load and high throughput under heavy load. This paper proposed a new media access protocol for WDM passive star coupler network. The proposed one is a random access rpotocol based on reservation. Access delay is short under low load by using random access method, and high throughput is achieved under heavy load by usin greservation access. Analytic model for the performance analysis of the proposed protocol is developed and performance of the proposed protocol is compared with the previous ones. The effect on the performance of the number of the nodes and channels, and the number of transceivers in each node are analyzed.

• ETRI Journal
• /
• v.29 no.5
• /
• pp.655-666
• /
• 2007

There are nodes and edges in a topological map. Node data has been used as a main source of information for the localization of mobile robots. In contrast, edge data is regarded as a minor source of information, and it has been used in an intuitive and heuristic way. However, edge data also can be used as a good source of information and provide a way to use edge data efficiently. For that purpose, we define a data format which describes the shape of an edge. This format is called local generalized Voronoi graph's angle (LGA). However, the LGA is constituted of too many samples; therefore, real time localization cannot be performed. To reduce the number of samples, we propose a compression method which utilizes wavelet transformation. This method abstracts the LGA by key factors using far fewer samples than the LGA. Experiments show that the LGA accurately describes the shape of the edges and that the key factors preserve most information of the LGA while reducing the number of samples.

• 한국정보통신설비학회:학술대회논문집
• /
• 2008.08a
• /
• pp.17-20
• /
• 2008

A clustering scheme for ad hoc networks is aimed at managing a number of mobile devices by utilizing hierarchical structure of the networks. In order to construct and maintain an effective hierarchical structure in ad hoc networks where mobile devices may move at high mobility, the following requirements must be satisfied. The role of each mobile device for the hierarchical structure is adaptive to dynamic change of the topology of the ad hoc networks. The role of each mobile device should thus change autonomously based on the local information. The overhead for management of the hierarchical structure is small. The number of mobile devices in each cluster should thus be almost equivalent. This paper proposes an adaptive multihop clustering scheme for highly mobile ad hoc networks. The results obtained by extensive simulation experiments show that the proposed scheme does not depend on mobility and node degree of mobile devices in the ad hoc network, which satisfy the above requirements.

• Transactions of the Korean Society for Noise and Vibration Engineering
• /
• v.18 no.6
• /
• pp.674-680
• /
• 2008

A new meshless method for obtaining natural frequencies of arbitrarily shaped plates with the free boundary condition is introduced in the paper. In order to improve the characteristics of convergence and accuracy of the method, a special local polar coordinates system is devised and located for each of nodes distributed along the boundary of the plate of interest. In addition, a new way of decreasing the size of the system matrix that gives natural frequencies of the plate is employed to reduce the amount of numerical calculations, which is needed for computing the determinant of the system matrix. Finally the excellence of the characteristics of convergence and accuracy of the method is shown in several case studies, which indicate that natural frequencies by the proposed method are very accurate and converged swiftly to exact values as the number of boundary nodes increases.

• Structural Engineering and Mechanics
• /
• v.12 no.5
• /
• pp.507-526
• /
• 2001

In standard finite element algorithms, the local stability conditions are not accounted for in the formulation of the tangent stiffness matrix. As a result, the loss of the local stability is not adequately related to the onset of the global instability. The phenomenon typically arises with material-type localizations, such as shear bands and plastic hinges. This paper addresses the problem in the context of the planar, finite-strain, rate-independent, materially non-linear beam theory, although the proposed technology is in principle not limited to beam structures. A weak formulation of Reissner's finite-strain beam theory is first presented, where the pseudocurvature of the deformed axis is the only unknown function. We further derive the local stability conditions for the large deformation case, and suggest various possible combinations of the interpolation and numerical integration schemes that trigger the simultaneous loss of the local and global instabilities of a statically determined beam. For practical applications, we advice on a procedure that uses a special numerical integration rule, where interpolation nodes and integration points are equal in number, but not in locations, except for the point of the local instability, where the interpolation node and the integration point coalesce. Provided that the point of instability is an end-point of the beam-a condition often met in engineering practice-the procedure simplifies substantially; one of such algorithms uses the combination of the Lagrangian interpolation and Lobatto's integration. The present paper uses the Galerkin finite element discretization, but a conceptually similar technology could be extended to other discretization methods.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.45 no.12
• /
• pp.120-127
• /
• 2008

HMIPv6 draws lots of attentions in recent years for providing an efficient handover and reducing the signaling overhead. HMIPv6 employs MAP(Mobility Anchor Point) in order to minimize a signaling overhead and a local mobility management. MAP completes an efficient mobility management in HMIPv6 network environment with frequent handover. However, HMIPv6 causes load concentration at a paricular MAP and may have unnecessary latency between HN(Mobile Node) and CN(Correspondent Node) within the same network. A MAP may also disturb the route optimization in HMIPv6 network because all packets must be transmitted through a MAP. In this paper, we propose a scheme to optimize the route in HMIPv6 networks according to MAP load. We configure a threshold in order to support the better service into MAP domain. The packets do not pass through MAP and are directly transmitted to AR(Access Router) if the number of current MNs attached to the MAP exceed the desired threshold. We simulate the performance of the proposed scheme and compare with HMIPv6. Resultly, the proposed scheme reduces signaling costs and mitigates concentration of a paticular MAP as well.