• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2008.10a
• /
• pp.846-849
• /
• 2008

In recent years there has been growing interest in wireless sensor networks (WSNs) for a variety of indoor applications. In this paper, we present the RSSI-based localization in indoor environments. In order to evaluate the relationship between distance and RSSI, the log-normal path loss shadowing model is used. By tagging users with a sensor node and deploying a number of nodes at fixed position in the building, the RSSI can be used to determine the position of tagged user. This system operates by recording and processing signal strength information at the base stations. It combines Euclidean distance technique with signal strength matrix obtained during real-time measurement to determine the location of user. The experimental results presented the ability of this system to estimate user's location with a accuracy.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.18 no.4
• /
• pp.579-586
• /
• 2023

A wireless sensor network (WSN) has limited battery power because it is used wirelessly using low-cost small sensors. Since the battery cannot be replaced, the lifespan of the sensor node is directly related to the lifespan of the battery, so power must be used efficiently to maximize the lifespan of the network. In this study, based on PEGASIS, a representative energy-efficient routing protocol, we propose a protocol that classifies layers according to the distance from the sink node and configures multiple chains rather than one chain. The proposed protocol can increase network lifespan by reducing the transmission distance between nodes to prevent unnecessary energy consumption.

• Journal of the Korea Society of Computer and Information
• /
• v.15 no.12
• /
• pp.75-84
• /
• 2010

As broadcasting in Mobile Ad hoc NETwork (MANET) is the process that a node sends a packet to all other nodes in the network. it is used for routing protocols such as Ad hoc On demand Distance Vector (AODV) to disseminate control information for establishing the routes. In this paper, we propose Probabilistic Broadcasting mechanism based on Distance Ratio between sender and receive node in MANETs. The proposed approach is based on the combination of probability and distance based approach. A mobile node receiving broadcast packets determines the probability of rebroadcasting considering distance ratio from sender. The distance ratio of a node is calculated by the distance from sender and the length of radio field strength. As a node with high distance ratio is located far away from sender, rebroadcast probability is set to high value. On contrary, the low rebroadcast probability is set for a node with low distance ratio which is close to sender. So it reduces packets transmission caused by the early die-out of rebroadcast packets. Compared with the simple flooding and fixed probabilistic flooding by simulation, our approach shows better performances results. Proposed algorithm can reduce the rebroadcast packet delivery more than 30% without scanting reachability, where as it shows up to 96% reachability compared with flooding.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.20 no.2
• /
• pp.763-772
• /
• 2019

Recently, there is a great expectation for the sustainable effect of TOD and apply it to urban planning and design. However, there are few research on the quantitative evaluation method of the effect. The purpose of this study is to propose a quantitative way to assess the effectiveness of TOD(Transit Oriented Development)'s vehicle traffic reduction in the urban planning phase, based on the land-use plan. Firstly, it proposes a method to convert the information contained in the land-use plan into a network and secondly a method to estimate the travel distance based on the network. In the first phase, the roads in the land-use plan are converted into links and the intersection of the roads into nodes. The area and the height of the zones included in the land-use plan are converted into the weights on adjacent nodes. The second phase assumes the frequency at which travel occurs between nodes on the network is relative to the weights and estimates the travel distance by dividing it into a pedestrian and a vehicle. Then, taking the city without TOD as the object, through comparison present city and alternatively redesigned city to the analysis of TOD effect. In this study, the application of these methods to Bundang as of 1997 and alternatively redesigned Bundang showed that about 39.94 percent of the vehicle traffic reduction effects occurred. Furthermore, the pedestrian traffic ratio of alternatively redesigned Bundang increased to 2.39%.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.3A
• /
• pp.443-450
• /
• 2000

Although designing a virtual topology for all-optical WDM wide-area networks has been extensively studied and several algorithms have been proposed, these algorithms assumed error-free communication between two nodes. However, noises from optical amplifiers and optical cross-connects can degraded the signal, resulting in a nonzero bit-error rate. In this paper, we investigate the effect of physical limitations on the virtual topology design. We show that for side-area all-optical networks where transmission distance is fairly long, virtual topology design algorithm that can determine the locations of opto-electronic(OE) and electro-optic(EO) conversions to set up a connection request with a high BER in a multihop manner.

• Proceedings of the Computational Structural Engineering Institute Conference
• /
• 2008.04a
• /
• pp.8-13
• /
• 2008

In this study, an adaptive node generation procedure in the radial point interpolation method is proposed. Since we set the initial configuration of nodes by subdivision of background cell, abrupt changes of inter-nodal distance between higher and lower error regions are unavoidable. This unpreferable nodal spacing induces additional errors. To obtain the smoothy nodal configuration, it's regenerated by local Delaunay triangulation algorithm This technique was originally developed to generate a set of well-shaped triangles and tetrahedra. To demonstrate the performance of proposed scheme, the results of making optimal nodal configuration with adaptive refinement method are investigated for stress concentration problems.

• Journal of Environmental Science International
• /
• v.17 no.1
• /
• pp.77-83
• /
• 2008

The purpose of this study was to develop the national park visitor counting system using the ubiquitous sensor network. This system is composed of a sensor node, sink node, gateways, CDMA module, server, and clients. The results of the study were: 1) stable data transmission distance was possible within 100 meters between sensor nodes, 2) the developed counting sensor system showed a network communication stability level of 88.3 percent in 1.2m wide trails. When installed in concentrate use areas or forks of national parks, the visitor counting system will not only contribute to provide reliable visitor counting, but also to improve the quality of national park visitor service, to manage park facilities and natural resources more efficiently, to achieve an information oriented national park system.

• Journal of Korean Institute of Industrial Engineers
• /
• v.19 no.3
• /
• pp.37-49
• /
• 1993

In this paper, the TSP(traveling salesman problem) which its costs(distance) between nodes are defined with Max($\bar{x}$, $\bar{y}$) has been dealt. In order to find a satisfactory solution for this kind of problem, we generate weighted matrix, and then develope a new heuristic problem solving method using the weighted matrix. Also we analyze the effectiveness of the newly developed heuristic method comparing it with other heuristic algorithm already exists for Euclidean TSP. Finally, we apply a new developed algorithm to real Max($\bar{x}$,$\bar{y}$) TSP such as PCB inserting.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.26 no.2
• /
• pp.47-58
• /
• 2001

The purpose of this study is to present methods for determining the k most vital arcs (k-MVAs) in shortest path problem (SPP) using evolutionary algorithms. The problem of finding the k-MVAs in SPP is to find a set of k arcs whose simultaneous removal from the network causes the greatest increase in the shortest distance between two specified nodes. Generally, the problem of determining the k-MVAs in SPP has been known as NP-hard. Therefore, to deal with problems of the real world, heuristic algorithms are needed. In this study we present three kinds of evolutionary algorithms for finding the k-MVAs in SPP, and then to evaluate the performance of proposed algorithms.

• Magazine of the Korean Society of Agricultural Engineers
• /
• v.43 no.2
• /
• pp.112-121
• /
• 2001

In this study, a spatial location-allocation model of center villages (SLAMCV) was developed for selecting spatial center villages and allocating their rear villages. In SLAMCV, rural space was considered as a network with villages for nodes and roads for connecting lines. For quantification of residents’ accessibilities in the network, a disutility index (DUI) was developed and used, which is dependent upon travelling distance between the center and its hinter villages, design vehicle speed in connecting road and population of hinter villages. SLAMCV was verified to Christaller’s hexagonal hierachical settlement system to test the theoretical reasonability and computing algorithm of the model.