• 제목/요약/키워드: Sensor network routing

검색결과 715건 처리시간 0.024초

MAP : A Balanced Energy Consumption Routing Protocol for Wireless Sensor Networks

  • Azim, Mohamed Mostafa A.
    • Journal of Information Processing Systems
    • /
    • 제6권3호
    • /
    • pp.295-306
    • /
    • 2010
  • Network lifetime is a critical issue in Wireless Sensor Networks (WSNs). In which, a large number of sensor nodes communicate together to perform a predetermined sensing task. In such networks, the network life time depends mainly on the lifetime of the sensor nodes constituting the network. Therefore, it is essential to balance the energy consumption among all sensor nodes to ensure the network connectivity. In this paper, we propose an energy-efficient data routing protocol for wireless sensor networks. Contrary to the protocol proposed in [6], that always selects the path with minimum hop count to the base station, our proposed routing protocol may choose a longer path that will provide better distribution of the energy consumption among the sensor nodes. Simulation results indicate clearly that compared to the routing protocol proposed in [6], our proposed protocol evenly distributes the energy consumption among the network nodes thus maximizing the network life time.

원전 무선 센서 네트워크에 적합한 클러스터 헤드 체인 라우팅 프로토콜 (Cluster Head Chain Routing Protocol suitable for Wireless Sensor Networks in Nuclear Power Plants)

  • 정성민
    • 디지털산업정보학회논문지
    • /
    • 제16권2호
    • /
    • pp.61-68
    • /
    • 2020
  • Nuclear power plants have a lower cost of power generation, and they are more eco-friendly than other power generation plants. Also, we need to prepare nuclear plant accidents because of their severe damage. In the event of a safety accident, such as a radiation leak, by applying a wireless sensor network to a nuclear power plant, many sensor nodes can be used to monitor radiation and transmit information to an external base station to appropriately respond to the accident. However, applying a wireless sensor network to nuclear power plants requires routing protocols that consider the sensor network size and bypass obstacles such as plant buildings. In general, the hierarchical-based routing protocols are efficient in energy consumption. In this study, we look into the problems that may occur if hierarchical-based routing protocols are applied to nuclear power plants and propose improved routing protocols to solve these problems. Simulation results show that the proposed routing protocol is more effective in energy consumption than the existing LEACH protocol.

Interference Aware Multipath Routing in Multi-rate Wireless Sensor Networks

  • Lee, Kang Gun;Park, Hyung Kun
    • 한국멀티미디어학회논문지
    • /
    • 제18권8호
    • /
    • pp.909-914
    • /
    • 2015
  • In wireless sensor networks, sensor nodes have a short transmission range and data is transferred from source to destination node using the multi-hop transmission. Sensor nodes are powered by battery and the link qualities are different, and the routing protocol in the wireless sensor network is one of the important technical issues. Multipath routing was proposed to reduce the data congestion and increase data throughput. In the multipath routing, however, each path can be interfered by the other path, and it can aggravate network performance. In this paper, we propose the multipath routing scheme for multi-rate wireless sensor networks. The multipath routing selects transmission paths to minimize transmission delay and path interference.

An Adaptive Power-Controlled Routing Protocol for Energy-limited Wireless Sensor Networks

  • Won, Jongho;Park, Hyung-Kun
    • Journal of information and communication convergence engineering
    • /
    • 제16권3호
    • /
    • pp.135-141
    • /
    • 2018
  • Wireless sensor networks (WSN) are composed of a large number of sensor nodes. Battery-powered sensor nodes have limited coverage; therefore, it is more efficient to transmit data via multi-hop communication. The network lifetime is a crucial issue in WSNs and the multi-hop routing protocol should be designed to prolong the network lifetime. Prolonging the network lifetime can be achieved by minimizing the power consumed by the nodes, as well as by balancing the power consumption among the nodes. A power imbalance can reduce the network lifetime even if several nodes have sufficient (battery) power. In this paper, we propose a routing protocol that prolongs the network lifetime by balancing the power consumption among the nodes. To improve the balance of power consumption and improve the network lifetime, the proposed routing scheme adaptively controls the transmission range using a power control according to the residual power in the nodes. We developed a routing simulator to evaluate the performance of the proposed routing protocol. The simulation results show that the proposed routing scheme increases power balancing and improves the network lifetime.

무선센서네트워크에서 네트워크 수명연장을 위한 잔여전력 기반 라우팅 프로토콜 (Residual Power based Routing Protocol to Extend Network Lifetime in Wireless Sensor Networks)

  • 원종호;박형근
    • 한국멀티미디어학회논문지
    • /
    • 제21권5호
    • /
    • pp.592-598
    • /
    • 2018
  • In wireless sensor networks where there is no centralized base station, each node has limited transmission range and the multi-hop routing for transmitting data to the destination is the one of the important technical issues. In particular, the wireless sensor network is not powered by external power source but operates by its own battery, so it is required to maximize the network life through efficient use of energy. To balance the power consumption, the residual power based adaptive power control is required in routing protocol. In this paper, we propose a routing protocol that prolongs the network lifetime by balancing the power consumption among the nodes by controlling the transmit power according to the residual power. We evaluate the proposed routing protocol using extensive simulation, and the results show that the proposed routing scheme can balance the power consumption and prolong network lifetime.

