Next Article in Journal
Full-Body Locomotion Reconstruction of Virtual Characters Using a Single Inertial Measurement Unit
Previous Article in Journal
Highly Selective Polypyrrole MIP-Based Gravimetric and Electrochemical Sensors for Picomolar Detection of Glyphosate
Article Menu
Issue 11 (November) cover image

Export Article

Open AccessArticle
Sensors 2017, 17(11), 2578;

A Tree Based Broadcast Scheme for (m, k)-firm Real-Time Stream in Wireless Sensor Networks

Department of Informatics, Gyeongsang National University, Jinju 52828, Korea
College of Technological Innovation, Zayed University, Dubai 19282, UAE
Department of Computer Science and Engineering, Chungnam National University, Daejeon 34134, Korea
Author to whom correspondence should be addressed.
Received: 30 August 2017 / Revised: 2 November 2017 / Accepted: 2 November 2017 / Published: 9 November 2017
(This article belongs to the Section Sensor Networks)
Full-Text   |   PDF [329 KB, uploaded 10 November 2017]   |  


Recently, various unicast routing protocols have been proposed to deliver measured data from the sensor node to the sink node within the predetermined deadline in wireless sensor networks. In parallel with their approaches, some applications demand the specific service, which is based on broadcast to all nodes within the deadline, the feasible real-time traffic model and improvements in energy efficiency. However, current protocols based on either flooding or one-to-one unicast cannot meet the above requirements entirely. Moreover, as far as the authors know, there is no study for the real-time broadcast protocol to support the application-specific traffic model in WSN yet. Based on the above analysis, in this paper, we propose a new (m, k)-firm-based Real-time Broadcast Protocol (FRBP) by constructing a broadcast tree to satisfy the (m, k)-firm, which is applicable to the real-time model in resource-constrained WSNs. The broadcast tree in FRBP is constructed by the distance-based priority scheme, whereas energy efficiency is improved by selecting as few as nodes on a tree possible. To overcome the unstable network environment, the recovery scheme invokes rapid partial tree reconstruction in order to designate another node as the parent on a tree according to the measured (m, k)-firm real-time condition and local states monitoring. Finally, simulation results are given to demonstrate the superiority of FRBP compared to the existing schemes in terms of average deadline missing ratio, average throughput and energy consumption. View Full-Text
Keywords: (m, k)-firm real-time; broadcast; wireless sensor networks (m, k)-firm real-time; broadcast; wireless sensor networks

Figure 1

This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited (CC BY 4.0).

Share & Cite This Article

MDPI and ACS Style

Park, H.; Kim, B.-S.; Kim, K.H.; Shah, B.; Kim, K.-I. A Tree Based Broadcast Scheme for (m, k)-firm Real-Time Stream in Wireless Sensor Networks. Sensors 2017, 17, 2578.

Show more citation formats Show less citations formats

Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Related Articles

Article Metrics

Article Access Statistics



[Return to top]
Sensors EISSN 1424-8220 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert
Back to Top