• Title/Summary/Keyword: Large-scale sensor networks

Search Result 104, Processing Time 0.03 seconds

Robust Hierarchical Data Fusion Scheme for Large-Scale Sensor Network

  • Song, Il Young
    • Journal of Sensor Science and Technology
    • /
    • v.26 no.1
    • /
    • pp.1-6
    • /
    • 2017
  • The advanced driver assistant system (ADAS) requires the collection of a large amount of information including road conditions, environment, vehicle status, condition of the driver, and other useful data. In this regard, large-scale sensor networks can be an appropriate solution since they have been designed for this purpose. Recent advances in sensor network technology have enabled the management and monitoring of large-scale tasks such as the monitoring of road surface temperature on a highway. In this paper, we consider the estimation and fusion problems of the large-scale sensor networks used in the ADAS. Hierarchical fusion architecture is proposed for an arbitrary topology of the large-scale sensor network. A robust cluster estimator is proposed to achieve robustness of the network against outliers or failure of sensors. Lastly, a robust hierarchical data fusion scheme is proposed for the communication channel between the clusters and fusion center, considering the non-Gaussian channel noise, which is typical in communication systems.

A FRAMEWORK FOR QUERY PROCESSING OVER HETEROGENEOUS LARGE SCALE SENSOR NETWORKS

  • Lee, Chung-Ho;Kim, Min-Soo;Lee, Yong-Joon
    • Proceedings of the KSRS Conference
    • /
    • 2007.10a
    • /
    • pp.101-104
    • /
    • 2007
  • Efficient Query processing and optimization are critical for reducing network traffic and decreasing latency of query when accessing and manipulating sensor data of large-scale sensor networks. Currently it has been studied in sensor database projects. These works have mainly focused on in-network query processing for sensor networks and assumes homogeneous sensor networks, where each sensor network has same hardware and software configuration. In this paper, we present a framework for efficient query processing over heterogeneous sensor networks. Our proposed framework introduces query processing paradigm considering two heterogeneous characteristics of sensor networks: (1) data dissemination approach such as push, pull, and hybrid; (2) query processing capability of sensor networks if they may support in-network aggregation, spatial, periodic and conditional operators. Additionally, we propose multi-query optimization strategies supporting cross-translation between data acquisition query and data stream query to minimize total cost of multiple queries. It has been implemented in WSN middleware, COSMOS, developed by ETRI.

  • PDF

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.

Memory-Efficient Hypercube Key Establishment Scheme for Micro-Sensor Networks

  • Lhee, Kyung-Suk
    • ETRI Journal
    • /
    • v.30 no.3
    • /
    • pp.483-485
    • /
    • 2008
  • A micro-sensor network is comprised of a large number of small sensors with limited memory capacity. Current key-establishment schemes for symmetric encryption require too much memory for micro-sensor networks on a large scale. In this paper, we propose a memory-efficient hypercube key establishment scheme that only requires logarithmic memory overhead.

  • PDF

EETS : Energy- Efficient Time Synchronization for Wireless Sensor Networks (무선 센서 네트워크에서 에너지 효율성을 고려한 시간 동기 알고리즘)

  • Kim, Soo-Joong;Hong, Sung-Hwa;Eom, Doo-Seop
    • Journal of IKEEE
    • /
    • v.11 no.4
    • /
    • pp.322-330
    • /
    • 2007
  • Recent advances in wireless networks and low-cost, low-power design have led to active research in large-scale networks of small, wireless, low power sensors and actuators, In large-scale networks, lots of timing-synchronization protocols already exist (such as NTP, GPS), In ad-hoc networks, especially wireless sensor networks, it is hard to synchronize all nodes in networks because it has no infrastructure. In addition, sensor nodes have low-power CPU (it cannot perform the complex computation), low batteries, and even they have to have active and inactive section by periods. Therefore, new approach to time synchronization is needed for wireless sensor networks, In this paper, I propose Energy-Efficient Time Synchronization (EETS) protocol providing network-wide time synchronization in wireless sensor networks, The algorithm is organized two phase, In first phase, I make a hierarchical tree with sensor nodes by broadcasting "Level Discovery" packet. In second phase, I synchronize them by exchanging time stamp packets, And I also consider send time, access time and propagation time. I have shown the performance of EETS comparing Timing-sync Protocol for Sensor Networks (TPSN) and Reference Broadcast Synchronization (RBS) about energy efficiency and time synchronization accuracy using NESLsim.

  • PDF

