GPSR: greedy perimeter stateless routing for wireless networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
On greedy geographic routing algorithms in sensing-covered networks
Proceedings of the 5th ACM international symposium on Mobile ad hoc networking and computing
On the Longest Edge of Gabriel Graphs in Wireless Ad Hoc Networks
IEEE Transactions on Parallel and Distributed Systems
Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing
Delivery Guarantee of Greedy Routing in Three Dimensional Wireless Networks
WASA '08 Proceedings of the Third International Conference on Wireless Algorithms, Systems, and Applications
Asymptotic critical transmission radii for greedy forward routing in wireless ad hoc networks
IEEE Transactions on Communications
Sharp thresholds for relative neighborhood graphs in wireless ad hoc networks
IEEE Transactions on Wireless Communications
Optimal transmission power of wireless sensors for real-time systems in ship area networks
ISWPC'10 Proceedings of the 5th IEEE international conference on Wireless pervasive computing
Energy-efficient restricted greedy routing for three dimensional random wireless networks
WASA'10 Proceedings of the 5th international conference on Wireless algorithms, systems, and applications
Effect of multiple hops on network lifetime and energy consumption in a wireless sensor network
Proceedings of the International Conference & Workshop on Emerging Trends in Technology
Optimal transmission power with delay constraints in 2D and 3D MANETs
Journal of Parallel and Distributed Computing
Geometric graphs with randomly deleted edges - connectivity and routing protocols
MFCS'11 Proceedings of the 36th international conference on Mathematical foundations of computer science
Survey paper: A survey on routing algorithms for wireless Ad-Hoc and mesh networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
On the impact of transmission radius on routing efficiency
Proceedings of the first ACM MobiHoc workshop on Airborne Networks and Communications
| Hi-index | 0.00 |
Greedy forward routing (abbreviated by GFR)in wireless ad hoc networks is a localized geographic routing in which each node discards a packet if one of its neighbors is closer to the destination of the packet than itself, or otherwise forwards the packet to the neighbor closest to the destination of the packet. If all nodes have the same transmission radii, the critical transmission radius for GFR is the smallest transmission radius which ensures that packets can be delivered between any source-destination pairs. In this paper, we study the asymptotic critical transmission radius for GFR in randomly deployed wireless ad hoc networks. We assume that the network nodes are represented by a Poisson point process of density n over a convex compact region of u it area with bounded curvature.Let ß0 = 1/ (⅔√3 over 2π) ≈ 1.62. We show that √ß0 1n n over πn is asymptotically almost surely (abbreviated by a.a.s.) the threshold of the critical transmission radius for GFR.I other words,for ß ß0 if the trasmission radius is √ß 1n n over πn, it is a.a.s. packets can be delivered between any source-destination pairs; for any ß 0 if the transmission radius is √ß 1n noverπn, it is a.a.s. packets can't be delivered between some source-destination pair.