Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/67530
Title: Inter-cell channel time-slot scheduling for multichannel multiradio cellular fieldbuses
Authors: Tan, A
Wang, Q 
Guan, N
Deng, Q
Hu, XS
Keywords: Wireless
Fieldbus
Ethernet
Real-time
Issue Date: 2015
Publisher: Institute of Electrical and Electronics Engineers
Source: 2015 IEEE Real-Time Systems Symposium, San Antonio, Texas, USA, 1-4 Dec 2015, p.227-238 How to cite?
Abstract: Recently there is a growing interest of incorporating cellular architecture (with wired base stations and last-hop wireless connections) into fieldbuses to support mobile real-time applications. A promising trend is that such cellular fieldbuses will go multichannel multiradio, due to the wide availability of cheap multichannel commercial-off-the-shelf (COTS) wireless nodes, and the rise of 4G and future cellular technologies. For multichannel multiradio cellular fieldbuses, per-flow real-time schedulability guarantee in the inter-cell level has not yet been well studied. Particularly, unlike 3G cellular networks, which use static FDMA/CDMA to isolate cells, the multichannel multiradio feature allows neighboring cells to use the same radio frequency channel at different time-slots, or the same time-slot at different radio frequency channels. How to carry out channel time-slot scheduling is therefore the focus of this paper. To address this issue, we propose a greedy scheduling algorithm, together with a polynomial time closed-form schedulability test. The relationship between the schedulability test result, greedy scheduling schedulability, and schedulability is explored. We prove the equivalence of the three for chained cellular fieldbus topology, a typical topology with broad applications. This also implies the optimality of greedy scheduling, and the sufficiency and necessity of the schedulability test in the context of chained topology. To demonstrate and validate these schedulability theories, we carry out a case study on a classic admission planning problem. The schedulability test not only serves as a planning constraint, but also guides us to propose an approximation algorithm to solve the NP-hard admission planning problem. Comparisons to exhaustive search corroborate the validity of our schedulability theories.
URI: http://hdl.handle.net/10397/67530
ISBN: 978-1-4673-9507-6 (print)
ISSN: 1052-8725
DOI: 10.1109/RTSS.2015.29
Appears in Collections:Conference Paper

Access
View full-text via PolyU eLinks SFX Query
Show full item record

Google ScholarTM

Check

Altmetric



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