Loading...
Please wait, while we are loading the content...
Similar Documents
Asymptotic critical transmission radius for greedy forward routing in wireless ad hoc networks abstract.
| Content Provider | CiteSeerX |
|---|---|
| Author | Wan, P. -J. |
| Abstract | Greedy forward routing (abbreviated by GFR) in wireless ad hoc networks is a localized geographic routing in which each node discards a packet if none 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 unit 2 area with bounded curvature. Let β0 =1 / 3 − √ ” |
| File Format | |
| Access Restriction | Open |
| Subject Keyword | Greedy Forward Routing Convex Compact Region Asymptotic Critical Transmission Radius Critical Transmission Radius Network Node Wireless Ad Hoc Network Abstract Neighbor Closest Bounded Curvature Source-destination Pair Transmission Radius Poisson Point Process Wireless Ad Hoc Network Localized Geographic Routing |
| Content Type | Text |
