Geographic Random Forwarding (GeRaF) for Ad Hoc and Sensor Networks: Multihop Performance
Geographic Random Forwarding (GeRaF) for Ad Hoc and Sensor Networks: Multihop Performance
复制标题
DOI：
10.1109/tmc.2003.1255648
复制
发表时间：
2003-10
期刊：
影响因子：
--
通讯作者：
M. Zorzi;R. Rao
中科院分区：
文献类型：
--
作者：
M. Zorzi;R. Rao
在本文中，我们提出了一种基于所涉及节点的地理位置和通过接收器之间的竞争随机选择中继节点的新颖转发技术。我们关注这种解决方案的多跳性能，即到达目的地的平均跳数作为距离和可用邻居平均数量的函数。讨论了理想化方案（其中始终选择最佳中继节点），并通过仿真和分析技术评估其性能。显示了一种选择最佳继电器之一的实用方案，其性能非常接近理想情况。还给出了一些关于实际实现的设计问题的讨论。
In this paper, we propose a novel forwarding technique based on geographical location of the nodes involved and random selection of the relaying node via contention among receivers. We focus on the multihop performance of such a solution, in terms of the average number of hops to reach a destination as a function of the distance and of the average number of available neighbors. An idealized scheme (in which the best relay node is always chosen) is discussed and its performance is evaluated by means of both simulation and analytical techniques. A practical scheme to select one of the best relays is shown to achieve performance very close to that of the ideal case. Some discussion about design issues for practical implementation is also given.