• Title/Summary/Keyword: sensor routing protocols

Search Result 208, Processing Time 0.03 seconds

A Study on Environment Management System in Tunnel using Wireless Sensor Networks (무선 센서 네트워크를 이용한 터널 내 환경 관리 시스템에 관한 연구)

  • Joo, Yang-Ick;Kim, Jae-Wan
    • Journal of Korea Multimedia Society
    • /
    • v.16 no.10
    • /
    • pp.1196-1203
    • /
    • 2013
  • In general, the cost of transceiver for wireless network configuration is more expensive than that for wired network. However, in case of environmental management system in a tunnel, the cost can be minimized by adopting low rate tranceiver because the amount of the exchanged data for tunnel monitoring is very small. When the obtained data from sensor node is sent directly to the corresponding command node, there is no need to consider routing problem of the data transfer. However in this case, sensor nodes are required to be implemented with high power transmitter and experience high energy consumption. To tackle this problem, relay nodes can be used to transfer the data of tunnel monitoring, and suitable routing protocols for selecting optimum path are needed. Therefore, in this paper, we propose a routing algorithm and a self-configuration protocol for environment management system in tunnel.

A Robust Energy Saving Data Dissemination Protocol for IoT-WSNs

  • Kim, Moonseong;Park, Sooyeon;Lee, Woochan
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.12 no.12
    • /
    • pp.5744-5764
    • /
    • 2018
  • In Wireless Sensor Networks (WSNs) for Internet of Things (IoT) environment, fault tolerance is a most fundamental issue due to strict energy constraint of sensor node. In this paper, a robust energy saving data dissemination protocol for IoT-WSNs is proposed. Minimized energy consumption and dissemination delay time based on signal strength play an important role in our scheme. The representative dissemination protocol SPIN (Sensor Protocols for Information via Negotiation) overcomes overlapped data problem of the classical Flooding scheme. However, SPIN never considers distance between nodes, thus the issue of dissemination energy consumption is becoming more important problem. In order to minimize the energy consumption, the shortest path between sensors should be considered to disseminate the data through the entire IoT-WSNs. SPMS (Shortest Path Mined SPIN) scheme creates routing tables using Bellman Ford method and forwards data through a multi-hop manner to optimize power consumption and delay time. Due to these properties, it is very hard to avoid heavy traffic when routing information is updated. Additionally, a node failure of SPMS would be caused by frequently using some sensors on the shortest path, thus network lifetime might be shortened quickly. In contrast, our scheme is resilient to these failures because it employs energy aware concept. The dissemination delay time of the proposed protocol without a routing table is similar to that of shortest path-based SPMS. In addition, our protocol does not require routing table, which needs a lot of control packets, thus it prevents excessive control message generation. Finally, the proposed scheme outperforms previous schemes in terms of data transmission success ratio, therefore our protocol could be appropriate for IoT-WSNs environment.

A Virtual Laboratory to Practice Mobile Wireless Sensor Networks: A Case Study on Energy Efficient and Safe Weighted Clustering Algorithm

  • Dahane, Amine;Berrached, Nasr-Eddine;Loukil, Abdelhamid
    • Journal of Information Processing Systems
    • /
    • v.11 no.2
    • /
    • pp.205-228
    • /
    • 2015
  • In this paper, we present a virtual laboratory platform (VLP) baptized Mercury allowing students to make practical work (PW) on different aspects of mobile wireless sensor networks (WSNs). Our choice of WSNs is motivated mainly by the use of real experiments needed in most courses about WSNs. These experiments require an expensive investment and a lot of nodes in the classroom. To illustrate our study, we propose a course related to energy efficient and safe weighted clustering algorithm. This algorithm which is coupled with suitable routing protocols, aims to maintain stable clustering structure, to prevent most routing attacks on sensor networks, to guaranty energy saving in order to extend the lifespan of the network. It also offers a better performance in terms of the number of re-affiliations. The platform presented here aims at showing the feasibility, the flexibility and the reduced cost of such a realization. We demonstrate the performance of the proposed algorithms that contribute to the familiarization of the learners in the field of WSNs.

