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

无线Ad Hoc网络中多点中继广播协议的最大化传输概率

Maximizing the Probability of Delivery of Multipoint Relay Broadcast Protocol in Wireless Ad Hoc Networks with a Realistic Physical Layer

François Ingelrest, David Simplot-Ryl

摘要:

现在普遍认为,用于模拟无线网络物理层的单位圆盘图并不能反映真实的无线电传输,对数正态阴影模型更适合于实验模拟。以前的工作集中在单播的现实情况下,而广播的要求是根本不同的,不能从单播的情况下。因此,广播协议必须适应,以便在现实的假设下仍然是有效的。本文研究了著名的多点中继协议(MPR)。在后者中,每个节点必须选择一组邻居作为中继,以覆盖整个2跳邻居。我们给出的实验结果表明,原来的方法提供的选择一套继电器不给现实的模型与良好的效果。我们还提供了三个新的替代和他们的表现,表明他们更好地适合所考虑的模型。第一个最大化节点和所考虑的中继之间的正确接收的概率乘以它们在2跳邻域中的覆盖范围。第二种方法用所考虑的邻居和它所覆盖的2跳邻居之间的正确接收概率的平均值来代替覆盖。最后,第三个启发式算法保持与第二个启发式算法相同的概念,但试图最大化2跳邻居的覆盖水平:当2跳邻居的覆盖水平不高于给定的覆盖阈值时,它们仍然被认为是未覆盖的,因此可以选择许多邻居来覆盖相同的2跳邻居。

英文摘要:

It is now commonly accepted that the unit disk graph used to model the physical layer in wireless networks does not reflect real radio transmissions, and that the lognormal shadowing model better suits to experimental simulations. Previous work on realistic scenarios focused on unicast, while broadcast requirements are fundamentally different and cannot be derived from unicast case. Therefore, broadcast protocols must be adapted in order to still be efficient under realistic assumptions. In this paper, we study the well-known multipoint relay protocol (MPR). In the latter, each node has to choose a set of neighbors to act as relays in order to cover the whole 2-hop neighborhood. We give experimental results showing that the original method provided to select the set of relays does not give good results with the realistic model. We also provide three new heuristics in replacement and their performances which demonstrate that they better suit to the considered model. The first one maximizes the probability of correct reception between the node and the considered relays multiplied by their coverage in the 2-hop neighborhood. The second one replaces the coverage by the average of the probabilities of correct reception between the considered neighbor and the 2-hop neighbors it covers. Finally, the third heuristic keeps the same concept as the second one, but tries to maximize the coverage level of the 2-hop neighborhood: 2-hop neighbors are still being considered as uncovered while their coverage level is not higher than a given coverage threshold, many neighbors may thus be selected to cover the same 2-hop neighbors.

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

↑