• Title/Summary/Keyword: energy aware routing

Search Result 113, Processing Time 0.028 seconds

Delay and Energy-Aware Routing Algorithm For Energy-Constrained Wireless Networks (무선 Ad-hoc 네트워크환경에서 전송지연과 에너지소비를 고려한 라우팅 알고리즘)

  • Casaquite, Reizel;Hwang, Won-Joo
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.11 no.9
    • /
    • pp.1799-1805
    • /
    • 2007
  • Wireless Ad-hoc networks may contain nodes of various types of which many can have limited power capabilities. A failure of a node due to energy exhaustion may impact the performance of the whole network hence, energy must be conserved. In this paper, we propose a Delay and Energy-Aware Routing (DEAR) algorithm a multiple metric path cost routing algorithm which considers not only the energy consumed by the node during transmission and reception but as well as the residual energy of the node and the delay incurred during route discovery. Based on our results, DEAR algorithm performs well and maximizes network lifetime by routing flows to nodes with sufficient energy such that the energy consumption is balanced among nodes in proportion to their energy reserves.

The Multi-path Power-aware Source Routing(MPSR) for the Maximum Network Lifetime in Ad-Hoc Networks (애드혹 네트워크에서 최대 네트워크 유지 시간을 위한 다중경로 에너지 고려 라우팅 기법)

  • Hwang, Ho-Young;Suh, Hyo-Joong
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.10 no.5
    • /
    • pp.21-29
    • /
    • 2010
  • In Ad-Hoc Networks, the limited energy is the key issue for longer network operation time. To solve this problem, various energy-aware routing techniques have been proposed including PSR (Power-aware Source Routing), HPSR (Hirachical Power-aware Source Routing), and etc. Those techniques generally select the most adequate route considering the energy consumption so that the energy efficiency can be improved. However, There are problems in those techniques that traffic can be concentrated in some specific area in a network. In this paper, a new energy aware routing technique called MPSR is proposed to achieve longer network lifetime and fewer rerouting attempts.

On the Performance Evaluation of Energy-Aware Sleep Scheduling (EASS) in Energy Harvesting WSN (EH-WSN)

  • Encarnacion, Nico N.;Yang, Hyun-Ho
    • Journal of information and communication convergence engineering
    • /
    • v.10 no.3
    • /
    • pp.264-268
    • /
    • 2012
  • Tree-based structures offer assured optimal paths from the data source to the sink. Shortest routes are disregarded since these do not consider the remaining energy level of the nodes. This shortens the lifetime of the whole network. Most tree-based routing protocols, although aware of the nodes' energy, do not consider an energy aware sleep scheduling scheme. We propose an energy-aware sleep scheduling (EASS) scheme that will improve the sleep scheduling scheme of an existing tree-based routing protocol. An energy harvesting structure will be implemented on the wireless sensor network. The depth of sleep of every node will be based on the harvested energy.

Energy-Aware Routing Protocol for Mobile Ad Hoc Network (노드의 여유 에너지 기반 이동 Ad Hoc 네트워크의 라우팅 프로토콜)

  • Kwon, Soo-Kun
    • Journal of Korea Multimedia Society
    • /
    • v.8 no.8
    • /
    • pp.1108-1118
    • /
    • 2005
  • A mobile Ad Hoc network is a dynamic mobile wireless network that can be formed without the need for any pre-existing wired or wireless infrastructure. A mobile ad hoc node has limited battery capacity. Hence, Ad Hoc routing protocol ought to be energy conservative. Previous energy aware routing has limit in fairness among nodes and network wide power consumption. In this research, we propose a new routing protocol called Clustering Based Energy-Aware Routing(CBEAR) which can improve the problems. Simulation results show that the routing protocol improves fairness and network wide power consumption as well as life time of nodes.

  • PDF

An Energy Aware Source Routing with Disjoint Multipath Selection for Wireless Sensor Networks (무선 센서네트워크에서 다중 경로 선정에 기반한 에너지 인식 소스 라우팅 프로토콜)

  • Hwang Do-youn;Lim Jae-Sung
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.31 no.1A
    • /
    • pp.23-29
    • /
    • 2006
  • In wireless sensor networks(WSNs), it is crucial to maintain network connectivity as long as possible since nodes are battery-powered and unchange-able. We propose a new routing protocol called Energy Aware Source Routing(EASR) which can be efficient in respect of network lifetime and long-term connectivity. Our protocol is multipath source routing, only one path will be selected at the same time and each path has probability to be selected like as Energy Aware Routing(EAR) protocol. The route discovery procedure of EASR protocol is reformed from the route discovery procedure of Split Multipath Routing(SMR) protocol. However, there is the difference between SMR and EASR. In EASR, we define an overhearing ratio in order to reduce energy waste due to overhearing effect among each selected path. Thus, we can establish energy efficient multiple paths by making use of overhearing ratio. The simulation results are also demonstrated that our scheme increases in network lifetimes, and achieves reasonable packet latency time.

