2005 · 60 citations · 8 references
ComputingGeoinformaticsComputational GeometryMobile ComputingMobile SystemsGeometric GraphsGraph AlgorithmsMobile Ad Hoc NetworksMobile NetworksRoutingRouting AlgorithmsAd Hoc NetworksGeometric RoutingHeuristic Routing AlgorithmsMobile Ad Hoc Network RoutingMobile Ad Hoc RoutingProximity GraphsRouting In Mobile NetworksUnit Disk Graphs
A unit disk graph and its proximity graphs are often used as the underlying topologies of a mobile ad hoc network. One category of unicast routing algorithms, position-based routing algorithms, has been developed and studied extensively in the context of 2-D. This, however, poses evident questions in terms of the reliability and efficiency of these algorithms when practically the mobile host is an object positioned in the real world of 3-D. We propose a heuristic for routing in 3-D based on the 2-D face routing algorithm. We study experimentally the properties of geometric graphs in 3-D and the performance of various routing algorithms on these graphs.
8
Routing with Guaranteed Delivery in Ad Hoc Wireless Networks
Prosenjit Bose, Pat Morin, Ivan Stojmenović et al. · Wireless Networks · 2001 · 1.2K citations
Compass routing on geometric networks.
Evangelos Kranakis, Harvinder Singh, Jorge Urrutia · 1999 · 850 citations