• Title/Summary/Keyword: low power network

Search Result 1,235, Processing Time 0.027 seconds

Design of a Broadband Printing RFID Tag Antenna with Low Performance Degradation Due to Nearby Dielectric Material (근접 유전체에 의한 성능 열화가 적은 광대역 프린팅 태그 안테나 설계)

  • Ji, Sung-Hwan;Han, Won-Keun;Park, Ik-Mo;Choo, Ho-Sung
    • The Journal of Korean Institute of Electromagnetic Engineering and Science
    • /
    • v.20 no.8
    • /
    • pp.694-700
    • /
    • 2009
  • In this paper, we propose a RFID tag antenna with low performance degradation due to nearby dielectric materials. The proposed antenna is designed to be appropriate for ink printing fabrication. The antenna is designed to operate in UHF band of $860{\sim}960$ MHz. The antenna uses a T-matching network in the middle of the main body and two parasitic patches in vicinity for complex conjugate matching with a commercial tag chip. In addition, the two parasitic patches induce currents at different dielectric constants of nearby dielectric materials. This can minimize the performance degradation due to nearby dielectric materials. The measured results show the half power matching bandwidth from 844 MHT to 1,268 MHz. It exhibits the reading distance of about 3.5 m in free space when the tag antenna is used with the commercial reader antenna (transmitting power of 20 dBm and the reader antenna gain of 6 dBi). When the tag is attached on dielectric materials of wood and FR4, the resulting reading distances are 2.61 m and 2.51 m, respectively.

Lightweight Validation Mechanism for IoT Sensing Data Based on Obfuscation and Variance Analysis (난독화와 변화량 분석을 통한 IoT 센싱 데이터의 경량 유효성 검증 기법)

  • Yun, Junhyeok;Kim, Mihui
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.8 no.9
    • /
    • pp.217-224
    • /
    • 2019
  • Recently, sensor networks are built and used on many kinds of fields such as home, traffic, medical treatment and power grid. Sensing data manipulation on these fields could be a serious threat on property and safety. Thus, a proper way to block sensing data manipulation is necessary. In this paper, we propose IoT(Internet of Things) sensing data validation mechanism based on data obfuscation and variance analysis to remove manipulated sensing data effectively. IoT sensor device modulates sensing data with obfuscation function and sends it to a user. The user demodulates received data to use it. Fake data which are not modulated with proper obfuscation function show different variance aspect with valid data. Our proposed mechanism thus can detect fake data by analyzing data variance. Finally, we measured data validation time for performance analysis. As a result, block rate for false data was improved by up to 1.45 times compared with the existing technique and false alarm rate was 0.1~2.0%. In addition, the validation time on the low-power, low-performance IoT sensor device was measured. Compared to the RSA encryption method, which increased to 2.5969 seconds according to the increase of the data amount, the proposed method showed high validation efficiency as 0.0003 seconds.

Average Data Rate Analysis for Data Exchanging Nodes via Relay by Concurrent Transmission (데이타 교환 노드의 동시 전송 릴레이 이용을 위한 평균 데이터 전송률 분석)

  • Kwon, Taehoon
    • The Journal of Korea Institute of Information, Electronics, and Communication Technology
    • /
    • v.11 no.6
    • /
    • pp.638-644
    • /
    • 2018
  • Relay systems have recently gained attentions because of its capability of cell coverage extension and the power gain as the one of key technologies for 5G. Relays can be exploited for small-cell base stations and the autonomous network, where communication devices communicate with each other cooperatively. Therefore, the relay technology is expected to enable the low power and large capacity communication. In order to maximize the benefits of using a limited number of relays, the efficient relay selection method is required. Especially, when two nodes exchange their data with each other via relay, the relay selection can maximize the average data rate by the spatial location of the relay. For this purpose, the average data rate is analyzed first according to the relay selection. In this paper, we analyzed the average data rate when two nodes exchange their data via dual-hop decode and forward relaying considering the interference by the concurrent transmission under Nakagami-m fading channel. The correctness of the analysis is verified by the Monte Carlo simulation. The results show that the concurrent transmission is superior to the non-concurrent transmission in the high required data rate region rather than in the low required data rate region.

