OR-AHaD: An Opportunistic Routing Algorithm for Energy Harvesting WSN

نویسندگان

  • Sanam Shirazi Beheshtiha
  • Hwee-Pink Tan
  • Masoud Sabaei
  • Fabrice Theoleyre
چکیده

With recent advances, the trend has shifted from battery-powered wireless sensor networks towards ones powered by ambient energy harvesters (WSN-HEAP). In such networks, operability of the node is dependent on the harvesting rate which is usually stochastic in nature. Therefore, it is necessary to devise routing protocols with energy management capabilities that consider variations in the availability of the environmental energy. In this book chapter, we design OR-AHaD, an Opportunistic Routing algorithm with Adaptive Harvesting-aware Duty Cycling. In the proposed algorithm, candidates are primarily prioritized by applying geographical zoning and later coordinated in a timer-based fashion by exchanging coordination messages. An energy management model is presented which uses the estimated harvesting rate in the near future to adjust the duty cycle of each node adaptively. Simulation results show that OR-AHaD exploits the available energy resources in an efficient way and increases goodput in comparison to other opportunistic routing protocols for WSN-HEAP.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Opportunistic routing in wireless sensor networks powered by ambient energy harvesting

Energy consumption is an important issue in the design of wireless sensor networks (WSNs) which typically rely on portable energy sources like batteries for power. Recent advances in ambient energy harvesting technologies have made it possible for sensor nodes to be powered by ambient energy entirely without the use of batteries. However, since the energy harvesting process is stochastic, exact...

متن کامل

Leach Routing Algorithm Optimization through Imperialist Approach

Routing is an important challenge in WSN due to the presence of hundreds or thousands of sensor nodes. Low Energy Adaptive Clustering Hierarchy (LEACH) is a hierarchical routing and data dissemination protocol. LEACH divides a network domain into several sub-domains that are called clusters. Non-uniformity of cluster distribution and CHs selection without considering the positions of other sens...

متن کامل

Opportunistic Routing in Large - scale Energy Harvesting Wireless Sensor Networks by Hossein

Opportunistic Routing in Large-scale Energy Harvesting Wireless Sensor Networks Hossein Shafieirad Master of Applied Sciences Graduate Department of Electrical and Computer Engingeering University of Toronto 2016 Energy self-sufficiency is one of the main bottlenecks in the implementation of wireless sensor networks (WSNs). In this regard, energy harvesting (EH), the capture of energy from ambi...

متن کامل

An Adaptive LEACH-based Clustering Algorithm for Wireless Sensor Networks

LEACH is the most popular clastering algorithm in Wireless Sensor Networks (WSNs). However, it has two main drawbacks, including random selection of cluster heads, and direct communication of cluster heads with the sink. This paper aims to introduce a new centralized cluster-based routing protocol named LEACH-AEC (LEACH with Adaptive Energy Consumption), which guarantees to generate balanced cl...

متن کامل

IJSRD - International Journal for Scientific Research & Development| Vol. 5, Issue 03, 2017 | ISSN (online): 2321-0613

the major research problem in WSN is to save energy in different operations of the network and increase the lifetime. Most of the energy of a node is consumed during routing process. This is because the environment in which the WSN is used is unstable in nature most of the time like in habitat monitoring, defense applications and industrial applications etc. Hence, there is a need of energy eff...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013