• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.12 no.5
• /
• pp.61-66
• /
• 2012

We propose a traffic information service system for which traffic data are transmitted over vehicle ad-hoc network from neighbor vehicles, and eventually provided to the traffic information center through a few gateway vehicles which are capable of inter-working with the infrastructure network like 3G. The center broadcasts the traffic information through the FM radio. The proposed scheme allows collecting and analyzing traffic status of large areas without incorporating separated monitoring systems, e.g., probe cars and enables to provide accurate traffic information to drivers in timely manner. We also evaluate its performance by ns-3 simulation.

• Journal of the Korean Data and Information Science Society
• /
• v.24 no.6
• /
• pp.1297-1307
• /
• 2013

Several multi-hop applications developed for vehicular ad hoc networks use broadcast as a means to either discover nearby neighbors or disseminate useful traffic information to othet vehicles located within a certain geographical area. However, the conventional broadcast mechanism may lead to the so-called broadcast storm problem, a scenario in which there is a high level of contention and collision at the link layer due to an excessive number of broadcast packets. To solve broadcast storm problem, we propose an RPB-MACn-based LV-CAST that is a vehicular broadcast algorithm for disseminating safety-related emergency message. The proposed LV-CAST identifies the last node within transmission range by computing the distance extending on 1 hop from the sending node of an emergency message to the next node of receiving node of the emergency message, and the last node only re-broadcasts the emergency message. The performance of LV-CAST is evaluated through simulation and compared with other message dissemination algorithms.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.22 no.9
• /
• pp.1243-1249
• /
• 2018

In this paper, we propose a scheme that tunes the backoff period for enhancing the system throughput with estimating the number of devices in IEEE 802.15.4 slotted carrier sense multiple access with collision avoidance (CSMA/CA) networks. Since each device does not sense the channel always in IEEE 802.15.4 slotted CSMA/CA networks, a personal area network (PAN) coordinator is used to estimate the number of active devices. The PAN coordinator broadcasts an optimal backoff period for the estimated number of devices through a beacon frame. In order to estimate the number of devices in run time, a simple moving average filter is utilized. We show the performance of our proposed scheme in terms of the estimated number of devices and the system throughput. The simulation results show that our proposed scheme can obtain higher system throughput than the IEEE 802.15.4 standard.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.17 no.3
• /
• pp.755-761
• /
• 2013

Medium access control (MAC) protocols for wireless sensor networks make sensor nodes on state for energy-efficiency only when necessary. In this paper we present an energy efficient priority-based MAC protocol for energy-harvesting Wireless Sensor Networks (WSNs). For support priority-based packet transmission the proposed EEPB-MAC protocol uses the modified IEEE 802.15.4 beacon frames including priority bit, sender node address, and NAV value fields. A receiver node periodically wakes up, receives sender beacon frames, selects data sending sender, and broadcasts a beacon frame containing the selected sender's address. A receiver node selects sender node according to sender's data priority. A receiver nodes also adjust wake up period based on their energy states. Hence, the energy consumption of receiver node can be minimized. Through simulations and analytical analysis, we evaluate the performance of our proposed the EEPB-MAC protocol and compare it against the previous MACs. Results have shown that our protocol outperforms other MAC in terms of energy consumption, higher priority packet delivery delay.

• Journal of KIISE:Databases
• /
• v.31 no.2
• /
• pp.140-149
• /
• 2004

Data broadcast has received much attention as a very efficient method for disseminating data items in mobile environment with large number of mobile clients. In this approach, a database server periodically and continuously broadcasts data items through wireless channels and clients perform read-only transactions by accessing necessary data items from the air. While broadcasting, the server must also process update transactions on the database, which raises an obstacle for client's accessing consistent data. In this research, we propose a new algorithm SCDSC(Serialization Checking with DirtySet on Commit) which is an alternative for solving the concurrency control problem efficiently. The SCDSC is a kind of optimistic concurrency control in that a client checks the consistency of data using a DirtySet as a part of data broadcast when it commits its transaction. In each broadcast cycle, the server updates and disseminates the DirtySet with newly changed data items for last few cycles in the sliding window approach. We perform an analysis and a simulation study to evaluate the performance of our SCDSC algorithm in terms of data consistency and data currency.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.42 no.1
• /
• pp.108-120
• /
• 2017

To this end, the ROK military is developing a Korean Tactical Data Link (Link-K) in two stages: Basic and Completion types. Currently, the basic type of the Link-K has a limitations for supporting Mission Group(MG)s, such as to share unnecessary information and inefficient routing, because all RICCs simply broadcasts the same information in the basic type of the Link-K. In this paper, we propose a Zone-based Wireless Link-K network structure and a routing algorithm. To improve the effectiveness of the proposed routing algorithm, we have studied a filtering method that adjusts the message data according to the priority of the message and a method of controlling the load of the network. In order to evaluate the performance of the proposed scheme, it is proved that it is effective to support the mission task group compared with the existing wireless Link-K routing algorithm according to the operational scenario situation.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.12B
• /
• pp.1075-1082
• /
• 2008

