• Title/Summary/Keyword: wsn

Search Result 891, Processing Time 0.023 seconds

An Asymmetric Key-Based Security Architecture for Wireless Sensor Networks

  • Haque, Md. Mokammel;Pathan, Al-Sakib Khan;Hong, Choong-Seon;Huh, Eui-Nam
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.2 no.5
    • /
    • pp.265-277
    • /
    • 2008
  • In spite of previous common assumptions about the incompatibility of public key cryptography (PKC) schemes with wireless sensor networks (WSNs), recent works have shown that they can be utilized for such networks in some manner. The major challenge of employing a PKC-based scheme in a wireless sensor network is posed by the resource limitations of the tiny sensors. Considering this sensor feature, in this paper we propose an efficient PKC-based security architecture with relatively lower resource requirements than those of previously proposed PKC schemes for WSN. In addition, our scheme aims to provide robust security in the network. Our security architecture comprises two basic components; a key handshaking scheme based on simple, linear operations and the derivation of a decryption key by a receiver node. Our architecture enables node-to-base-station and node-to-node secure communications. Analysis and simulation results show that our proposed architecture ensures a good level of security for network communications, and can be effectively implemented with the limited computational, memory, and energy budgets of current-generation sensor nodes.

Security Model for Tree-based Routing in Wireless Sensor Networks: Structure and Evaluation

  • Almomani, Iman;Saadeh, Maha
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.6 no.4
    • /
    • pp.1223-1247
    • /
    • 2012
  • The need for securing Wireless Sensor Networks (WSNs) is essential especially in mission critical fields such as military and medical applications. Security techniques that are used to secure any network depend on the security requirements that should be achieved to protect the network from different types of attacks. Furthermore, the characteristics of wireless networks should be taken into consideration when applying security techniques to these networks. In this paper, energy efficient Security Model for Tree-based Routing protocols (SMTR) is proposed. In SMTR, different attacks that could face any tree-based routing protocol in WSNs are studied to design a security reference model that achieves authentication and data integrity using either Message Authentication Code (MAC) or Digital Signature (DS) techniques. The SMTR communication and processing costs are mathematically analyzed. Moreover, SMTR evaluation is performed by firstly, evaluating several MAC and DS techniques by applying them to tree-based routing protocol and assess their efficiency in terms of their power requirements. Secondly, the results of this assessment are utilized to evaluate SMTR phases in terms of energy saving, packet delivery success ratio and network life time.

Research on Anti-Reader Collision Protocols for Integrated RFID-WSNs

  • Ko, Doo-Hyun;Kim, Bum-Jin;An, Sun-Shin
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.4 no.5
    • /
    • pp.776-796
    • /
    • 2010
  • Integrated RFID-WSNs (wireless sensor networks) have recently been researched to provide object identities, sensing information, mobile service, and network functionalities. In integrated RFID-WSNs, the reader collision is one of the critical problems. Above all, due to the absence of universally applicable anti-collision protocols and the channel capture phenomenon, the medium access control protocols in integrated RFID-WSNs suffer from reader collision and starvation problems. In this paper, we propose an efficient MAC protocol, called EMP, to avoid the above problems in integrated RFID-WSNs. EMP is a CSMA-based MAC protocol which is compatible with sensor networks operating on integrated nodes which consist of an RFID reader and a senor node. EMP resolves not only the reader collision problem, but also the starvation problem using a power control mechanism. To verify the performance of EMP, we compared it with other anti-reader collision MAC protocols using simulations. As a result, the performance of EMP showed improvements in throughput, system efficiency, and energy consumption compared to the single data channel protocols (CSMA/CA, Pulse, and DiCa) in dense deployment environments.