CONTEXT-AWARE ROUTING ARCHITECTURE ON TELEMATICS SENSOR COMMUNICATION NETWORK

  • Lee Eunkyu;Kim Minsoo;Jang Byung-Tae
    • 대한원격탐사학회:학술대회논문집
    • /
    • 대한원격탐사학회 2005년도 Proceedings of ISRS 2005
    • /
    • pp.546-549
    • /
    • 2005
  • It is evident that advancement of ubiquitous technologies in the near future guarantees more convenient and plentiful living. With regarding to car life, we dream of an automatic driving without any effort of operation. This paper touches the realization issue, a convergence of wireless sensor network and Telematics specializing on an information routing mechanism between participating components in Telematics sensor communication network. We list up new requirements of wireless sensor network deployed for Telematics services. Then context-aware routing architecture is proposed in order to solve these constraints, in which a network topology for routing can be dynamically configured according to the combination of context models of network components.

  • PDF

센서 네트워크에서의 RSS(Received Signal Strength)를 이용한 향상된 멀티-홉 라우팅 프로토콜 (Enhanced Multi-Hop Routing Protocol using RSS in Sensor Network)

  • 이민구;강정훈;유준재;윤명현
    • 대한전기학회:학술대회논문집
    • /
    • 대한전기학회 2005년도 심포지엄 논문집 정보 및 제어부문
    • /
    • pp.206-208
    • /
    • 2005
  • Wireless sensor network's value has increased greatly in recent years in the fields of Ubiquitous Computing that function as solution to reduce both the limitation and collision about RFID Technology. The research for wireless sensor network technology is proceeding with the research for various sensor nodes, powerful routing algorithms, securities for data transmission, and valid applications. This paper suggests that we make the new multi-hop routing algorithm using RSS in order to implement enhanced multi-hop routing algorithm. This paper should demonstrate that the routing algorithm using suggested RSS is superior to routing algorithm based on established BSDV(Destination Sequenced Distance Vector).

  • PDF

Optimized Energy Cluster Routing for Energy Balanced Consumption in Low-cost Sensor Network

  • Han, Dae-Man;Koo, Yong-Wan;Lim, Jae-Hyun
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제4권6호
    • /
    • pp.1133-1151
    • /
    • 2010
  • Energy balanced consumption routing is based on assumption that the nodes consume energy both in transmitting and receiving. Lopsided energy consumption is an intrinsic problem in low-cost sensor networks characterized by multihop routing and in many traffic overhead pattern networks, and this irregular energy dissipation can significantly reduce network lifetime. In this paper, we study the problem of maximizing network lifetime through balancing energy consumption for uniformly deployed low-cost sensor networks. We formulate the energy consumption balancing problem as an optimal balancing data transmitting problem by combining the ideas of corona cluster based network division and optimized transmitting state routing strategy together with data transmission. We propose a localized cluster based routing scheme that guarantees balanced energy consumption among clusters within each corona. We develop a new energy cluster based routing protocol called "OECR". We design an offline centralized algorithm with time complexity O (log n) (n is the number of clusters) to solve the transmitting data distribution problem aimed at energy balancing consumption among nodes in different cluster. An approach for computing the optimal number of clusters to maximize the network lifetime is also presented. Based on the mathematical model, an optimized energy cluster routing (OECR) is designed and the solution for extending OEDR to low-cost sensor networks is also presented. Simulation results demonstrate that the proposed routing scheme significantly outperforms conventional energy routing schemes in terms of network lifetime.

Behavior based Routing Misbehavior Detection in Wireless Sensor Networks

  • Terence, Sebastian;Purushothaman, Geethanjali
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제13권11호
    • /
    • pp.5354-5369
    • /
    • 2019
  • Sensor networks are deployed in unheeded environment to monitor the situation. In view of the unheeded environment and by the nature of their communication channel sensor nodes are vulnerable to various attacks most commonly malicious packet dropping attacks namely blackhole, grayhole attack and sinkhole attack. In each of these attacks, the attackers capture the sensor nodes to inject fake details, to deceive other sensor nodes and to interrupt the network traffic by packet dropping. In all such attacks, the compromised node advertises itself with fake routing facts to draw its neighbor traffic and to plunge the data packets. False routing advertisement play vital role in deceiving genuine node in network. In this paper, behavior based routing misbehavior detection (BRMD) is designed in wireless sensor networks to detect false advertiser node in the network. Herein the sensor nodes are monitored by its neighbor. The node which attracts more neighbor traffic by fake routing advertisement and involves the malicious activities such as packet dropping, selective packet dropping and tampering data are detected by its various behaviors and isolated from the network. To estimate the effectiveness of the proposed technique, Network Simulator 2.34 is used. In addition packet delivery ratio, throughput and end-to-end delay of BRMD are compared with other existing routing protocols and as a consequence it is shown that BRMD performs better. The outcome also demonstrates that BRMD yields lesser false positive (less than 6%) and false negative (less than 4%) encountered in various attack detection.

에너지 및 메모리 효율성을 개선한 비트맵기반 라우팅 프로토콜 (Bitmap-based Routing Protocol for Improving Energy and Memory Efficiency)

  • 최해원;김상진;류명춘
    • 디지털산업정보학회논문지
    • /
    • 제5권3호
    • /
    • pp.59-67
    • /
    • 2009
  • This paper proposes a improved bitmap routing protocol, which finds the best energy efficient routing path by minimizing the network overheads and prolongs the overall network lifetime. Jung proposed a bitmap scheme for sensor networks. His scheme uses a bitmap table to represent the connection information between nodes. However, it has a problem that the table size is depends on the number of nodes in the sensor networks. The problem is very serious in the sensor node with a limited memory. Thereby, this paper proposes a improved bitmap routing protocol to solve the problem in Jung's scheme. Proposed protocol over the memory restricted sensor network could optimize the size of bitmap table by applying the deployed network property. Proposed protocol could be used in the diversity of sensor networks due to it has minimum memory overheads.