• Title/Summary/Keyword: power aware routing

Search Result 71, Processing Time 0.025 seconds

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.

Traffic Load & Lifetime Deviation based Power-aware Routing Protocol for MANET (MANET에서 트래픽 부하와 노드 수명 편차에 기반한 power-aware 라우팅 프로토콜)

  • Kim, Dong-Hyun;Ha, Rhan
    • Journal of KIISE:Information Networking
    • /
    • v.33 no.5
    • /
    • pp.395-406
    • /
    • 2006
  • In ad hoc networks, the limited battery capacity of nodes affects a lifetime of network Recently, a large variety of power-aware routing protocols have been proposed to improve an energy efficiency of ad hoc networks. Existing power-aware routing protocols basically consider the residual battery capacity and transmission power of nodes in route discovery process. This paper proposes a new power-aware routing protocol, TDPR(Traffic load & lifetime Deviation based Power-aware Routing protocol), that does not only consider residual battery capacity and transmission power, but also the traffic load of nodes and deviation among the lifetimes of nodes. It helps to extend the entire lifetime of network and to achieve load balancing. Simulations using ns-2[14] show the performance of the proposed routing protocol in terms of the load balancing of the entire network, the consumed energy capacity of nodes, and an path's reliability TDPR has maximum 72% dead nodes less than AODV[4], and maximum 58% dead nodes less than PSR[9]. And TDPR consumes residual energy capacity maximum 29% less than AODV, maximum 15% less than PSR. Error messages are sent maximum 38% less than PSR, and maximum 41% less than AODV.

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

  • Lee, Byung-Geon;Yoon, Won-Sik
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.45 no.7
    • /
    • pp.62-66
    • /
    • 2008
  • In this paper we have proposed a power aware location based routing protocol for wireless ad hoc network. The existing greedy perimeter stateless routing (GPSR) has some problems which are certain node overloaded and void situation. The proposed power aware greedy perimeter stateless routing (PAGPSR) protocol gives a solution for these problems in GPSR. PAGPSR uses power aware and geographically informed neighbor selection to route a packet towards the destination. It also gives a solution for the fundamental problem in geographical routing called communication void. It considers residual energy of battery and distance to the destination for the next hope node selection. When it encounters a void it starts limited-flooding to select next hop node. To evaluate the performance of our protocol we simulated PAGPSR in ns-2. Our simulation results show that our protocol achieves longer network lifetime compared with greedy perimeter stateless routing (GPSR).

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.

Power Aware Routing Protocol in Multimedia Ad-hoc Network Considering Hop Lifetime of Node

  • Huh, Jun-Ho;Kim, Yoondo;Seo, Kyungryong
    • Journal of Multimedia Information System
    • /
    • v.1 no.2
    • /
    • pp.101-110
    • /
    • 2014
  • The purpose of this research is to extend Ad-hoc network system lifetime with the proposed routing protocol which has considered hop lifetimes of the nodes while guaranteeing QoS in the establishment process of Ad-hoc network communication paths. Based on another power aware routing system that proposed in the advanced research [1], we are proposing an alternative power aware routing system in which nodes' hop lifetimes are compared in order to extend the lifetime of an Ad-hoc network system and delay factors have been considered for the assurance of QoS. The research of the routing protocol in this paper, which aims to maximize the system survival time considering power consumption status during the path searching in MANET and pursues the mechanism that controls hop delays for the same reason, can be applied to the study of WSN. The study concerning such phenomena is essential so that the proposed protocol has been simulated and verified with NS-2 in Linux system focusing on the lifetimes of the hops of the nodes. Commercialization of smart devices and arrival of the ubiquitous age has brought about the world where all the people and things are connected with networks. Since the proposed power aware method and the hop delay control mechanism used to find the adequate communication paths in MANET which mainly uses batteries or in WSN, they can largely contribute to the lifetime extension of the network system by reducing power consumptions when utilized for the communications attempts among soldiers during military operation, disaster areas, temporary events or exhibitions, mobile phone shadow areas, home networks, in-between vehicle communications and sense networks, etc. This paper presents the definitions and some advantages regarding the proposed outing protocol that sustain and extend the lifetime of the networks.

  • PDF

Route Selection Protocol based on Energy Drain Rates in Mobile Ad Hoc Networks (무선 Ad Hoc 통신망에서 에너지 소모율(Energy Drain Rate)에 기반한 경로선택 프로토콜)

  • Kim, Dong-Kyun
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.28 no.7A
    • /
    • pp.451-466
    • /
    • 2003
  • Untethered nodes in mobile ad-hoc networks strongly depend on the efficient use of their batteries. In this paper, we propose a new metric, the drain rate, to forecast the lifetime of nodes according to current traffic conditions. This metric is combined with the value of the remaining battery capacity to determine which nodes can be part of an active route. We describe new route selection mechanisms for MANET routing protocols, which we call the Minimum Drain Rate (MDR) and the Conditional Minimum Drain Rate (CMDR). MDR extends nodal battery life and the duration of paths, while CMDR also minimizes the total transmission power consumed per packet. Using the ns-2 simulator and the dynamic source routing (DSR) protocol, we compare MDR and CMDR against prior proposals for power-aware routing and show that using the drain rate for power-aware route selection offers superior performance results.

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-efficient Power-aware Routing Protocol based on Load-balancing for Ad hoc Networks (Ad hoc 네트워크 환경에서 부하 균등 기반의 power-aware 라우팅 프로토콜)

  • Kim Dong-hyun;Ha Rhan
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2005.11a
    • /
    • pp.379-381
    • /
    • 2005
  • Ad hoc 네트워크에서 노드의 한정된 에너지 용량은 개설 경로의 수명과 안정성에 많은 영향을 미치는 요소이다. 따라서 이러한 에너지 한계를 극복하기 위한 다양한 power-aware 라우팅 프로토콜들이 네트워크 계층에서 제안되고 있으며, 이들 라우팅 프로토콜들은 기본적으로 노드의 배터리 잔량 에너지와 전송 전력량을 경로 탐색 과정에서 반영한다. 본 논문에서는 기존의 power-aware 라우팅 프로토콜보다 개설 경로의 동작시간을 높이고 전체 네트워크의 부하균등을 이를 수 있도록 하는 새로운 라우팅 프로토콜을 제안하며 TPR(Traffic load based power-aware routing protocol)로 명명한다. TPR은 NS-2를 이용한 성능 평가를 통해 전체 네트워크의 부하 균등과 개설 경로의 수면, 안정성 측면에서의 개선점을 확인한다.

  • PDF

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.

CLSR: Cognitive Link State Routing for CR-based Tactical Ad Hoc Networks

  • Ahn, Hyochun;Kim, Jaebeom;Ko, Young-Bae
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.9 no.1
    • /
    • pp.50-67
    • /
    • 2015
  • The Cognitive Radio (CR) paradigm in tactical ad hoc networks is an important element of future military communications for network-centric warfare. This paper presents a novel Cognitive Link State Routing protocol for CR-based tactical ad hoc networks. The proposed scheme provides prompt and reliable routes for Primary User (PU) activity through procedures that incorporate two main functions: PU-aware power adaptation and channel switching. For the PU-aware power adaptation, closer multipoint relay nodes are selected to prevent network partition and ensure successful PU communication. The PU-aware channel switching is proactively conducted using control messages to switch to a new available channel based on a common channel list. Our simulation study based on the ns-3 simulator demonstrates that the proposed routing scheme delivers significantly improved performance in terms of average end-to-end delay, jitter, and packet delivery ratio.