• IEIE Transactions on Smart Processing and Computing
• /
• v.6 no.4
• /
• pp.299-304
• /
• 2017

A wireless passive sensor network is a network consisting of sink nodes, sensor nodes, and radio frequency (RF) sources, where an RF source transfers energy to sensor nodes by radiating RF waves, and a sensor node transmits data by consuming the received energy. Against theoretical expectations, a wireless passive sensor network suffers from many practical difficulties: scarcity of energy, non-simultaneity of energy reception and data transmission, and inefficiency in allocating time resources. Perceiving such difficulties, we propose a simple contending-type medium access control (MAC) scheme for many sensor nodes to deliver packets to a sink node. Then, we derive an approximate expression for the network-wide throughput attained by the proposed MAC scheme. Also, we present an approximate expression for the optimal partition, which maximizes the saturated network-wide throughput. Numerical examples confirm that each of the approximate expressions yields a highly precise value for network-wide throughput and finds an exactly optimal partition.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.53 no.6
• /
• pp.29-36
• /
• 2016

A wireless passive sensor network is a network which, by letting separate RF sources supply energy to sensor nodes, is able to live an eternal life without batteries. Against expectations about an eternal life, however, a wireless passive sensor network still has many problems; scarcity of energy, non-simultaneity of energy reception and data transmission and inefficiency in resource allocation. In this paper, we focus on a wireless passive sensor network providing a packet service which is tolerable to packet losses but requires timely delivery of packets. Perceiving the practical constraints, we then consider a contending-type MAC scheme, rooted in framed and slotted ALOHA, for supporting many sensor nodes to deliver packets to a sink node. Next, we investigate the network-wide throughput achieved by the MAC scheme when the packets transmitted by geographically scattered sensor nodes experience path losses hence capture phenomena. Especially, we derive an exact formula of network-wide throughput in a closed form when 2 sensor nodes reside in the network. By controlling design parameters, we finally optimize the contending-type MAC scheme as to attain the maximum network-wide throughput.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.53 no.4
• /
• pp.20-26
• /
• 2016

A wireless passive sensor network is a network which, by letting RF sources supply energy to sensor nodes, is - at least theoretically - able to live an eternal life without batteries. Due to the technological immaturity, however, a wireless passive sensor network still has many difficulties; energy scarcity, non-simultaneity of energy reception and data transmission and inefficiency in data transmission occurring at sensor nodes. Considering such practical constraints, in this paper, we propose an elementary MAC scheme supporting many sensor nodes to deliver packets to a sink node. Based on a time structure in which a charging interval for charging capacitors by using received and an acting interval for communicating with a sink node are alternately repeated, the proposed MAC scheme delivers packets to a sink node according to slotted ALOHA. In general, a contention-type scheme tends to exhibit relatively low throughput. Thus, we multilaterally evaluate the throughput performance achieved by the proposed MAC scheme using a simulation method. Simulation results show that the network-wide throughput performance can be enhanced by properly setting the length of acting interval.

• Journal of Advanced Navigation Technology
• /
• v.27 no.4
• /
• pp.469-472
• /
• 2023

If temperature management is required in factory or environmental monitoring, temperature can be measured by connecting various sensors wired or wirelessly. Surface acoustic wave sensors measure temperature using changes in acoustic waves on the sensor surface according to temperature, and are useful for wireless networks. In this paper, in order to build a wireless temperature measurement system in the 900 MHz frequency band, the temperature characteristics of the passive SAW sensor were measured, and the analysis and removal of multipath reflection wave effect inside the high temperature chamber were conducted. The resonant frequency of the SAW sensor was measured, and radio transmission/reception and multipath reflected wave removal techniques were proposed in the shielded chamber.

• Journal of Communications and Networks
• /
• v.11 no.6
• /
• pp.589-598
• /
• 2009

In wireless sensor networks, a node that reports information gathered from adjacent assets should relay packets appropriately so that its location context is kept private, and thereby helping ensure the security of the assets that are being monitored. Unfortunately, existing routing methods that counter the local eavesdropping-based tracing deal with a single asset, and most of them suffer from the packet-delivery latency as they prefer to take a separate path of many hops for each packet being sent. In this paper, we propose a routing method, greedy perimeter stateless routing-based source-location privacy with crew size w (GSLP-w), that enhances location privacy of the packet-originating node (i.e., active source) in the presence of multiple assets. GSLP-w is a hybrid method, in which the next-hop node is chosen in one of four modes, namely greedy, random, perimeter, and retreat modes. Random forwarding brings the path diversity, while greedy forwarding refrains from taking an excessively long path and leads to convergence to the destination. Perimeter routing makes detours that avoid the nodes near assets so that they cannot be located by an adversary tracing up the route path. We study the performance of GSLP-w with respect to crew size w (the number of packets being sent per path) and the number of sources. GSLP-w is compared with phantom routing-single path (PR-SP), which is a notable routing method for source-location privacy and our simulation results show that improvements from the point of the ratio of safety period and delivery latency become significant as the number of source nodes increases.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.7 no.11
• /
• pp.2769-2792
• /
• 2013

