• 제목/요약/키워드: 노드배치

Search Result 364, Processing Time 0.026 seconds

Fixed node reduction technique using relative coordinate estimation algorithm (상대좌표 추정 알고리즘을 이용한 고정노드 저감기법)

  • Cho, Hyun-Jong;Kim, Jong-Su;Lee, Sung-Geun;Kim, Jeong-Woo;Seo, Dong-Hoan
    • Journal of Advanced Marine Engineering and Technology
    • /
    • v.37 no.2
    • /
    • pp.220-226
    • /
    • 2013
  • Recently, with the rapid development of factory automation and logistics system, a few workers were able to manage the broad workplace such as large vessels and warehouse. To estimate the exact location of these workers in the conventional wireless indoor localization systems, three or more fixed nodes are generally used to recognize the location of a mobile node consisting of a single node. However, these methods are inefficient in terms of node deployment because the broad workplace requires a lot of fixed nodes compared to workers(mobile nodes). Therefore, to efficiently deploy fixed nodes in these environments that need a few workers, this paper presents a novel estimation algorithm which can reduce the number of fixed nodes by efficiently recognizing the relative coordinates of two fixed nodes through a mobile node composed of three nodes. Also, to minimize the distance errors between mobile node and fixed node, rounding estimation(RE) technique is proposed. Experimental results show that the error rate of localization is improved, by using proposed RE technique, 90.9% compared to conventional trilateration in the free space. In addition, despite the number of fixed nodes can be reduced by up to 50% in the indoor free space, the proposed estimation algorithm recognizes precise location which has average error of 0.15m.

A Cost-Efficient Energy Supply Sources Deployment Scheme in Wireless Sensor Networks (센서 네트워크 바용 절감을 위한 에너지 공급장치 배치 기법)

  • Choi, Yun-Bum;Kim, Yong-Ho;Kim, Jae-Joon;Kim, Hoon
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.36 no.6B
    • /
    • pp.738-743
    • /
    • 2011
  • This paper considers the cost minimization issue for sensor network systems where sensor energy is supplied by remote energy sources wirelessly. Assuming symmetric structures of sensor nodes and energy sources, cost minimization problem is formulated, where the cost of sensor networks is represented as a function of sensor node density and energy source coverage. The optimal solution for the problem is provided and simulation results show that the proposal scheme achieves around 19% cost reduction in comparision to a conventional scheme.

Fixed Partitioning Methods for Extending lifetime of sensor node for Wireless Sensor Networks (WSN환경에서 센서노드의 생명주기 연장을 위한 고정 분할 기법)

  • Han, Chang-Su;Cho, Young-Bok;Woo, Sung-Hee;Lee, Sang-Ho
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.20 no.5
    • /
    • pp.942-948
    • /
    • 2016
  • WSN based on wireless sensor nodes, Sensor nodes can not be reassigned and recharged if they once placed. Each sensor node comes into being involved to a communication network with its limited energy. But the existing proposed clustering techniques, being applied to WSN environment with irregular dispersion of sensor nodes, have the network reliability issues which bring about a communication interruption with the local node feature of unbalanced distribution in WSN. Therefore, the communications participation of the sensor nodes in the suggested algorithm is extended by 25% as the sensor field divided in the light of the non-uniformed distribution of sensor nodes and a static or a dynamic clustering algorithm adopted according to its partition of sensor node density in WSN. And the entire network life cycle was extended by 14% to ensure the reliability of the network.

RRA : Ripple Routing Algorithm Considering the RF-Coverage of the node in WSN (RRA : 무선센서 네트워크에서 노드의 통신영역을 고려한 랜덤 배치 고정형 라우팅 알고리즘)

  • Lee, Doo-Wan;Kim, Min-Je;Jang, Kyung-Sik
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2011.10a
    • /
    • pp.820-823
    • /
    • 2011
  • WSN is composed of a lot of small sensors with the limited hardware resources. In WSN, at the initial stage, sensor nodes are randomly deployed over the region of interest, and self-configure the clustered networks by grouping a bunch of sensor nodes and selecting a cluster header among them. In this paper, we propose a self-configuration routing protocol for WSN, which consists of step-wise ripple routing algorithm for initial deployment, effective joining of sensor nodes. RRA is search node in RF-coverage of each node, which result in fast network connection, reducing overall power consumption, and extending the lifetime of network.

  • PDF

A study on the application of the shared node policy of the job batch scheduler to maximize the utilization rate of computational resources of cluster system (클러스터 시스템의 계산자원 활용률을 극대화하기 위한 작업배치스케줄러의 공유노드 정책 적용 방안 연구)

  • Kwon, Min-Woo;Yoon, JunWeon;Hong, TaeYoung
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2022.05a
    • /
    • pp.4-7
    • /
    • 2022
  • 작업배치스케줄러는 다수의 사용자에게 클러스터 시스템의 계산 자원을 효과적으로 제공하는 유용한 시스템 소프트웨어이다. 한국과학기술정보연구원에서는 작업배치스케줄러인 PBS와 SLURM을 이용하여 슈퍼컴퓨터 5호기 메인시스템인 누리온과 뉴론을 각각 공동활용서비스하고 있다. 본 논문에서는 뉴론의 제한된 계산자원을 다수의 연구자들에게 효율적으로 서비스하기 위해 SLURM 작업배치스케줄러의 공유노드 정책을 적용하는 방안과 작업통계 분석 기법을 소개한다.