The Design and Implementation of the Directory Service for the utilization of USN (USN 활용을 위한 디렉토리 서비스 설계 및 구현)

  • Mun, Jin-Mo;Yang, Jeong-Seung;Jeon, Jun-Hyuck;Han, Jae-Il;Lee, Yong-Joon;Oh, Se-Won
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2006.10d
    • /
    • pp.530-534
    • /
    • 2006
  • RFID/USN은 u-Korea를 구현하는 핵심 인프라로서 무한한 성장 잠재력을 내포하고 있으며 향후 인터넷에 이어 산업 전반에 커다란 변혁을 가져올 수 있는 분야로 대두되고 있다. 우리나라의 경우 u-Korea 비전과 세계적인 RFID/USN 기술을 확보하여 세계 시장을 선점하고자 하는 IT839 정책에 따라 RFID/USN에 대한 관심도가 사회 전반적으로 증대되어 USN에 대한 연구가 활발히 이루어지고 있으며 앞으로 USN 인프라 구축이 완료됨에 따라 USN을 활용하기 위한 USN 어플리케이션들이 빠르게 증가할 것이다. USN 인프라 기반의 어플리케이션 개발을 보다 손쉽게 하기 위해 USN 미들웨어의 필요성이 대두되며 디렉토리 서비스는 USN 미들웨어를 구성하는 핵심 서비스 중의 하나이다. 그러나 USN 구성요소인 WSN의 특성 등을 고려할 때 USN 인프라에 적합한 디렉토리 서비스는 검색에 중점을 둔 기존의 디렉토리 서비스와 달리 갱신문제가 나타날 수 있으며 본 논문은 이를 극복할 수 있는 디렉토리 서비스의 설계 및 구현에 대해 논한다.

  • PDF

A Priority Based Transmission Control Scheme Considering Remaining Energy for Body Sensor Network

  • Encarnacion, Nico;Yang, Hyunho
    • Smart Media Journal
    • /
    • v.4 no.1
    • /
    • pp.25-32
    • /
    • 2015
  • Powering wireless sensors with energy harvested from the environment is coming of age due to the increasing power densities of both storage and harvesting devices and the electronics performing energy efficient energy conversion. In order to maximize the functionality of the wireless sensor network, minimize missing packets, minimize latency and prevent the waste of energy, problems like congestion and inefficient energy usage must be addressed. Many sleep-awake protocols and efficient message priority techniques have been developed to properly manage the energy of the nodes and to minimize congestion. For a WSN that is operating in a strictly energy constrained environment, an energy-efficient transmission strategy is necessary. In this paper, we present a novel transmission priority decision scheme for a heterogeneous body sensor network composed of normal nodes and an energy harvesting node that acts as a cluster head. The energy harvesting node's decision whether or not to clear a normal node for sending is based on a set of metrics which includes the energy harvesting node's remaining energy, the total harvested energy, the type of message in a normal node's queue and finally, the implementation context of the wireless sensor network.

An Energy Efficient Hierarchical Clustering Algorithm for Wireless Sensor Networks (무선 센서 네트워크를 위한 에너지 효율적인 계층적 클러스터링 알고리즘)

  • Cha, Si-Ho;Lee, Jong-Eon;Choi, Seok-Man
    • Journal of Korea Society of Digital Industry and Information Management
    • /
    • v.4 no.2
    • /
    • pp.29-37
    • /
    • 2008
  • Clustering allows hierarchical structures to be built on the nodes and enables more efficient use of scarce resources, such as frequency spectrum, bandwidth, and energy in wireless sensor networks (WSNs). This paper proposes a hierarchical clustering algorithm called EEHC which is more energy efficient than existing algorithms for WSNs, It introduces region node selection as well as cluster head election based on the residual battery capacity of nodes to reduce the costs of managing sensor nodes and of the communication among them. The role of cluster heads or region nodes is rotated among nodes to achieve load balancing and extend the lifetime of every individual sensor node. To do this, EEHC clusters periodically to select cluster heads that are richer in residual energy level, compared to the other nodes, according to clustering policies from administrators. To prove the performance improvement of EEHC, the ns-2 simulator was used. The results show that it can reduce the energy and bandwidth consumption for organizing and managing WSNs comparing it with existing algorithms.

