• Title/Summary/Keyword: Sensor Routing Protocol

Search Result 479, Processing Time 0.031 seconds

Building Efficient Multi-level Wireless Sensor Networks with Cluster-based Routing Protocol

  • Shwe, Hnin Yu;Kumar, Arun;Chong, Peter Han Joo
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.9
    • /
    • pp.4272-4286
    • /
    • 2016
  • In resource constrained sensor networks, usage of efficient routing protocols can have significant impact on energy dissipation. To save energy, we propose an energy efficient routing protocol. In our approach, which integrates clustering and routing in sensor networks, we perform network coding during data routing in order to achieve additional power savings in the cluster head nodes. Efficacy of the proposed method in terms of the throughput and end-to-end delay is demonstrated through simulation results. Significant network lifetime is also achieved as compared with other techniques.

Energy Efficient Routing Protocol in Wireless Sensor Networks with Hole (홀이 있는 WSN 환경에서 에너지 효율적인 라우팅 프로토콜 )

  • Eung-Bum Kim;Tae-Wook Kwon
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.18 no.5
    • /
    • pp.747-754
    • /
    • 2023
  • Energy-efficient routing protocol is an important task in a wireless sensor network that is used for monitoring and control by wirelessly collecting information obtained from sensor nodes deployed in various environments. Various routing techniques have been studied for this, but it is also necessary to consider WSN environments with specific situations and conditions. In particular, due to topographical characteristics or specific obstacles, a hole where sensor nodes are not deployed may exist in most WSN environments, which may result in inefficient routing or routing failures. In this case, the geographical routing-based hall bypass routing method using GPS functions will form the most efficient path, but sensors with GPS functions have the disadvantage of being expensive and consuming energy. Therefore, we would like to find the boundary node of the hole in a WSN environment with holes through minimal sensor function and propose hole bypass routing through boundary line formation.

Self-Organization Routing Protocol supporting Node moving in Wireless Sensor Network (무선 센서 네트워크에서의 노드 이동을 지원하는 자가 구성 라우팅 프로토콜)

  • Kim, Yong;Jang, Kyung-Sik
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2009.10a
    • /
    • pp.1035-1037
    • /
    • 2009
  • Common to use fixed-node sensor network and wireless sensor networks, unlike the recent move of the node happens frequently. These wireless sensor networks by taking into account the mobility of sensor nodes dynamically self-configurable routing protocol is required. In this paper, a fixed-node configuration and energy efficiency in the self-LEACH protocol is based on the useful movement of the nodes of the cluster is dynamically self-configuring routing protocols offer M-LEACH.

  • PDF

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.

Mobile PULSE : A Routing Protocol Considering the Power and the Route Recovery Time in Sensor Networks with A Mobile Sink Node (모바일 PULSE : 모바일 싱크 노드를 가진 센서 네트워크에서의 경로 복구 시간과 전력 소모량을 고려한 라우팅 프로토콜)

  • Lee, Chi-Young;Lee, Shin-Hyoung;Yoo, Chuck
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.34 no.2B
    • /
    • pp.151-161
    • /
    • 2009
  • The PULSE protocol can greatly reduce power consumption using a node's sleep state. But this protocol does not consider movement of a sink node in a sensor network. In the mobile sensor network a routing protocol must recover path error by movement of a sink node as quickly as possible. Therefore we have to achieve fast path recovery and power saving to support movement of a sink node in a sensor network. This paper proposes the Mobile PULSE protocol which is a improved routing protocol for a mobile sink node. And we evaluate Mobile PULSE and show that the Mobile PULSE reduces the recovery time about 40% compared with original PULSE protocol. Mobile PULSE increases energy consumption than PULSE as a maximum of 0.8%, which means Mobile PULSE is similar to PULSE in energy consumption. This paper shows mobile PULSE's capability in the mobile sensor network through evaluation of path recovery time and power consumption.