A pairwise key establishment scheme for USN (U-센서네트워크에서의 Pairwise key 설정 기법)

  • Lee, Kyoung-Hyo;Jung, Seok-Won;Oh, Byeong-Kyun
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2006.10c
    • /
    • pp.552-555
    • /
    • 2006
  • 센서네트워크는 유비쿼터스 컴퓨팅 사회에서 핵심 기술로 부각되고 있다. 이러한 센서네트워크는 노드들이 노출되거나 데이터 전송 시 일반 네트워크보다 보안에 취약하므로 안전한 통신을 위하여 센서 노드간 키를 설정하는 것은 보안을 위한 기본적인 요구사항이 되고 있다. 본 논문에서는 배치된 센서네트워크에서 셋업서버의 오버헤드를 줄이기 위하여 네트워크를 클러스터링하고 각 셀 안에 클러스터 헤더와 노드들을 배치한 후 클러스터내의 노드사이의 안전한 통신을 하기위한 pairwise key를 설정하는 기법을 제안하였다.

  • PDF

A Key Management Scheme for Wireless Sensor Networks using Self-Positioning with Deployment Knowledge (센서 네트워크에서의 자가 위치 추정을 이용한 키 분배 메커니즘)

  • Kim, Eun-Ah;Doh, In-Shil;Chae, Ki-Joon
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2005.07a
    • /
    • pp.205-207
    • /
    • 2005
  • 센서 네트워크는 않은 수의 센서 노드들로 구성된 네트워크로 센서를 통한 주변 정보 감지 및 감지된 정보를 처리하는 기능을 수행한다. 최근 유비쿼터스 컴퓨팅 개념의 도입과 함께 이를 실생활에 구현하기 위한 기반 기술로 큰 관심을 모으고 있다. 그러나 센서 네트워크의 일상 생활 시스템에서의 의존도가 높아질수록 이로 인한 위험성 또한 높아 질 수밖에 없다. 본 논문에서는 센서 네트워크에서의 보안 서비스를 제공하기 위하여 필수적인 키 관리 기술을 고찰하고 효율적인 키 관리 방법을 제안하고자 한다. 센서 네트워크의 구축 시 센서 노드들의 배치 특성을 고려하여 키 스트링 풀을 설정하고, 배치된 센서 노드의 위치에 따라 필요한 키를 집중적으로 분배하여 센서 네트워크 내의 공통 키 설정 확률을 높이고 센서 노드의 메모리 소모량을 줄이는 키 관리 방법을 고안하였다.

  • PDF

Implementing Dynamic Reconfiguration in Sensor Network Operating System SenOS (센서 네트워크용 운영체제 SenOS에서 동적 재구성 기능 구현)

  • Kim, Do-Hyuk;Kim, Min-Kyu;Kim, Tae-Hyung
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2006.10a
    • /
    • pp.390-394
    • /
    • 2006
  • 센서 노드는 정보 수집, 데이터 통신, 협력을 통한 모니터링과 같은 작업들을 수행하기 위해 군사 작전 지역, 산업 시설, 생태 환경 등에 배치된다. 응용 프로그램과 운영체제가 설치된 센서 노드를 센서 필드에 배치하고 나면 센서 노드는 쉽게 수거되기 어렵고 재프로그래밍을 위한 물리적인 연결이 힘들게 되어 응용의 변화에 따른 새로운 응용 프로그램의 설치, 수정과 같은 업데이트가 쉽지 않다. 또한 제한적인 시스템 자원을 가진 센서 노드의 특성상 이러한 재구성 기능은 업데이트에 사용되는 비용이 고려 되어야한다. 본 논문에서는 유한 상태 머신 (finite state machine) 기반의 운영체제인 SenOS에서 응용의 변화에 대처할 수 있도록 동적 재구성 기능이 구현된 형태와 특징을 기술한다.

  • PDF

A Simulation of Mobile Base Station Placement for HAP based Networks by Clustering of Mobile Ground Nodes (지상 이동 노드의 클러스터링을 이용한 HAP 기반 네트워크의 이동 기지국 배치 시뮬레이션)

  • Song, Ha-Yoon
    • Journal of Korea Multimedia Society
    • /
    • v.11 no.11
    • /
    • pp.1525-1535
    • /
    • 2008
  • High Altitude Platform (HAP) based networks deploy network infrastructures of Mobile Base Station (MBS) in a form of Unmanned Aerial Vehicle (UAV) at stratosphere in order to build network configuration. The ultimate goal of HAP based network is a wireless network service for wide area by deploying multiple MBS for such area. In this paper we assume multiple UAVs over designated area and solve the MBS placement and coverage problem by clustering the mobile ground nodes. For this study we assumed area around Cheju island and nearby naval area where multiple mobile and fixed nodes are deployed and requires HAP based networking service. By simulation, visual results of stratospheric MBS placement have been presented. These results include clustering, MBS placement and coverage as well as dynamic reclustering according to the movement of mobile ground nodes.

  • PDF

Search-Oriented Deployment Strategies using GIS for Wireless Sensor Networks (무선센서 네트워크 성능 향상을 위한 지리정보시스템 기반 탐색 지향적 센서배치 기법)

  • Kim, June-Kyoung;O, Nam-Geol;Kim, Jae-Joon;Lee, Young-Moo;Kim, Hoon;Jung, Bang-Chul
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.34 no.10B
    • /
    • pp.973-980
    • /
    • 2009
  • Many studies which have been done for efficient installation and management of wireless sensor networks (WSN) include energy savings, key managements and sensor deployments. Sensor deployment problem is one of the most important and fundamental issues among them in that the topic is directly related with the system cost and performance. In this paper, we suggest a sensor deployment scheme that reduces the system cost of WSN while satisfying the fundamental system requirements of connectivity between sensor nodes and sensing coverage. Using graphical information system(GIS) which contains region-dependent information related with connectivity condition, the initial positions of sensors in the procedure simulated annealing (SA) are determined. The GIS information helps in reducing system cost reduction not only at the initial deployment of SA but also at the final deployment of SA which is shown by computer simulations.