Modeling and routing scheme for (m,k)-firm streams in wireless multimedia sensor networks

Abstract

In this paper, we propose a novel scheme of how to efficiently and reliably deliver multimedia real-time streams in wireless sensor networks. To specify the property of streams, a multimedia stream is modeled as an (m,k)-firm stream that is known to have the characteristics of weakly hard real-time system. In addition, a distributed, measurement-based routing scheme for (m,k)-firm streams is newly proposed while considering several constraints on node as well as on communication medium. Simulations and their analysis are provided to validate the suitability of traffic modeling, reduced dynamic failure probability, and extended network lifetime when the proposed routing protocol is employed.As motivated by the aforementioned needs, we consider the (m,k)-firm model [21] in wireless sensor networks. A real-time stream with the (m,k)-firm guarantee requirement demands that at least m out of any k consecutive packets in this stream must meet their respective deadline. Two well-known examples for a (m,k)-firm stream are video and audio streams, because they are tolerant to packet loss but sensitive to real-time delivery. The concept of (m,k)-firm is appropriate for wireless sensor networks due to minimum requirement and its inevitable packet loss. Packet loss is naturally expected because of the poor wireless connectivity and bandwidth constraints on wireless sensor networks. Despite of the apparent suitability of the model, to the best of the authors' knowledge, the research in [16] has been only addressed to date except for the schemes developed by our research group [22,23].Although our previous work was proposed to introduce and support a (m,k)-firm model in wireless multimedia sensor networks, our contribution was limited to develop the appropriate scheduling for the traffic model. Thus, in consequence of our achievements, we propose a scheme on how to efficiently and reliably model a (m,k)-firm traffic in wireless multimedia sensor networks and employ routing algorithm to guarantee real-time delivery. In the proposed scheme, both m and k values are determined by the density

RETRACTED ARTICLE: Invulnerability mechanism based on mobility prediction and opportunistic cloud computing with topological evolution for wireless multimedia sensor networks

“…A novel scheme of how to efficiently and reliably deliver multimedia real-time streams in wireless sensor networks was proposed in [7]. Image data is transmitted to the base station via fuzzy logic with clustering infrastructure, which considered the nodes mobility [8].…”

A Survey on Real-Time Communications in Wireless Sensor Networks

“…Moreover, one framework that integrates each scheme shows the low failure probability for real-time requirements on ( , )-firm stream by the help of the proposed scheme. However, since there are researches for communication protocol, Kim and Sung [86] presented traffic model and new routing protocol together. Particularly, application and clustering scheme were firstly mentioned and addressed in this work.…”

Clustering Scheme for (m,k)-Firm Streams in Wireless Sensor Networks

“…Upon completing the aggregation, for the delivery of the (m,k)-firm stream, we use the (m,k)-firm specific routing protocol, which was proposed in [12]. In the proposed scheme, a velocity-balanced and energy-balanced real-time routing approach is used for ensuring positive DBP values.…”

“…The comparative protocols are presented in my previous work in [12] . For the (m,k)-firm stream, (4,5), (3,4), (2,3)-firm streams are used where the initial period of the sensing of (4,5) is set to 250 ms, and the other two streams are set to 500 ms and 1 s, respectively.…”

“…On the basis of this concept, a priority assignment technology called distance-based priority (DBP) was developed to arbitrate between the streams in a system. Further, several variant protocols have been proposed in [12]. However, despite these research efforts, the scalability problem still remains unsolved.…”