一种无线传感器网络的最优查询分配算法
An Optimal Query Assignment for Wireless Sensor Networks
摘要:
无线传感器网络的两个QoS要求之间的权衡:查询等待时间和有效性(年龄)的数据喂养的查询,进行了研究。我们提出了一个连续的时间马尔可夫决策过程与漂移之间的权衡两个QoS要求,通过分配传入的查询无线传感器网络或数据库。为了计算最优分配策略,我们通过非标准的一致化,论证了一个离散时间马尔可夫决策过程,随机等价于初始连续过程。利用动态规划方法确定离散时间过程的最优查询分配策略。接下来,我们数值评估的最优策略的性能,并表明它优于平均分配成本的其他三个算法,通常在实践中使用。最后,我们的模型的最优性也证实了在真实的查询流量的情况下,我们提出的政策实现了显着的成本节省相比,prostitics。
英文摘要:
A trade-off between two QoS requirements of wireless sensor networks: query waiting time and validity (age) of the data feeding the queries, is investigated. We propose a Continuous Time Markov Decision Process with a drift that trades-off between the two QoS requirements by assigning incoming queries to the wireless sensor network or to the database. To compute an optimal assignment policy, we argue, by means of non-standard uniformization, a discrete time Markov decision process, stochastically equivalent to the initial continuous process. We determine an optimal query assignment policy for the discrete time process by means of dynamic programming. Next, we assess numerically the performance of the optimal policy and show that it outperforms in terms of average assignment costs three other heuristics, commonly used in practice. Lastly, the optimality of the our model is confirmed also in the case of real query traffic, where our proposed policy achieves significant cost savings compared to the heuristics.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。