Data Portal @ linkeddatafragments.org

Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Geographic_routing> ?p ?o. }

• Geographic_routing abstract "Geographic routing (also called georouting or position-based routing) is a routing principle that relies on geographic position information. It is mainly proposed for wireless networks and based on the idea that the source sends a message to the geographic location of the destination instead of using the network address. The idea of using position information for routing was first proposed in the 1980s in the area of packet radio networks and interconnection networks. Geographic routing requires that each node can determine its own location and that the source is aware of the location of the destination. With this information a message can be routed to the destination without knowledge of the network topology or a prior route discovery.There are various approaches, such as single-path, multi-path and flooding-based strategies (see for a survey).Most single-path strategies rely on two techniques: greedy forwarding and face routing. Greedy forwarding tries to bring the message closer to the destination in each step using only local information. Thus, each node forwards the message to the neighbor that is most suitable from a local point of view. The most suitable neighbor can be the one who minimizes the distance to the destination in each step (Greedy). Alternatively, one can consider another notion of progress, namely the projected distance on the source-destination-line (MFR, NFP), or the minimum angle between neighbor and destination (Compass Routing). Not all of these strategies are loop-free, i.e. a message can circulate among nodes in a certain constellation. It is known that the basic greedy strategy and MFR are loop free, while NFP and Compass Routing are not.Greedy forwarding can lead into a dead end, where there is no neighbor closer to the destination. Then, face routing helps to recover from that situation and find a path to another node, where greedy forwarding can be resumed. A recovery strategy such as face routing is necessary to assure that a message can be delivered to the destination. The combination of greedy forwarding and face routing was first proposed in 1999 under the name GFG (Greedy-Face-Greedy). It guarantees delivery in the so-called unit disk graph network model. Various variants, which were proposed later, also for non-unit disk graphs, are based on the principles of GFG.Although originally developed as a routing scheme that uses the physical positions of each node, geographic routing algorithms have also been applied to networks in which each node is associated with a point in a virtual space, unrelated to its physical position. The process of finding a set of virtual positions for the nodes of a network such that geographic routing using these positions is guaranteed to succeed is called greedy embedding.".
• Geographic_routing thumbnail Georouting_greedy_variants.svg?width=300.
• Geographic_routing wikiPageID "8425648".
• Geographic_routing wikiPageRevisionID "591429965".
• Geographic_routing align "center".
• Geographic_routing caption "Face routing: A message is routed along the interior of the faces of the communication graph, with face changes at the edges crossing the S-D-line . The final routing path is shown in blue.".
• Geographic_routing caption "Greedy forwarding variants: The source node has different choices to find a relay node for further forwarding a message to the destination . A = Nearest with Forwarding Progress , B = Most Forwarding progress within Radius , C = Compass Routing, E = Greedy".
• Geographic_routing hasPhotoCollection Geographic_routing.
• Geographic_routing image "Georouting face routing.svg".
• Geographic_routing image "Georouting greedy variants.svg".
• Geographic_routing width "300".
• Geographic_routing width "336".
• Geographic_routing subject Category:Routing_algorithms.
• Geographic_routing subject Category:Routing_protocols.
• Geographic_routing subject Category:Wireless_networking.
• Geographic_routing type Abstraction100002137.
• Geographic_routing type Act100030358.
• Geographic_routing type Activity100407535.
• Geographic_routing type Algorithm105847438.
• Geographic_routing type Communication100033020.
• Geographic_routing type Direction106786629.
• Geographic_routing type Event100029378.
• Geographic_routing type Message106598915.
• Geographic_routing type Procedure101023820.
• Geographic_routing type Protocol106665108.
• Geographic_routing type PsychologicalFeature100023100.
• Geographic_routing type RoutingAlgorithms.
• Geographic_routing type RoutingProtocols.
• Geographic_routing type Rule105846932.
• Geographic_routing type Rule106652242.
• Geographic_routing type YagoPermanentlyLocatedEntity.
• Geographic_routing comment "Geographic routing (also called georouting or position-based routing) is a routing principle that relies on geographic position information. It is mainly proposed for wireless networks and based on the idea that the source sends a message to the geographic location of the destination instead of using the network address. The idea of using position information for routing was first proposed in the 1980s in the area of packet radio networks and interconnection networks.".
• Geographic_routing label "Geographic routing".
• Geographic_routing sameAs m.0272_t7.
• Geographic_routing sameAs Q5535067.
• Geographic_routing sameAs Q5535067.
• Geographic_routing sameAs Geographic_routing.
• Geographic_routing wasDerivedFrom Geographic_routing?oldid=591429965.
• Geographic_routing depiction Georouting_greedy_variants.svg.
• Geographic_routing isPrimaryTopicOf Geographic_routing.