arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1301.3302cs.NI
收藏

基于测量的多跳无线中继网络即时部署

Measurement Based Impromptu Deployment of a Multi-Hop Wireless Relay Network

Arpan Chattopadhyay, Marceau Coupechoux, Anurag Kumar

摘要:

我们研究的问题,最佳顺序(“如你去”)部署无线中继节点作为一个人走在一条线的随机长度(与已知的分布)。我们的目标是创建一个即兴的多跳无线网络连接的数据包源被放置在线路的末端与位于起点的汇节点,在光流量制度。当部署人员沿着从汇点到源点的线路行进时,在每一步,他测量到一个(或多个)先前放置的中继的信道质量,并且基于这些测量来放置中继节点,以便在所得到的网络中最小化从源点到汇点节点的总功率或最大功率,这受到对所放置的中继的预期数量的约束。对于这两个目标中的每一个,考虑两种不同的中继选择策略:(i)每个中继经由其紧邻的前一个中继与信宿通信,(ii)通信路径可以跳过一些部署的中继。通过适当的建模假设,我们将这些问题中的每一个都表述为马尔可夫决策过程(MDP)。我们提供了所有这些情况下的最优政策结构,并提供插图,通过数值结果,为一些典型的参数。

英文摘要:

We study the problem of optimal sequential ("as-you-go") deployment of wireless relay nodes as a person walks along a line of random length (with a known distribution). The objective is to create an impromptu multihop wireless network for connecting a packet source to be placed at the end of the line with a sink node located at the starting point, to operate in the light traffic regime. As the deployment person walks along the line from the sink towards the source, at every step, he measures the channel quality to one (or more) previously placed relays, and places the relay nodes based on these measurements, so as to minimize either the sum power or the maximum power from the source to the sink node in the resultant network, subject to a constraint on the expected number of relays placed. For each of these two objectives, two different relay selection strategies are considered: (i) each relay communicates with the sink via its immediate previous relay, (ii) the communication path can skip some of the deployed relays. With appropriate modeling assumptions, we formulate each of these problems as a Markov decision process (MDP). We provide the optimal policy structures for all these cases, and provide illustrations, via numerical results, for some typical parameters.

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

↑