A greedy forwarding algorithm is one of the most suitable solutions for routing in vehicular ad-hoc networks. Compared to conventional routing protocols for mobile ad-hoc networks, greedy forwarding based routing protocols maintain only local information of neighbors instead of per-destination routing entries, and thus they show better performance in highly-mobile vehicular ad-hoc networks. With greedy forwarding, each node learns its geographical position and periodically broadcasts a beacon message including its position information. Based on the position information, each node selects a neighbor node located closest to the destination node as the next forwarder. One of the most serious problems in greedy forwarding is the lost link problem due to the mobility of nodes. In this paper, we propose a new algorithm to reduce the lost link problem. The proposed algorithm aims to find an efficient and stable routing path by taking account of the position of neighbors and the last beacon reception time. Our simulation results show that the proposed algorithm outperforms the legacy greedy algorithm and its variants.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38A no.10
• /
• pp.908-917
• /
• 2013

In this paper, we propose a discovery protocol for finding nearby mobile applications and services in a device-to-device communications system. The device-to-device communication technology enables proximity-based services such as mobile social networks and mobile marketing. For realizing these proximity-based services, it is essential to design a discovery protocol which pinpoints the devices with mobile applications of interest among hundreds and thousands of devices in proximity. In the infrastructure-less networks such as ad hoc networks, we can design the discovery protocol that periodically broadcasts a short discovery code containing the compressed information of the mobile applications. In this paper, we design the discovery protocol with the discovery code generated by using a hash function and a Bloom filter. We also mathematically analyze the performance of the proposed protocol.

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

Since 1993, the civil aviation community through RTCA (Radio Technical Commission for Aeronautics) and the ICAO (International Civil Air Navigation Organization) have been working on the definition of GNSS augmentation systems that will provide improved levels of accuracy and integrity. These augmentation systems have been classified into three distinct groups: Aircraft Based Augmentation Systems (ABAS), Space Based Augmentation Systems (SBAS) and Ground Based Augmentation Systems (GBAS). The last one is an implemented system to support Air Navigation in CAT-I approaching operation. It consists of three primary subsystems: the GNSS Satellite subsystem that produces the ranging signals and navigation messages; the GBAS ground subsystem, which uses two or more GNSS receivers. It collects pseudo ranges for all GNSS satellites in view and computes and broadcasts differential corrections and integrity-related information; the Aircraft subsystem. Within the area of coverage of the ground station, aircraft subsystems may use the broadcast corrections to compute their own measurements in line with the differential principle. After selection of the desired FAS for the landing runway, the differentially corrected position is used to generate navigation guidance signals. Those are lateral and vertical deviations as well as distance to the threshold crossing point of the selected FAS and integrity flags. The Department of Applied Science in Naples has create for its study a virtual GBAS Ground station. Starting from three GPS double frequency receivers, we collect data of 24h measures session and in post processing we generate the GC (GBAS Correction). For this goal we use the software Pegasus V4.1 developed from EUROCONTROL. Generating the GC we have the possibility to study and monitor GBAS performance and integrity starting from a virtual functional architecture. The latter allows us to collect data without the necessity to found us authorization for the access to restricted area in airport where there is one GBAS installation.

• Journal of Positioning, Navigation, and Timing
• /
• v.12 no.2
• /
• pp.113-119
• /
• 2023

Satellite navigation systems, with the exception of the GLObal NAvigation Satellite System (GLONASS), adopt ionosphere models and provide ionospheric coefficients to single-frequency users via navigation messages to correct ionospheric delay, the main source of positioning errors. A Global Navigation Satellite System (GNSS) mostly has its own ionospheric models: the Klobuchar model for Global Positioning System (GPS), the NeQuick-G model for Galileo, and the BeiDou Global Ionospheric delay correction Model (BDGIM) for BeiDou satellite navigation System (BDS)-3. On the other hand, a Regional Navigation Satellite System (RNSS) such as the Quasi-Zenith Satellite System (QZSS) and BDS-2 uses the Klobuchar Model rather than developing a new model. QZSS provides its own coefficients that are customized for its service area while BDS-2 slightly modifies the Klobuchar model to improve accuracy in the Asia-Pacific region. In addition, BDS broadcasts multiple ionospheric parameters depending on the satellites, unlike other systems. In this paper, we analyzed the different ionospheric models of GPS, QZSS, and BDS in Korea. The ionospheric models of QZSS and BDS-2, which are based in Asia, reduced error by at least 25.6% compared to GPS. However, QZSS was less accurate than GPS during geomagnetic storms or at low latitude. The accuracy of the models according to the BDS satellite orbit was also analyzed. The BDS-2 ionospheric model showed an error reduction of more than 5.9% when using GEO coefficients, while in BDS-3, the difference between satellites was within 0.01 m.