• Title/Summary/Keyword: Underwater sensor networks

Search Result 96, Processing Time 0.032 seconds

Energy Efficient Routing Protocol of Underwater Sensor Networks in the Deep Ocean (에너지 효율을 고려한 수중 센서 네트워크 라우팅 기법)

  • Kim, Eun-Jo;Kim, Dae-Young
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2007.10d
    • /
    • pp.294-299
    • /
    • 2007
  • 수중 센서 네트워크에서는 물 속이라는 환경적 특성으로 인해 네트워크 구성에 있어서 많은 어려움이 있다. 무엇보다도 배터리를 지속적으로 공급받거나 충전시킬 수 없기 때문에 배터리 고갈로 인한 센서노드의 손실이 발생하고 이는 전체 센서 네트워크 연결을 방해하는 요소로 작용하게 된다. 따라서 본 논문에서는 지역적으로 소스 라우팅 기법을 적용하여 에너지 소비를 줄이는 라우팅 기법을 제안하였다. 먼저 수중 통신에 사용되는 음파와 에너지와의 관계식을 유도한 뒤에 에너지 소비에 중요하게 작용하는 변수들을 이끌어 냈다. 깊은 바다에 설치된 센서 네트워크에서는 깊이에 따른 환경 변수들의 값이 달라질 수 있기 때문에 링크 메트릭에 영향을 줄 수 있음을 확인했고 이를 바탕으로 에너지 소비에 미치는 환경변수들의 영향도와 제안된 라우팅 기법이 에너지 소비에 미치는 영향을 시뮬레이션을 통해 확인하였다.

  • PDF

An Energy Efficient Clustering Mechanism in Underwater Acoustic Sensor Networks (수중 음향 센서 네트워크에서의 에너지 효율적인 클러스터링 메커니즘)

  • Yun, Phil-Jung;Kim, Chang-Hwa;Kim, Sang-Kyung
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2008.05a
    • /
    • pp.881-884
    • /
    • 2008
  • 수중 음향 센서 네트워크는 무선 센서 네트워크의 한 분야로서 활발하게 연구되고 있다. 하지만 무선 센서 네트워크에서의 지상이라는 환경은 수중 음향 센서 네트워크에서의 수중이라는 환경과 많은 차이가 있다. 예를 들어 수중에서는 지상에서 보다 더 많은 통신 에너지를 필요로 하며 현재 단일채널 밖에 사용할 수 없다. 그러므로 수중 음향 센서 네트워크에서 무선 센서 네트워크의 메커니즘을 그대로 사용하기에는 적합하지 않다. 본 논문에서는 수중 음향 센서 네트워크에서의 에너지 효율적 클러스터링 메커니즘을 제안한다. 제안하는 클러스터링 메커니즘은 단일채널의 수중환경을 대상으로 클러스터 내 통신에서 발생하는 충돌문제를 최소화하여 에너지 효율을 증가시키기 위해 하향식방법을 이용하여 클러스터 헤드 노드를 선정하고 선정된 클러스터 헤드 노드를 중심으로 클러스터 범위를 결정하는 방법을 제시한다.

Delayed CTS Transmission Scheme for Fairness Enhancement in UWASNs (수중 센서네트워크에서 공평성을 위한 CTS 전송 지연 기법)

  • Lee, Dong-Won;Kim, Sun-Myeng;Yang, Yeon-Mo
    • Journal of the Institute of Electronics Engineers of Korea SC
    • /
    • v.49 no.3
    • /
    • pp.19-25
    • /
    • 2012
  • Underwater sensor networks (UWSNs) employ acoustic channels for communications. One of the main characteristics of the underwater acoustic channel is long propagation delay. Previously proposed MAC (medium access control) protocols for wireless sensor networks cannot be directly used in UWSNs due to the long propagation delay. The long propagation delay and uneven nodes deployments cause spatial fairness in UWSNs. Therefore, a new MAC protocol for UWSNs needs to be developed to provide efficient communications. In this paper, we propose an efficient MAC protocol in order to alleviate the fairness problem. In the proposed scheme, when a node receives a RTS packet, it does not immediately send back but delays a CTS packet. The node collects several RTS packets from source nodes during the delay time. It chooses one of the RTS packets based on the queue status information. And then, it sends a CTS packet to the source node which sent the chosen RTS packet. The performance of the proposed scheme is investigated via simulation. Simulation results show that our scheme is effective and alleviates the fairness problem.

A 2MC-based Framework for Sensor Data Loss Decrease in Wireless Sensor Network Failures (무선센서네트워크 장애에서 센서 데이터 손실 감소를 위한 2MC기반 프레임워크)

  • Shin, DongHyun;Kim, Changhwa
    • Journal of the Korea Society for Simulation
    • /
    • v.25 no.2
    • /
    • pp.31-40
    • /
    • 2016
  • Wireless sensor networks have been used in many applications such as marine environment, army installation, etc. The sensor data is very important, because all these applications depend on sensor data. The possibility of communication failures becomes high since the surrounding environment of a wireless sense network has an sensitive effect on its communications. In particular, communication failures in underwater communications occur more frequently because of a narrow bandwidth, slow transmission speed, noises from the surrounding environments and so on. In cases of communication failures, the sensor data can be lost in the sensor data delivery process and these kinds of sensor data losses can make critical huge physical damages on human or environments in applications such as fire surveillance systems. For this reason, although a few of studies for storing and compressing sensor data have been proposed, there are lots of difficulties in actual realization of the studies due to none-existence of the framework using network communications. In this paper, we propose a framework for reducing loss of the sensor data and analyze its performance. The our analyzed results in non-framework application show a decreasing data recovery rate, T/t, as t time passes after a network failure, where T is a time period to fill the storage with sensor data after the network failure. Moreover, all the sensor data generated after a network failure are the errors impossible to recover. But, on the other hand, the analyzed results in framework application show 100% data recovery rate with 2~6% data error rate after data recovery.

Design of Low-Power Hybrid LNA with Multi-Input for Mobile Ultrasound System (이동형 초음파시스템에 적합한 다중 입력방식의 저전력 혼성 저잡음 증폭기 설계)

  • Song, Jae-Yeol;Lee, Kyung-Hoon;Park, Sung-Mo
    • Journal of the Institute of Convergence Signal Processing
    • /
    • v.15 no.2
    • /
    • pp.64-69
    • /
    • 2014
  • Ultrasound system is one of the complex wireless signal processing systems that are widely used in the fields of modern industry such as medical diagnostics, underwater communications, and sensor-networks. Miniaturization of ultrasound system has been raging recently. In this paper, a hybrid LNA that is suitable for miniaturization and mobile diagnostic ultrasound system has been developed. The proposed LNA has low noise figure of less than 5dB, and the feedback resistor is designed to be electrically adjusted in order to attain the impedance-matching for various ultrasound transducers. It supports the whole ultrasound frequencies from 10KHz to 150MHz frequency band and also provides sleep modes. A gain from -18.8 to -29.5 dB is achieved by adjusting each transducer to fit the system character. Power consumption can be reduced up to 90% in similar performance as compared to the existing LNA.

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.