A study on WSN based ECG and body temperature measuring system for ubiquitous healthcare: 2. Vital signal monitoring software system (유비쿼터스 헬스케어를 위한 센서 네트워크 기반의 심전도 및 체온 측정 시스템: 2. 생체신호 모니터링 소프트웨어 시스템)

  • Lee, Dae-Seok;Chung, Wan-Young
    • Journal of Sensor Science and Technology
    • /
    • v.15 no.6
    • /
    • pp.417-424
    • /
    • 2006
  • An ubiquitous healthcare monitoring system for elderly person at home was designed for continuous healthy monitoring of elderly person or patients. Human vital signals, such as ECG and body temperature, were monitored by terminal PC or PDA via ECG and temperature sensor nodes on the patient's body. From the ECG data, the heart rate, tachycardia, bradycardia and arrhythmia were diagnosed on the terminal PC or PDA to assist doctor's or nurse's aid or patient itself to monitor the patient's condition and give medical examination. Artificial judgement support system was designed in server computer and the system support a doctor or nurser for management or treatment of the patient. This system can be applied to vital signal monitoring system for solitude elderly person at self house or home health care service part. And this ubiquitous healthcare system can reduce the medical expenses in coming aging or aged society.

A Reconfiguration Method for Preserving Network Bandwidth and Nodes Energy of Wireless Sensor Networks

  • Jung, Hyunjun;Jeong, Dongwon;On, Byung-Won;Baik, Doo-Kwon
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.5
    • /
    • pp.2181-2202
    • /
    • 2016
  • In Wireless Sensor Networks (WSNs) and even in the Internet of Things (IoT) ecosystem, the reconfiguration of sensor variables is an important problem when the role of a system (or application) program's sensor nodes needs to be adjusted in a particular situation. For example, the outdoor temperature in a volcanic zone, which is usually updated in a system every 10 s, should be updated every 1 s during an emergency situation. To solve this problem, this paper proposes a novel approach based on changing only a set of sensor variables in a part of a program, rather than modifying the entire program, in order to reduce both network congestion and the sensor nodes' battery consumption. To validate our approach, we demonstrate an implementation of a proof-of-concept prototype system and also present results of comparative studies showing the performance and effectiveness of our proposed method.

Analysis of Optimized Aggregation Timing in Wireless Sensor Networks

  • Lee, Dong-Wook;Kim, Jai-Hoon
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.3 no.2
    • /
    • pp.209-218
    • /
    • 2009
  • In a wireless sensor network(WSN) each sensor node deals with numerous sensing data elements. For the sake of energy efficiency and network lifetime, sensing data must be handled effectively. A technique used for this is data aggregation. Sending/receiving data involves numerous steps such as MAC layer control packet handshakes and route path setup, and these steps consume energy. Because these steps are involved in all data communication, the total cost increases are related to the counts of data sent/received. Therefore, many studies have proposed sending combined data, which is known as data aggregation. Very effective methods to aggregate sensing data have been suggested, but there is no means of deciding how long the sensor node should wait for aggregation. This is a very important issue, because the wait time affects the total communication cost and data reliability. There are two types of data aggregation; the data counting method and the time waiting method. However, each has weaknesses in terms of the delay. A hybrid method can be adopted to alleviate these problems. But, it cannot provide an optimal point of aggregation. In this paper, we suggest a stochastic-based data aggregation scheme, which provides the cost(in terms of communication and delay) optimal aggregation point. We present numerical analysis and results.

R3: A Lightweight Reactive Ring based Routing Protocol for Wireless Sensor Networks with Mobile Sinks

  • Yu, Sheng;Zhang, Baoxian;Yao, Zheng;Li, Cheng
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.12
    • /
    • pp.5442-5463
    • /
    • 2016
  • Designing efficient routing protocols for a wireless sensor network with mobile sinks (mWSN) is a challenging task since the network topology and data paths change frequently as sink nodes move. In this paper, we design a novel lightweight reactive ring based routing protocol called R3, which removes the need of proactively maintaining data paths to mobile sinks as they move in the network. To achieve high packet delivery ratio and low transmission cost, R3 combines ring based forwarding and trail based forwarding together. To support efficient ring based forwarding, we build a ring based structure for a network in a way such that each node in the network can easily obtain its ring ID and virtual angle information. For this purpose, we artificially create a virtual hole in the central area of the network and accordingly find a shortest cycled path enclosing the hole, which serves as base ring and is used for generating the remaining ring based structure. We accordingly present the detailed design description for R3, which only requires each node to keep very limited routing information. We derive the communication overhead by ring based forwarding. Extensive simulation results show that R3 can achieve high routing performance as compared with existing work.