• Title/Summary/Keyword: Sensor nodes

Search Result 2,025, Processing Time 0.031 seconds

A Power Management Unit for Solar Energy Harvesting (빛 에너지 하베스팅을 위한 전력관리회로)

  • Yoon, Eun-Jung;Hwang, In-Ho;Park, Jong-Tae;Yu, Chong-Gun
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2012.10a
    • /
    • pp.267-271
    • /
    • 2012
  • In this paper a power management unit for solar energy harvesting is proposed. If solar energy is sufficient, Power Management Unit(PMU) directly supplies load with solar energy. By contrast, if solar energy is insufficient to operate sensor nodes, voltage booster(VB) boosts the solar cell's output voltage, and then PMU supplies load with the harvested energy. The designed circuit had been fabricated using a 018um CMOS process. In the first case, the PMU supplies load with more energy than in the second case. In the second case where a VB is used, the PMU operates to supply load with solar energy even when illumination is low and minimum solar cells with very low output voltage are used.

  • PDF

A Performance Comparison of On-Demand Routing Protocols for Application Services in MANET (MANET에서 응용 서비스 데이터 유형에 따른 요구기반 라우팅 프로토콜의 성능비교)

  • Jang Jun-Young;Lee Kil-Sup;Lee Sung Jong
    • The KIPS Transactions:PartC
    • /
    • v.11C no.7 s.96
    • /
    • pp.871-878
    • /
    • 2004
  • Recenty, there has been great interest in MANET from various areas. In this paper we focus on performance analysis of on demand routing protocols surf as DSR, AODV, and TORA in MANET. We have conducted several simulations concerned with application service data such as sensor, text. voice, and video data. And then, we have evaluated the performance of three protocols in a pre-designed ad hoc network, which is consisted of 20 nodes. As a result, we have obtained quantitative data for packet delivery fraction, average end to-end delay, routing load, channel utilization from upper layer and supportable routing protocol for application service data. The results can be used for designing specific-purposed ad-hoc networks.

A Study on UWB Ranging and Positioning Technique using Common Clock (공통 클럭을 이용한 UWB 거리 인지 및 무선 측위 기술 연구)

  • Park, Jae-Wook;Choi, Yong-Sung;Lee, Soon-Woo;Lee, Won-Cheol
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.35 no.12A
    • /
    • pp.1128-1135
    • /
    • 2010
  • A wireless positioning system using ultra-wideband (UWB) for indoor wireless positioning uses ranging data in order to accurately estimate location. Commonly, ranging uses time of arrival (TOA), time difference of arrival (TDOA) based on arrival time. The most fundamental issue in the ranging for wireless positioning is to obtain clock synchronization among the sensor nodes and to correct an error caused by the relative clock offset from each node. In this paper, we propose ranging and positioning technique using common clock in order to solve both clock synchronization and clock offset problems. To verify the performance of proposed, we simulated ranging and positioning in channel model introduced by IEEE 802.15.4a Task Group and then results show that location estimation is unaffected by clock offset.

Traffic Adaptive Transmission Algorithm for Energy Efficiency in WBAN (WBAN 환경에서 에너지 효율을 고려한 트래픽 적응형 전송 알고리즘)

  • Kim, Jinhyuk;Hong, Changki;Choi, Sangbang
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.38B no.5
    • /
    • pp.315-327
    • /
    • 2013
  • Wireless Body Area Network (WBAN) is a network around a human body within 3~5m which consists of medical or non-medical device. WBAN has to satisfy many kinds of demands such as low-power, a variety of data rate and a data priority. Especially, it is hard for the nodes for monitoring vital signs to replace battery. Thus energy and channel efficiency is important because the battery power is limited. In this thesis, a novel algorithm for reducing the energy consumption is proposed. The proposed algorithm adjusts transmission period according to traffic. by means of determining transmission period by amount of data, the node can reduce energy consumption. Energy detection is performed in order to guarantee data priority before attempting to transmit. In case of failing to transmit, it is proposed that energy consumption is reduced through avoiding collision by changing priority. The comparison result shows that the proposed algorithm reduces power consumption and increasing maximum channel efficiency by avoiding collision.

Performance Evaluation of Real-Time Power-Aware Scheduling Techniques Incorporating Idle Time Distribution Policies (실행 유휴 시간 분배 정책에 따른 실시간 전력 관리 스케줄링 기법의 성능 평가)

  • Tak, Sungwoo
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.18 no.7
    • /
    • pp.1704-1712
    • /
    • 2014
  • The unused Worst-Case Execution Time (WCET) allocated to a real-time task occurs when the actual execution time of the task can be far less than the WCET preassigned to the task for a schedulability test. Any unused WCET allocated to the task can be exploited to reduce the power consumption of battery-powered sensor nodes through real-time power-aware scheduling techniques. From the distribution perspective of the unused WCET, the unused WCET distribution policy is classified into three types: Conservative Unused WCET (CU-WCET), Moderate Unused WCET (MU-WCET), and Aggressive Unused WCET (AU-WCET) distribution policies. We evaluated the performance of real-time power-aware scheduling techniques incorporating each of three unused WCET distribution policies in terms of low power consumption.

