Complexity reduction of throughput optimal link scheduling algorithm through topology control in wireless networks
by Ali Ghiasian; Behnaz Omoomi; Hossein Saidi
International Journal of Ad Hoc and Ubiquitous Computing (IJAHUC), Vol. 27, No. 1, 2018

Abstract: In single channel wireless networks, concurrent transmissions at different links may interfere with each other. To improve system throughput, a scheduling algorithm is necessary to choose a subset of links for data transmission. Throughput optimal link scheduling discipline is generally an NP-hard problem. In this paper, we utilise the concept of line graph and extend it to line multigraph to cope with the complexity issue of the maximum weight scheduling (MWS) algorithm. The necessary and sufficient conditions for reducing the complexity of MWS in terms of network topology are derived. We prove that the complexity of eLehot is polynomial time provided that conflict graph does not contain seven derived forbidden graphs as induced subgraphs. We also propose eLehot algorithm for detecting whether a graph is line multigraph and output its root graph. The results of this paper introduce a new approach in wireless topology control where the target is complexity reduction.

Online publication date: Tue, 05-Dec-2017

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
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 Ad Hoc and Ubiquitous Computing (IJAHUC):
Login with your Inderscience username and password:

    Username:        Password:         

Forgotten your 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