• Title/Summary/Keyword: Heterogeneous Sensor Networks

Search Result 91, Processing Time 0.021 seconds

A Software Architecture for Highly Reconfigurable Sensor Operating Systems (재구성 가능한 고성능 센서 운영체제를 위한 소프트웨어 아키텍처 설계)

  • Kim, Tae-Hwan;Kim, Hie-Cheol
    • IEMEK Journal of Embedded Systems and Applications
    • /
    • v.2 no.4
    • /
    • pp.242-250
    • /
    • 2007
  • Wireless sensor networks are subject to highly heterogeneous system requirements in terms of their functionality and performance due to their broad application areas. Though the heterogeneity hinders the opportunity of developing a single universal platform for sensor networks, efforts to provide uniform, inter-operable and scalable ones for sensor networks are still essential for the growth of the industry as well as their technological advance. As a part of our work to develop such a robust platform, this paper presents the software architecture for sensor nodes with focus on our sensor node operating system and its configuration methodology. Addressing principle issues in its design space which includes programming, execution, task scheduling and software layer models, our architecture is highly reconfigurable with respect to system resources and functional requirements and also highly efficient in supporting multi-threading under small system resources.

  • PDF

Improvement of cluster head selection method in L-SEP

  • Jin, Seung Yeon;Jung, Kye-Dong;Lee, Jong-Yong
    • International Journal of Internet, Broadcasting and Communication
    • /
    • v.9 no.4
    • /
    • pp.51-58
    • /
    • 2017
  • This paper deals with the improvement of cluster head selection method in L-SEP for heterogeneous nodes among hierarchical routing protocols of wireless sensor network. Wireless sensor networks are classified into homogeneous and heterogeneous network. In heterogeneous network, SEP, L-SEP are mainly used because cluster head selection probability is different depending on node type. But, since protocol based on SEP has different cluster head selection probabilities depending on the node type, clusters that transmit data inefficiently can be formed. to improve this, it is necessary to select the cluster head that minimizes the transmission distance of member node and the cluster head. Therefore, we propose a protocol that improve the cluster head selection method.

Novel Architecture of Self-organized Mobile Wireless Sensor Networks

  • Rizvi, Syed;Karpinski, Kelsey;Razaque, Abdul
    • Journal of Computing Science and Engineering
    • /
    • v.9 no.4
    • /
    • pp.163-176
    • /
    • 2015
  • Self-organization of distributed wireless sensor nodes is a critical issue in wireless sensor networks (WSNs), since each sensor node has limited energy, bandwidth, and scalability. These issues prevent sensor nodes from actively collaborating with the other types of sensor nodes deployed in a typical heterogeneous and somewhat hostile environment. The automated self-organization of a WSN becomes more challenging as the number of sensor nodes increases in the network. In this paper, we propose a dynamic self-organized architecture that combines tree topology with a drawn-grid algorithm to automate the self-organization process for WSNs. In order to make our proposed architecture scalable, we assume that all participating active sensor nodes are unaware of their primary locations. In particular, this paper presents two algorithms called active-tree and drawn-grid. The proposed active-tree algorithm uses a tree topology to assign node IDs and define different roles to each participating sensor node. On the other hand, the drawn-grid algorithm divides the sensor nodes into cells with respect to the radio coverage area and the specific roles assigned by the active-tree algorithm. Thus, both proposed algorithms collaborate with each other to automate the self-organizing process for WSNs. The numerical and simulation results demonstrate that the proposed dynamic architecture performs much better than a static architecture in terms of the self-organization of wireless sensor nodes and energy consumption.

An Effective Mapping for a Mobile Robot using Error Backpropagation based Sensor Fusion (오류 역전파 신경망 기반의 센서융합을 이용한 이동로봇의 효율적인 지도 작성)

  • Kim, Kyoung-Dong;Qu, Xiao-Chuan;Choi, Kyung-Sik;Lee, Suk-Gyu
    • Journal of the Korean Society for Precision Engineering
    • /
    • v.28 no.9
    • /
    • pp.1040-1047
    • /
    • 2011
  • This paper proposes a novel method based on error back propagation neural networks to fuse laser sensor data and ultrasonic sensor data for enhancing the accuracy of mapping. For navigation of single robot, the robot has to know its initial position and accurate environment information around it. However, due to the inherent properties of sensors, each sensor has its own advantages and drawbacks. In our system, the robot equipped with seven ultrasonic sensors and a laser sensor navigates to map two different corridor environments. The experimental results show the effectiveness of the heterogeneous sensor fusion using an error backpropagation algorithm for mapping.

A Java Virtual Machine for Sensor Networks (센서 네트워크를 위한 자바 가상 기계)

  • Kim, Seong-Woo;Lee, Jong-Min;Lee, Jung-Hwa;Shin, Jin-Ho
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.14 no.1
    • /
    • pp.13-20
    • /
    • 2008
  • Sensor network consists of a large number of sensor node distributed in the environment being sensed and controlled. The resource-constrained sensor nodes tend to have various and heterogeneous architecture. Thus, it is important to make its software environment platform-independent and reprogrammable. In this paper, we present BeeVM, a Java operating system designed for sensor networks. BeeVM offers a platform-independent Java programming environment with its efficiently executable file format and a set of class APIs for basic operating functions, sensing and wireless networking. BeeVM's high-level native interface and layered network subsystem allow complex program for sensor network to be short and readable. Our platform has been ported on two currently popular hardware platforms and we show its effectiveness through the evaluation of a simple application.

