• Journal of the Korea Institute of Military Science and Technology
• /
• v.14 no.1
• /
• pp.123-131
• /
• 2011

In this paper, modeling and design of a distributed detection system are considered for an active sonar sensor network. The sensor network has a parallel configuration and it consists of a fusion center and a set of receiver nodes. A system with two receiver nodes is considered to investigate a theoretical aspect of design. To be specific, AND rule and OR rule are considered as the fusion rules of the sensor network. For the fusion rules, it is shown that a threshold rule of each sensor node has uniformly most powerful properties. Optimum threshold for each sensor is obtained that maximizes the probability of detection given probability of false alarm. Numerical experiments were also performed to investigate the detection characteristics of a distributed detection system with multiple sensor nodes. The experimental results show how signal strength, false alarm probability, and the distance between nodes in a sensor field affect the system detection performances.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.15 no.6
• /
• pp.103-108
• /
• 2015

Maintaining efficient energy consumption and elongating network lifetime are the key issues in wireless sensor networks. Existing routing protocols usually select the cluster heads based on the proximity to the sensor nodes. In this case the cluster heads can be placed farther to the base station, than the distance between the sensor nodes and the base station, which yields inefficient energy consumption. In this work we propose a novel algorithm that select the nodes in a cluster and the cluster heads based on the locations of related nodes. We verify that the proposed algorithm gives better performance in terms of network life time than existing solutions.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.6 no.12
• /
• pp.3257-3274
• /
• 2012

Broadcast routing has become an important research field for vehicular ad-hoc networks (VANETs) recently. However, the packet delivery rate is generally low in existing VANET broadcast routing protocols. Therefore, the design of an appropriate broadcast protocol based on the features of VANET has become a crucial part of the development of VANET. This paper analyzes the disadvantage of existing broadcast routing protocols in VANETs, and proposes an improved algorithm (namely ODAM-C) based on the ODAM (Optimized Dissemination of Alarm Messages) protocol. The ODAM-C algorithm improves the packet delivery rate by two mechanisms based on the forwarding features of ODAM. The first distance-based mechanism reduces the possibility of packet loss by considering the angles between source nodes, forwarding nodes and receiving nodes. The second mechanism increases the redundancy of forwarding nodes to guarantee the packet success delivery ratio. We show by analysis and simulations that the proposed algorithm can improve packet delivery rate for vehicular networks compared against two widely-used existing protocols.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.9 no.6
• /
• pp.55-61
• /
• 2009

This paper proposes a position estimation of a mobile robot based on USN(Ubiquitous Sensor Network) and encoder, and development of tele-operation system using Internet. USN used in experiments is based on ZigBee protocol and has location estimation engine which uses RSSI signal to estimate distance between nodes. By distortion the estimated distance using RSSI is not correct, compensation method is needed. We obtained fuzzy model to calculate more accurate distance between nodes and use encoder which is built in robot to estimate accurate position of robot. Based on proposed position estimation method, tele-operation system was developed. We show by experiment that proposed method is more appropriate for estimation of position and remote navigation of mobile robot through Internet.

• Journal of the Korea Society of Computer and Information
• /
• v.13 no.4
• /
• pp.127-132
• /
• 2008

Wireless sensor network technologies applicable to various industrial fields are rapidly growing. Because it is difficult to change a battery for the once distributed wireless sensor network, energy efficient design is very critical. In order to achieve this purpose in network design, a number of studies have been examining the energy efficient routing protocol. The sensor network consumes energy in proportion to the distance of data transmission and the data to send. Cluster-based routing Protocols such as LEACH-C achieve energy efficiency through minimizing the distance of data transmission. In LEACH-C, however, the total distance between the nodes consisting the clusters are considered important in constructing clustering. This paper examines the cluster-head-selection-algorithm that reflect the distance between the base station and the cluster-head having a big influence on energy consumption. The Proposed method in this paper brought the result that the performance improved average $4{\sim}7%$ when LEACH-C and the base station are located beyond a certain distance. This result showed that the distance between cluster-head and the base station had a substantial influence on lifetime performance in the cluster-based routing protocol.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.11 no.5
• /
• pp.53-58
• /
• 2011

