• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38C no.7
• /
• pp.605-611
• /
• 2013

If an accident vehicle propagates emergency messages to other vehicles close to it, the other drivers may realize and avoid the accident spot. In this letter, we propose a broadcast scheme to propagate emergency messages fast in urban VANETs (Vehicular Ad-Hoc Networks) with the help of GPS (Global Position System). In our scheme, a transmitting vehicle chooses the farthest node as the next relay vehicle to propagate emergency messages. And, we suggest an algorithm for intersection recognition and SCF (Store-Carry-Forward) task by taking advantage of periodic hello packets to reduce the propagation time and enhance the delivery ratio.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.12B
• /
• pp.1037-1041
• /
• 2004

In this paper we propose a new conceptual slave clock system in which remotely located clock is synchronized to the reference clock by intermediation of the satellite time, show a probability of adoption to real network by experiments. This new proposed method has lots of structural advantages over the existing methods because all of the node clocks can be maintained with the same hierarchical quality. The measurement results show that the accuracy of the experimental slave clock system can be kept within a few parts in 1012 and that the MTIE (Maximum Time Interval Error) meets the ITU-T Recommendation G.811 for the primary reference clock A prototype system having fully automatic operational functions has been realized, and it is expected to be commercially used as a node clock for synchronization in the digital communication network in the near future.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.11 no.4
• /
• pp.1294-1300
• /
• 2010

In an environment where all nodes move, the sensor node receives anchor node's position information within communication radius and modifies the received anchor node's position information by one's traveled distance and direction in saving in one's memory, where if there at least 3, one's position is determined by performing localization through trilateration. The proposed localization mechanisms have been simulated in the Matlab. In an environment where certain distance is maintained and nodes move towards the same direction, the probability for the sensor node to meet at least 3 anchor nodes with absolute coordinates within 1 hub range is remote. Even if the sensor node has estimated its position with at least 3 beacon information, the angle ${\theta}$ error of accelerator and digital compass will continuously apply by the passage of time in enlarging the error tolerance and its estimated position not being relied. Dead reckoning technology is used as a supplementary position tracking navigation technology in places where GPS doesn't operate, where one's position can be estimated by knowing the distance and direction the node has traveled with acceleration sensor and digital compass. The localization algorithm to be explained is a localization technique that uses Dead reckoning where all nodes are loaded with omnidirectional antenna, and assumes that one's traveling distance and direction can be known with accelerator and digital compass. The simulation results show that our scheme performed better than other mechanisms (e.g. MCL, DV-distance).

• Journal of Internet Computing and Services
• /
• v.9 no.4
• /
• pp.51-59
• /
• 2008

In wireless sensor networks, one of most common location detection methods that do not require additional devices such as GPS and ultrasonic sensor, is the location detection method based on received signal strength. However, measured received signal strength will fluctuate over time mainly due to physical radio channel characteristics between nodes, which subsequently will cause errors to measured distance between nodes. Since these contaminated distance data are utilized to detect the location of unknown node, there will be accumulated errors in the location of unknown node. In order to overcome the limitation of the location detection method based on received signal strength, we propose a location scheme in which reliability information of distance data as well as distance data between nodes are utilized to estimate the location of unknown node. Through simulation, it is shown that the proposed scheme can accomplish 30% capacity improvement.

• Spatial Information Research
• /
• v.19 no.1
• /
• pp.117-126
• /
• 2011

Recently, AR applications provide location-based spatial information by GPS. Also, the spatial information is displayed by the angle of the camera. So far, traditional spatial indexes in spatial database field retrieve and filter spatial information by the minimum bounding rectangle (MBR) algorithm.(ex. R-tree) MBR strategy is a useful technique in the geographic information systems and location based services. But MBR technique doesn't reflect the characteristics of spatial queries in AR. Spatial queries of AR applications have high possibility of the dead space area between MBRs of non-leaf node and query area. We propose triangle node filtering algorithm that improved efficiency of spatial retrieval used the triangle node filtering techniques by exclusion the dead space. In this paper, the proposed algorithm has been implemented on PostgreSQL/PostGIS. Experimental results show the spatial retrieval that using the proposed algorithm better performance than the spatial retrieval that of the minimum bounding rectangle algorithm.

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

