Energy-Efficient Relay-Selection-Based Dynamic Routing Algorithm for IoT-Oriented Software-Defined WSNs

In this article, a dynamic routing algorithm based on energy-efficient relay selection (RS), referred to as DRA-EERS, is proposed to adapt to the higher dynamics in time-varying software-defined wireless sensor networks (SDWSNs) for the Internet-of-Things (IoT) applications. First, the time-varying...

Full description

Saved in:
Bibliographic Details
Published in:IEEE internet of things journal Vol. 7; no. 9; pp. 9050 - 9065
Main Authors: Ding, Zhaoming, Shen, Lianfeng, Chen, Hongyang, Yan, Feng, Ansari, Nirwan
Format: Journal Article
Language:English
Published: Piscataway IEEE 01.09.2020
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:
Algorithms
Coefficients
Computer simulation
Dynamic routing
Energy efficiency
energy efficiency (EE)
Heuristic algorithms
Internet of Things
Internet of Things (IoT)
Markov chains
Optimization
Relay
relay selection (RS)
Relays
Routing
Routing protocols
Shortest-path problems
Software
software-defined wireless sensor networks (SDWSNs)
Transition probabilities
Weight
Wireless sensor networks
ISSN:2327-4662, 2327-4662
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In this article, a dynamic routing algorithm based on energy-efficient relay selection (RS), referred to as DRA-EERS, is proposed to adapt to the higher dynamics in time-varying software-defined wireless sensor networks (SDWSNs) for the Internet-of-Things (IoT) applications. First, the time-varying features of SDWSNs are investigated from which the state-transition probability (STP) of the node is calculated based on a Markov chain. Second, a dynamic link weight is designed for DRA-EERS by incorporating both the link reward and the link cost, where the link reward is related to the link energy efficiency (EE) and the node STP, while the link cost is affected by the locations of nodes. Moreover, one adjustable coefficient is used to balance the link reward and the link cost. Finally, the energy-efficient routing problem can be formulated as an optimization problem, and DRA-EERS is performed to find the best relay according to the energy-efficient RS criteria derived from the designed link weight. The simulation results demonstrate that the path EE obtained by DRA-EERS through an available coefficient adjustment outperforms that by Dijkstra's shortest path algorithm. Again, a tradeoff between the EE and the throughput can be achieved by adjusting the coefficient of the link weight, i.e., increasing the impact of the link reward to improve the EE, and otherwise, to improve the throughput.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:2327-4662
2327-4662
DOI:10.1109/JIOT.2020.3002233