• 제목/요약/키워드: Wireless Sensor networks

검색결과 2,280건 처리시간 0.026초

계층적 클러스터링을 기반으로 하는 무선 센서 네트워크의 Throughput 과 Availability 평가 (Assessing Throughput and Availability based on Hierarchical Clustering in Wireless Sensor Networks)

  • 이준혁;오영환
    • 한국신뢰성학회지:신뢰성응용연구
    • /
    • 제5권4호
    • /
    • pp.465-486
    • /
    • 2005
  • A unreliable network system results in unsatisfied performance. A performance criterion of a network is throughput and availability. One of the most compelling technological advances of this decade has been the advent of deploying wireless networks of heterogeneous smart sensor nodes for complex information gathering tasks, The advancement and popularization of wireless communication technologies make more efficiency to network devices with wireless technology than with wired technology. Recently, the research of wireless sensor network has been drawing much attentions. In this paper, We evaluate throughput and availability of wireless sensor network, which have hierarchical structure based on clustering and estimate the maximum hroughput, average throughput and availability of the network considering several link failure patterns likely to happen at a cluster consisted of sensor nodes. Also increasing a number of sensor nodes in a cluster, We analysis the average throughput and availability of the network.

  • PDF

무선 센서 네트워크에서의 분산 컴퓨팅 모델 (Distributed Computing Models for Wireless Sensor Networks)

  • 박총명;이충산;조영태;정인범
    • 정보과학회 논문지
    • /
    • 제41권11호
    • /
    • pp.958-966
    • /
    • 2014
  • 무선 센서 네트워크는 분산처리 환경을 제공해준다. 센서 노드들은 계산 능력, 네트워크 대역폭, 전력 등이 제한된 환경에서 배치되고 스스로 네트워크를 구성하여 수집된 데이터들을 싱크노드로 전송한다. 이런 전형적인 무선 센서 네트워크에서는 네트워크 패킷들 간의 충돌이 발생하며 이로 인해 네트워크 수명이 단축된다. 클러스터링과 네트워크 내부처리는 네트워크 내부의 패킷을 줄여 문제점을 해결한다. 제한된 에너지를 가진 센서 노드가 가능한 오랫동안 동작하게 하는 것이 큰 이슈이기 때문에 많은 연구들이 에너지 절약에 중점을 두고 진행되고 있다. 하지만 본 논문에서는 프로세싱 타임라인에 기반을 둔 협력 처리 모델을 제안한다. 이 모델은 처리의 검증, 총 실행시간의 예측, 무선 센서 네트워크에서 분산 처리에 필요한 최적의 노드 개수의 결정 등을 포함한다. 제안된 모델의 정확성을 실험을 통해 나타내고, 사례 연구로 이 모델이 분산처리 어플리케이션에 사용가능함을 보인다.

무선 센서 네트워크에서 유니캐스트를 위한 에너지 효율적인 라우팅 프로토콜 (An Energy Efficient Routing Protocol for Unicast in Wireless Sensor Networks)

  • 한욱표;이희춘;정영준
    • 한국정보과학회논문지:정보통신
    • /
    • 제34권4호
    • /
    • pp.262-268
    • /
    • 2007
  • 무선 센서 네트워크의 각 센서 노드는 배터리 기반의 제한된 에너지로 동작하기 때문에 무선센서 네트워크에서의 효율적인 에너지 사용에 많은 연구가 이루어지고 있다. 무선 센서 네트워크의 수명을 연장하기 위해서는 전체 네트워크의 전력소비를 줄이는 것도 필요하지만 보다 중요한 것은 센서 노드들의 균일한 에너지 소비를 유도하는 것이다. 무선 센서 네트워크와 같이 많은 수의 센서 노드가 조밀하게 분포되어 긴밀한 협업을 통해 정보를 모으고 전달하는 유기적인 시스템에서는 가능한 많은 노드들이 생존하는 것이 망의 수명에 더욱 중요한 요인이 된다. 본 논문에서는 무선 센서 네트워크에서 Ad Hoc 라우팅 프로토콜인 AODV를 기반으로 수집된 자료를 목표지점까지 전달하는데 소수의 특정 노드들에 트래픽이 집중되지 않게 하여 전체 네트워크의 수명을 연장하는 에너지 인식 라우팅 기법을 제안한다. 제안한 프로토콜에 대해서 시뮬레이션을 기반으로 네트워크 수명과 종단 간 지연 등의 성능 지표에 대한 분석을 수행하였다.

Dynamic Clustering Based on Location in Wireless Sensor Networks with Skew Distribution

  • Kim, Kyung-Jun;Kim, Jung-Gyu
    • 한국정보기술응용학회:학술대회논문집
    • /
    • 한국정보기술응용학회 2005년도 6th 2005 International Conference on Computers, Communications and System
    • /
    • pp.27-30
    • /
    • 2005
  • Because of unreplenishable power resources, reducing node energy consumption to extend network lifetime is an important requirement in wireless sensor networks. In addition both path length and path cost are important metrics affecting sensor lifetime. We propose a dynamic clustering scheme based on location in wireless sensor networks. Our scheme can localize the effects of route failures, reduce control traffic overhead, and thus enhance the reachability to the destination. We have evaluated the performance of our clustering scheme through a simulation and analysis. We provide simulation results showing a good performance in terms of approximation ratios.

  • PDF

