• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.12
• /
• pp.5785-5804
• /
• 2019

The information of localization is a fundamental requirement in wireless sensor network (WSN). The method of distance vector-hop (DV-Hop), a range-free localization algorithm, can locate the ordinary nodes by utilizing the connectivity and multi-hop transmission. However, the error of the estimated distance between the beacon nodes and ordinary nodes is too large. In order to enhance the positioning precision of DV-Hop, fast triangle flip bat algorithm, which is based on curve strategy and rank transformation (FTBA-TCR) is proposed. The rank is introduced to directly select individuals in the population of each generation, which arranges all individuals according to their merits and a threshold is set to get the better solution. To test the algorithm performance, the CEC2013 test suite is used to check out the algorithm's performance. Meanwhile, there are four other algorithms are compared with the proposed algorithm. The results show that our algorithm is greater than other algorithms. And this algorithm is used to enhance the performance of DV-Hop algorithm. The results show that the proposed algorithm receives the lower average localization error and the best performance by comparing with the other algorithms.

• Journal of the Korea Society of Computer and Information
• /
• v.17 no.4
• /
• pp.99-107
• /
• 2012

We propose control mechanism of UAV(Unmanned Aerial Vehicle) group for making the communication network to the base station after the target is found. We assume UAVs can communicate to each other by wireless LAN without existing communication infrastructure. UAVs started to fly in linear formation, after finding target, UAVs move to the base station to send the information about the target. At least one UAV stays the position that the target is found. This paper explains the mechanism supporting reliable connectivity during UAV group's flying. We verify the proposed scheme and evaluate the performance through NS-2 simulation. The proposed scheme can be applied to the disaster area and war zone, which the existing communication infrastructure cannot be worked.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.7 no.6
• /
• pp.1479-1485
• /
• 2012

The parking management system can increase driver's convenience with detailed parking information service in the parking lot. At the same time, parking management system consumes non-negligible electrical energy with large amount of sensors, displays and control modules. With the increase in the demand for green and sustainable building design all over the world, it becomes a meaningful issue for parking management system to reduce operating power. This paper presents the preliminary design and estimated results of a parking management system which is optimized to reduce the power consumption mainly on detectors and displays. The system design is based on pre-developed wireless parking detectors, Park Tile and Park Disk. The system has a number of parking space detectors, vehicle count detectors, information displays, guidance terminals and other control units. We have performed system architecture design, communication network design, parking information service scenario planning, battery life regulation and at last operating power estimation. The estimated operating power was 0.93KW per parking-slot, which is 20% of traditional systems. The estimated annual maintenance cost was 18% of traditional systems.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38B no.7
• /
• pp.543-552
• /
• 2013

For the safety messages in IEEE 802.11p/WAVE vehicles network environment, strict periodic beacon broadcasting requires status advertisement to assist the driver for safety. In crowded networks where beacon message are broadcasted at a high number of frequencies by many vehicles, which used for beacon sending, will be congested by the wireless medium due to the contention-window based IEEE 802.11p MAC. To resolve the congestion, we consider a MAC scheme based on slotted p-persistent CSMA as a simple non-cooperative Bayesian game which involves payoffs reflecting the attempt probability. Then, we derive Bayesian Nash Equilibrium (BNE) in a closed form. Using the BNE, we propose new congestion control algorithm to improve the performance of the beacon rate under saturation condition in IEEE 802.11p/WAVE vehicular networks. This algorithm explicitly computes packet delivery probability as a function of contention window (CW) size and number of vehicles. The proposed algorithm is validated against numerical simulation results to demonstrate its stability.

• KIPS Transactions on Computer and Communication Systems
• /
• v.7 no.9
• /
• pp.227-234
• /
• 2018

Guaranteeing the end-to-end delay deadline is an important issue for quality of service (QoS) of delay sensitive systems, such as real-time system, networked control system (NCS), and cyber-physical system (CPS). Most routing algorithms typically use the mean end-to-end delay as a performance metric and select a routing path that minimizes it to improve average performance. However, minimum mean delay is an insufficient routing metric to reflect the characteristics of the unpredictable wireless channel condition because it only represents average value. In this paper, we proposes a deadline-aware routing algorithm that maximizes the probability of packet arrival within a pre-specified deadline for CPS by considering the delay distribution rather than the mean delay. The proposed routing algorithm constructs the end-to-end delay distribution in a given network topology under the assumption of the single hop delay follows an exponential distribution. The simulation results show that the proposed routing algorithm can enhance QoS and improve networked control performance in CPS by providing a routing path which maximizes the probability of meeting the deadline.

• Asia-pacific Journal of Multimedia Services Convergent with Art, Humanities, and Sociology
• /
• v.9 no.1
• /
• pp.179-187
• /
• 2019

