Energy-Efficient Multi-User Routing in a Software-Defined Multi-Hop Wireless Network

Ziqi Liu, Gaochao Xu, Peng Liu, Xiaodong Fu and Yang Liu
Additional contact information
Ziqi Liu: College of Computer Science and Technology, Jilin University, Changchun 130012, China
Gaochao Xu: College of Computer Science and Technology, Jilin University, Changchun 130012, China
Peng Liu: College of Computer Science and Technology, Jilin University, Changchun 130012, China
Xiaodong Fu: College of Computer Science and Technology, Jilin University, Changchun 130012, China
Yang Liu: College of Computer Science and Technology, Jilin University, Changchun 130012, China

Future Internet, 2019, vol. 11, issue 6, 1-17

Abstract: Software-defined networking (SDN) is an innovative architecture that designs a logical controller to manage and program the network based on the global view, providing more efficient management, better performance, and higher flexibility for the network. Therefore, applying the SDN concept in a multi-hop wireless network (MWN) has been proposed and extensively studied to overcome the challenges of MWN. In this paper, we propose an energy-efficient global routing algorithm for a software-defined multi-hop wireless network (SDMWN), which is able to get transmission paths for several users at the same time to minimize the global energy consumption with the premise of satisfying the QoS required by users. To this end, we firstly propose a Lagrange relaxation-based aggregated cost (LARAC) and K-Dijkstra combined algorithm to get the top K energy-minimum paths that satisfy the QoS in polynomial time. Then, we combine the alternative paths of each user obtained by K-LARAC and propose an improved genetic algorithm to solve the global routing strategy. The simulation results show that the proposed K-LARAC and genetic algorithm combined method has the ability to obtain an approximate optimal solution with lower time cost.

Keywords: software-defined multi-hop wireless networking (SDMWN); QoS routing; Lagrange relaxation; K-Dijkstra; genetic algorithm (search for similar items in EconPapers)
JEL-codes: O3 (search for similar items in EconPapers)
Date: 2019
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
https://www.mdpi.com/1999-5903/11/6/133/pdf (application/pdf)
https://www.mdpi.com/1999-5903/11/6/133/ (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:gam:jftint:v:11:y:2019:i:6:p:133-:d:240626

Access Statistics for this article

Future Internet is currently edited by Ms. Grace You

More articles in Future Internet from MDPI
Bibliographic data for series maintained by MDPI Indexing Manager ().