Prediction of the Following BCI Performance by Means of Spectral EEG Characteristics in the Prior Resting State (뇌신호 주파수 특성을 이용한 CNN 기반 BCI 성능 예측)

  • Kang, Jae-Hwan;Kim, Sung-Hee;Youn, Joosang;Kim, Junsuk
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.9 no.11
    • /
    • pp.265-272
    • /
    • 2020
  • In the research of brain computer interface (BCI) technology, one of the big problems encountered is how to deal with some people as called the BCI-illiteracy group who could not control the BCI system. To approach this problem efficiently, we investigated a kind of spectral EEG characteristics in the prior resting state in association with BCI performance in the following BCI tasks. First, spectral powers of EEG signals in the resting state with both eyes-open and eyes-closed conditions were respectively extracted. Second, a convolution neural network (CNN) based binary classifier discriminated the binary motor imagery intention in the BCI task. Both the linear correlation and binary prediction methods confirmed that the spectral EEG characteristics in the prior resting state were highly related to the BCI performance in the following BCI task. Linear regression analysis demonstrated that the relative ratio of the 13 Hz below and above the spectral power in the resting state with only eyes-open, not eyes-closed condition, were significantly correlated with the quantified metrics of the BCI performance (r=0.544). A binary classifier based on the linear regression with L1 regularization method was able to discriminate the high-performance group and low-performance group in the following BCI task by using the spectral-based EEG features in the precedent resting state (AUC=0.817). These results strongly support that the spectral EEG characteristics in the frontal regions during the resting state with eyes-open condition should be used as a good predictor of the following BCI task performance.

Table-Based Fault Tolerant Routing Method for Voltage-Frequency-Island NoC (Voltage-Frequency-Island NoC를 위한 테이블 기반의 고장 감내 라우팅 기법)

  • Yoon, Sung Jae;Li, Chang-Lin;Kim, Yong Seok;Han, Tae Hee
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.53 no.8
    • /
    • pp.66-75
    • /
    • 2016
  • Due to aggressive scaling of device sizes and reduced noise margins, physical defects caused by aging and process variation are continuously increasing. Additionally, with scaling limitation of metal wire and the increasing of communication volume, fault tolerant method in manycore network-on-chip (NoC) has been actively researched. However, there are few researches investigating reliability in NoC with voltage-frequency-island (VFI) regime. In this paper, we propose a table-based routing technique that can communicate, even if link failures occur in the VFI NoC. The output port is alternatively selected between best and the detour routing path in order to improve reliability with minimized hardware cost. Experimental results show that the proposed method achieves full coverage within 1% faulty links. Compared to $d^2$-LBDR that also considers a routing method for searching a detour path in real time, the proposed method, on average, produces 0.8% savings in execution time and 15.9% savings in energy consumption.

A Coexistence Mitigation Scheme in IEEE 802.15.4-based WBAN (IEEE 802.15.4 기반 WBAN의 공존 문제 완화 기법)

  • Choi, Jong-hyeon;Kim, Byoung-seon;Cho, Jin-sung
    • Journal of Internet Computing and Services
    • /
    • v.16 no.3
    • /
    • pp.1-11
    • /
    • 2015
  • WBAN(Wireless Body Area Network) operating around the human body aims at medical and non-medical service at the same time. and it is the short-range communication technology requiring low-power, various data rate and high reliability. Various studies is performing for IEEE 802.15.4, because IEEE 802.15.4 can provide high compatibility for operate WBAN among communication standard satisfiable these requirements. Meanwhile, in the case of coexisting many IEEE 802.15.4-based WBAN, signal interference and collision are the main cause that is decreasing data reliability. but IEEE 802.15.4 Standard does not consider about coexistence of many networks. so it needs improvement. In this paper, To solve about this problem, identify coexistence problem of IEEE 802.15.4-based WBAN by preliminary experiments. and propose a scheme to mitigate the reliability decrease at multiple coexistence WBAN. The proposed scheme can be classified in two steps. The first step is avoidance to collision on the CFP through improving data transmission. The second step is mitigation collision through converting channel access method. Proposed scheme is verified the performance by performing comparison experiment with Standard-based WBAN.

An Energy-Efficient and Destination-Sequenced Routing Algorithm by a Sink Node in Wireless Sensor Networks (무선 센서 네트워크에서의 싱크 노드에 의한 에너지 효율적인 목적지-순서적 라우팅 알고리즘)

  • Jung, Sang-Joon;Chung, Youn-Ky
    • Journal of Korea Multimedia Society
    • /
    • v.10 no.10
    • /
    • pp.1347-1355
    • /
    • 2007
  • A sensor network is composed of a large number of tiny devices, scattered and deployed in a specified regions. Each sensing device has processing and wireless communication capabilities, which enable it to gather information from the sensing area and to transfer report messages to a base station. The energy-efficient routing paths are established when the base station requests a query, since each node has several characteristics such as low-power, constrained energy, and limited capacity. The established paths are recovered while minimizing the total transmit energy and maximizing the network lifetime when the paths are broken. In this paper, we propose a routing algorithm that each sensor node reports its adjacent link information to the sink node when a sink node broadcasts a query. The sink node manages the total topology and establishes routing paths. This algorithm has a benefit to find an alternative path by reducing the negotiating messages for establishing paths when the established paths are broken. To reduce the overhead of collection information, each node has a link information before reporting to the sink. Because the node recognizes which nodes are adjacent. The proposed algorithm reduces the number of required messages, because sensor nodes receive and report routing messages for establishment at the beginning of configuring routing paths, since each node keeps topology information to establish a routing path, which is useful to report sensing tasks in monitoring environments.

  • PDF

