Authors: Amir Darehshoorzadeh; Llorenç Cerdà-Alabern; Vicent Pla
Addresses: Computer Architecture Department, Univ. Politècnica de Catalunya, Barcelona 08034, Spain ' Computer Architecture Department, Univ. Politècnica de Catalunya, Barcelona 08034, Spain ' Communications Department, Univ. Politècnica de València, València 46022, Spain
Abstract: 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.
Keywords: opportunistic routing; candidate selection algorithms; maximum progress distances; wireless networks; routing protocols; node positioning; node location; simulation; distance progress.
International Journal of Ad Hoc and Ubiquitous Computing, 2015 Vol.20 No.3, pp.137 - 147
Available online: 26 Nov 2015 *Full-text access for editors Access for subscribers Purchase this article Comment on this article