Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/67530
DC FieldValueLanguage
dc.contributorDepartment of Computing-
dc.creatorTan, A-
dc.creatorWang, Q-
dc.creatorGuan, N-
dc.creatorDeng, Q-
dc.creatorHu, XS-
dc.date.accessioned2017-07-27T08:33:38Z-
dc.date.available2017-07-27T08:33:38Z-
dc.identifier.isbn978-1-4673-9507-6 (print)-
dc.identifier.issn1052-8725-
dc.identifier.urihttp://hdl.handle.net/10397/67530-
dc.language.isoenen_US
dc.publisherInstitute of Electrical and Electronics Engineersen_US
dc.subjectWirelessen_US
dc.subjectFieldbusen_US
dc.subjectEtherneten_US
dc.subjectReal-timeen_US
dc.titleInter-cell channel time-slot scheduling for multichannel multiradio cellular fieldbusesen_US
dc.typeConference Paperen_US
dc.identifier.spage227-
dc.identifier.epage238-
dc.identifier.doi10.1109/RTSS.2015.29-
dcterms.abstractRecently 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.-
dcterms.bibliographicCitation2015 IEEE Real-Time Systems Symposium, San Antonio, Texas, USA, 1-4 Dec 2015, p.227-238-
dcterms.issued2015-
dc.relation.conferenceIEEE Real-Time Systems Symposium [RTSS]-
dc.identifier.rosgroupid2015002090-
dc.description.ros2015-2016 > Academic research: refereed > Refereed conference paper-
Appears in Collections:Conference Paper
Access
View full-text via PolyU eLinks SFX Query
Show simple item record

SCOPUSTM   
Citations

1
Last Week
0
Last month
Citations as of Feb 15, 2020

WEB OF SCIENCETM
Citations

2
Last Week
0
Last month
Citations as of Oct 24, 2020

Page view(s)

129
Last Week
3
Last month
Citations as of Oct 21, 2020

Google ScholarTM

Check

Altmetric


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