• Title/Summary/Keyword: wsn

Search Result 891, Processing Time 0.027 seconds

High Performance HIGHT Design with Extended 128-bit Data Block Length for WSN (WSN을 위한 128비트 확장된 데이터 블록을 갖는 고성능 HIGHT 설계)

  • Kim, Seong-Youl;Lee, Je-Hoon
    • Journal of Sensor Science and Technology
    • /
    • v.24 no.2
    • /
    • pp.124-130
    • /
    • 2015
  • This paper presents a high performance HIGHT processor that can be applicable for CCM mode. In fact, HIGHT algorithm is a 64-bit block cipher. However, the proposed HIGHT extends the basic block length to 128-bit. The proposed HIGHT is operated as 128-bit block cipher and it can treat 128-bit block at once. Thus, it can be applicable for the various WSN applications that need fast and ultralight 128-bit block cipher, in particular, to be operated in CCM mode. In addition, the proposed HIGHT processor shares the common logics such as 128-bit key scheduler and control logics during encryption and decryption to reduce the area overhead caused by the extension of data block length. From the simulation results, the circuit area and power consumption of the proposed HIGHT are increases as 40% and 64% compared to the conventional 64-bit counterpart. However, the throughput of the proposed HIGHT can be up to two times as fast. Consequently, the proposed HIGHT is useful for USN and handheld devices based on battery as well as RFID tag the size of circuit is less than 5,000 gates.

Wake-up Algorithm of Wireless Sensor Node Using Geometric Probability (기하학적 확률을 이용한 무선 센서 노드의 웨이크 업 알고리즘 기법)

  • Choi, Sung-Yeol;Kim, Sang-Choon;Kim, Seong Kun;Lee, Je-Hoon
    • Journal of Sensor Science and Technology
    • /
    • v.22 no.4
    • /
    • pp.268-275
    • /
    • 2013
  • Efficient energy management becomes a critical design issue for complex WSN (Wireless Sensor Network). Most of complex WSN employ the sleep mode to reduce the energy dissipation. However, it should cause the reduction of sensing coverage. This paper presents new wake-up algorithm for reducing energy consumption in complex WSN. The proposed wake-up algorithm is devised using geometric probability. It determined which node will be waked-up among the nodes having overlapped sensing coverage. The only one sensor node will be waked-up and it is ready to sense the event occurred uniformly. The simulation results show that the lifetime is increased by 15% and the sensing coverage is increased by 20% compared to the other scheduling methods. Consequently, the proposed wake-up algorithm can eliminate the power dissipation in the overlapped sensing coverage. Thus, it can be applicable for the various WSN suffering from the limited power supply.

Improved Relocation Accuracy by Adding Extended Search in Sink Migration Process of WSN (WSN 환경의 싱크 재배치 과정에서 영역 확장 검색 추가를 통한 재배치 정확성 향상)

  • Lee, Tae-Ho;Yoo, Seung-Eon;Lee, Byung-Jun;Kim, Kyung-Tae;You, Hee-Yong
    • Proceedings of the Korean Society of Computer Information Conference
    • /
    • 2019.01a
    • /
    • pp.105-106
    • /
    • 2019
  • 본 논문에서는 무선 센서 네트워크(Wireless Sensor Network, WSN) 환경에 배치되어 물리적 데이터를 감지하는 각 센서들의 데이터를 수집을 위한 싱크(Sink)가 일정 주기로 이동 및 재배치되는 싱크 마이그레이션(Migration) 과정에 있어 다음 배치 위치를 효율적으로 선정하기 위해 클러스터 헤드(Cluster Head, CH)를 기준으로 영역 검색 단계를 추가하여 재배치 정확성 및 효율성 증대 기법을 제안한다. 본 논문에서는 WSN 환경을 바탕으로 싱크 재배치 과정에 해당 기법을 적용하여 시뮬레이션 하였으며, 해당 실험의 결과에 따르면 싱크 재배치의 정확성 및 효율성 증대로 전체 영역에 대한 고른 데이터 수집 및 소모 에너지 균형이 향상되었다.

  • PDF

