Modeling and comparison of candidate selection algorithms in opportunistic routing

Abstract

2886 2898 55 13 ; S ; Opportunistic Routing (OR) has been investigated in recent years as a way to increase the performance of multihop wireless networks by exploiting its broadcast nature. In contrast to traditional routing, where traffic is sent along pre-determined paths, in OR an ordered set of candidates is selected for each next-hop. Upon each transmission, the candidates coordinate such that the most priority one receiving the packet actually forwards it. Most of the research in OR has been addressed to investigate candidate selection algorithms. In this paper we propose a discrete time Markov chain to assess the improvement that may be achieved using opportunistic routing. We use our model to compare a selected group of candidate selection algorithms that have been proposed in the literature. Our main conclusion is that optimality is obtained at a high computational cost, with a performance gain very similar to that of much simpler but non-optimal algorithms. Therefore, we conclude that fast and simple OR candidate selection algorithms may be preferable in dynamic networks, where the candidates sets are likely to be updated frequently. © 2011 Elsevier B.V. All rights reserved. This work was supported by the Spanish government through projects TIN2010-21378-C02-01 and TIN2010-21378-C02-02, by the Generalitat de Catalunya through project 2009-SGR-1167, and by the European Commission through the NoE EuroNF. Darehshoorzadeh, A.; Cerdà-Alabern, L.; Pla, V. (2011). Modeling and comparison of candidate selection algorithms in opportunistic routing. Computer Networks. 55(13):2886-2898. doi:10.1016/j.comnet.2011.06.009