Opportunistic routing (OR) is a new class of routing protocols that selects the next-hop forwarder on-the-fly. In contrast to traditionally routing, OR does not select a single node as the next-hop forwarder, but a set of forwarder candidates. When a packet is transmitted, the candidates coordinate such that the best one receiving the packet will forward it, while the others will discard the packet. The selection and prioritisation of candidates, referred to as candidate selection algorithm (CSA), has a great impact on OR performance. In this paper we propose and study two new candidate selection algorithms based on the geographic position of nodes. This information is used by the CSAs in order to maximise the distance progress (DP) towards the destination. We compare our proposals with other well-known CSAs proposed in the literature through mathematical analysis and simulation. We show that candidate selection algorithms based on DP achieve almost the same performance as the optimum algorithms proposed in the literature, while the computational cost is dramatically reduced. ; Peer Reviewed ; Postprint (author's final draft)


    Access

    Download


    Export, share and cite



    Distance progress based opportunistic routing for wireless mesh networks

    Darehshoorzadeh, Amir / Cerdà Alabern, Llorenç | BASE | 2012

    Free access

    Opportunistic Routing Protocols

    Zhu, Hongzi / Li, Minglu | Springer Verlag | 2013



    Candidate Algorithms for Routing in a Network of Inter-satellite Links

    Franck, L. / Maral, G. / American Institute of Aeronautics and Astronautics | British Library Conference Proceedings | 2000


    Adaptive Fuzzy Routing in Opportunistic Network (AFRON)

    Payam Nabhani / Sima Radmanesh | BASE | 2012

    Free access