• Journal of Korea Multimedia Society
• /
• v.8 no.12
• /
• pp.1613-1622
• /
• 2005

Broadcasting is fundamental and effective data dissemination mechanism for route discovery, address resolution, and many other network services in mobile ad hoc networks. Although many approaches for broadcasting have been proposed to minimize the number of retransmissions, none of them guarantee the best-suited bounds of retransmissions. Appropriate use of probabilistic method can lower the chance of contention and collision among neighboring nodes, so that it reduces the number of rebroadcasts. In this paper, we propose a probabilistic approach that dynamically adjusts the rebroadcasting probability according to the distance between the sender and the receiver. While the rebroadcast probabilities of a mobile node close to sender will be set lower, the rebroadcast probabilities of a mobile node far away from sender wi1l be set to higher, The rebroadcast probability of a node wi1l be set according to the distance from sender. We evaluate the performance of proposed approach by comparing it with flooding as well as a fixed probabilistic broadcast approach. Simulation results showed that the performance of proposed scheme outperforms by about $70\%$ than flooding scheme and outperforms by about $20\%$ than fixed probabilistic scheme.

• Journal of Institute of Control, Robotics and Systems
• /
• v.14 no.6
• /
• pp.608-614
• /
• 2008

This paper describes a location tracking system to guide landing process of an Unmanned Helicopter(UMH) exploiting MIT Cricket nodes. For automatic landing of a UMH, a precise positioning system is indispensable. However, GPS(Global Positioning System) is inadequate for tracking the three dimensional position of a UMH because of large positioning errors. The Cricket systems use Time-Difference-of-Arrival(TDoA) method with ultrasonic and RF(Radio Frequency) signals to measure distances. They operate in passive mode in that a listener attached to a moving device receives distance signals from several beacons located at fixed points on ground. Inevitably, this passive type of implementation causes large disturbances in measuring distances between beacons and the listener due to wind blow from propeller and turbulence of UMH body. To cope with this problem, we proposed active type of implementation for positioning a UMH. In this implementation, a beacon is set up at UMH body and four listeners are located at ground area at least where the UMH will land. A pair of Ultrasonic and RF signals from the beacon arrives at several listeners to calculate the position of the UMH. The distance signals among listeners are synchronized with a counter value appended to each distance signals from the beacon.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.18 no.1
• /
• pp.41-47
• /
• 2008

Cluster based fuzzy model tree has certain drawbacks to decrease performance of testinB data when over-fitting of training data exists. To reduce the sensitivity of performance due to over-fitting problem, we proposed a modified cluster based fuzzy model tree with node information. To construct model tree, cluster centers are calculated by fuzzy clustering method using all input and output attributes in advance. And then, linear models are constructed at internal nodes with fuzzy membership values between centers and input attributes. In the prediction step, membership values are calculated by using fuzzy distance between input attributes and all centers that passing the nodes from root to leaf nodes. Finally, data prediction is performed by the weighted average method with the linear models and fuzzy membership values. To show the effectiveness of the proposed method, we have applied our method to various dataset. Under various experiments, our proposed method shows better performance than conventional cluster based fuzzy model tree.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.11 no.4
• /
• pp.846-851
• /
• 2007

The wireless sensor network is one of the most practical and cost-effective solutions for monitoring systems covering wild and wide area such as wildfire monitoring. However, the RF distance between sensor nodes is very short due to the need of low power consumption of the sensor node, so the number of sensor nodes to be deployed in the target area is more than tens of thousands. In this paper, we design and analyze the deployment issues as well as re-deployment problem occurred when the battery is exhausted. We also propose the needs and solutions for coverage problem in dynamic deployment. By the experimental evaluations, we analyze the packet success ratio between sensor nodes under various environments such as obstacles and variable distances.

• Journal of Advanced Marine Engineering and Technology
• /
• v.37 no.2
• /
• pp.220-226
• /
• 2013

Recently, with the rapid development of factory automation and logistics system, a few workers were able to manage the broad workplace such as large vessels and warehouse. To estimate the exact location of these workers in the conventional wireless indoor localization systems, three or more fixed nodes are generally used to recognize the location of a mobile node consisting of a single node. However, these methods are inefficient in terms of node deployment because the broad workplace requires a lot of fixed nodes compared to workers(mobile nodes). Therefore, to efficiently deploy fixed nodes in these environments that need a few workers, this paper presents a novel estimation algorithm which can reduce the number of fixed nodes by efficiently recognizing the relative coordinates of two fixed nodes through a mobile node composed of three nodes. Also, to minimize the distance errors between mobile node and fixed node, rounding estimation(RE) technique is proposed. Experimental results show that the error rate of localization is improved, by using proposed RE technique, 90.9% compared to conventional trilateration in the free space. In addition, despite the number of fixed nodes can be reduced by up to 50% in the indoor free space, the proposed estimation algorithm recognizes precise location which has average error of 0.15m.

• The Journal of the Convergence on Culture Technology
• /
• v.8 no.2
• /
• pp.373-377
• /
• 2022