An Energy Effective Protocol for Clustering Ad Hoc Network

  • Lee, Kang-Whan;Chen, Yun
    • Journal of information and communication convergence engineering
    • /
    • v.6 no.2
    • /
    • pp.117-121
    • /
    • 2008
  • In ad hoc network, the scarce energy management of the mobile devices has become a critical issue in order to extend the network lifetime. Therefore, the energy consumption is important in the routing design, otherwise cluster schemes are efficient in energy conserving. For the above reasons, an Energy conserving Context aware Clustering algorithm (ECC) is proposed to establish the network clustering structure, and a routing algorithm is introduced to choose the Optimal Energy Routing Protocol (OERP) path in this paper. Because in ad hoc network, the topology, nodes residual energy and energy consuming rate are dynamic changing. The network system should react continuously and rapidly to the changing conditions, and make corresponding action according different conditions. So we use the context aware computing to actualize the cluster head node, the routing path choosing. In this paper, we consider a novel routing protocol using the cluster schemes to find the optimal energy routing path based on a special topology structure of Resilient Ontology Multicasting Routing Protocol (RODMRP). The RODMRP is one of the hierarchical ad hoc network structure which combines the advantage of the tree based and the mesh based network. This scheme divides the nodes in different level found on the node energy condition, and the clustering is established based on the levels. This protocol considered the residual energy of the nodes and the total consuming energy ratio on the routing path to get the energy efficiently routing. The proposed networks scheme could get better improve the awareness for data to achieve and performance on their clustering establishment and messages transmission. Also, by using the context aware computing, according to the condition and the rules defined, the sensor nodes could adjust their behaviors correspondingly to improve the network routing.

Energy Reduction Methods using Energy-aware QoS Routing Scheme and Its Characteristics in IP Networks (IP Network에서 Energy-aware QoS Routing에 의한 에너지 감소 방법 및 특성)

  • Han, Chimoon
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.49 no.9
    • /
    • pp.27-34
    • /
    • 2012
  • Today the energy consumption of ICT networks is about 10% of the worldwide power consumption and will be remarkably increased in the near future. For that reason, the energy saving topics of ICT networks are actually studying in various research institutes. This paper studies the possible energy saving methods assuring the QoS of networks on network level. This paper assumed the energy consumption models according to energy profiles of node and link in IP networks. Especially it formulates the energy problem of a minimum energy consumption with various energy profile models and suggests the methods of energy-aware QoS routing under energy saving and network QoS sustaining condition. It shows the large difference of energy saving according to energy profiles and the possibility of energy saving by using the appropriate energy profile model in the simulation experiment. This paper shows that min_used_path(MP) heuristic of energy-aware QoS routing is the excellent method compared with other heuristic methods as view of reduction ratio of nodes and links and energy saving effect under network QoS sustaining condition. As a result, this paper confirms that the min_used_path(MP) heuristic of energy-aware QoS routing can get energy saving and sustaining of network QoS in IP networks.

An Improved Energy Aware Greedy Perimeter Stateless Routing Protocol for Wireless Ad Hoc Network (무선 Ad Hoc 네트워크를 위한 개선된 위치정보 기반의 에너지를 고려한 라우팅 프로토콜)

  • Kim, Hak-Je;Yoon, Won-Sik
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.46 no.11
    • /
    • pp.25-31
    • /
    • 2009
  • In this paper we propose an improved energy aware greedy perimeter stateless routing protocol (EAGPSR) for wireless ad hoc network. The existing greedy perimeter stateless routine (GPSR) has some problems with overloaded node and void situation. The improved EAGPSR protocol is proposed to remedy these problems. It also gives the solution for the fundamental problem in geographical routine called void communication. It considers two parameters (Residual Energy of battery and distance to the destination) for the next hop selection. In order to use efficiently limited-energy of node in wireless ad hoc network, network lifetime is focused. To evaluate the performance of our protocol we simulated EAGPSR in ns-2. The simulation results show that the proposed protocol achieves longer network lifetime compared with greedy perimeter stateless routing (GPSR) and the existing Energy aware greedy perimeter stateless routing protocol (EAGPSR).

Energy-Aware Routing Algorithm using Backup Route for Ad hoc Network (애드혹 네트워크에서의 보조 경로를 이용한 에너지 인식 라우팅 알고리즘)

  • Jung Se-Won;Lee Chae-Woo
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.42 no.6 s.336
    • /
    • pp.23-32
    • /
    • 2005
  • This paper proposes a new algorithm for the energy constraint ad-hoc network which efficiently spread the energy usage over the network through the backup route scheme in order to increase the network lifetime. Recently, the various energy-efficient routing algorithms based on On-demanding method are proposed. Among them, PSR(Power-aware Source Routing) increased the network lifetime through the periodical route alternation depended on the use of the battery while DSR(Dynamice Source Routing) uses only the route selected during the route discovery phase. But PSR has a problem that it increases the route overhead because of the frequent flooding for the route alternation. For solving this problem, we propose HPSR(Hierarchical Power-aware Source Routing) which uses the backup route set during the route discovery in order to alternation the route without the flooding. HPSR increases the network lifetime due to the frequent route alternation using backup route while it decreases the routing overhead due to the reduced flooding. In this paper, we also prove the performance of HPSR through the simulation using OPNET.

Energy-aware Source Routing Protocol for Lifetime Maximization in Mobile Ad Hoc Networks (이동 애드혹 네트워크에서 생존시간 최대화를 위한 에너지 인지 소스 라우팅 프로토콜)

  • Choi, Hyun-Ho
    • The Journal of The Korea Institute of Intelligent Transport Systems
    • /
    • v.11 no.3
    • /
    • pp.31-39
    • /
    • 2012
  • In this paper, we propose an energy-aware source routing protocol for maximizing a network lifetime in mobile ad hoc network environments. The proposed routing protocol is based on the source routing and chooses a path that maximize the path lifetime, by considering both transmit/receive power consumption and residual battery power in the mobile nodes from the perspective of source-destination end-to-end. This paper proposes a new routing cost and designs a new routing protocol for minimizing the control packet overhead occurred during the route discovery. Simulation results show that the proposed scheme has similar performances to the conventional routing schemes in terms of the number of transmission hops, transmission rate and total energy consumption, but achieves the performance improvement of 20 percent with respect to the lifetime.