Proceedings chapter
Open access

Combinatorial Approach for Geographic Routing with Delivery Guarantees

Presented at Lisbon (Portugal), 7 - 9 January
Publication date2014

In this paper we present a novel combinatorial approach for geographic routing with delivery guarantees. Proposed algorithm can be seen as a variant of GFG (Greedy Face Greedy of Bose et.al) algorithm, but based on the defined combinatorial properties of the graph. We utilize a distributed planarization algorithm of a geometric graph, which is based on the Schnyder's characterization of planar graphs. The new approach is combinatorial in the sense that the nodes are ordered with respect to three distinct order relations satisfying the suitable properties. The coordinate system motivated the development of this routing algorithm is VRAC (Virtual Raw Anchor Coordinates), which localizes nodes based on the raw distances from three fixed anchors. Since the positions of the anchors need not to be known, the nodes localized by the VRAC coordinate system does not correspond to the exact geographic location of nodes, yet leaving sufficient information to define necessary combinatorial constructs.

Citation (ISO format)
SAMARASINGHE, Kasun, LEONE, Pierre. Combinatorial Approach for Geographic Routing with Delivery Guarantees. In: International Conference on Sensor Networks (SENSORNETS 2014). Lisbon (Portugal). [s.l.] : [s.n.], 2014. p. 195–204. doi: 10.5220/0004712501950204
Main files (1)
Proceedings chapter (Accepted version)

Technical informations

Creation05/22/2014 4:35:00 PM
First validation05/22/2014 4:35:00 PM
Update time03/14/2023 9:15:41 PM
Status update03/14/2023 9:15:41 PM
Last indexation01/16/2024 10:44:44 AM
All rights reserved by Archive ouverte UNIGE and the University of GenevaunigeBlack