• Title/Summary/Keyword: Wireless Sensor networks

Search Result 2,280, Processing Time 0.023 seconds

Analysis on Security Vulnerabilities of a Password-based User Authentication Scheme for Hierarchical Wireless Sensor Networks (계층적 무선 센서 네트워크를 위한 패스워드 기반 사용자 인증 스킴의 보안 취약점 분석)

  • Joo, Young-Do
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.15 no.4
    • /
    • pp.63-70
    • /
    • 2015
  • The numerous improved schemes of user authentication based on password have been proposed in order to prevent the data access from the unauthorized person. The importance of user authentication has been remarkably growing in the expanding application areas of wireless sensor networks. Recently, emerging wireless sensor networks possesses a hierarchy among the nodes which are divided into cluster heads and sensor nodes. Such hierarchical wireless sensor networks have more operational advantages by reducing the energy consumption and traffic load. In 2012, Das et al. proposed a user authentication scheme to be applicable for the hierarchical wireless sensor networks. Das et al. claimed that their scheme is effectively secure against the various security flaws. In this paper, author will prove that Das et al.'s scheme is still vulnerable to man-in-the-middle attack, password guessing/change attack and does not support mutual authentication between the user and the cluster heads.

A Method to Customize Cluster Member Nodes for Energy-Efficiency in Wireless Sensor Networks (무선 센서 네트워크에서 에너지 효율을 위한 클러스터 멤버 노드 설정 방법)

  • Nam, Chooon-Sung;Jang, Kyung-Soo;Shin, Dong-Ryeol
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.9 no.6
    • /
    • pp.15-21
    • /
    • 2009
  • The goal of wireless sensor networks is to collect sensing data on specific region over wireless communication. Sink node gathers all local sensing data, processes and transmits them to users who use sensor networks. Generally, senor nodes are low-cost, low power devices with limited sensing, computation and wireless communication capabilities. And sensor network applies to multi-hop communication on large-scale network. As neighboring sensor nodes have similar data, clustering is more effective technique for 'data-aggregation'. In cluster formation technique based on multi-hop, it is necessary that the number of cluster member nodes should be distributed equally because of the balance of cluster formation To achieve this, we propose a method to customize cluster member nodes for energy-efficiency in wireless sensor networks.

  • PDF

A Multimedia Data Compression Scheme for Disaster Prevention in Wireless Multimedia Sensor Networks

  • Park, Jun-Ho;Lim, Jong-Tae;Yoo, Jae-Soo;Oh, Yong-Sun;Oh, Sang-Hoon;Min, Byung-Won;Park, Sun-Gyu;Noh, Hwang-Woo;Hayashida, Yukuo
    • International Journal of Contents
    • /
    • v.11 no.2
    • /
    • pp.31-36
    • /
    • 2015
  • Recent years have seen a significant increase in demand for multimedia data over wireless sensor networks for monitoring applications that utilize sensor nodes to collect multimedia data, including sound and video. However, the multimedia streams generate a very large amount of data. When data transmission schemes for traditional wireless sensor networks are applied in wireless multimedia sensor networks, the network lifetime significantly decreases due to the excessive energy consumption of specific nodes. In this paper, we propose a data compression scheme that implements the Chinese remainder theorem to a wireless multimedia sensor network. The proposed scheme uses the Chinese Remainder Theorem (CRT) to compress and split multimedia data, and it then transmits the bit-pattern packets of the remainder to the base station. As a result, the amount of multimedia data that is transmitted is reduced. The superiority of our proposed scheme is demonstrated by comparing its performance to that of an existing scheme. The results of our experiment indicate that our proposed scheme significantly increased the compression ratio and reduced the compression operation in comparison to those of existing compression schemes.

