Modeling and comparison of candidate selection algorithms in opportunistic routing

Darehshoorzadeh, Amir; Cerdà-Alabern, Llorenç; Pla, Vicent

doi:10.1016/j.comnet.2011.06.009

Cited by 35 publications

(27 citation statements)

References 26 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In [18] an algebraic approach is applied to study the interaction of OR routing algorithms and routing metrics. In [6,9] a Markov model to assess the improvement that may be achieved using opportunistic routing has been proposed. At the same time, Li and Zhang published an analytic framework to estimate the transmission costs of packet forwarding in wireless networks [17].…”

Section: Related Workmentioning

confidence: 99%

“…Then, the CSA is run to assign the candidates. Finally, the expected number of transmissions is computed analytically, as explained in [9]. The analytic results have been obtained using R [20].…”

Section: Performance Evaluationmentioning

confidence: 99%

“…Therefore, optimum candidate selection requires a perfect knowledge of the whole network topology. Additionally, the computational cost of evaluating the mathematical formulas used in optimum CSAs increases very rapidly with the number of nodes in the network [9].…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Candidate selection algorithms in opportunistic routing based on distance progress

Darehshoorzadeh

Cerdí-Alabern

Pla

2015

IJAHUC

Self Cite

View full text Add to dashboard Cite

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 prioritization of candidates, referred to as candidate selection algorithm, 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 candidate selection algorithms in order to maximize the distance progress towards the destination. We compare our proposals with other well-known candidate selection algorithms proposed in the literature through mathematical analysis and simulation. We show that candidate selection algorithms based on distance progress achieve almost the same performance as the optimum algorithms proposed in the literature, while the computational cost is dramatically reduced.

show abstract

Section: Related Workmentioning

confidence: 99%

Section: Performance Evaluationmentioning

confidence: 99%

See 1 more Smart Citation

Candidate selection algorithms in opportunistic routing based on distance progress

Darehshoorzadeh

Cerdí-Alabern

Pla

2015

IJAHUC

Self Cite

View full text Add to dashboard Cite

show abstract

“…Zubow et al in [56] claimed that shadow fading losses for spatially close candidates are not independent from each other, unlike commonly assumed. They presented measurements obtained from an indoor testbed and concluded that correlations can not be neglected if nodes are separated by less than 2 m. In [57,58] a Markov model to assess the improvement that may be achieved using opportunistic routing was proposed. At the same time, Li and Zhang published an analytical framework to estimate the transmission costs of packet forwarding in wireless networks [59].…”

Section: Opportunistic Routingmentioning

confidence: 99%

Multicast delivery using opportunistic routing in wireless mesh networks

Darehshoorzadeh

Alabern

2014

IJAHUC

Self Cite

View full text Add to dashboard Cite

Opportunistic Routing (OR) has been proposed to improve the efficiency of unicast protocols in wireless networks. In OR, in contrast to traditional routing, instead of preselecting a single specific node to be the next-hop forwarder, an ordered set of nodes (referred to as candidates) is selected as the next-hop potential forwarders. In this paper, we investigate how OR can be used to improve multicast delivery. We propose a new multicast routing protocol based on opportunistic routing for wireless mesh networks, named Multicast Opportunistic Routing Protocol (MORP). MORP opportunistically employs a set of forwarders to send a packet toward all destinations. Each forwarder is responsible for sending the packet to a subset of destinations. Based on the candidates that successfully receive the packet in each transmission, MORP builds a tree on the fly. We compare our proposal with two well known ODMRP and ADMR multicast protocols. Our results demonstrate that MORP outperforms ODMRP and ADMR, reducing the number of data transmissions and increasing the delivery ratio.

show abstract

“…9 Several candidate selection algorithms have been proposed. 6,[10][11][12] For OR, the candidate selection algorithm generally contains end-to-end methods and local approaches. 13 Both methods use a predetermined metric to select and prioritize the candidate set.…”

Section: Introductionmentioning

confidence: 99%

TIME-DRIVEN opportunistic routing protocol for ultra-wideband indoor positioning

Gao

Shen

Dong

et al. 2016

International Journal of Distributed Sensor Networks

View full text Add to dashboard Cite

The scope of a single regional indoor positioning network is often restricted to its main anchor communication range and more susceptible to obstacles. Multiple main anchors can be the basis of an indoor positioning network's extensibility and can adapt to the complex communication environment. In this article, a novel TIME-DRIVEN opportunistic routing protocol with intelligent response is proposed. First, an extendable ultra-wideband positioning system is modeled. In two or more communication cells, anchors can act as a main or slave anchor in different areas, respectively, and a forward clock check package from the initial district to its surrounding area. They can also achieve the clock synchronization of the entire network. In this model, the anchors will be divided into different sizes of clusters, and the main anchor is elected according to the broadcast time. Furthermore, the relay anchor will be intelligently selected according to the opportunistic probability based on the received signal strength indicator. Finally, experiments are conducted to verify the performance of the method.

show abstract

Modeling and comparison of candidate selection algorithms in opportunistic routing

Cited by 35 publications

References 26 publications

Candidate selection algorithms in opportunistic routing based on distance progress

Candidate selection algorithms in opportunistic routing based on distance progress

Multicast delivery using opportunistic routing in wireless mesh networks

TIME-DRIVEN opportunistic routing protocol for ultra-wideband indoor positioning

Contact Info

Product

Resources

About