IEICE TRANSACTIONS on Communications
A Channel-Aware Scheduling Scheme for (m,k)-Firm Streams in Wireless Multimedia Sensor Networks
Summary :
In this letter, we propose a channel-aware scheduling algorithm to support real-time applications in wireless multimedia sensor networks. Multimedia streams are sensitive to real-time delivery but can tolerate some packet loss. Therefore, this specific application is modelled as an (m,k)-firm stream. To satisfy the real-time requirements, a scheduling scheme that provides packet partitioning and real-time delivery is proposed. Packet partitioning combines static assignment and dynamic adjustment while considering the channel state. The scheme is designed to minimize the number of mandatory packets delivered in a bad channel state to avoid dynamic failure. In addition, automatic repeat request technology is introduced to enhance the reliability of real-time delivery. Simulations and analyses show that the proposed scheme has a good ability to withstand a bad channel status.
- Publication
- IEICE TRANSACTIONS on Communications Vol.E95-B No.10 pp.3312-3315
- Publication Date
- 2012/10/01
- Publicized
- Online ISSN
- 1745-1345
- DOI
- 10.1587/transcom.E95.B.3312
- Type of Manuscript
- LETTER
- Category
- Network
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Changxiao ZHAO, Huagang XIONG, "A Channel-Aware Scheduling Scheme for (m,k)-Firm Streams in Wireless Multimedia Sensor Networks" in IEICE TRANSACTIONS on Communications,
vol. E95-B, no. 10, pp. 3312-3315, October 2012, doi: 10.1587/transcom.E95.B.3312.
Abstract: In this letter, we propose a channel-aware scheduling algorithm to support real-time applications in wireless multimedia sensor networks. Multimedia streams are sensitive to real-time delivery but can tolerate some packet loss. Therefore, this specific application is modelled as an (m,k)-firm stream. To satisfy the real-time requirements, a scheduling scheme that provides packet partitioning and real-time delivery is proposed. Packet partitioning combines static assignment and dynamic adjustment while considering the channel state. The scheme is designed to minimize the number of mandatory packets delivered in a bad channel state to avoid dynamic failure. In addition, automatic repeat request technology is introduced to enhance the reliability of real-time delivery. Simulations and analyses show that the proposed scheme has a good ability to withstand a bad channel status.
URL: https://global.ieice.org/en_transactions/communications/10.1587/transcom.E95.B.3312/_p
Copy
@ARTICLE{e95-b_10_3312,
author={Changxiao ZHAO, Huagang XIONG, },
journal={IEICE TRANSACTIONS on Communications},
title={A Channel-Aware Scheduling Scheme for (m,k)-Firm Streams in Wireless Multimedia Sensor Networks},
year={2012},
volume={E95-B},
number={10},
pages={3312-3315},
abstract={In this letter, we propose a channel-aware scheduling algorithm to support real-time applications in wireless multimedia sensor networks. Multimedia streams are sensitive to real-time delivery but can tolerate some packet loss. Therefore, this specific application is modelled as an (m,k)-firm stream. To satisfy the real-time requirements, a scheduling scheme that provides packet partitioning and real-time delivery is proposed. Packet partitioning combines static assignment and dynamic adjustment while considering the channel state. The scheme is designed to minimize the number of mandatory packets delivered in a bad channel state to avoid dynamic failure. In addition, automatic repeat request technology is introduced to enhance the reliability of real-time delivery. Simulations and analyses show that the proposed scheme has a good ability to withstand a bad channel status.},
keywords={},
doi={10.1587/transcom.E95.B.3312},
ISSN={1745-1345},
month={October},}
Copy
TY - JOUR
TI - A Channel-Aware Scheduling Scheme for (m,k)-Firm Streams in Wireless Multimedia Sensor Networks
T2 - IEICE TRANSACTIONS on Communications
SP - 3312
EP - 3315
AU - Changxiao ZHAO
AU - Huagang XIONG
PY - 2012
DO - 10.1587/transcom.E95.B.3312
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E95-B
IS - 10
JA - IEICE TRANSACTIONS on Communications
Y1 - October 2012
AB - In this letter, we propose a channel-aware scheduling algorithm to support real-time applications in wireless multimedia sensor networks. Multimedia streams are sensitive to real-time delivery but can tolerate some packet loss. Therefore, this specific application is modelled as an (m,k)-firm stream. To satisfy the real-time requirements, a scheduling scheme that provides packet partitioning and real-time delivery is proposed. Packet partitioning combines static assignment and dynamic adjustment while considering the channel state. The scheme is designed to minimize the number of mandatory packets delivered in a bad channel state to avoid dynamic failure. In addition, automatic repeat request technology is introduced to enhance the reliability of real-time delivery. Simulations and analyses show that the proposed scheme has a good ability to withstand a bad channel status.
ER -
English