A New Cross-Layer QoS-Provisioning Architecture in Wireless Multimedia Sensor Networks

  • Sohn, Kyungho;Kim, Young Yong;Saxena, Navrati
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.12
    • /
    • pp.5286-5306
    • /
    • 2016
  • Emerging applications in automation, medical imaging, traffic monitoring and surveillance need real-time data transmission over Wireless Sensor Networks (WSNs). Guaranteeing Quality of Service (QoS) for real-time traffic over WSNs creates new challenges. Rapid penetration of smart devices, standardization of Machine Type Communications (MTC) in next generation 5G wireless networks have added new dimensions in these challenges. In order to satisfy such precise QoS constraints, in this paper, we propose a new cross-layer QoS-provisioning strategy in Wireless Multimedia Sensor Networks (WMSNs). The network layer performs statistical estimation of sensory QoS parameters. Identifying QoS-routing problem with multiple objectives as NP-complete, it discovers near-optimal QoS-routes by using evolutionary genetic algorithms. Subsequently, the Medium Access Control (MAC) layer classifies the packets, automatically adapts the contention window, based on QoS requirements and transmits the data by using routing information obtained by the network layer. Performance analysis is carried out to get an estimate of the overall system. Through the simulation results, it is manifested that the proposed strategy is able to achieve better throughput and significant lower delay, at the expense of negligible energy consumption, in comparison to existing WMSN QoS protocols.

QoS Routing Protocol Based on Virtual Grids and MultiPaths for Mobile Sinks in Wireless Sensor Networks (무선 센서 네트워크에서 이동 싱크를 위한 가상 그리드와 다중 경로 기반의 QoS 라우팅 프로토콜)

  • Yim, Jinhyuk;Lee, Euisin
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.5 no.11
    • /
    • pp.385-392
    • /
    • 2016
  • Recently, Expectation Area-based Real-time Routing (EAR2) protocol has been proposed to support real-time routing in wireless sensor networks. EAR2 considers the expectation area of a mobile sink and uses flooding within the expectation area. However, flooding leads to excessive energy consumption and causes long delay against real-time routing. Moreover, since EAR2 uses single path to the expectation area, it is difficult to support reliable routing in sensor networks with high link failures. Thus, to overcome these limitation of EAR2, this paper proposes a reliable and real-time routing protocol based on virtual grids and multipath for mobile sinks. To support real-time routing, the proposed protocol considers expectation grids belonged to the expectation area. Instead of flooding within the expectation area, the proposed protocol uses multicasting to the expectation grids and single hop forwarding in an expectation grid because the multicasting can save much energy and the single hop forwarding can provide short delay. Also, the proposed protocol uses multipath to the expectation grids to deal with link failures for supporting reliable routing. Simulation results show that the proposed protocol is superior to the existing protocols.

A Review on IoT: Layered Architecture, Security Issues and Protocols

  • Tooba Rashid;Sumbal Mustafa
    • International Journal of Computer Science & Network Security
    • /
    • v.23 no.9
    • /
    • pp.100-110
    • /
    • 2023
  • The Internet of Things (IoT) is the most creative and focused technology to be employed today. It increases the living conditions of both individuals and society. IoT offers the ability to recognize and incorporate physical devices across the globe through a single network by connecting different devices by using various technologies. As part of IoTs, significant questions are posed about access to computer and user privacy-related personal details. This article demonstrates the three-layer architecture composed of the sensor, routing, and implementation layer, respectively, by highlighting the security risks that can occur in various layers of an IoT architecture. The article also involves countermeasures and a convenient comparative analysis by discussing major attacks spanning from detectors to application. Furthermore, it deals with the basic protocols needed for IoT to establish a reliable connection between objects and items.