Dynamic Sink Relocation with Fuzzy Logic for WSN (WSN 환경에서 Fuzzy Logic을 활용한 동적 싱크 재배치 기법)

  • Lee, Tae-Ho;Kim, Min-Woo;Lee, Byung-Jun;Kim, Kyung-Tae;Youn, Hee-Yong
    • Proceedings of the Korean Society of Computer Information Conference
    • /
    • 2019.07a
    • /
    • pp.99-100
    • /
    • 2019
  • 무선 센서 네트워크(Wireless Sensor Network, WSN)에서의 싱크 이동은 전력 문제와 관련하여 해결해야할 중요한 문제이다. 또한 고정된 싱크를 사용하면 노드의 과도한 에너지 소비로 인해 네트워크 성능이 저하될 수 있는 문제점이 있다. 본 논문에서는 센서 노드의 클러스터가 퍼지 로직(Fuzzy Logic)을 기반으로 형성되고 싱크 재배치가 동적 2단계 메커니즘을 사용하여 결정되는 에너지 효율적인 싱크 재배치 기법을 제안한다. 본 논문에서 제안하는 기법은 싱크 재배치에 필요한 통신 오버 헤드를 최소화하고 데이터 패킷의 손실이나 지연을 최소화하여 싱크 재배치를 허용한다. 시뮬레이션 결과 제안 기법이 기존의 WSN의 대표적인 싱크 재배치 기법보다 네트워크 수명과 처리량 측면에서 우수하다는 것을 확인할 수 있었다.

  • PDF

MAC Protocol considering Data Urgency for EH-WSN (EH-WSN에서 데이터의 긴급성을 고려한 MAC프로토콜)

  • Park, Gwanho;Park, Hyung-Kun
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2019.05a
    • /
    • pp.304-305
    • /
    • 2019
  • Wireless sensor networks are used in various applications due to the flexibility of network. In particular, the energy harvesting wireless sensor network (EH-WSN) has been introduced to solve the power limitation problem, and the application range of the sensor network is further expanded. In order to transmit the sensed data to the destination node, the MAC protocol considering the power of the nodes has been studied. The power situation and the urgency of the data are important elements of data transmission, and a medium access control protocol that comprehensively considers data urgency and power of nodes is required. In this paper, we propose a medium access control protocol which can select relay nodes according to power situation and urgency of data.

  • PDF

Quality of Service using Min-Max Data Size Scheduling in Wireless Sensor Networks

  • Revathi, A.;Santhi, S.G.
    • International Journal of Computer Science & Network Security
    • /
    • v.22 no.9
    • /
    • pp.327-333
    • /
    • 2022
  • Wireless Sensor Networks (WSNs) plays an important role in our everyday life. WSN is distributed in all the places. Nowadays WSN devices are developing our world as smart and easy to access and user-friendly. The sensor is connected to all the resources based on the uses of devices and the environment [1]. In WSN, Quality of Service is based on time synchronization and scheduling. Scheduling is important in WSN. The schedule is based on time synchronization. Min-Max data size scheduling is used in this proposed work. It is used to reduce the Delay & Energy. In this proposed work, Two-hop neighboring node is used to reduce energy consumption. Data Scheduling is used to identify the shortest path and transmit the data based on weightage. The data size is identified by three size of measurement Min, Max and Medium. The data transmission is based on time, energy, delivery, etc., the data are sent through the first level shortest path, then the data size medium, the second level shortest path is used to send the data, then the data size is small, it should be sent through the third level shortest path.

Energy Efficient Routing Protocol Based on PEGASIS in WSN Environment (WSN 환경에서 PEGASIS 기반 에너지 효율적 라우팅 프로토콜)

  • Byoung-Choul Baek;Tae-Wook Kwon
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.18 no.4
    • /
    • pp.579-586
    • /
    • 2023
  • A wireless sensor network (WSN) has limited battery power because it is used wirelessly using low-cost small sensors. Since the battery cannot be replaced, the lifespan of the sensor node is directly related to the lifespan of the battery, so power must be used efficiently to maximize the lifespan of the network. In this study, based on PEGASIS, a representative energy-efficient routing protocol, we propose a protocol that classifies layers according to the distance from the sink node and configures multiple chains rather than one chain. The proposed protocol can increase network lifespan by reducing the transmission distance between nodes to prevent unnecessary energy consumption.