Wireless sensor networks are being used in various fields. Wireless sensor networks are applied in many areas, such as security, military detection, environmental management, industrial control, and home automation. There is a problem about the limit of energy that the sensor network basically has. In this paper, we propose the LEACH-CCBD (Low Energy Adaptive Clustering hierarchy - Centrailized with Cluster and Basestation Distance) algorithm that uses energy efficiently by improving network transmission based on LEACH-C among the representative routing protocols. The LEACH-CCBD algorithm is a method of assigning a cluster head to a cluster head by comparing the sum of the distance from the member node to the cluster distance and the distance from the cluster node to the base station with respect to the membership of the member nodes in the cluster when configuring the cluster. The proposed LEACH-CCBD used Matlab simulation to confirm the performance results for each protocol. As a result of the experiment, as the lifetime of the network increased, it was shown to be superior to the LEACH and LEACH-C algorithms.

• Journal of KIISE:Information Networking
• /
• v.37 no.6
• /
• pp.489-493
• /
• 2010

In an indoor localization method taking the lateration-based approach, the distance between a target and an AP (Anchor Point) is estimated using RSS (Received Signal Strength) measurements. Since the characteristics of a radio signal randomly vary in time and space, errors are unavoidable in distance estimation with measured RSS. Since the accuracy of distance estimation affects the localization accuracy of a lateration-based method, additional APs hearing a target have been used for localization in the literature. However, lots of experimental results show that the accuracy of a lateration-based method is improved by using carefully selected APs measuring the high quality RSSs which the distances estimated is close to the actual distances between nodes as reference APs, not using merely more APs. In this paper, we focus on selection method of reference AP and distance estimation method reflecting on environmental dynamics. We validate our method by implementing an indoor localization system and evaluating the accuracy of our method in the various experimental environments.

• KIPS Transactions on Software and Data Engineering
• /
• v.5 no.12
• /
• pp.653-662
• /
• 2016

This paper describes a test case generation algorithm for Simulink/Stateflow models based on the Rapidly exploring Random Tree (RRT) algorithm that has been successfully applied to path finding. An important factor influencing the performance of the RRT algorithm is the metric used for calculating the distance between the nodes in the RRT space. Since a test case for a Simulink/Stateflow (SL/SF) model is an input sequence to check a specific condition (called a test target in this paper) at a specific status of the model, it is necessary to drive the model to the status before checking the condition. A status maps to a node of the RRT. It is usually necessary to check various conditions at a specific status. For example, when the specific status represents an SL/SF model state from which multiple transitions are made, we must check multiple conditions to measure the transition coverage. We propose a unique distance calculation metric, based on the observation that the test targets are gathered around some specific status such as an SL/SF state, named key nodes in this paper. The proposed metric increases the probability that an RRT is extended from key nodes by imposing penalties to non-key nodes. A test case generation algorithm utilizing the proposed metric is proposed. Three models of Electrical Control Units (ECUs) embedded in a commercial vehicle are used for the performance evaluation. The performances are evaluated in terms of penalties and compared with those of the algorithm using a typical RRT algorithm.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.8 no.5
• /
• pp.1128-1134
• /
• 2007

Recently, sensor network technology is a highly concerned area due to the expectation of many applications in various fields. The application of sensor network technology to the marine and ocean surveillance and investigation makes the marine environmental research easier since intelligent sensor nodes substitute the human labor work. In ocean sensor network, the localization scheme for the sensor nodes is most essential because all the information without from sensor nodes might be useless unless the positional information of each sensor nodes is provided. In this paper, the localization scheme with mobile beacons in ocean sensor networks is suggested and showed it could be effective for applying to marine circumstances. Even though the previous localization scheme(Ssu's) has advantages that additional hardware is not required for obtaining the information of distance and angle and shows the high accuracy of location and energy efficiency and easy expandability as well, it has also demerits the location error increases as the minimum distance between the absolute positional information become closer. In our works, the improved localization scheme with the presumed area of sensor node using geometric constraints is suggested.

• Journal of Korean Society of Rural Planning
• /
• v.11 no.1 s.26
• /
• pp.1-8
• /
• 2005

The purpose of this study is to develop a simulation model of rural road path for infrastructure of green-tourism and public service in rural areas. This study makes an objective function for moving cost minimization considering car travel time according to road characteristics, which can route the optimal shortest road paths between the center places and all rear villages, based on GIS coverages of road-village network for connecting between center places and rural villages as input data of the model. In order to verify the model algorithm, a homogeneous hexagonal network, assuming distribution of villages with same population density and equal distance between neighborhood villages on a level plane area, was tested to simulate the optimal paths between the selected center nodes and the other rear nodes, so that the test showed reasonable shortest paths and road intensity defined in this study. The model was also applied to the actual rural area, Ucheon-myun, which is located on Hoengsung-gun, Kangwon-do, with 72 rural villages, a center village (Uhang, 1st center place) in the area, a county conte. (Hoengsung-eup, 2nd center place), and a city (Wonju, 3rd center place), as upper settlement system. The three kinds of conte. place, Uhang, Hoengsung-eup, and Wonju, were considered as center places of three scenarios to simulate the optimal shortest paths between the centers and rural villages, respectively. The simulation results on the road-village network with road information about pavement and width of road show that several spans having high intensity of road are more important that the others, while some road spans have low intensity of road.