Hop-by-Hop Dynamic Addressing Based Routing Protocol for Monitoring of long range Underwater Pipeline

  • Abbas, Muhammad Zahid;Bakar, Kamalrulnizam Abu;Ayaz, Muhammad;Mohamed, Mohammad Hafiz;Tariq, Moeenuddin
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.11 no.2
    • /
    • pp.731-763
    • /
    • 2017
  • In Underwater Linear Sensor Networks (UW-LSN) routing process, nodes without proper address make it difficult to determine relative sensor details specially the position of the node. In addition, it effects to determine the exact leakage position with minimized delay for long range underwater pipeline monitoring. Several studies have been made to overcome the mentioned issues. However, little attention has been given to minimize communication delay using dynamic addressing schemes. This paper presents the novel solution called Hop-by-Hop Dynamic Addressing based Routing Protocol for Pipeline Monitoring (H2-DARP-PM) to deal with nodes addressing and communication delay. H2-DARP-PM assigns a dynamic hop address to every participating node in an efficient manner. Dynamic addressing mechanism employed by H2-DARP-PM differentiates the heterogeneous types of sensor nodes thereby helping to control the traffic flows between the nodes. The proposed dynamic addressing mechanism provides support in the selection of an appropriate next hop neighbour. Simulation results and analytical model illustrate that H2-DARP-PM addressing support distribution of topology into different ranges of heterogeneous sensors and sinks to mitigate the higher delay issue. One of the distinguishing characteristics of H2-DARP-PM has the capability to operate with a fewer number of sensor nodes deployed for long-range underwater pipeline monitoring.

Assessing Throughput and Availability based on Hierarchical Clustering in Wireless Sensor Networks (계층적 클러스터링을 기반으로 하는 무선 센서 네트워크의 Throughput 과 Availability 평가)

  • Lee Jun-Hyuk;Oh Young-Hwan
    • Journal of Applied Reliability
    • /
    • v.5 no.4
    • /
    • pp.465-486
    • /
    • 2005
  • A unreliable network system results in unsatisfied performance. A performance criterion of a network is throughput and availability. One of the most compelling technological advances of this decade has been the advent of deploying wireless networks of heterogeneous smart sensor nodes for complex information gathering tasks, The advancement and popularization of wireless communication technologies make more efficiency to network devices with wireless technology than with wired technology. Recently, the research of wireless sensor network has been drawing much attentions. In this paper, We evaluate throughput and availability of wireless sensor network, which have hierarchical structure based on clustering and estimate the maximum hroughput, average throughput and availability of the network considering several link failure patterns likely to happen at a cluster consisted of sensor nodes. Also increasing a number of sensor nodes in a cluster, We analysis the average throughput and availability of the network.

  • 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.

Fuzzy Logic Approach to Zone-Based Stable Cluster Head Election Protocol-Enhanced for Wireless Sensor Networks

  • Mary, S.A. Sahaaya Arul;Gnanadurai, Jasmine Beulah
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.4
    • /
    • pp.1692-1711
    • /
    • 2016
  • Energy is a scarce resource in wireless sensor networks (WSNs). A variety of clustering protocols for WSNs, such as the zone-based stable election protocol-enhanced (ZSEP-E), have been developed for energy optimization. The ZSEP-E is a heterogeneous zone-based clustering protocol that focuses on unbalanced energy consumption with parallel formation of clusters in zones and election of cluster heads (CHs). Most ZSEP-E research has assumed probabilistic election of CHs in the zones by considering the maximum residual energy of nodes. However, studies of the diverse CH election parameters are lacking. We investigated the performance of the ZSEP-E in such scenarios using a fuzzy logic approach based on three descriptors, i.e., energy, density, and the distance from the node to the base station. We proposed an efficient ZSEP-E scheme to adapt and elect CHs in zones using fuzzy variables and evaluated its performance for different energy levels in the zones.

A Study on Distributed Self-Reliance Wireless Sensing Mechanism for Supporting Data Transmission over Heterogeneous Wireless Networks

  • Caytiles, Ronnie D.;Park, Byungjoo
    • International Journal of Internet, Broadcasting and Communication
    • /
    • v.12 no.3
    • /
    • pp.32-38
    • /
    • 2020
  • The deployment of geographically distributed wireless sensors has greatly elevated the capability of monitoring structural health in social-overhead capital (SOC) public infrastructures. This paper deals with the utilization of a distributed mobility management (DMM) approach for the deployment of wireless sensing devices in a structural health monitoring system (SHM). Then, a wireless sensing mechanism utilizing low-energy adaptive clustering hierarchy (LEACH)-based clustering algorithm for smart sensors has been analyzed to support the seamless data transmission of structural health information which is essentially important to guarantee public safety. The clustering of smart sensors will be able to provide real-time monitoring of structural health and a filtering algorithm to boost the transmission of critical information over heterogeneous wireless and mobile networks.