An Efficient Particle Sensor Algorithm (에너지 효율을 고려한 파티클 센서 알고리즘)

  • Hong, Sung-Hwa;Kim, Hoon-Ki
    • Journal of the Korea Society of Computer and Information
    • /
    • v.14 no.5
    • /
    • pp.141-148
    • /
    • 2009
  • Wireless Sensor Networks (WSN) can be applied to various industry fields and environment analysis fields with the progress of various sensor technologies. Also WSN help automatically monitoring of sensor nodes installed at wide area. Especially, the tiny sensor nodes recently developed for the environment analysis require much more electronic power. The reasons are the measurable fields are departmentalized and the more detailed measuring fields are created by the development of various materials and applications. Furthermore, the sensor nodes operated by small batteries for the fields require low cost and low power consumption in wireless networks technology. The power efficiency is the most important factor for the WSN life time. Because the sensor nodes are installed at wide area and hard to recover. This paper proposes the WSN algorithm is applied sensor node that has low power consumption and efficiency measurement.

Ruzicka Indexed Regressive Homomorphic Ephemeral Key Benaloh Cryptography for Secure Data Aggregation in WSN

  • Saravanakumar Pichumani;T. V. P. Sundararajan;Rajesh Kumar Dhanaraj;Yunyoung Nam;Seifedine Kadry
    • Journal of Internet Technology
    • /
    • v.22 no.6
    • /
    • pp.1287-1297
    • /
    • 2021
  • Data aggregation is the significant process in which the information is gathered and combines data to decrease the amount of data transmission in the WSN. The sensor devices are susceptible to node attacks and security issues such as data confidentiality and data privacy are extremely important. A novel technique called Ruzicka Index Regressive Homomorphic Ephemeral Key Benaloh Cryptography (RIRHEKBC) technique is introduced for enhancing the security of data aggregation and data privacy in WSN. By applying the Ruzicka Index Regressive Homomorphic Ephemeral Key Benaloh Cryptography, Ephemeral private and public keys are generated for each sensor node in the network. After the key generation, the sender node performs the encryption using the receiver public key and sends it to the data aggregator. After receiving the encrypted data, the receiver node uses the private key for decrypting the ciphertext. The key matching is performed during the data decryption using Ruzicka Indexive regression function. Once the key is matched, then the receiver collects the original data with higher security. The simulation result proves that the proposed RIRHEKBC technique increases the security of data aggregation and minimizes the packet drop, and delay than the state-of-the- art methods.

Improved SCRO Algorithm in WSN considering Node Failure (WSN에서 Node failure를 고려한 개선된 SCRO 알고리즘)

  • Kang, Moon-Kyoung;Jin, Kyo-Hong
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2008.05a
    • /
    • pp.469-472
    • /
    • 2008
  • Hierarchical routing in Wireless Sensor Network lowers the amount of a memory used and energy consumption so that the network lifetime longer. But, When Node Failure is occurred, Hierarchical routing do not look for another route. This is the problem of Hierarchical routing. To solve the problem, we would study other hierarchical routings. There are typically hierarchical routing protocols which can be used in WSN, such as the hierarchical routing of Zigbee and HiLow protocol which is submitted as draft to IETF 6LoWPAN WG. Also, there is SCRO algorithm which be able to assign short-cut routing path. This paper explains how to solve the Node Failure in each Zigbee hierarchical routing and HiLow protocol. And we suggest how to solve the Node Failure in SCRO protocol. SCRO protocol is able to assign new routing path rapidly when Node Failure is occurred. Because the strong of SCRO protocol is to assign Short-cut routing path.

  • PDF