With the recent development of small computing devices, IoT sensor network can be widely deployed and is now readily available with sensing, calculation and communi-cation functions at low cost. Sensor data management is a major component of the Internet of Things environment. The huge volume of data produced and transmitted from sensing devices can provide a lot of useful information but is often considered the next big data for businesses. New column-wise compression technology is mounted to the large data server because of its superior space efficiency. Since sensor nodes have narrow bandwidth and fault-prone wireless channels, sensor-based storage systems are subject to incomplete data services. In this study, we will bring forth a short overview through providing an analysis on IoT sensor networks, and will propose a new storage management scheme for IoT data. Our management scheme is based on RAID storage model using column-wise segmentation and compression to improve space efficiency without sacrificing I/O performance. We conclude that proposed storage control scheme outperforms the previous RAID control by computer performance simulation.

• Journal of IKEEE
• /
• v.25 no.1
• /
• pp.193-200
• /
• 2021

In order to prevent illegal fishing and reduce lost fishing gear, it is necessary to develop a constant and continuous fishing gear monitoring system in the marine environment. In this paper, we design a long-term operational, reliable system model with communication coverage of more than 25Km considering the reality of gradually expanding fishing activity due to the depletion of fishery resources and marine environments. The design results are implemented to verify the operability of the system by separating the communication success rate of SKT and private LoRa networks and verifying the control function of each control system through the collected location information, respectively.

• The KIPS Transactions:PartC
• /
• v.14C no.3 s.113
• /
• pp.229-238
• /
• 2007

Sensor networks consist of many tiny sensor nodes that collaborate among themselves to collect, process, analyze, and disseminate data. In sensor networks, sensor nodes are typically powered by batteries, and have limited computing resources. Moreover, the redeployment of nodes by energy exhaustion or their movement makes network topology change dynamically. These features incur problems that do not appear in traditional, wired networks. Security in sensor networks is challenging problem due to the nature of wireless communication and the lack of resources. Several efforts are underway to provide security services in sensor networks, but most of them are preventive approaches based on cryptography. However, sensor nodes are extremely vulnerable to capture or key compromise. To ensure the security of the network, it is critical to develop suity mechanisms that can survive malicious attacks from "insiders" who have access to the keying materials or the full control of some nodes. In order to protect against insider attacks, it is necessary to understand how an insider can attack a sensor network. Several attacks have been discussed in the literature. However, insider attacks in general have not been thoroughly studied and verified. In this paper, we study the insider attacks against routing protocols in sensor networks using the Ad-hoc On-Demand Distance Vector (AODV) protocol. We identify the goals of attack, and then study how to achieve these goals by modifying of the routing messages. Finally, with the simulation we study how an attacker affects the sensor networks. After we understand the features of inside attacker, we propose a detect mechanism using hop count information.

• Journal of Satellite, Information and Communications
• /
• v.4 no.1
• /
• pp.1-7
• /
• 2009

As the information age comes out, the aspect of future war brings about the many changes in terms of war-fighting environment. Accordingly, information superiority and intelligence-centric warfare have been important and new war-fighting concept such as NCW(network centric warfare) have been turned up. This paper proposed all-weather core-strategy communications systems guaranteeing not only the real-time transmission of the information collected in a battlefield and expansion, automation, and rapidity of a battlefield but also broadband, mobility, survivability, and flexibility. The proposed military satellite communications system is classified into wideband mass capacity link, survivability, and the system supporting OTM(on the move) communication for the real-time transmission of battlefield information. This paper analyzed the essential operation concepts and core schemes of the U.S. Army's next generation system, TSAT(Transformational Satellite Communication System). Base on the analysis results, this paper proposed that the architecture of next generation military satellite communications systems for NCW have to provide the data rate, anti-jamming capability, network control and management capability which are optimally adaptable for the wireless channel environments such as jamming and interference and to support the variety of platforms like high-speed mobile vehicles, micromini devices, super-high speed unmanned aerial vehicles. Finally, this paper also proposed that next generation military satellite communications systems need the technologies such as the adaptable multi-antenna, laser link, and next-generation anti-jamming waveform.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.40 no.8
• /
• pp.1631-1636
• /
• 2015

With the advance of wireless communication technology in terrestrial area, underwater communication is also evolving very fast from a simple point-to-point transmission to an elaborate networked communications. Underwater acoustic channel has quite different features comparing with the terrestrial radio channel in terms of propagation delay, Doppler shift, multipath, and path loss. Thus, existing technologies developed for terrestrial communication might not work properly in underwater channel. Especially medium access control (MAC) protocols which highly depend on propagation phenomenon should be newly designed for underwater network. CSMA/CA has drawn lots of attention as a candidate of underwater MAC protocol, since it is able to resolve a packet collision and the hidden node problem. However, a received signal could be degraded by the interferences from the nodes locating outside the receiver's propagation radius. In this paper, we study the effects of interference on the CSMA/CA based underwater network. We derived the SNR with the interference using the sonar equation and analyzed the degradation of the RTS/CTS effects. These results are compared with the terrestrial results to understand the differences. Finally we summarized the design considerations in CSMA/CA based underwater network.