Geographic Random Forwarding (GeRaF) for Ad Hoc and Sensor Networks: Energy and Latency Performance

By Michele Zorzi, Ramesh R. Rao. IEEE Transactions on Mobile Computing, 2003

652 citations recorded by the source corpus.

Subfields: Computer Networks and Communications

View Paper: https://www.semanticscholar.org/paper/f77fc4c89057fa937f1f59fe95639465f281c7d0

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computer Networks and Communications

Citations in the corpus

Non-commercial Research and Educational Use including without Limitation Use in Instruction at Your Institution, Sending It to Specific Colleagues That You Know, and Providing a Copy to Your Institution's Administrator. All Other Uses, Reproduction and Distribution, including without Limitation Comm (2005, neutral): “We omit effects of the anisotropy in J lm which are to modify slightly the observed values of D lm and which are negligible for proton–proton couplings.”
Focused beam routing protocol for underwater acoustic networks (2008, neutral): “In wireless sensor networks, location awareness has been previously considered leading to geographical routing protocols such as GeRaF [9, 10], a forwarding technique based on location information of the nodes involved, and random selection of the relaying nodes via contention among the receivers.”
Practical relay networks: a generalization of hybrid-ARQ (2005, methodology): “The protocol assumes that each node knows its own position as well as that of the destination, and that a channel contention scheme exists to determine the forwarding node (the details of the contention scheme can be found in [14], [ 15 ]).”
Controlled sink mobility for prolonging wireless sensor networks lifetime (2008, methodology): “Data are now delivered to the current position of the sink according to the GeRaF routing protocol [58, 59].”
Energy-Efficient Cooperative Communication Based on Power Control and Selective Single-Relay in Wireless Sensor Networks (2008, background): “A single relay selection strategy based on distance estimation has been investigated in [ 7 ], where a distributed scheme always selects the cooperative relay that is closest to the destination from the set of relays that have decoded the data successfully.”
Geographic Random Forwarding (GeRaF) for Ad Hoc and Sensor Networks: Multihop Performance (2003, methodology): “Such protocol is described and analyzed, in detail, in a companion paper [1].”
Cooperative communications with relay-selection: when to cooperate and whom to cooperate with? (2008, background): “In [7], the authors proposed to choose the best relay depending on its geographic position, based on the geographic random forwarding (GeRaF) protocol proposed in [8] and [9].”
A simple Cooperative diversity method based on network path selection (2005, methodology): “ closest region contend and so on, until all regions are covered, with a typical number of regions close to 4. The latency of the above distance-dependent contention resolution scheme was analyzed in [18]. Zorzi and Rao’s scheme of distance-dependent relay selection was employed in the context of Hy”
MAC Essentials for Wireless Sensor Networks (2010, methodology): “Canonical Solutions Preamble-Sampling ALOHA [73], Preamble-Sampling CSMA [74], Cycled Receiver [75], LPL [76], Channel Polling [77] Improving CCA BMAC [76] Adaptive Duty Cycle EA-ALPL [78] Reducing Preamble Length by PacketizationCSMA-MPS [80], TICER [75], WOR [19], X-MAC [81], MH-MAC [82] , DPS-MAC”
A Review of Information Dissemination Protocols for Vehicular Ad Hoc Networks (2012, neutral): “ographic Random Forwarding (GeRaF) protocol [27].”
A Survey of Multi-Objective Optimization in Wireless Sensor Networks: Metrics, Algorithms, and Open Problems (2016, background): “Zorzi and Rao [135] developed the energy-versuslatency trade-offs based on the geographical location of the nodes, and proposed a collision avoidance protocol.”
Energy conservation in wireless sensor networks: A survey (2009, background): “Although being defined as a geographic routing protocol, GeRaF (Geographic Random Forwarding) [21], [153], [154] actually presents features which are in the direction of location-driven duty-cycled operations, which make use of both nodes position and redundancy.”