• Title/Summary/Keyword: Underwater Distributed Sensor Network

Search Result 7, Processing Time 0.021 seconds

A Study on the Design of an Underwater Distributed Sensor Network for the Shallow Water by An Effectiveness Analysis (효과도 분석을 통한 천해용 수중분산 센서망 설계 연구)

  • Kim, Wan-Jin;Bae, Ho Seuk;Kim, Woo Shik;Lee, Sang Kug;Choi, Sang Moon
    • Journal of the Korea Institute of Military Science and Technology
    • /
    • v.17 no.5
    • /
    • pp.591-603
    • /
    • 2014
  • In this paper, we have described the characteristics of the Underwater Distributed Sensor Network (UDSN) and proposed the conceptual design guideline by an effectiveness analysis. To perform the effectiveness analysis, we defined an battlefield environment, and then analyzed principal components which compose the UDSN to find out simulation parameters and system constraints. We have chosen a measure of effectiveness based on a target trajectory, which could enhance intuitive understanding about current status, and performed various simulations to reveal critical design parameters in terms of sensor node types, arrangement, cost and combination of detection information.

Application of Approximate FFT Method for Target Detection in Distributed Sensor Network (분산센서망 수중표적 탐지를 위한 근사 FFT 기법의 적용 연구)

  • Choi, Byung-Woong;Ryu, Chang-Soo;Kwon, Bum-Soo;Hong, Sun-Mog;Lee, Kyun-Kyung
    • The Journal of the Acoustical Society of Korea
    • /
    • v.27 no.3
    • /
    • pp.149-153
    • /
    • 2008
  • General underwater target detection methods adopt short-time FFT for estimate target doppler. This paper proposes the efficient target detection method, instead of conventional FFT, using approximate FFT for distributed sensor network target detection, which requires lighter computations. In the proposed method, we decrease computational rate of FFT by the quantization of received signal. For validation of the proposed method, experiment result which is applied to FFT based active sonar detector and real oceanic data is presented.

Target Localization Using Geometry of Detected Sensors in Distributed Sensor Network (분산센서망에서 표적을 탐지한 센서의 기하학적 구조를 이용한 표적위치 추정)

  • Ryu, Chang Soo
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.53 no.2
    • /
    • pp.133-140
    • /
    • 2016
  • In active sonar field, a target detection and localization based on a distributed sensor network has been much studied for the underwater surveillance of the coast. Zhou et al. proposed a target localization method utilizing the positions of target-detected sensors in distributed sensor network which consists of detection-only sensors. In contrast with a conventional method, Zhou's method dose not require to estimate the propagation model parameters of detection signal. Also it needs the lower computational complexity, and to transmit less data between network nodes. However, it has large target localization error. So it has been modified for reducing localization error by Ryu. Modified Zhou's method has better estimation performance than Zhou's method, but still relatively large estimation error. In this paper, a target localization method based on modified Zhou's method is proposed for reducing the localization error. The proposed method utilizes the geometry of the positions of target-detected sensors and a line that represents the bearing of target, a line can be found by modified Zhou's method. This paper shows that the proposed method has better target position estimation performance than Zhou's and modified Zhou's method by computer simulations.

An Energy-Efficient Clustering Scheme in Underwater Acoustic Sensor Networks (수중음향 센서 네트워크에서 효율적인 저전력 군집화 기법)

  • Lee, Jae-Hun;Seo, Bo-Min;Cho, Ho-Shin
    • The Journal of the Acoustical Society of Korea
    • /
    • v.33 no.5
    • /
    • pp.341-350
    • /
    • 2014
  • In this paper, an energy efficient clustering scheme using self organization method is proposed. The proposed scheme selects a cluster head considering not only the number of neighbor nodes but also the residual battery amount. In addition, the network life time is extended by re-selecting the cluster heads only in case the current cluster head's residual energy falls down below a certain threshold level. Accordingly, the energy consumption is evenly distributed over the entire network nodes. The cluster head delivers the collected data from member nodes to a Sink node in a way of multi-hop relaying. In order to evaluate the proposed scheme, we run computer simulation in terms of the total residual amount of battery, the number of alive nodes after a certain amount of time, the accumulated energy cost for network configuration, and the deviation of energy consumption of all nodes, comparing with LEACH which is one of the most popular network clustering schemes. Numerical results show that the proposed scheme has twice network life-time of LEACH scheme and has much more evenly distributed energy consumption over the entire network.