TinyIBAK: Design and Prototype Implementation of An Identity-based Authenticated Key Agreement Scheme for Large Scale Sensor Networks

  • Yang, Lijun;Ding, Chao;Wu, Meng
    • 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.

A Congestion Control Scheme Considering Traffic in Large-Scale Wireless Sensor Networks (대규모 무선 센서 네트워크에서 트래픽을 고려한 혼잡제어)

  • Kwak, Moon-Sang;Hong, Young Sik
    • Journal of KIISE
    • /
    • v.42 no.1
    • /
    • pp.114-121
    • /
    • 2015
  • Large-scale wireless sensor networks are constructed by using a large number of sensor nodes that are non-uniformly deployed over a wide area. As a result, the data collected by the sensor nodes are similar to that from one another since a high density of the sensor nodes may cause an overlap. As a result of the characteristics of the traffic, data is collected from a plurality of sensor nodes by a sink node, and when the sensor nodes transmit their collected data to the sink node, the sensor nodes around the sink node have a higher amount of traffic than the sensor nodes far away from the sink node. Thus, the former sensor encounter bottlenecks due to traffic congestion and have an energy hole problem more often than the latter ones, increasing energy consumption. This paper proposes a congestion control scheme that considers traffic flows in order to control traffic congestion of the sensor nodes that are non-uniformly deployed over a large-scale wireless sensor network.

A Design of a Selective Multi Sink GRAdient Broadcast Scheme in Large Scale Wireless Sensor Network (대규모 무선 센서 네트워크 환경을 위한 다중 Sink 브로드캐스팅 기법 설계)

  • Lee, Ho-Sun;Cho, Ik-Lae;Lee, Kyoon-Ha
    • Journal of the Korea Society of Computer and Information
    • /
    • v.10 no.4 s.36
    • /
    • pp.239-248
    • /
    • 2005
  • The reliability and efficiency of network must be considered in the large scale wireless sensor networks. Broadcast method must be used rather than unicast method to enhance the reliability of networks. In recently proposed GRAB (GRAdient Broadcast) can certainly enhance reliability of networks fy using broadcast but its efficiency regarding using energy of network is low due to using only one sink. Hence, the lifetime of networks is reduced. In the paper we propose the scheme of SMSGB (Selective Multi Sink Gradient Broadcast) which uses single sink of multi-sink networks. The broadcast based SMSGB can secure reliability of large scale wireless sensor networks. The SMSGB can also use the network's energy evenly via multi sink distribution. Our experiments show that using SMSGB was reliable as GRAB and it increased the network's lifetime by 18% than using GRAB.

  • PDF

A Survey on Key Management Strategies for Different Applications of Wireless Sensor Networks

  • Raazi, Syed Muhammad Khaliq-Ur-Rahman;Lee, Sung-Young
    • Journal of Computing Science and Engineering
    • /
    • v.4 no.1
    • /
    • pp.23-51
    • /
    • 2010
  • Wireless Sensor Networks (WSN) have proved to be useful in applications that involve monitoring of real-time data. There is a wide variety of monitoring applications that can employ Wireless Sensor Network. Characteristics of a WSN, such as topology and scale, depend upon the application, for which it is employed. Security requirements in WSN vary according to the application dependent network characteristics and the characteristics of an application itself. Key management is the most important aspect of security as some other security modules depend on it. We discuss application dependent variations in WSN, corresponding changes in the security requirements of WSN and the applicability of existing key management solutions in each scenario.

A Large-scale Multi-track Mobile Data Collection Mechanism for Wireless Sensor Networks

  • Zheng, Guoqiang;Fu, Lei;Li, Jishun;Li, Ming
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.8 no.3
    • /
    • pp.857-872
    • /
    • 2014
  • Recent researches reveal that great benefit can be achieved for data gathering in wireless sensor networks (WSNs) by employing mobile data collectors. In order to balance the energy consumption at sensor nodes and prolong the network lifetime, a multi-track large-scale mobile data collection mechanism (MTDCM) is proposed in this paper. MTDCM is composed of two phases: the Energy-balance Phase and the Data Collection Phase. In this mechanism, the energy-balance trajectories, the sleep-wakeup strategy and the data collection algorithm are determined. Theoretical analysis and performance simulations indicate that MTDCM is an energy efficient mechanism. It has prominent features on balancing the energy consumption and prolonging the network lifetime.