• Title/Summary/Keyword: Wireless Sensor Networks

Search Result 1,840, Processing Time 0.048 seconds

Survey on Security in Wireless Sensor

  • Li, Zhijun;Gong, Guang
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.18 no.6B
    • /
    • pp.233-248
    • /
    • 2008
  • Advances in electronics and wireless communication technologies have enabled the development of large-scale wireless sensor networks (WSNs). There are numerous applications for wireless sensor networks, and security is vital for many of them. However, WSNs suffer from many constraints, including low computation capability, small memory, limited energy resources, susceptibility to physical capture, and the lack of infrastructure, all of which impose unique security challenges and make innovative approaches desirable. In this paper, we present a survey on security issues in wireless sensor networks. We address several network models for security protocols in WSNs, and explore the state of the art in research on the key distribution and management schemes, typical attacks and corresponding countermeasures, entity and message authentication protocols, security data aggregation, and privacy. In addition, we discuss some directions of future work.

Multipath Routing Based on Opportunistic Routing for Improving End-to-end Reliability in Large-scale Wireless Sensor Networks (대규모 무선 센서 네트워크에서 종단 간 전송 성공률 향상을 위한 기회적 라우팅 기반 다중 경로 전송 방안)

  • Kim, SangDae;Kim, KyongHoon;Kim, Ki-Il
    • IEMEK Journal of Embedded Systems and Applications
    • /
    • v.14 no.4
    • /
    • pp.177-186
    • /
    • 2019
  • In wireless sensor networks, the transmission success ratio would be decreased when the scale of the WSNs increased. To defeat this problem, we propose a multipath routing based on opportunistic routing for improving end-to-end reliability in large-scale wireless sensor networks. The proposed scheme exploits the advantages of existing opportunistic routing and achieves high end-to-end success ratio by branching like a multipath routing through local decision without information of the whole network. As a result of the simulation result, the proposed scheme shows a similar or higher end-to-end transmission success ratio and less energy consumption rather than the existing scheme.

A Secure Multipath Transmission Scheme Based on One-Way Hash Functions in Wireless Sensor Networks (무선 센서 네트워크 환경에서 단-방향 해쉬 함수 기반 다중 경로 보안 전송 기법)

  • Lee, Yun-Jeong;Kim, Dong-Joo;Park, Jun-Ho;Seong, Dong-Ook;Yoo, Jae-Soo
    • The Journal of the Korea Contents Association
    • /
    • v.12 no.1
    • /
    • pp.48-58
    • /
    • 2012
  • With the development of sensing devices and wireless communication technologies, wireless sensor networks are composed of a large number of sensor nodes that are equipped with limited computing performance and restricted communication capabilities. Besides, the sensor nodes are deployed in hostile or unattended environments. Therefore, the wireless sensor networks are vulnerable to security. In particular, the fatal damage may be occurred when data are exposed in real world applications. Therefore, it is important for design requirements to be made so that wireless sensor networks provide the strong security. However, because the conventional security schemes in wired networks did not consider the limited performance of the sensor node, they are so hard to be applied to wireless sensor networks. In this paper, we propose a secure multipath transmission scheme based on one-way hash functions in wireless sensor networks considering the limited performance of the wireless sensor nodes. The proposed scheme converts a sensor reading based on one of one-way hash functions MD5 in order to make it harder to be cracked and snooped. And then, our scheme splits the converted data and transfers the split data to the base station using multi-path routing. The experimental results show that our proposed scheme consumes the energy of just about 6% over the existing security scheme.

TriSec: A Secure Data Framework for Wireless Sensor Networks Using Authenticated Encryption

  • Kumar, Pardeep;Cho, Sang-Il;Lee, Dea-Seok;Lee, Young-Dong;Lee, Hoon-Jae
    • Journal of information and communication convergence engineering
    • /
    • v.8 no.2
    • /
    • pp.129-135
    • /
    • 2010
  • Wireless sensor networks (WSNs) are an emerging technology and offers economically viable monitoring solution to many challenging applications. However, deploying new technology in hostile environment, without considering security in mind has often proved to be unreasonably unsecured. Apparently, security techniques face many critical challenges in WSNs like data security and secrecy due to its hostile deployment nature. In order to resolve security in WSNs, we propose a novel and efficient secure framework called TriSec: a secure data framework for wireless sensor networks to attain high level of security. TriSec provides data confidentiality, authentication and data integrity to sensor networks. TriSec supports node-to-node encryption using PingPong-128 stream cipher based-privacy. A new PingPong-MAC (PP-MAC) is incorporated with PingPong stream cipher to make TriSec framework more secure. PingPong-128 is fast keystream generation and it is very suitable for sensor network environment. We have implemented the proposed scheme on wireless sensor platform and our result shows their feasibility.

Min-Distance Hop Count based Multi-Hop Clustering In Non-uniform Wireless Sensor Networks

  • Kim, Eun-Ju;Kim, Dong-Joo;Park, Jun-Ho;Seong, Dong-Ook;Lee, Byung-Yup;Yoo, Jae-Soo
    • International Journal of Contents
    • /
    • v.8 no.2
    • /
    • pp.13-18
    • /
    • 2012
  • In wireless sensor networks, an energy efficient data gathering scheme is one of core technologies to process a query. The cluster-based data gathering methods minimize the energy consumption of sensor nodes by maximizing the efficiency of data aggregation. However, since the existing clustering methods consider only uniform network environments, they are not suitable for the real world applications that sensor nodes can be distributed unevenly. To solve such a problem, we propose a balanced multi-hop clustering scheme in non-uniform wireless sensor networks. The proposed scheme constructs a cluster based on the logical distance to the cluster head using a min-distance hop count. To show the superiority of our proposed scheme, we compare it with the existing clustering schemes in sensor networks. Our experimental results show that our proposed scheme prolongs about 48% lifetime over the existing methods on average.