In this paper, we propose an authenticated key agreement scheme, TinyIBAK, based on the identity-based cryptography and bilinear paring, for large scale sensor networks. We prove the security of our proposal in the random oracle model. According to the formal security validation using AVISPA, the proposed scheme is strongly secure against the passive and active attacks, such as replay, man-in-the middle and node compromise attacks, etc. We implemented our proposal for TinyOS-2.1, analyzed the memory occupation, and evaluated the time and energy performance on the MICAz motes using the Avrora toolkits. Moreover, we deployed our proposal within the TOSSIM simulation framework, and investigated the effect of node density on the performance of our scheme. Experimental results indicate that our proposal consumes an acceptable amount of resources, and is feasible for infrequent key distribution and rekeying in large scale sensor networks. Compared with other ID-based key agreement approaches, TinyIBAK is much more efficient or comparable in performance but provides rekeying. Compared with the traditional key pre-distribution schemes, TinyIBAK achieves significant improvements in terms of security strength, key connectivity, scalability, communication and storage overhead, and enables efficient secure rekeying.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.40 no.10
• /
• pp.1900-1911
• /
• 2015

In this paper, we introduce backscatter communication for power-limited sensors to enable long-range transmission in wireless sensor networks, and envision a way to avoid doubly near-far problem in wireless-powered communication network (WPCN) with this technology. In backscatter based WPCN, users harvest energy from both the signal broadcasted by the hybrid access point and the carrier signal transmitted by the carrier emitter in the downlink, and then transmit their own information in a passive way via the reflection of the carrier signal using frequency-shift keying modulation in the uplink. We characterize the energy-free condition and the signal-to-noise ratio (SNR) outage zone in backscatter based WPCN. Further, we propose backscatter based harvest-then-transmit protocol to maximize the sum-throughput of the backscatter based WPCN by optimally allocating time for energy harvesting and information transmission. Numerical results demonstrate that the backscatter based WPCN increases significantly the transmission range and diminishes greatly the SNR outage zone.

• Journal of Ocean Engineering and Technology
• /
• v.24 no.4
• /
• pp.86-93
• /
• 2010

RFID has been used as an identification tool that substitutes for bar codes. Its areas of application are increasing due to its suitability in ubiquitous environment. In this paper, first, we review various aspects of RFID, including standards, characteristics, and relationships with wireless sensor networks. Then, we review the technical aspects of RFID and its areas of application, e.g., supply chain management (SCM) and manufacturing since 2005. SCM, in which RFIDs can shorten lead time and ensure the quality of products, is one of the most active application areas. Manufacturing is a relatively new area for RFID applications, but it is believed that it can enhance the productivity and the reliability of the products. Also, the authors suggest research issues and limitations of RFID, as well as possible application areas related to marine engineering.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.47 no.2
• /
• pp.103-112
• /
• 2010

In sensor networks, because sensors are deployed in an unprotected environment, they are prone to be targets of compromise attack, If the number of compromised nodes increases considerably, the key management in the network is paralyzed. In particular, compromise of Cluster Heads (CHs) in clustered sensor networks is much more threatening than that of normalsensors. Recently, rekeying schemes which update the exposed keys using the keys unknown to the compromised nodes are emerging. However, they cause some security and efficiency problems such as single group key employment in a cluster, passive eviction of compromised nodes, and excessive communication and computation overhead. In this paper, we present a proactive rekeying scheme using renewals of duster organization for clustered sensor networks. In the proposed scheme, each sensor establishes individual keys with neighbors at network boot-up time, and these keys are employed for later transmissions between sensors and their CH. By the periodic cluster reorganization, the compromised nodes are expelled from network and the individual keys employed in a cluster are changed continuously. Besides, newly elected CHs securely agree a key with sink by informing their members to sink, without exchangingany keying materials. The simulation results shows that the proposed scheme remarkably improves the confidentiality and integrity of data in spite of the increase of compromised nodes. Also, they show that the proposed scheme exploits the precious energy resource more efficiently than SHELL.

• Journal of KIISE:Information Networking
• /
• v.35 no.1
• /
• pp.34-45
• /
• 2008

In dynamic wireless sensor networks where sources and sinks are moving or are created/died, control overheads for route establishment are increased and thus become one of the major factors for energy consumption. This study introduces prefetching and pruning for Directed Diffusion to remove redundant control messages. Prefetching collects path information for each event with "AnyEvent" in advance and gives quick responses without further flooding of requests. Pruning accumulates history information from previous requests and replies, and then stops forwarding a request towards where the event does not exist. Simulation results with ns show that it is possible to build implicit and soft infrastructures within a Directed Diffusion system through these active collection and passive accumulation and they improve energy consumption more as control overhead goes higher.