On High Spatial Reuse Link Scheduling in STDMA Wireless Ad Hoc Networks

Author

Gore, Ashutosh Deepak ; Karandikar, Abhay ; Jagabathula, Srikanth

Author_Institution

Indian Inst. of Technol., Mumbai

fYear

2007

fDate

26-30 Nov. 2007

Firstpage

736

Lastpage

741

Abstract

We consider the point-to-point link scheduling problem in Spatial Time Division Multiple Access (STDMA) wireless ad hoc networks, motivate the use of spatial reuse as performance metric and provide an explicit characterization of spatial reuse. We assume uniform transmission power at all nodes and propose an algorithm based on a graph model of the network as well as Signal to Interference and Noise Ratio (SINR) computations. Our algorithm achieves higher spatial reuse than existing algorithms, without compromising on computational complexity.

Keywords

ad hoc networks; graph theory; scheduling; time division multiple access; STDMA; computational complexity; graph model; high spatial reuse link scheduling; point-to-point link scheduling; signal to interference and noise ratio computations; spatial time division multiple access; wireless ad hoc networks; Broadcasting; Computational complexity; Computer networks; Interference; Measurement; Mobile ad hoc networks; Scheduling algorithm; Signal to noise ratio; Throughput; Time division multiple access;

fLanguage

English

Publisher

ieee

Conference_Titel

Global Telecommunications Conference, 2007. GLOBECOM '07. IEEE

Conference_Location

Washington, DC

Print_ISBN

978-1-4244-1042-2

Electronic_ISBN

978-1-4244-1043-9

Type

conf

DOI

10.1109/GLOCOM.2007.143

Filename

4411053