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.
Article PDF
Avoid common mistakes on your manuscript.
References
Li X. J., Seet B.-C., Chong P. H. J. (2008) Multihop cellular networks: Technology and economics. Computer Networks 52(9): 1825–1837
Li X. J., Chong P. H. (2010) Performance analysis of multihop cellular network with fixed channel assignment. Wireless Networks 16(2): 511–526
Tam Y. H., Benkoczi R., Hassanein H. S., Akl S. G. (2010) Channel assignment for multihop cellular networks: Minimum delay. IEEE Transactions on Mobile Computing 9: 1022–1034
Kannan G., Huang Y., Bhatti S. N., Merchant S. N., Desai U. B. (2009) A cross layer routing protocol for multihop cellular networks. Wireless Personal Communications 51(3): 427–447
Lin, Y., & Hsu, Y. (2000). Multi-hop cellular: A new architecture for wireless communications. In IEEE INFOCOM 2000 (Vol. 3, pp. 1273–1282). Tel-Aviv, Israel: Dan Panorama Hotel, 26–30 March 2000.
Cho, J., & Haas, Z. J. (2004). Impact of concurrent transmissions on downstream throughput in multi-hop cellular networks. In IEEE international conference on communications, ICC 04 (pp. 3748–3753). June 2004.
Ramanathan S., Lloyd E. L. (1993) Scheduling algorithms for multihop radio networks. IEEE/ACM Transactions on Networking 1: 166–177
Bertossi A. A., Bonuccelli M. A. (1995) Code assignment for hidden terminal interference avoidance in multihop packet radio networks. IEEE/ACM Transactions on Networking 3: 441–449
Behzad, A., & Rubin, I. (2003). On the performance of graph-based scheduling algorithms for packet radio networks. In IEEE GLOBECOM 2003 (Vol. 6, pp. 3432–3436). Dec 2003.
Moscibroda, T., & Wattenhofer, R. (2006). The complexity of connectivity in wireless networks. In IEEE INFOCOM 2006. April 2006.
Moscibroda, R. W. T., & Zollinger, A. (2006). Topology control meets sinr: The scheduling complexity of arbitrary topologies. In ACM MobiHoc 2006 (pp. 310–321). May 2006.
Rajeswaran, A., Kim, G., & Negi, R. (2004). A scheduling framework for uwb & cellular networks. In Proceedings of the first international conference on broadband networks, BroadNets 2004 (pp. 386–395).
ElBatt T., Ephremides A. (2004) Joint scheduling and power control for wireless ad-hoc networks. IEEE Transactions on Wireless Communications 3: 74–85
Leonardi, E., Mellia, M., Marsan, M. A., & Neri, F. (2005). Joint optimal scheduling and routing for maximum network throughput. In IEEE INFOCOM 2005 (Vol. 2, pp. 310–321). 13–17 March 2005.
Johansson, M., & Xiao, L. (2004). Scheduling, routing and power allocation for fairness in wireless networks. In VTC 2004-Spring (Vol. 3, pp. 1355–1360). 17–19 May 2004.
Srivastava, S., Tripathi, S., Sanghi, D., & Chaturvedi, A. K. (2003). A code allocation protocol for maximizing throughput in cdma based ad hoc networks. In IEEE-Globecom-2003 (Vol. 2, pp. 1385–1390). 16–20 Mar 2003.
Dua A., Desai U. B., Mallik R. K. (2004) Minimum probability of error based methods for adaptive multiuser detection in multipath DS-CDMA channels. IEEE Transactions on Wireless Communications 3: 939–948
Gore, A. D., Karandikar, A., & Jagabathula, S. (2007). On high spatial reuse link scheduling in STDMA wireless ad hoc networks. In Proceedings of the IEEE global communications conference, GLOBECOM 07 (pp. 736–741). Nov 2007.
Dua, A. (2002). MPOE based multiuser detection for DS-CDMA communications. Dual degree dissertation (BTech and MTech), Iit Bombay, June 2002.
Motwani R., Raghavan P. (1995) Randomized algorithms. Cambridge University Press, Cambridge
Forests, Frames, and Games: Algorithms for Matroid Sums and Applications (Vol. 7) (1992).
Bettstetter, C. (2003). Topology properties of ad hoc networks with random waypoint mobility. June 2003.
Acknowledgment
This work was supported by Microsoft Research India under the MSRI PhD Fellowship Award 2006. Authors acknowledge Ashutosh Deepak Gore of Electrical Engineering Department, IIT-Bombay for the technical discussions and valuable inputs.
Open Access
This article is distributed under the terms of the Creative Commons Attribution Noncommercial License which permits any noncommercial use, distribution, and reproduction in any medium, provided the original author(s) and source are credited.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Open Access This is an open access article distributed under the terms of the Creative Commons Attribution Noncommercial License (https://creativecommons.org/licenses/by-nc/2.0), which permits any noncommercial use, distribution, and reproduction in any medium, provided the original author(s) and source are credited.
About this article
Cite this article
Kannan, G., Merchant, S.N. & Desai, U.B. Spatial Link Scheduling for SCDMA Multihop Cellular Networks: A Cross Layer Framework. Wireless Pers Commun 63, 279–295 (2012). https://doi.org/10.1007/s11277-010-0118-1
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11277-010-0118-1