HDRE: Coverage Hole Detection with Residual Energy in Wireless Sensor Networks

  • Zhang, Yunzhou;Zhang, Xiaohua;Fu, Wenyan;Wang, Zeyu;Liu, Honglei
    • Journal of Communications and Networks
    • /
    • v.16 no.5
    • /
    • pp.493-501
    • /
    • 2014
  • Coverage completeness is an important indicator for quality of service in wireless sensor networks (WSN). Due to limited energy and diverse working conditions, the sensor nodes have different lifetimes which often cause network holes. Most of the existing methods expose large limitation and one-sidedness because they generally consider only one aspect, either coverage rate or energy issue. This paper presents a novel method for coverage hole detection with residual energy in randomly deployed wireless sensor networks. By calculating the life expectancy of working nodes through residual energy, we make a trade-off between network repair cost and energy waste. The working nodes with short lifetime are screened out according to a proper ratio. After that, the locations of coverage holes can be determined by calculating the joint coverage probability and the evaluation criteria. Simulation result shows that compared to those traditional algorithms without consideration of energy problem, our method can effectively maintain the coverage quality of repaired WSN while enhancing the life span of WSN at the same time.

Binomial Distribution Based Reputation for WSNs: A Comprehensive Survey

  • Wei, Zhe;Yu, Shuyan
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.15 no.10
    • /
    • pp.3793-3814
    • /
    • 2021
  • Most secure solutions like cryptography are software based and they are designed to mainly deal with the outside attacks for traditional networks, but such soft security is hard to be implemented in wireless sensor networks to counter the inside attacks from internal malicious nodes. To address this issue, reputation has been introduced to tackle the inside malicious nodes. Reputation is essentially a stimulating mechanism for nodes' cooperation and is employed to detect node misbehaviors and improve the trust-worthiness between individual nodes. Among the reputation models, binomial distribution based reputation has many advantages such as light weight and ease of implementation in resource-constraint sensor nodes, and accordingly researchers have proposed many insightful related methods. However, some of them either directly use the modelling results, apply the models through simple modifications, or only use the required components while ignoring the others as an integral part of the whole model, this topic still lacks a comprehensive and systematical review. Thus the motivation of this study is to provide a thorough survey concerning each detailed functional components of binomial distribution based reputation for wireless sensor networks. In addition, based on the survey results, we also argue some open research problems and suggest the directions that are worth future efforts. We believe that this study is helpful to better understanding the reputation modeling mechanism and its components for wireless sensor networks, and can further attract more related future studies.

Localization Algorithm for Wireless Sensor Networks Based on Modified Distance Estimation

  • Zhao, Liquan;Zhang, Kexin
    • Journal of Information Processing Systems
    • /
    • v.16 no.5
    • /
    • pp.1158-1168
    • /
    • 2020
  • The distance vector-hop wireless sensor node location method is one of typical range-free location methods. In distance vector-hop location method, if a wireless node A can directly communicate with wireless sensor network nodes B and C at its communication range, the hop count from wireless sensor nodes A to B is considered to be the same as that form wireless sensor nodes A to C. However, the real distance between wireless sensor nodes A and B may be dissimilar to that between wireless sensor nodes A and C. Therefore, there may be a discrepancy between the real distance and the estimated hop count distance, and this will affect wireless sensor node location error of distance vector-hop method. To overcome this problem, it proposes a wireless sensor network node location method by modifying the method of distance estimation in the distance vector-hop method. Firstly, we set three different communication powers for each node. Different hop counts correspond to different communication powers; and so this makes the corresponding relationship between the real distance and hop count more accurate, and also reduces the distance error between the real and estimated distance in wireless sensor network. Secondly, distance difference between the estimated distance between wireless sensor network anchor nodes and their corresponding real distance is computed. The average value of distance errors that is computed in the second step is used to modify the estimated distance from the wireless sensor network anchor node to the unknown sensor node. The improved node location method has smaller node location error than the distance vector-hop algorithm and other improved location methods, which is proved by simulations.

