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.


    Access

    Download


    Export, share and cite



    Title :

    Combinatorial Approach for Geographic Routing with Delivery Guarantees


    Contributors:

    Publication date :

    2014-01-01


    Remarks:

    International Conference on Sensor Networks (SENSORNETS 2014) pp. 195-204


    Type of media :

    Article/Chapter (Book)


    Type of material :

    Electronic Resource


    Language :

    English



    Classification :

    DDC:    629



    Combinatorial Approach for Geographic Routing with Delivery Guarantees

    Samarasinghe, Kasun / Leone, Pierre | BASE | 2014

    Free access


    Optimal Routing in Stochastic Networks with Reliability Guarantees

    Zheng, Wanzheng / Thangeda, Pranay / Savas, Yagiz et al. | IEEE | 2021


    Hybrid Swarm-Based Geographic VDTN Routing

    Azzoug, Youcef / Boukra, Abdelmadjid / Soares, Vasco N. G. J. | Springer Verlag | 2021


    A Novel Semi-Permanent Geographic Routing

    Li, Linqi / Yang, Xinyu | British Library Online Contents | 2016