Energy-Efficient Clustering Scheme using Candidates Nodes of Cluster Head (클러스터헤더 후보노드를 이용한 에너지 효율적인 클러스터링 방법)

  • Cho, Young-Bok;Kim, Kwang-Deuk;You, Mi-Kyeong;Lee, Sang-Ho
    • Journal of the Korea Society of Computer and Information
    • /
    • v.16 no.3
    • /
    • pp.121-129
    • /
    • 2011
  • One of the major challenges of minimum energy consumption for wireless sensor networks(WSN) environment. LEACH protocol is hierarchical routing protocol that obtains energy efficiency by using clustering. However, LEACH protocol in each round, because the new cluster configuration, cluster configuration, whenever the energy consumed shorten the life of the network. Therefore in this paper, the cluster is formed in WSN environment in early stage and the problems with energy waste have been solved by selecting C-node. In the initial round of proposed model uses 26 percent more than traditional LEACH energy consumption. However, as the round is ongoing, it has been proved by the network simulation tool that the waste of energy could be diminished up to 35%.

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.

Systematic Network Coding for Computational Efficiency and Energy Efficiency in Wireless Body Area Networks (무선 인체 네트워크에서의 계산 효율과 에너지 효율 향상을 위한 시스테매틱 네트워크 코딩)

  • Kim, Dae-Hyeok;Suh, Young-Joo
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.36 no.10A
    • /
    • pp.823-829
    • /
    • 2011
  • Recently, wireless body area network (WBAN) has received much attention as an application for the ubiquitous healthcare system. In WBAN, each sensor nodes and a personal base station such as PDA have an energy constraint and computation overhead should be minimized due to node's limited computing power and memory constraint. The reliable data transmission also must be guaranteed because it handles vital signals. In this paper, we propose a systematic network coding scheme for WBAN to reduce the network coding overhead as well as total energy consumption for completion the transmission. We model the proposed scheme using Markov chain. To minimize the total energy consumption for completing the data transmission, we made the problem as a minimization problem and find an optimal solution. Our simulation result shows that large amount of energy reduction is achieved by proposed systematic network coding. Also, the proposed scheme reduces the computational overhead of network coding imposed on each node by simplify the decoding process.

Routing Protocol of Shipping Container Network suitable for Port/Yard Stacking Environment: SAPDS(Simple Alternative Path Destined for Sink node) (항만/야적장 적치 환경에 적합한 컨테이너 네트워크 라우팅 프로토콜: SAPDS(Simple Alternative Path Destined for Sink node))

  • Kwark, Gwang-Hoon;Lee, Jae-Kee
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.36 no.6B
    • /
    • pp.728-737
    • /
    • 2011
  • For the real time monitoring and tracking of shipping container which is one of the core objects for global logistics, Wireless Ad-Hoc Network technology might be needed in stacking environments such as ports, yards and ships. In this paper, we propose a container network routing protocol suitable for port or yard stacking environments which include some constraints such as shadow area problem from metal material, frequent movement of container, etc. With this protocol in which a mesh network algorithm is applied, every container data packet can be delivered to the sink node reliably even with frequent join/leave of container nodes. As soon as a node on path gets malfunction, alternative backup path is supported with notice to neighbor node, which makes constant total optimal path. We also verified that the performance of proposed protocol is better than AODV, one of previous major MANet(Mobile Ad-Hoc Network) protocol with a function for alternative path, which says the proposed protocol is better for frequent join/leave and variable link quality.

Location Estimation for Multiple Targets Using Tree Search Algorithms under Cooperative Surveillance of Multiple Robots (다중로봇 협업감시 시스템에서 트리 탐색 기법을 활용한 다중표적 위치 좌표 추정)

  • Park, So Ryoung;Noh, Sanguk
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.38A no.9
    • /
    • pp.782-791
    • /
    • 2013
  • This paper proposes the location estimation techniques of distributed targets with the multi-sensor data perceived through IR sensors of the military robots. In order to match up targets with measured azimuths, we apply the maximum likelihood (ML), depth-first, and breadth-first tree search algorithms, in which we use the measured azimuths and the number of pixels on IR screen for pruning branches and selecting candidates. After matching up targets with azimuths, we estimate the coordinate of each target by obtaining the intersection point of the azimuths with the least square error (LSE) algorithm. The experimental results show the probability of missing target, mean of the number of calculating nodes, and mean error of the estimated coordinates of the proposed algorithms.