Energy-Efficient Face Routing Protocol Considering Radio Range in Wireless Sensor Networks (무선 센서 네트워크에서 무선 반경을 고려한 에너지 효율적인 페이스 라우팅 프로토콜)

  • Cho, Hyunchong;Kim, Sangdae;Kim, Cheonyong;Kim, Sang-Ha;Hwang, Chi-Jung
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.40 no.6
    • /
    • pp.1058-1069
    • /
    • 2015
  • In wireless sensor networks, geographic routing is known as an efficient method to transmit the data packet using the location information. Geographic routing relies on two techniques: greedy forwarding and face routing. Face routing helps to recover from greedy routing fail and is based on the planar graph in which does not cross each edge. However, the planarization causes frequently short transmission of data packet because it removes other edges except the shortest one. In other words, since the planarization removes the long edges, face routing could not exploit the efficient removed edges of communication graph. This problem brings about the excessive energy consumption of nodes. In this paper, we propose an energy efficient face routing protocol in wireless sensor networks. This proposed protocol searches the removed edges and transmits them via the edges. Simulation shows that the proposed protocol is more efficient in terms of energy consumption than the previous face routing.

An Energy Efficient Routing Protocol for Unicast in Wireless Sensor Networks (무선 센서 네트워크에서 유니캐스트를 위한 에너지 효율적인 라우팅 프로토콜)

  • Han, Uk-Pyo;Lee, Hee-Choon;Chung, Young-Jun
    • Journal of KIISE:Information Networking
    • /
    • v.34 no.4
    • /
    • pp.262-268
    • /
    • 2007
  • The efficient node-energy utilization in wireless sensor networks has been studied because sensor nodes operate with limited power based on battery. To extend the lifetime of the wireless sensor networks, maintaining balanced power consumption between sensor nodes is more important than reducing total energy consumption of the overall network. Since a large number of sensor nodes are densely deployed and collect data by cooperation in wireless sensor network, keeping more sensor nodes alive as possible is important to extend the lifetime of the sensor network. In this paper, we submit an efficient energy aware routing protocol based on AODV ad hoc routing protocol for wireless sensor networks to increase its lifetime without degrading network performance. The proposed protocol is designed to avoid traffic congestion on minor specific nodes at data transfer and to make the node power consumption be widely distributed to increase the lifetime of the network. The performance of the proposed protocol has been examined and evaluated with the NS-2 simulator in terms of network lifetime and end-to-end delay.

An Analysis on the Effects of Cluster Leadership Rotation among Nodes Using Least Temperature Routing Protocol

  • Encarnacion, Nico;Yang, Hyunho
    • Journal of information and communication convergence engineering
    • /
    • v.12 no.2
    • /
    • pp.104-108
    • /
    • 2014
  • The field of body sensor networks has attracted interest of many researchers due to its potential to revolutionize medicine. These sensors are usually implanted inside the human body and communicate among themselves. In the process of receiving, processing, or transmitting data, these devices produce heat. This heat damages the tissues surrounding the devices in the case of prolonged exposure. In this paper, to reduce this damages, we have improved and evaluated two protocols-the least temperature routing protocol and adaptive least temperature routing protocol-by implementing clustering as well as a leadership rotation algorithm. We used Castalia to simulate a basic body area network cluster composed of 6 nodes. A throughput application was used to simulate all the nodes sending data to one sink node. Simulations results shows that improved communication protocol with leadership rotation algorithm significantly reduce the energy consumption as compared to a scheme without leadership rotation algorithm.

Energy-aware Tree Routing Protocol for Wireless Sensor Networks (센서 네트워크에서 에너지 효율성을 고려한 트리 라우팅 프로토콜)

  • Hwang, So-Young;Jin, Gwang-Ja;Shin, Chang-Sub;Kim, Bong-Soo
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.33 no.8B
    • /
    • pp.624-629
    • /
    • 2008
  • Many routing protocols have been proposed for sensor networks where energy awareness and reliability are essential design issues. This paper proposes an Energy-aware Tree Routing Protocol (ETRP) for Wireless Sensor Networks. The proposed scheme relates to reliable and energy efficient data routing by selecting a data transmission path in consideration of residual energy at each node to disperse energy consumption across the networks and reliably transmit the data through a detour path when there is link or node failure. Simulation results show that the proposed method outperformed traditional Tree Routing (TR) by 23.5% in network lifetime.

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.