On the maximum performance in opportunistic routing

Authors:
Lloreng Cerda-Alabern;Amir Darehshoorzadeh;Vicent Pla
Affiliations:
Univ. Politecnica de Catalunya, Computer Architecture Dep., Barcelona, Spain;Univ. Politecnica de Catalunya, Computer Architecture Dep., Barcelona, Spain;Univ. Politecnica de Valencia, Communications Dep., Valencia, Spain
Venue:
WOWMOM '10 Proceedings of the 2010 IEEE International Symposium on A World of Wireless, Mobile and Multimedia Networks (WoWMoM)
Year:
2010

Citing 0
Cited 2

Modeling and comparison of candidate selection algorithms in opportunistic routing

Computer Networks: The International Journal of Computer and Telecommunications Networking
A new multicast opportunistic routing protocol for wireless mesh networks

NETWORKING'11 Proceedings of the IFIP TC 6th international conference on Networking

Quantified Score

Hi-index	0.00

Visualization

Abstract

In recent years there has been a growing interest in Opportunistic Routing as a way to increase the capacity of wireless networks by exploiting its broadcast nature. By contrast to traditional uni-path routing, in opportunistic routing the nodes overhearing neighbor's transmissions can become candidates to forward the packets towards the destination. In this paper we address the question: What is the maximum performance that can be obtained using opportunistic routing? To answer this question we use an analytical model that allows to compute the optimal position of the nodes, such that the progress towards the destination is maximized. We use this model to compute bounds to the minimum expected number of transmissions that can be achieved in a network using opportunistic routing.