• Title/Summary/Keyword: Routing protocol

Search Result 1,463, Processing Time 0.023 seconds

Relay Node Selection Scheme for EH-WSN Routing considering Data Urgency (EH-WSN 라우팅에서 데이터의 긴급성을 고려한 중계노드 선택기법)

  • Kang, Min-Seung;Park, Hyung-Kun
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.24 no.8
    • /
    • pp.1113-1116
    • /
    • 2020
  • In the EH-WSN(Energy Harvesting Wireless Sensor Network), the routing protocol must consider the power condition of nodes such as residual power and energy harvesting rate. Many EH-WSN studies have emphasized the power aspect and make the urgency of sensed data less important. However, in applications such as environmental monitoring, stability and latency become more important issues than power efficiency for urgent data. In this paper, we designed a routing protocol that can set path according to data urgency. To this end, relay nodes are determined considering the urgency of date. Nodes with poor power do not participate in routing when normal data is generated, so that urgent data can be transmitted reliably with low latency. The performance of the proposed routing protocol is analyzed by computer simulation.

A Beeline Routing Protocol for Heterogeneous WSN for IoT-Based Environmental Monitoring

  • Sahitya, G.;Balaji, N.;Naidu, C.D.
    • International Journal of Computer Science & Network Security
    • /
    • v.22 no.10
    • /
    • pp.67-72
    • /
    • 2022
  • A wireless sensor network (WSN), with its constrained sensor node energy supply, needs an energy-efficient routing technique that maximises overall system performance. When rumours are routed using a random-walk routing algorithm, which is not highly scalable, spiral pathways may appear. Because humans think a straight line is the quickest route between two sites and two straight lines in a plane are likely to intersect, straight-line routing (SLR) constructs a straight path without the aid of geographic information. This protocol was developed for WSNs. As a result, sensor nodes in WSNs use less energy when using SLR. Using comprehensive simulation data, we show that our upgraded SLR systems outperform rumour routing in terms of performance and energy conservation.

A Grid-based Efficient Routing Protocol for a Mobile Sink in Wireless Sensor Networks

  • Lee, Taekkyeun
    • Journal of the Korea Society of Computer and Information
    • /
    • v.23 no.2
    • /
    • pp.35-43
    • /
    • 2018
  • In this paper, we propose a grid-based efficient routing protocol for a mobile sink in wireless sensor networks. In the proposed protocol, the network is partitioned into grids and each grid has a grid head. For the efficient routing to a mobile sink, the proposed protocol uses a mobile sink representative node to send the data to a mobile sink and grid heads are used as a mobile sink representative node. Furthermore, the proposed protocol uses nodes in the boundary of the center grid as position storage nodes. The position storage nodes store the position of a mobile sink representative node and provide source nodes with it for data delivery. With these features, the proposed protocol can reduce a lot of overhead to update the position information and improve the delay of data delivery to a mobile sink. The proposed protocol performs better than other protocols in terms of the delay and the energy consumption per node in the performance evaluation.

Advanced HEED protocol using distance weight in USN (USN 환경에서 거리 가중치를 사용한 개선된 HEED 프로토콜)

  • Jeoung, Su-Hyung;Yoo, Hae-Young
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.10 no.2
    • /
    • pp.370-376
    • /
    • 2009
  • Recently, Study for routing protocol is gone vigorously in the Ubiquitous Sensor Network. A hierarchical routing protocol is being practical and received interest among them. Therefore we analyze a weak point of HEED. And I suggest the new protocol that solved a weak point of HEED. The new protocol that we propose puts weight in the energy remainder amount than HEED and elect CH. And elected CH is designed to change by new node when quantity of energy leftover becomes less than 50%. Therefore all nodes come to use energy fairly. The protocol that we proposed can prove the cluster survival rate about 30%. And CH is more effective because when elect CH replace, response time selects small node.

Mobile Sink Supporting Routing Protocol using Agent of Cluster Node (클러스터 노드의 에이전트를 이용한 이동 싱크 지원 라우팅 프로토콜)

  • Kim, Young-Soo;Suh, Jung-Seok
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.13 no.6
    • /
    • pp.1208-1214
    • /
    • 2009
  • Sensor networks are vulnerable to data congestion and hot-spot compared with wireless networks. Mobile sink supporting route protocol has such problems as hot-spot and data congestion because agent of cluster node transmits all data packet. Therefore, mobile sink supporting route protocol needs to reduce the number of packets and keep the packets from concentrating on a single node. To solve these problems, we propose mobile sink supporting routing Protocol using agent of cluster node. Cutting down on the number of packets compared with the existing mobile sink supporting routing Protocol, our proposed protocol has reduced both communication overhead and energy consumption.