A Biometric-based User Authentication and Key Agreement Scheme for Heterogeneous Wireless Sensor Networks

  • Chen, Ying;Ge, Yangming;Wang, Wenyuan;Yang, Fengyu
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.12 no.4
    • /
    • pp.1779-1798
    • /
    • 2018
  • Heterogeneous wireless sensor networks (HEWSN) is a kind of wireless sensor networks (WSN), each sensor may has different attributes, HEWSN has been widely used in many aspects. Due to sensors are deployed in unattended environments and its resource constrained feature, the design of security and efficiency balanced authentication scheme for HEWSN becomes a vital challenge. In this paper, we propose a secure and lightweight user authentication and key agreement scheme based on biometric for HEWSN. Firstly, fuzzy extractor is adopted to handle the user's biometric information. Secondly, we achieve mutual authentication and key agreement among three entities, which are user, gateway and cluster head in the four phases. Finally, formal security analysis shows that the proposed scheme defends against various security pitfalls. Additionally, comparison results with other surviving relevant schemes show that our scheme is more efficient in term of computational cost, communication cost and estimated time. Therefore, the proposed scheme is well suitable for practical application in HEWSN.

A Performance Comparison of Flooding Schemes in Wireless Sensor Networks (무선센서네트워크에서 플러딩 기법의 성능평가)

  • Kim, Kwan-Woong;Cho, Juphil
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.16 no.6
    • /
    • pp.153-158
    • /
    • 2016
  • Broadcasting in multi-hop wireless sensor networks is a basic operation that supports many applications such as route search, setting up addresses and sending messages from the sink to sensor nodes. The broadcasting using flooding causes problems that can be mentioned as a broadcasting storm such as redundancy, contention and collision. A variety of broadcasting schemes using wireless sensor networks have been proposed to achieve superior performance rather than simple flooding scheme. Broadcasting algorithms in wireless sensor networks can be classified into six subcategories: flooding scheme, probabilistic scheme, counter-based scheme, distance-based scheme, location-based schemes, and neighbor knowledge-based scheme. This study analyzes a simple flooding scheme, probabilistic scheme, counter-based scheme, distance-based scheme, and neighbor knowledge-based scheme, and compares the performance and efficiency of each scheme through network simulation.

SINR based Maximum Link Scheduling with Uniform Power in Wireless Sensor Networks

  • Huang, Baogui;Yu, Jiguo;Yu, Dongxiao;Ma, Chunmei
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.8 no.11
    • /
    • pp.4050-4067
    • /
    • 2014
  • In wireless sensor networks, link scheduling is a fundamental problem related to throughput capacity and delay. For a given set of communication requests $L=\{l_1,l_2,{\cdots},l_n\}$, the MLS (maximum link scheduling) problem aims to find the largest possible subset S of Lsuch that the links in S can be scheduled simultaneously. Most of the existing results did not consider bidirectional transmission setting, which is more realistic in wireless sensor networks. In this paper, under physical interference model SINR (signal-to-noise-plus-interference-ratio) and bidirectional transmission model, we propose a constant factor approximation algorithm MLSA (Maximum Link Scheduling Algorithm) for MLS. It is proved that in the same topology setting the capacity under unidirectional transmission model is lager than that under bidirectional transmission model. However, compared with some work under unidirectional transmission model, the capacity of MLSA is improved about 28% to 45%.

An Energy Efficient Data Delivery Scheme based on Cross-Layer Design in Wireless Sensor Networks (무선 센서네트워크에서 교차계층 설계 기반의 에너지 효율적인 데이터 전송 기법)

  • Shin, Jong-Whoi;Kim, Jae-Hyun;Kim, Seog-Gyu
    • Journal of the Korea Society of Computer and Information
    • /
    • v.13 no.4
    • /
    • pp.177-184
    • /
    • 2008
  • The design goal of protocols in wireless sensor networks (WSN) is mainly energy efficiency because of their stringent resource and energy constraints. In this paper, we propose a simple cross-layered protocol for WSNs, so called EATD(Energy-Aware Tree based Delivery scheme). EATD is a tree-based energy aware data delivery algorithm by using a SYNC packet with link and node cost to maximize the network lifetime. Our simulation results show significant improvements compared with existing schemes in terms of energy efficiency and delay.

  • PDF

BRAIN: A bivariate data-driven approach to damage detection in multi-scale wireless sensor networks

  • Kijewski-Correa, T.;Su, S.
    • Smart Structures and Systems
    • /
    • v.5 no.4
    • /
    • pp.415-426
    • /
    • 2009
  • This study focuses on the concept of multi-scale wireless sensor networks for damage detection in civil infrastructure systems by first over viewing the general network philosophy and attributes in the areas of data acquisition, data reduction, assessment and decision making. The data acquisition aspect includes a scalable wireless sensor network acquiring acceleration and strain data, triggered using a Restricted Input Network Activation scheme (RINAS) that extends network lifetime and reduces the size of the requisite undamaged reference pool. Major emphasis is given in this study to data reduction and assessment aspects that enable a decentralized approach operating within the hardware and power constraints of wireless sensor networks to avoid issues associated with packet loss, synchronization and latency. After over viewing various models for data reduction, the concept of a data-driven Bivariate Regressive Adaptive INdex (BRAIN) for damage detection is presented. Subsequent examples using experimental and simulated data verify two major hypotheses related to the BRAIN concept: (i) data-driven damage metrics are more robust and reliable than their counterparts and (ii) the use of heterogeneous sensing enhances overall detection capability of such data-driven damage metrics.