Dynamic Local Update-based Routing Protocol(D-LURP) in Wireless Sensor Network with Mobile Sink (모바일 싱크노드를 갖는 무선 센서 네트워크에서 동적 지역 업데이트 기반의 라우팅 프로토콜(D-LURP))

  • Chung, Jae-Hoon;Park, Sung-Han
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.46 no.3
    • /
    • pp.116-122
    • /
    • 2009
  • Mobile Wireless Sensor Network is an organized collection of sensor nodes and mobile sink nodes, in which the sensor node transmits the signal to the sink node. In real environment, there are many cases in which sinks have mobility caused by the people, the vehicle and etc. Since all nodes in the sensor networks have limited energy, many researches have been done in order to prolong the lifetime of the entire network. In this paper we propose Dynamic Local Update-based Routing Protocol(D-LURP) that prolong the lifetime of the entire network to efficiently maintain frequent location update of mobile sink static sensor nodes in Mobile WSNs. When the sink node moves out of the local broadcasting area the proposed D-LURP configures dynamically the local update area consisted of the new local broadcasting area and the previous dissemination node(DN) and find the path between the DN and the sink node, instead of processing a new discovering path like LURP. In this way the processing of broadcasting sink node's location information in the entire network will be omitted. and thus less energy will be consumpted. We compare the performances of the proposed scheme and existing Protocols.

Energy-Balanced Location-Aided Routing Protocol for E-Health Systems

  • Su, Haoru;Nguyen-Xuan, Sam;Nam, Heungwoo;An, Sunshin
    • Annual Conference of KIPS
    • /
    • 2011.11a
    • /
    • pp.101-103
    • /
    • 2011
  • E-Health is one of the most promising applications of wireless sensor networks. This paper describes a prototype for e-Health systems. Based on the system, we propose the energy-balanced location-aided routing protocol. The location and energy information of the neighbor Coordinators is collected and stored in the neighbor discovery procedure. And then the Coordinator selects the most suitable neighbor to forward the data. The simulation results show that the proposed protocol has better performance than the three other routing protocols.

Delay-Constrained Energy-Efficient Cluster-based Multi-Hop Routing in Wireless Sensor Networks

  • Huynh, Trong-Thua;Dinh-Duc, Anh-Vu;Tran, Cong-Hung
    • Journal of Communications and Networks
    • /
    • v.18 no.4
    • /
    • pp.580-588
    • /
    • 2016
  • Energy efficiency is the main objective in the design of a wireless sensor network (WSN). In many applications, sensing data must be transmitted from sources to a sink in a timely manner. This paper describes an investigation of the trade-off between two objectives in WSN design: minimizing energy consumption and minimizing end-to-end delay. We first propose a new distributed clustering approach to determining the best clusterhead for each cluster by considering both energy consumption and end-to-end delay requirements. Next, we propose a new energy-cost function and a new end-to-end delay function for use in an inter-cluster routing algorithm. We present a multi-hop routing algorithm for use in disseminating sensing data from clusterheads to a sink at the minimum energy cost subject to an end-to-end delay constraint. The results of a simulation are consistent with our theoretical analysis results and show that our proposed performs much better than similar protocols in terms of energy consumption and end-to-end delay.

Self-configuration Routing Protocol for Mobile Wireless Sensor Networks (이동 무선센서 네트워크에서의 자가구성 라우팅 기법)

  • Lee, Doo-Wan;Kim, Yong;Jang, Kyung-Sik
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2010.05a
    • /
    • pp.856-859
    • /
    • 2010
  • WSN is composed of a lot of small sensors with the limited hardware resources. In WSN, at the initial stage, sensor nodes are randomly deployed over the region of interest, and self-configure the clustered networks by grouping a bunch of sensor nodes and selecting a cluster header among them. Specially, in Mobile-WSN environment, in which the administrator's intervention is restricted, the self-configuration capability is essential to establish a power-conservative Mobile-WSN which provides broad sensing coverage and communication coverage. In this paper, we propose a self-configuration routing protocol for Mobile-WSN, which consists of step-wise novel protocols for initial deployment, effective joining and removal of sensor nodes, which result in reducing overall power consumption, and extending the lifetime of network.

  • PDF