A Routing Scheme Considering Bottleneck and Route Link Quality in RPL-based IoT Wireless Networks (RPL 기반 IoT 무선 네트워크에서 노드 병목 및 전송 경로 품질을 고려한 라우팅 기법)

  • Jung, Ik-Joo;Chung, Sang-Hwa;Lee, Sung-Jun
    • Journal of KIISE
    • /
    • v.42 no.10
    • /
    • pp.1268-1279
    • /
    • 2015
  • In order to manage a large number of devices connected to the Internet of Things (IoT), the Internet Engineering Task Force (IETF) proposed the IPv6 Routing Protocol for Low Power and Lossy Networks (RPL). The route of the RPL network is generated through the use of an Objective Function (OF) that is suitable for the service that is required for the IoT network. Since the route of the RPL network is conventionally simply chosen only by considering the link quality between the nodes, it is sensible to seek an OF that can also provide better Quality of Service (QoS). In previous studies, the end-to-end delay might possibly be sub-optimal because they only deal with problems related to the reduction of energy consumption and not to the link quality on the path to the sink node. In this study, we propose a scheme that reduces the end-to-end delay but also gives full consideration to both the quality on the entire route to the destination and to the expected lifetime of nodes with bottlenecks from heaped traffic. Weighting factors for the proposed scheme are chosen by experiments and the proposed scheme can reduce the end-to-end delay and the energy consumption of previous studies by 20.8% and 10.5%, respectively.

A New Routing Algorithm for Performance improvement of Wireless Sensor Networks (무선 센서 네트워크의 성능 향상을 위한 새로운 라우팅 알고리즘)

  • Yang, Hyun-Suk;Kim, Do-Hyung;Park, Joon-Yeol;Lee, Tae-Bong
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.49 no.1
    • /
    • pp.39-45
    • /
    • 2012
  • In this paper, a distributed 2-hop routing algorithm is proposed. The main purpose of the proposed algorithm is to reduce the overall power consumption of each sensor node so that the lifetime of WSN(wireless sensor network) is prolonged. At the beginning of each round, the base station transmits a synchronization signal that contains information on the priority table that is used to decide whether each sensor node is elected as a cluster head or not. The priority table is constructed so that sensor nodes closer to half energy distance from the base station get the higher priority. 2-hop routing is done as follows. Cluster heads inside half energy distance from the base station communicate with the base station directly. Those outside half energy distance have to decide whether they choose 2-hop routing or 1-hop routing. To do this, each cluster head outside half energy distance calculates the energy consumption needed to communicate with the base station via 1-level cluster head or directly. If less energy is needed when passing through the 1-level cluster head, 2-hop routing is chosen and if not, 1-hop routing is chosen. After routing is done each sensor nodes start sensing data.

Design and Implementation of Initial OpenSHMEM Based on PCI Express (PCI Express 기반 OpenSHMEM 초기 설계 및 구현)

  • Joo, Young-Woong;Choi, Min
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.6 no.3
    • /
    • pp.105-112
    • /
    • 2017
  • PCI Express is a bus technology that connects the processor and the peripheral I/O devices that widely used as an industry standard because it has the characteristics of high-speed, low power. In addition, PCI Express is system interconnect technology such as Ethernet and Infiniband used in high-performance computing and computer cluster. PGAS(partitioned global address space) programming model is often used to implement the one-sided RDMA(remote direct memory access) from multi-host systems, such as computer clusters. In this paper, we design and implement a OpenSHMEM API based on PCI Express maintaining the existing features of OpenSHMEM to implement RDMA based on PCI Express. We perform experiment with implemented OpenSHMEM API through a matrix multiplication example from system which PCs connected with NTB(non-transparent bridge) technology of PCI Express. The PCI Express interconnection network is currently very expensive and is not yet widely available to the general public. Nevertheless, we actually implemented and evaluated a PCI Express based interconnection network on the RDK evaluation board. In addition, we have implemented the OpenSHMEM software stack, which is of great interest recently.