Please use this identifier to cite or link to this item: http://dspace.library.iitb.ac.in/xmlui/handle/100/15496
Title: Spatial Link Scheduling for SCDMA Multihop Cellular Networks: A Cross Layer Framework
Authors: KANNAN, G
MERCHANT, SN
DESAI, UB
Keywords: Scheduling
Multihop Cellular Networks
Spatial Reuse
Issue Date: 2012
Publisher: SPRINGER
Citation: WIRELESS PERSONAL COMMUNICATIONS, 63(2)279-295
Abstract: Probability of error based Spatial Code Division Multiple Access scheduling algorithm is presented in this paper to systematically reuse the orthogonal CDMA codes in a given cell for Multihop Cellular Network. We assign and reuse the CDMA codes to peer-to-peer links such that the probability of error in all scheduled links are below certain threshold. The proposed scheduling algorithm PoE-LinkSchedule involves two phases. In the first phase we present a scheduling metric "Probability of Error (PoE)" as a function of first and second order statistics of wireless channel coefficients between nodes. The second phase presents a graph theoretical as well as PoE based centralized scheduling algorithm. For a graph of network with n number of nodes, U number of links and theta thickness, the proposed scheduling algorithm has computational complexity of O(Unlogn + Un theta) as opposed to O(U (U) ) in the case of exhaustive search algorithm. The performance of the proposed algorithm is evaluated in terms of spatial reuse and end-to-end throughput. We show that the proposed algorithm has considerably higher end-to-end throughput and higher spatial reuse compared to existing link scheduling algorithms.
URI: http://dx.doi.org/10.1007/s11277-010-0118-1
http://dspace.library.iitb.ac.in/jspui/handle/100/15496
Appears in Collections:Article

Files in This Item:
There are no files associated with this item.


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.