MRFR - Multipath-based Routing Protocol with Fast-Recovery of Failures on MANETs

  • Ngo, Hoai Phong;Kim, Myung Kyun
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.7 no.2
    • /
    • pp.271-287
    • /
    • 2013
  • We propose a new multipath-based reliable routing protocol on MANETs, Multipath-based Reliable routing protocol with Fast-Recovery of failures (MRFR). For reliable message transmission, MRFR tries to find the most reliable path between a source and a destination considering the end-to-end packet reception reliability of the routes. The established path consists of a primary path that is used to transmit messages, and the secondary paths that are used to recover the path when detecting failures on the primary path. After establishing the path, the source transmits messages through the primary path. If a node detects a link failure during message transmission, it can recover the path locally by switching from the primary to the secondary path. By allowing the intermediate nodes to locally recover the route failure, the proposed protocol can handle the dynamic topological change of the MANETs efficiently. The simulation result using the QualNet simulator shows that the MRFR protocol performs better than other protocols in terms of the end-to-end message delivery ratio and fault-tolerance capability.

Dynamic Adjustment Strategy of n-Epidemic Routing Protocol for Opportunistic Networks: A Learning Automata Approach

  • Zhang, Feng;Wang, Xiaoming;Zhang, Lichen;Li, Peng;Wang, Liang;Yu, Wangyang
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.11 no.4
    • /
    • pp.2020-2037
    • /
    • 2017
  • In order to improve the energy efficiency of n-Epidemic routing protocol in opportunistic networks, in which a stable end-to-end forwarding path usually does not exist, a novel adjustment strategy for parameter n is proposed using learning atuomata principle. First, nodes dynamically update the average energy level of current environment while moving around. Second, nodes with lower energy level relative to their neighbors take larger n avoiding energy consumption during message replications and vice versa. Third, nodes will only replicate messages to their neighbors when the number of neighbors reaches or exceeds the threshold n. Thus the number of message transmissions is reduced and energy is conserved accordingly. The simulation results show that, n-Epidemic routing protocol with the proposed adjustment method can efficiently reduce and balance energy consumption. Furthermore, the key metric of delivery ratio is improved compared with the original n-Epidemic routing protocol. Obviously the proposed scheme prolongs the network life time because of the equilibrium of energy consumption among nodes.

Design and Implementation of A Location-based Energy-Efficient Routing Protocol using Quantity of Energy Consumed (에너지 사용량을 이용한 위치 기반 에너지 효율적인 라우팅 프로토콜 설계 및 구현)

  • Jang, You-Jin;Kim, Yong-Ki;Chang, Jae-Woo
    • Journal of Korea Spatial Information System Society
    • /
    • v.12 no.1
    • /
    • pp.1-9
    • /
    • 2010
  • Recently, wireless sensor networks(WSNs) technology has been considered as one of the most critical issues in the ubiquitous computing age. The sensor nodes have limited battery power, so they should consume low energy through their operation for the long-lasting lifetime. Therefore, it is essential to use energy efficient routing protocol. For this, we propose a location-based energy-efficient routing protocol which constructs the energy efficient route by considering the quantity of Energy consumed. In addition, we propose a route reconstruction algorithm to handle the disconnection of message transmission. Finally, we show from performance analysis using TOSSIM that our protocol outperforms the existing location based routing protocols in terms of energy efficiency.

A Study on Improved AODV Routing Protocol for Mobility based on ZigBee (ZigBee 기반의 무선 네트워크에서 이동성을 고려한 개선된 AODV 라우팅 프로토콜의 연구)

  • Kim, Yu-Doo;Moon, Il-Young
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.34 no.7B
    • /
    • pp.703-709
    • /
    • 2009
  • Recently, we are using wireless system based on ZigBee technology. It solves a complicated space and frequency movement. Then, we had studied it for improved performance. So, we are must concerned about routing protocol for improvement of a weak point of physical feature. But many researchers are not focusiong on developing Routing Protocol. In this paper, we proposed improved routing protocol using AODV for wireless system based on ZigBee technology. And it is analyzed the simulation result which compare with original and improved AODV protocol based on ZigBee network.

MRFR - Multipath-based Routing Protocol with Fast-Recovery of Failures on MANETs

  • Ngo, Hoai Phong;Kim, Myung Kyun
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.6 no.12
    • /
    • pp.3081-3099
    • /
    • 2012
  • We propose a new multipath-based reliable routing protocol on MANETs, Multipath-based Reliable routing protocol with Fast-Recovery of failures (MRFR). For reliable message transmission, MRFR tries to find the most reliable path between a source and a destination considering the end-to-end packet reception reliability of the routes. The established path consists of a primary path that is used to transmit messages, and the secondary paths that are used to recover the path when detecting failures on the primary path. After establishing the path, the source transmits messages through the primary path. If a node detects a link failure during message transmission, it can recover the path locally by switching from the primary to the secondary path. By allowing the intermediate nodes to locally recover the route failure, the proposed protocol can handle the dynamic topological change of the MANETs efficiently. The simulation result using the QualNet simulator shows that the MRFR protocol performs better than other protocols in terms of the end-to-end message delivery ratio and fault-tolerance capability.