arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1101.3835cs.NI
收藏

无线传感器网络中部分信息下的中继选择

Relay Selection with Partial Information in Wireless Sensor Networks

K. P. Naveen, Anurag Kumar

摘要:

我们的工作是出于地理转发零星的报警数据包的无线传感器网络(WSN),其中的节点是周期性和异步的睡眠-唤醒循环的基站。当节点(称为源)通过检测事件或从上游节点获得要转发的数据包时,它必须等待转发集中的邻居(称为中继)唤醒。每个中继与随机奖励(例如,朝向汇取得的进展)即IID。首先,源不确定中继的数量、它们的唤醒待用时间和奖励值,但知道它们的分布。在每个中继唤醒时刻,当中继揭示其奖励值时,源的问题是转发数据包或等待更多的中继唤醒。在这种情况下,我们寻求最小化的期望等待时间在源的平均奖励的下限。在运筹学文献中,我们的工作可以被认为是资产出售问题的一个变种。我们制定的中继选择问题作为一个部分可观测的马尔可夫决策过程(POMDP),其中的未知状态是中继的数量。我们首先考虑源知道中继的数量的情况。对于一般情况下,源只知道一个pmf的中继站的数量,它必须保持一个后验pmf的中继站的数量和转发的数据包,如果pmf是在一个最佳停止集。我们证明了最优停集是凸的,并得到了这个集的内外界。上述政策的计算复杂性促使我们制定一个替代的简化模型,其最佳政策是一个简单的阈值规则。我们提供模拟结果,比较各种单跳和端到端的转发策略的性能。

英文摘要:

Our work is motivated by geographical forwarding of sporadic alarm packets to a base station in a wireless sensor network (WSN), where the nodes are sleep-wake cycling periodically and asynchronously. When a node (referred to as the source) gets a packet to forward, either by detecting an event or from an upstream node, it has to wait for its neighbors in a forwarding set (referred to as relays) to wake-up. Each of the relays is associated with a random reward (e.g., the progress made towards the sink) that is iid. To begin with, the source is uncertain about the number of relays, their wake-up times and the reward values, but knows their distributions. At each relay wake-up instant, when a relay reveals its reward value, the source's problem is to forward the packet or to wait for further relays to wake-up. In this setting, we seek to minimize the expected waiting time at the source subject to a lower bound on the average reward. In terms of the operations research literature, our work can be considered as a variant of the asset selling problem. We formulate the relay selection problem as a partially observable Markov decision process (POMDP), where the unknown state is the number of relays. We begin by considering the case where the source knows the number of relays. For the general case, where the source only knows a pmf on the number of relays, it has to maintain a posterior pmf on the number of relays and forward the packet iff the pmf is in an optimum stopping set. We show that the optimum stopping set is convex and obtain inner and outer bounds to this set. The computational complexity of the above policies motivates us to formulate an alternative simplified model, the optimal policy for which is a simple threshold rule. We provide simulation results to compare the performance of the various one-hop and end-to-end forwarding policies.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