A Simple Energy Harvesting Algorithm for Wireless Sensor Networks

  • Encarnacion, Nico N.;Yang, Hyunho
    • Journal of information and communication convergence engineering
    • /
    • 제10권4호
    • /
    • pp.359-364
    • /
    • 2012
  • Harvesting energy from the environment is essential for many applications to slow down the deterioration of energy of the devices in sensor networks and in general, the network itself. Energy from the environment is an inexhaustible supply which, if properly managed and harvested from the sources, can allow the system to last for a longer period - more than the expected lifetime at the time of deployment, or even last indefinitely. The goal of this study is to develop a simple algorithm for ns-2 to simulate energy harvesting in wireless sensor network simulations. The algorithm is implemented in the energy module of the simulator. Energy harvesting algorithms have not yet been developed for ns-2. This study will greatly contribute to the existing knowledge of simulating wireless sensor networks with energy harvesting capabilities in ns-2. This paper will also serve as a basis for future research papers that make use of energy harvesting.

WiSeMote: a novel high fidelity wireless sensor network for structural health monitoring

  • Hoover, Davis P.;Bilbao, Argenis;Rice, Jennifer A.
    • Smart Structures and Systems
    • /
    • 제10권3호
    • /
    • pp.271-298
    • /
    • 2012
  • Researchers have made significant progress in recent years towards realizing effective structural health monitoring (SHM) utilizing wireless smart sensor networks (WSSNs). These efforts have focused on improving the performance and robustness of such networks to achieve high quality data acquisition and distributed, in-network processing. One of the primary challenges still facing the use of smart sensors for long-term monitoring deployments is their limited power resources. Periodically accessing the sensor nodes to change batteries is not feasible or economical in many deployment cases. While energy harvesting techniques show promise for prolonging unattended network life, low power design and operation are still critically important. This research presents the WiSeMote: a new, fully integrated ultra-low power wireless smart sensor node and a flexible base station, both designed for long-term SHM deployments. The power consumption of the sensor nodes and base station has been minimized through careful hardware selection and the implementation of power-aware network software, without sacrificing flexibility and functionality.

Topological Boundary Detection in Wireless Sensor Networks

  • Dinh, Thanh Le
    • Journal of Information Processing Systems
    • /
    • 제5권3호
    • /
    • pp.145-150
    • /
    • 2009
  • The awareness of boundaries in wireless sensor networks has many benefits. The identification of boundaries is especially challenging since typical wireless sensor networks consist of low-capability nodes that are unaware of their geographic location. In this paper, we propose a simple, efficient algorithm to detect nodes that are near the boundary of the sensor field as well as near the boundaries of holes. Our algorithm relies purely on the connectivity information of the underlying communication graph and does not require any information on the location of nodes. We introduce the 2-neighbor graph concept, and then make use of it to identify nodes near boundaries. The results of our experiment show that our algorithm carries out the task of topological boundary detection correctly and efficiently.

센서 네트워크에서 기계학습을 사용한 잔류 전력 추정 방안 (A Residual Power Estimation Scheme Using Machine Learning in Wireless Sensor Networks)

  • 배시규
    • 한국멀티미디어학회논문지
    • /
    • 제24권1호
    • /
    • pp.67-74
    • /
    • 2021
  • As IoT(Internet Of Things) devices like a smart sensor have constrained power sources, a power strategy is critical in WSN(Wireless Sensor Networks). Therefore, it is necessary to figure out the residual power of each sensor node for managing power strategies in WSN, which, however, requires additional data transmission, leading to more power consumption. In this paper, a residual power estimation method was proposed, which uses ignorantly small amount of power consumption in the resource-constrained wireless networks including WSN. A residual power prediction is possible with the least data transmission by using Machine Learning method with some training data in this proposal. The performance of the proposed scheme was evaluated by machine learning method, simulation, and analysis.

Cooperative Synchronization and Channel Estimation in Wireless Sensor Networks

  • Oh Mi-Kyung;Ma Xiaoli;Giannakis Georgios B;Park Dong-Jo
    • Journal of Communications and Networks
    • /
    • 제7권3호
    • /
    • pp.284-293
    • /
    • 2005
  • A critical issue in applications involving networks of wireless sensors is their ability to synchronize, and mitigate the fading propagation channel effects. Especially when distributed 'slave' sensors (nodes) reach-back to communicate with the 'master' sensor (gateway), low power cooperative schemes are well motivated. Viewing each node as an antenna element in a multi-input multi-output (MIMO) multi-antenna system, we design pilot patterns to estimate the multiple carrier frequency offsets (CFO), and the multiple channels corresponding to each node-gateway link. Our novel pilot scheme consists of non-zero pilot symbols along with zeros, which separate nodes in a time division multiple access (TDMA) fashion, and lead to low complexity schemes because CFO and channel estimators per node are decoupled. The resulting training algorithm is not only suitable for wireless sensor networks, but also for synchronization and channel estimation of single- and multi-carrier MIMO systems. We investigate the performance of our estimators analytically, and with simulations.

Distributed Prevention Mechanism for Network Partitioning in Wireless Sensor Networks

  • Wang, Lili;Wu, Xiaobei
    • Journal of Communications and Networks
    • /
    • 제16권6호
    • /
    • pp.667-676
    • /
    • 2014
  • Connectivity is a crucial quality of service measure in wireless sensor networks. However, the network is always at risk of being split into several disconnected components owing to the sensor failures caused by various factors. To handle the connectivity problem, this paper introduces an in-advance mechanism to prevent network partitioning in the initial deployment phase. The approach is implemented in a distributed manner, and every node only needs to know local information of its 1-hop neighbors, which makes the approach scalable to large networks. The goal of the proposed mechanism is twofold. First, critical nodes are locally detected by the critical node detection (CND) algorithm based on the concept of maximal simplicial complex, and backups are arranged to tolerate their failures. Second, under a greedy rule, topological holes within the maximal simplicial complex as another potential risk to the network connectivity are patched step by step. Finally, we demonstrate the effectiveness of the proposed algorithm through simulation experiments.