Efficient geographic routing in multihop wireless networks
By Seungjoon Lee, Bobby Bhattacharjee, Suman Banerjee. ACM Interational Symposium on Mobile Ad Hoc Networking and Computing, 2005
331 citations recorded by the source corpus.
Subfields: Computer Networks and Communications
View Paper: https://www.semanticscholar.org/paper/57f5adc89fc09231f7b1a2489f464acd633259e0
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
- Jun-hong Cui
- Azzedine F. M. Boukerche
- Antonio Alfredo Ferreira Loureiro
- Luiz Filipe Menezes Vieira
- Rodolfo W. L. Coutinho
- Yunsi Fei
- Tiansi Hu
- Peng Xie
Citations in the corpus
- QELAR: A Machine-Learning-Based Adaptive Routing Protocol for Energy-Efficient and Lifetime-Extended Underwater Sensor Networks (2010, background): “Although there exist many mature protocols for terrestrial sensor networks, they cannot be applied directly to UWSNs because of the fundamental differences in both the communication medium and network features.”
- VBF: Vector-Based Forwarding Protocol for Underwater Sensor Networks (2006, background): “Geographic Routing Protocols for Mobile Ad Hoc Networks In the literature, there are many geographic routing protocols [3], [13], [10], [6], [27], [7], [23], [16] proposed to address the node mobility issue.”
- A survey on routing algorithms for wireless Ad-Hoc and mesh networks (2012, unknown): “Finally, Reference [71] provided a practical routing algorithm that considered special wireless issues.”
- Virtual-Coordinate-Based Delivery-Guaranteed Routing Protocol in Wireless Sensor Networks (2008, background): “I. INTRODUCTION A wireless sensor network consists of several sensors, each of which has the ability to collect, process, and store environmental information as well as to communicate with others via inter-sensor communication.”
- Geographic and Opportunistic Routing for Underwater Sensor Networks (2016, methodology): “We use normalized advance (NADV) [37] to measure the “goodness” of each next-hop candidate node in Ci.”