Environment Monitoring System Using RF Sensor (RF 센서를 이용한 해양 환경 관리 시스템)

  • Cha, Jin-Man;Park, Yeoun-Sik
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2012.05a
    • /
    • pp.896-898
    • /
    • 2012
  • Recently, many countries are making efforts for the development of ocean resources because the necessity and importance of the ocean resources are increased. Underwater sensor networks have emerged as a very powerful technique for many applications, including monitoring, measurement, surveillance and control and envisioned to enable applications for oceanographic data collection, ocean sampling, environmental and pollution monitoring, offshore exploration, disaster prevention, tsunami and seaquake warning, assisted navigation, distributed tactical surveillance, and mine reconnaissance. The idea of applying sensor networks into underwater environments (i.e., forming underwater sensor networks) has received increasing interests in monitoring aquatic environments for scientific, environmental, commercial, safety, and military reasons. The data obtained by observing around the environment are wireless-transmitted by a radio set with various waves. According to the technical development of the medium set, some parameters restricted in observing the ocean have been gradually developed with the solution of power, distance, and corrosion and watertight by the seawater. The actual matters such as variety of required data, real-time observation, and data transmission, however, have not enough been improved just as various telecommunication systems on the land. In this paper, a wireless management system will be studied through a setup of wireless network available at fishery around the coast, real-time environmental observation with RF sensor, and data collection by a sensing device at the coastal areas.

  • PDF

Adaptive OFDMA with Partial CSI for Downlink Underwater Acoustic Communications

  • Zhang, Yuzhi;Huang, Yi;Wan, Lei;Zhou, Shengli;Shen, Xiaohong;Wang, Haiyan
    • Journal of Communications and Networks
    • /
    • v.18 no.3
    • /
    • pp.387-396
    • /
    • 2016
  • Multiuser communication has been an important research area of underwater acoustic communications and networking. This paper studies the use of adaptive orthogonal frequency-division multiple access (OFDMA) in a downlink scenario, where a central node sends data to multiple distributed nodes simultaneously. In practical implementations, the instantaneous channel state information (CSI) cannot be perfectly known by the central node in time-varying underwater acoustic (UWA) channels, due to the long propagation delays resulting from the low sound speed. In this paper, we explore the CSI feedback for resource allocation. An adaptive power-bit loading algorithm is presented, which assigns subcarriers to different users and allocates power and bits to each subcarrier, aiming to minimize the bit error rate (BER) under power and throughput constraints. Simulation results show considerable performance gains due to adaptive subcarrier allocation and further improvement through power and bit loading, as compared to the non-adaptive interleave subcarrier allocation scheme. In a lake experiment, channel feedback reduction is implemented through subcarrier clustering and uniform quantization. Although the performance gains are not as large as expected, experiment results confirm that adaptive subcarrier allocation schemes based on delayed channel feedback or long term statistics outperform the interleave subcarrier allocation scheme.

A Block-based Uniformly Distributed Random Node Arrangement Method Enabling to Wirelessly Link Neighbor Nodes within the Communication Range in Free 3-Dimensional Network Spaces (장애물이 없는 3차원 네트워크 공간에서 통신 범위 내에 무선 링크가 가능한 블록 기반의 균등 분포 무작위 노드 배치 방법)

  • Lim, DongHyun;Kim, Changhwa
    • Journal of Korea Multimedia Society
    • /
    • v.25 no.10
    • /
    • pp.1404-1415
    • /
    • 2022
  • The 2-dimensional arrangement method of nodes has been used in most of RF (Radio Frequency) based communication network simulations. However, this method is not useful for the an none-obstacle 3-dimensional space networks in which the propagation delay speed in communication is very slow and, moreover, the values of performance factors such as the communication speed and the error rate change on the depth of node. Such a typical example is an underwater communication network. The 2-dimensional arrangement method is also not useful for the RF based network like some WSNs (Wireless Sensor Networks), IBSs (Intelligent Building Systems), or smart homes, in which the distance between nodes is short or some of nodes can be arranged overlapping with their different heights in similar planar location. In such cases, the 2-dimensional network simulation results are highly inaccurate and unbelievable so that they lead to user's erroneous predictions and judgments. For these reasons, in this paper, we propose a method to place uniformly and randomly communication nodes in 3-dimensional network space, making the wireless link with neighbor node possible. In this method, based on the communication rage of the node, blocks are generated to construct the 3-dimensional network and a node per one block is generated and placed within a block area. In this paper, we also introduce an algorithm based on this method and we show the performance results and evaluations on the average time in a node generation and arrangement, and the arrangement time and scatter-plotted visualization time of all nodes according to the number of them. In addition, comparison with previous studies is conducted. As a result of evaluating the performance of the algorithm, it was found that the processing time of the algorithm was proportional to the number of nodes to be created, and the average generation time of one node was between 0.238 and 0.28 us. ultimately, There is no problem even if a simulation network with a large number of nodes is created, so it can be sufficiently introduced at the time of simulation.