In this letter, we propose a revised geographic routing protocol and a scheduling algorithm to support real-time applications, which are often observed in wireless sensor networks. In order to meet real-time requirement, a specific application is modeled as an (m,k)-firm stream that has a property of weakly hard real-time system. In addition, both a priority-based scheduling and a geographic forwarding scheme based on delay, distance, and remaining slack time are newly proposed. Simulations and their analysis are followed to validate the suitability of reduced dynamic failure probability and extended network lifetime.
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.
Copy
Ki-Il KIM, Tae-Eung SUNG, "Network Layer Approaches for (m,k)-Firm Stream in Wireless Sensor Networks" in IEICE TRANSACTIONS on Communications,
vol. E93-B, no. 11, pp. 3165-3168, November 2010, doi: 10.1587/transcom.E93.B.3165.
Abstract: In this letter, we propose a revised geographic routing protocol and a scheduling algorithm to support real-time applications, which are often observed in wireless sensor networks. In order to meet real-time requirement, a specific application is modeled as an (m,k)-firm stream that has a property of weakly hard real-time system. In addition, both a priority-based scheduling and a geographic forwarding scheme based on delay, distance, and remaining slack time are newly proposed. Simulations and their analysis are followed to validate the suitability of reduced dynamic failure probability and extended network lifetime.
URL: https://global.ieice.org/en_transactions/communications/10.1587/transcom.E93.B.3165/_p
Copy
@ARTICLE{e93-b_11_3165,
author={Ki-Il KIM, Tae-Eung SUNG, },
journal={IEICE TRANSACTIONS on Communications},
title={Network Layer Approaches for (m,k)-Firm Stream in Wireless Sensor Networks},
year={2010},
volume={E93-B},
number={11},
pages={3165-3168},
abstract={In this letter, we propose a revised geographic routing protocol and a scheduling algorithm to support real-time applications, which are often observed in wireless sensor networks. In order to meet real-time requirement, a specific application is modeled as an (m,k)-firm stream that has a property of weakly hard real-time system. In addition, both a priority-based scheduling and a geographic forwarding scheme based on delay, distance, and remaining slack time are newly proposed. Simulations and their analysis are followed to validate the suitability of reduced dynamic failure probability and extended network lifetime.},
keywords={},
doi={10.1587/transcom.E93.B.3165},
ISSN={1745-1345},
month={November},}
Copy
TY - JOUR
TI - Network Layer Approaches for (m,k)-Firm Stream in Wireless Sensor Networks
T2 - IEICE TRANSACTIONS on Communications
SP - 3165
EP - 3168
AU - Ki-Il KIM
AU - Tae-Eung SUNG
PY - 2010
DO - 10.1587/transcom.E93.B.3165
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E93-B
IS - 11
JA - IEICE TRANSACTIONS on Communications
Y1 - November 2010
AB - In this letter, we propose a revised geographic routing protocol and a scheduling algorithm to support real-time applications, which are often observed in wireless sensor networks. In order to meet real-time requirement, a specific application is modeled as an (m,k)-firm stream that has a property of weakly hard real-time system. In addition, both a priority-based scheduling and a geographic forwarding scheme based on delay, distance, and remaining slack time are newly proposed. Simulations and their analysis are followed to validate the suitability of reduced dynamic failure probability and extended network lifetime.
ER -