Spatial Link Scheduling for SCDMA Multihop Cellular Networks: A Cross Layer Framework

Authors:
G. Kannan;S. N. Merchant;U. B. Desai
Affiliations:
SPANN Laboratory, Department of Electrical Engineering, IIT Bombay, Mumbai, India 400076;SPANN Laboratory, Department of Electrical Engineering, IIT Bombay, Mumbai, India 400076;SPANN Laboratory, Department of Electrical Engineering, IIT Bombay, Mumbai, India 400076
Venue:
Wireless Personal Communications: An International Journal
Year:
2012

Citing 11
Cited 0

Scheduling algorithms for multihop radio networks

IEEE/ACM Transactions on Networking (TON)
Randomized algorithms

Randomized algorithms
Code assignment for hidden terminal interference avoidance in multihop packet radio networks

IEEE/ACM Transactions on Networking (TON)
A Scheduling Framework for UWB & Cellular Networks

BROADNETS '04 Proceedings of the First International Conference on Broadband Networks
Topology control meets SINR: the scheduling complexity of arbitrary topologies

Proceedings of the 7th ACM international symposium on Mobile ad hoc networking and computing
Multihop cellular networks: Technology and economics

Computer Networks: The International Journal of Computer and Telecommunications Networking
A Cross Layer Routing Protocol for Multihop Cellular Networks

Wireless Personal Communications: An International Journal
Performance analysis of multihop cellular network with fixed channel assignment

Wireless Networks
Channel Assignment for Multihop Cellular Networks: Minimum Delay

IEEE Transactions on Mobile Computing
Joint scheduling and power control for wireless ad hoc networks

IEEE Transactions on Wireless Communications
Minimum probability of error-based methods for adaptive multiuser detection in multipath DS-CDMA channels

IEEE Transactions on Wireless Communications

Quantified Score

Hi-index	0.00

Visualization

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 驴 thickness, the proposed scheduling algorithm has computational complexity of O(Unlogn + Un驴) 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.