UNIGE document Chapitre d'actes
previous document  unige:36913  next document
add to browser collection
Title

Combinatorial Approach for Geographic Routing with Delivery Guarantees

Authors
Published in International Conference on Sensor Networks (SENSORNETS 2014). Lisbon (Portugal) - 7 - 9 January - . 2014, p. 195-204
Abstract 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.
Identifiers
Full text
Structures
Research group Theoretical Computer Science
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. https://archive-ouverte.unige.ch/unige:36913

256 hits

111 downloads

Update

Deposited on : 2014-05-26

Export document
Format :
Citation style :