A Novel Link Scheduling Algorithm for Spatial Reuse in Wireless Networks

Author

Liu, Weiqiang ; Miao, Dandan ; Chen, Xiaohui ; Wang, Weidong

Author_Institution

Sch. of Inf. Sci. & Technol., Univ. of Sci. & Technol. of China, Hefei, China

fYear

2012

fDate

3-6 Sept. 2012

Firstpage

1

Lastpage

5

Abstract

In this paper, we study the problem of one-slot scheduling under the exact SINR interference model, which aims to find a maximum subset of links to be scheduled simultaneously in one slot. We present a novel link scheduling algorithm (DIVISION) to give an effect solution for link scheduling. Algorithm DIVISION seeks to schedule the wireless links by their geometric locations, which provides a new angle to explore the spatial reuse in wireless networks. Combined with numerical results, it is pointed out that the proposed algorithm has the same complexity as the typical algorithm GOW* which is also based on space scheduling, but yields potential better performance of the network throughput.

Keywords

interference suppression; wireless channels; DIVISION; SINR interference model; geometric location; link scheduling algorithm; one-slot scheduling; space scheduling; spatial reuse; wireless links; wireless network; Computational complexity; Interference; Receivers; Scheduling; Signal to noise ratio; Throughput; Wireless networks;

fLanguage

English

Publisher

ieee

Conference_Titel

Vehicular Technology Conference (VTC Fall), 2012 IEEE

Conference_Location

Quebec City, QC

ISSN

1090-3038

Print_ISBN

978-1-4673-1880-8

Electronic_ISBN

1090-3038

Type

conf

DOI

10.1109/VTCFall.2012.6398880

Filename

6398880