• 主题
高级搜索  >
历史搜索 清空历史
首页> 美国卫生研究院文献>Sensors (Basel Switzerland) >A Tree Based Broadcast Scheme for (m k)-firm Real-Time Stream in Wireless Sensor Networks
【2h】

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

机译：无线传感器网络中（mk）个公司实时流的基于树的广播方案

代理获取
本网站仅为用户提供外文OA文献查询和代理获取服务，本网站没有原文。下单后我们将采用程序或人工为您竭诚获取高质量的原文，但由于OA文献来源多样且变更频繁，仍可能出现获取不到、文献不完整或与标题不符等情况，如果获取不到我们将提供退款服务。请知悉。
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

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.
机译：近来，已经提出了各种单播路由协议以在无线传感器网络中的预定期限内将测量数据从传感器节点传送到宿节点。与它们的方法并行的是，某些应用程序需要特定的服务，该服务基于在截止日期之前向所有节点广播，可行的实时流量模型以及能源效率的提高。但是，当前基于洪泛或一对一单播的协议不能完全满足上述要求。而且，据作者所知，尚未对支持WSN中特定应用流量模型的实时广播协议进行研究。基于以上分析，本文通过构建满足（m，k）-firm的广播树，提出了一种新的基于（m，k）-firm的实时广播协议（FRBP）。资源受限的无线传感器网络中的实时模型。 FRBP中的广播树是通过基于距离的优先级方案构建的，而通过在树中选择尽可能少的节点来提高能效。为了克服不稳定的网络环境，该恢复方案调用快速的局部树重构，以便根据所测量的（m，k）个企业实时状况和本地状态监视将另一个节点指定为树上的父节点。最后，仿真结果证明了FRBP与现有方案相比在平均截止期限丢失率，平均吞吐量和能耗方面的优势。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
代理获取

客服邮箱：kefu@zhangqiaokeyan.com

京公网安备：11010802029741号 ICP备案号：京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有

  • 客服微信

  • 服务号