JORCA: joint opportunistic routing and channel assignment Online publication date: Thu, 31-Jul-2014
by Shiming He; Dafang Zhang; Kun Xie; Ji Zhang; Hong Qiao
International Journal of Embedded Systems (IJES), Vol. 6, No. 2/3, 2014
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.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Embedded Systems (IJES):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook