Full text

Turn on search term navigation

Copyright © 2018 Mohamed Saad. This work is licensed under http://creativecommons.org/licenses/by/4.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.

Abstract

Finding the route with maximum end-to-end spectral efficiency in multihop wireless networks has been subject to interest in the recent literature. All previous studies, however, focused on finding one route from a given source to a given destination under the constraint of equal bandwidth sharing. To the best of our knowledge, for the first time, this paper provides extensions to the multicommodity flow case, i.e., the case of multiple simultaneous source-destination (s-d) pairs. In particular, given an arbitrary number of s-d pairs, we address the problem of finding a route for every s-d pair such that the minimum spectral efficiency across all routes is maximized. We provide two alternative approaches, where one is based on fixed-sized time slots and the other is based on variable-sized time slots. For each approach, we derive the provably optimal routing algorithm. We also shed the light on the arising tradeoff between the complexity of network-layer route computation and the complexity of medium access control (MAC) layer scheduling of time slots, as well as the amenability to distributed implementation of our proposed algorithms. Our numerical results further illustrate the efficiency of the proposed approaches and their tradeoffs.

Details

Title
Optimal Multicommodity Spectrum-Efficient Routing in Multihop Wireless Networks
Author
Saad, Mohamed 1   VIAFID ORCID Logo 

 Department of Electrical and Computer Engineering, University of Sharjah, Sharjah, UAE 
Editor
Jose M Gimenez-Guzman
Publication year
2018
Publication date
2018
Publisher
John Wiley & Sons, Inc.
e-ISSN
15308677
Source type
Scholarly Journal
Language of publication
English
ProQuest document ID
2407627412
Copyright
Copyright © 2018 Mohamed Saad. This work is licensed under http://creativecommons.org/licenses/by/4.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.