Title: JORCA: joint opportunistic routing and channel assignment

Authors: Shiming He; Dafang Zhang; Kun Xie; Ji Zhang; Hong Qiao

Addresses: School of Information Science and Engineering, Hunan University, Changsha, Hunnan, China ' School of Information Science and Engineering, Hunan University, Changsha, Hunnan, China ' School of Information Science and Engineering, Hunan University, Changsha, Hunnan, China ' School of Information Science and Engineering, Hunan University, Changsha, Hunnan, China ' School of Information Science and Engineering, Hunan University, Changsha, Hunnan, China

Abstract: Opportunistic routing (OR) can improve the throughput of wireless mesh networks (WMNs). Most existing studies on OR focus on single-radio WMNs, where the severe interference may largely decrease the performance. Only a few works have studied OR in multiradio multi-channel WMNs, while they either select opportunistic route with given channel assignment, or assign channel based on selected opportunistic routing, which separate the interdependency of opportunistic routing and channel assignment, and can hardly achieve good performance. This paper formulates the joint problem of opportunistic routing and channel assignment as a mixed integer programming (MIP) problem and proves it to be NP-hard. To solve it, we propose a heuristic iterative algorithm named joint opportunistic routing and channel assignment (JORCA) which exploits multi-user diversity and channel resource. The simulation results demonstrate that, comparing with the two existing solutions, JORCA improves 44% and 15.5% in total throughput.

Keywords: wireless mesh networks; multi-radio WMNs; multi-channel WMNs; opportunistic routing; channel assignment; mixed integer programming; MIP; simulation; throughput.

DOI: 10.1504/IJES.2014.063812

International Journal of Embedded Systems, 2014 Vol.6 No.2/3, pp.148 - 157

Available online: 22 Jul 2014 *

Full-text access for editors Access for subscribers Purchase this article Comment on this article