In this paper, we firstly propose a novel cooperative transmission protocol, which utilizes the advantages of mid-notes in the route from the source to the destination. Taking benefits from balancing between the received packet from the source and acknowledge message from the destination, the mid-node between the source and the destination is firstly considered to be the broadcaster. If its signal is successfully received from the source, it leads to consider the next nodes, which has closer distance to the destination than it. If one of these nodes correctly receives the signal, it performs broadcasting the signal to the destination instead of mid-node. Otherwise, the mid-node directs attention to these nodes being near to the destination. As the result, some nodes are unnecessary to be considered and passed over time. After that, we analyze some published selection relaying schemes based on geographic information to choose the best nodes instead of the instantaneous SNR as before. Finally, simulation results are given to demonstrate the correctness of the performance analyses and show the significant improvement of the selection relaying schemes based geographic information compared to the other ones.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.7
• /
• pp.3393-3412
• /
• 2017

As a main challenge in network virtualization, virtual network embedding problem is increasingly important and heuristic algorithms are of great interest. Aiming at the problems of poor correlation in node embedding and link embedding, long distance between adjacent virtual nodes and imbalance resource consumption of network components during embedding, we herein propose a two-stage virtual network embedding algorithm NA-PVNM. In node embedding stage, resource requirement and breadth first search algorithm are introduced to sort virtual nodes, and a node fitness function is developed to find the best substrate node. In link embedding stage, a path fitness function is developed to find the best path in which available bandwidth, CPU and path length are considered. Simulation results showed that the proposed algorithm could shorten link embedding distance, increase the acceptance ratio and revenue to cost ratio compared to previously reported algorithms. We also analyzed the impact of position constraint and substrate network attribute on algorithm performance, as well as the utilization of the substrate network resources during embedding via simulation. The results showed that, under the constraint of substrate resource distribution and virtual network requests, the critical factor of improving success ratio is to reduce resource consumption during embedding.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.6 no.6
• /
• pp.1546-1564
• /
• 2012

Pattern-based query processing has not attracted much attention in wireless sensor network though its counterpart has been studied extensively in data stream. The methods used for data stream usually consume large memory and much energy. This conflicts with the fact that wireless sensor networks are heavily constrained by their hardware resources. In this paper, we use piece wise representation to represent sensor nodes' collected data to save sensor nodes' memory and to reduce the energy consumption for query. After getting data stream's and patterns' approximated line segments, we record each line's slope. We do similar matching on slope sequences. We compute the dynamic time warping distance between slope sequences. If the distance is less than user defined threshold, we say that the subsequence is similar to the pattern. We do experiments on STM32W108 processor to evaluate our strategy's performance compared with naive method. The results show that our strategy's matching precision is less than that of naive method, but our method's energy consumption is much better than that of naive approach. The strategy proposed in this paper can be used in wireless sensor network to process pattern-based queries.

• The Journal of the Acoustical Society of Korea
• /
• v.28 no.8
• /
• pp.774-780
• /
• 2009

This paper proposes a transmitted power saving method for underwater acoustic sensors considering the acoustic wave propagation characteristic that propagation loss increases more rapidly in higher frequency band. In the proposed scheme, sensor nodes are divided into a few groups based on the distance between sink node and the sensor node, and each group uses its own frequency band. The node group with longer distance uses lower frequency and the node group with shorter distance uses higher frequency. By means of such a distance-dependent frequency allocation, all sensor nodes are able to maintain a certain target signal-to-noise ratio (SNR), but also save transmitted power. In addition, the optimum size of node group is obtained, and also a frequency allocation algorithm is proposed accordingly. Numerical results show that the proposed scheme saves transmitted power by more 10 dB comparing non-grouping methods.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.50 no.3
• /
• pp.157-164
• /
• 2022

In this paper, we describe how to implement the mountainous terrain, radar, and air defense network for UAV path planning in a 3-D environment, and perform path planning and re-planning using the PRM algorithm, a sampling-based path planning algorithm. In the case of the original PRM algorithm, the calculation to check whether there is an obstacle between the nodes is performed 1:1 between nodes and is performed continuously, so the amount of calculation is greatly affected by the number of nodes or the linked distance between nodes. To improve this part, the proposed LineGridMask method simplifies the method of checking whether obstacles exist, and reduces the calculation time of the path planning through parallelization. Finally, comparing performance with existing PRM algorithms confirmed that computational time was reduced by up to 88% in path planning and up to 94% in re-planning.