Geographic random forwarding (GeRaF) for ad hoc and sensor networks: multihop performance Export

@article{citeulike:1233080, abstract = {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.}, author = {Zorzi, M. and Rao, R. R.}, booktitle = {Mobile Computing, IEEE Transactions on}, citeulike-article-id = {1233080}, citeulike-linkout-0 = {http://dx.doi.org/10.1109/TMC.2003.1255648}, citeulike-linkout-1 = {http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=1255648}, doi = {10.1109/TMC.2003.1255648}, journal = {Mobile Computing, IEEE Transactions on}, keywords = {opportunistic, opportunistic-routting, routing, wireless-networks, wireless-sensor-networks, wsn}, number = {4}, pages = {337--348}, posted-at = {2009-08-28 12:49:48}, priority = {2}, title = {Geographic random forwarding (GeRaF) for ad hoc and sensor networks: multihop performance}, url = {http://dx.doi.org/10.1109/TMC.2003.1255648}, volume = {2}, year = {2003} }

TY - JOUR ID - citeulike:1233080 L3 - citeulike-article-id:1233080 N2 - 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. IS - 4 JF - Mobile Computing, IEEE Transactions on EP - 348 TI - Geographic random forwarding (GeRaF) for ad hoc and sensor networks: multihop performance VL - 2 T2 - Mobile Computing, IEEE Transactions on SP - 337 KW - opportunistic KW - opportunistic-routting KW - routing KW - wireless-networks KW - wireless-sensor-networks KW - wsn AU - Zorzi, M AU - Rao, RR PY - 2003/// UR - http://dx.doi.org/10.1109/TMC.2003.1255648 ER -