...
  • 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>Journal of network and computer applications >Optimized query-driven appointment routing based on Expectation-Maximization in wireless sensor networks
【24h】

Optimized query-driven appointment routing based on Expectation-Maximization in wireless sensor networks

机译：无线传感器网络中基于期望最大化的优化查询驱动约会路由

获取原文
获取原文并翻译 | 示例
   

获取外文期刊封面封底 >>

       
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

Query-driven routing plays an important role in wireless sensor networks, especially when Sink looks for data with unknown location in the network. Rumor routing propagates event information in some select paths in the network, in effect, creating an event trace. When an agent on an event trace is crossed by a query agent, a route to event location is established. The main goal in all rumor-based algorithms is to expedite the cross over by the query-agents. This paper introduces a new class of rumor-based algorithms based on a concept called appointment, adding determinism to the cross-over point location as well as agent traversal trajectory in a randomly set-up network and event scenarios. Two flavors of the algorithm are proposed. In the first approach, query-agents and event-agents make an appointment at the edge of the network. In the second approach, the appointment is made at a central point in the network. We study the optimality conditions for such a central point as a function of the system parameters. A Gaussian mixture model is used to model the events' spatial stochastic distribution, and a dynamic Expectation-Maximization algorithm is developed to estimate its rank and parameters. A data fusion algorithm is then applied to calculate the appointment point. We formulate a trade-off among search speed, route length, and network life time. Simulation results in various scenarios are used to compare the proposed algorithms to other competing algorithms and also to the optimal solution. The results illustrate that algorithms proposed in this paper are nearly optimal and are superior compared to other query-based routing algorithms.
机译：查询驱动的路由在无线传感器网络中起着重要的作用，特别是当Sink查找网络中位置未知的数据时。谣言路由在网络中的某些选定路径中传播事件信息，实际上会创建事件跟踪。当事件跟踪上的代理被查询代理越过时，将建立到事件位置的路由。所有基于谣言的算法的主要目标是加快查询代理的过渡。本文介绍了一种基于新的基于谣言的算法，该算法基于一种称为约会的概念，为随机设置网络和事件场景中的交叉点位置以及座席遍历轨迹增加了确定性。提出了两种算法。在第一种方法中，查询代理和事件代理在网络边缘进行约会。在第二种方法中，约会是在网络的中心点进行的。我们研究了作为系统参数函数的中心点的最优条件。使用高斯混合模型对事件的空间随机分布进行建模，并开发了动态的“期望最大化”算法来估计事件的等级和参数。然后将数据融合算法应用于计算约会点。我们在搜索速度，路由长度和网络寿命之间进行权衡。在各种情况下的仿真结果用于将所提出的算法与其他竞争算法以及最佳解决方案进行比较。结果表明，本文提出的算法几乎是最优的，并且优于其他基于查询的路由算法。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号