Distance Progress Based Opportunistic Routing for wireless mesh networks

Darehshoorzadeh, Amir; Cerdà-Alabern, Llorenç

doi:10.1109/iwcmc.2012.6314199

Cited by 34 publications

(29 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…However, it does not take into account the quality of the links. More recently, a more advanced metric, Expected Distance Progress (EDP) [10], was proposed as an enhanced version of the DP, overcoming such limitation.…”

Section: Related Workmentioning

confidence: 99%

Combination of Intra-Flow Network Coding and Opportunistic Routing: Reliable Communications over Wireless Mesh Networks

Garrido¹,

Gómez²,

Agüero³

et al. 2015

Proceedings of the Eighth EAI International Conference on Simulation Tools and Techniques

View full text Add to dashboard Cite

Opportunistic routing has recently appeared as a technique aimed to increase the performance of wireless mesh networks, by taking advantage of the broadcast nature of the wireless medium. Despite the remarkable attention the research community has paid to it, there are still some issues that need to be addressed; one of the most relevant ones is the unnecessary forwarding of the same packet by a number of nodes. Since Random Linear Coding (RLC) mechanisms randomly mix packets before forwarding them, they can be exploited to avoid (or at least to minimize) the aforementioned problem. In a previous work we introduced a flexible Network Coding (NC) entity that we integrated within the ns-3 framework. We extend herewith its functionalities, by integrating an opportunistic routing module that enables it to be used over random topologies. In addition, we assess the performance of using different external algebraical libraries to carry out the coding/recoding/decoding operations (i.e. matrix inverse and rank calculation).

show abstract

Section: Related Workmentioning

confidence: 99%

Combination of Intra-Flow Network Coding and Opportunistic Routing: Reliable Communications over Wireless Mesh Networks

Garrido¹,

Gómez²,

Agüero³

et al. 2015

Proceedings of the Eighth EAI International Conference on Simulation Tools and Techniques

View full text Add to dashboard Cite

show abstract

“…We have used a semi-optimum candidate selection algorithm, DPOR [17], to select the candidates of the nodes towards the destination. DPOR is a fast and efficient candidate selection algorithm whose performance is very close to the optimum algorithms proposed in the literature, whereas it runs much faster (see [17]). The link delivery probabilities between two nodes have been assigned with the shadowing model with β = 2.7 and σ db = 6.0.…”

Section: Node Positioning In Two-dimensional Multihop Networkmentioning

confidence: 99%

Optimum node placement in wireless opportunistic routing networks

2013

Self Cite

View full text Add to dashboard Cite

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. In 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.

show abstract

“…Candidate selection, candidate prioritization and coordination between the candidates are the three main phases of OR, all of which have a great impact on the performance of the network. Different metrics and candidate selection algorithms to select and order the candidates are proposed in the research literature [4]- [7]. The proposed metrics range from simple, such as Hop count, Expected Transmission Count (ETX) [1], [4], and Distance This work is partially supported by NSERC DIVA Strategic Networks, NSERC DISCOVERY grants, the Canada Research Chair program, and ORF/MRI Research Funds.…”

Section: Introductionmentioning

confidence: 99%

“…Progress (DP) [5] to complex, such as Expected Any-Path Transmissions [6], and Expected Distance Progress (EDP) [7]. We anticipate that, the candidate selection algorithm which uses the metrics that reflect more information about the network topology, will perform better than the simple ones.…”

Section: Introductionmentioning

confidence: 99%

“…In our comparison, we have selected four different ranges of OR protocols. The protocols vary from simple but well-known protocols (ExOR [8] and POR [5]) to more complicated (DPOR [7]) and the optimum one (MTS [6]). To make the comparisons fair, and because we want to focus on the evaluation of different candidate selection algorithms, we have used the wellknown Timer-based approach for candidate coordination in the protocols under study.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Opportunistic routing protocols in wireless networks: A performance comparison

Darehshoorzadeh

Boukerche

2014

2014 IEEE Wireless Communications and Networking Conference (WCNC)

Self Cite

View full text Add to dashboard Cite

The broadcast nature of the wireless medium applied in Opportunistic Routing (OR) to improve the performance of wireless networks. OR protocols select a set of candidates as the next-hop forwarder. Each candidate can act as a potential forwarder if it receives the packet. Candidate selection is one of the main issues for OR protocols. In this paper, we implement and compare different ranges of OR protocols (simple, complex and optimum ones) in terms of different performance parameters using NS-2. The obtained results through extensive simulations show that OR improves the performance of network in different terms. Furthermore, our results provide insights to the use of each opportunistic routing protocols in different scenarios.

show abstract

Distance Progress Based Opportunistic Routing for wireless mesh networks

Cited by 34 publications

References 17 publications

Combination of Intra-Flow Network Coding and Opportunistic Routing: Reliable Communications over Wireless Mesh Networks

Combination of Intra-Flow Network Coding and Opportunistic Routing: Reliable Communications over Wireless Mesh Networks

Optimum node placement in wireless opportunistic routing networks

Opportunistic routing protocols in wireless networks: A performance comparison

Contact Info

Product

Resources

About