Recently, with the rapid advancement in information and communication technology, indoor location-based services(LBSs) that require precise position tracking have been actively studied with outdoor-LBS using GPS. However, in case of a ship which consists of steel structure, it is difficult to measure a precise localization due to significant ranging error by the diffraction and refraction of radio waves. In order to reduce location measurement errors that occur in these indoor environments, this paper presents distance compensation algorithms that are suitable for a narrow passage such as ship corridors without any additional sensors by using UWB(Ultra-wide-band), which is robust to multi-path and has an error in the range of a few centimeters in free space. These improvement methods are that Pythagorean theory and adjacent node technique are used to solve the distance error due to the node deployment and distance variation analysis technique is applied to reduce the ranging errors which are significantly fluctuated in the corner section. The experimental results show that the number of nodes and the distance error are reduced to 66% and 57.41%, respectively, compared with conventional CSS(Chirp spread spectrum) method.

• Proceedings of the Korean Institute of Navigation and Port Research Conference
• /
• v.2
• /
• pp.217-222
• /
• 2006

To find a location, GPS has been wildly used. But, it is hard to use in indoor because of very weak signal level. To meet indoor requirements, there have been many studies applying wireless communication networks such as WLAN, UWB and ZigBee. Among these, ZigBee is widely adopted in many WSN applications because it has an advantage of low-power and low-cost. In ZigBee, the RSSI is used as range measurement for ad-hoc network. The RSSI are converted to ranges using the signal attenuation model and these ranges become inputs of positioning methods. The obtained position with RSSI has large error because of its poor accuracy. To overcome this problem, ultrasonic sensors are added in many researches. By measuring the arrival time difference of ZigBee and ultrasound as a range measurement, the precise position can be found. However, there are still many problems: scheduling of beacons to transmit signals in a correct order, addition and synchronization of beacons and low-rate positioning rate. At this paper, an efficient method to solve these problems is proposed. In the proposed method, a node transmits ZigBee and ultrasound signal simultaneously. And beacons find the range with the received signals and send it back to a node with ZigBee. The position is computed in a node with the received ranges. In addition, a new positioning algorithm to solve the risk of the divergence in the linearization method and the singularity problem in the Savarese method is presented. Both static and dynamic experimental results show 0.02m RMS errors with high output rate.

• Journal of Advanced Navigation Technology
• /
• v.27 no.3
• /
• pp.300-305
• /
• 2023

In this paper, we confirmed that an efficient sensor network can be established at a low cost by applying Geofencing technology to a LoRa-based sensor network and verified its effectiveness in disaster management such as forest fires. We detected changes through GPS, gyro sensors, and combustion detection sensors, and defined the validity size of the Geofencing cell accurately. We proposed a LoRa Payload Frame Structure that has a flexible size according to the size of the sensor information.

• Journal of Korea Spatial Information System Society
• /
• v.8 no.2 s.17
• /
• pp.53-73
• /
• 2006

Recently, the need for Location-Based Services (LBS) has increased due to the development of mobile devices, such as PDAs, cellular phones and GPS. As a moving object database that stores and manages the positions of moving objects is the core technology of LBS, the scheme for maintaining the main memory DBMS to the server is necessary to store and process frequent reported positions of moving objects efficiently. However, previous works on a moving object database have studied mostly a disk based moving object index that is not guaranteed to work efficiently in the main memory DBMS because these indexes did not consider characteristics of the main memory. It is necessary to study the main memory index scheme for a moving object database. In this paper, we propose the main memory index scheme based on the R-tree for storing and processing positions of moving objects efficiently in the main memory DBMS. The proposed index scheme, which uses a growing node structure, prevents the splitting cost from increasing by delaying the node splitting when a node overflows. The proposed scheme also improves the search performance by using a MergeAndSplit policy for reducing overlaps between nodes and a LargeDomainNodeSplit policy for reducing a ratio of a domain size occupied by node's MBRs. Our experiments show that the proposed index scheme outperforms the existing index scheme on the maximum 30% for range queries.

• 제어로봇시스템학회:학술대회논문집
• /
• 2003.10a
• /
• pp.1162-1167
• /
• 2003

This paper presents a simple sensor network consists of a group of sensors, RF components, and microprocessors, to perform a distributed sensing and information transmission using wireless links. In the proposed sensor network, though each sensor node has a limited capability and a simple signal-processing engine, a group of sensor nodes can perform a various tasks through coordinated information sharing and wireless communication in a large working area. Using the capability of self-localization and tracking, we show the sensor network can be applied to localization and navigation of mobile robot in which the robot has to be coordinated effectively to perform given task in real time.