Modeling and comparison of candidate selection algorithms in opportunistic routing

摘要: 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 traditional routing, where traffic is sent along pre-determined paths, OR an ordered set candidates selected for each next-hop. Upon transmission, coordinate such that most priority one receiving packet actually forwards it. Most research addressed investigate candidate selection algorithms. this paper we propose discrete time Markov chain assess improvement may be achieved using opportunistic routing. We use our model compare group algorithms have proposed literature. Our main conclusion optimality obtained at high computational cost, with gain very similar much simpler but non-optimal Therefore, conclude fast and simple preferable dynamic networks, sets are likely updated frequently.