A Collaborative and Predictive Localization Algorithm for Wireless Sensor Networks

  • Liu, Yuan;Chen, Junjie
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.11 no.7
    • /
    • pp.3480-3500
    • /
    • 2017
  • Accurate locating for the mobile target remains a challenge in various applications of wireless sensor networks (WSNs). Unfortunately, most of the typical localization algorithms perform well only in the WSN with densely distributed sensor nodes. The non-localizable problem is prone to happening when a target moves into the WSN with sparsely distributed sensor nodes. To solve this problem, we propose a collaborative and predictive localization algorithm (CPLA). The Gaussian mixture model (GMM) is introduced to predict the posterior trajectory for a mobile target by training its prior trajectory. In addition, the collaborative and predictive schemes are designed to solve the non-localizable problems in the two-anchor nodes locating, one-anchor node locating and non-anchor node locating situations. Simulation results prove that the CPLA exhibits higher localization accuracy than other tested predictive localization algorithms either in the WSN with sparsely distributed sensor nodes or in the WSN with densely distributed sensor nodes.

A Beacon Scheduling for Mesh Topology in Wireless Sensor Networks (무선 센서 네트워크에서 메쉬 토폴로지를 위한 비컨 스케줄링)

  • Kim, Min-Jeong;Shim, Jun-Ho
    • The Journal of Society for e-Business Studies
    • /
    • v.15 no.4
    • /
    • pp.49-58
    • /
    • 2010
  • The wireless sensor network technology becomes one of core technologies to make it possible to implement various e-business applications. Energy efficiency is an important issue in wireless sensor networks. IEEE 802.15.4, a representative international standard for wireless sensor networks, provides the beacon enabled mode for energy-efficient communication. However, the beacons may conflict each other when the network is of multi-hop topology such as mesh or cluster-tree topology with beacon-enabled mode. The beacon conflict causes the failure of synchronization between sensor nodes, and affects other nodes in the network in that unsynchronized nodes cannot participate in communication. In this paper, we suggest an energy-efficient beacon scheduling for the wireless sensor networks. Nodes can save their energy duringperiod and prevent beacon conflict using beacon scheduling. We implement the scheduling using QualNet, and evaluate the performance under mesh topology networks. It turns out that the proposed scheduling may improve the energy efficiency in the networks.

Towards Key Issues of Disaster Aid based on Wireless Body Area Networks

  • Liu, Jianqi;Wang, Qinruo;Wan, Jiafu;Xiong, Jianbin;Zeng, Bi
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.7 no.5
    • /
    • pp.1014-1035
    • /
    • 2013
  • With recent advances in wireless communication and low-power miniaturized biomedical sensor and semiconductor technologies, wireless body area networks (WBAN) has become an integral part of the disaster aid system. Wearable vital sign sensors can track patients' status and location, thus enhancing disaster rescue efficiency. In the past few years, most of the literatures in the area of disaster aid system based on WBAN have focused on issues concerning wireless sensor design, sensor miniaturization, energy efficiency and communication protocols. In this paper, we will give an overview of disaster aid, discuss about the types of network communication as well as outline related issues. We will emphasize on analyzing six key issues in employing the disaster aid system. Finally, we will also highlight some of the challenges that still need to be addressed in the future in order to help the disaster aid system be truly and widely accepted by the public.

Improved TOA-Based Localization Method with BS Selection Scheme for Wireless Sensor Networks

  • Go, Seungryeol;Chong, Jong-Wha
    • ETRI Journal
    • /
    • v.37 no.4
    • /
    • pp.707-716
    • /
    • 2015
  • The purpose of a localization system is to estimate the coordinates of the geographic location of a mobile device. The accuracy of wireless localization is influenced by nonline-of-sight (NLOS) errors in wireless sensor networks. In this paper, we present an improved time of arrival (TOA)-based localization method for wireless sensor networks. TOA-based localization estimates the geographic location of a mobile device using the distances between a mobile station (MS) and three or more base stations (BSs). However, each of the NLOS errors along a distance measured from an MS (device) to a BS (device) is different because of dissimilar obstacles in the direct signal path between the two devices. To accurately estimate the geographic location of a mobile device in TOA-based localization, we propose an optimized localization method with a BS selection scheme that selects three measured distances that contain a relatively small number of NLOS errors, in this paper. Performance evaluations are presented, and the experimental results are validated through comparisons of various localization methods with the proposed method.