Show simple item record

dc.contributor.authorDarehshoorzadeh, Amir
dc.contributor.authorCerdà Alabern, Llorenç
dc.contributor.authorPla Boscà, Vicent
dc.contributor.otherUniversitat Politècnica de Catalunya. Departament d'Arquitectura de Computadors
dc.date.accessioned2016-02-23T08:59:49Z
dc.date.available2016-02-23T08:59:49Z
dc.date.issued2015-01-01
dc.identifier.citationDarehshoorzadeh, A., Cerdà, L., Pla, V. Candidate selection algorithms in opportunistic routing based on distance progress. "International journal of Ad Hoc and ubiquitous computing", 01 Gener 2015, vol. 20, núm. 3, p. 137-147.
dc.identifier.issn1743-8225
dc.identifier.urihttp://hdl.handle.net/2117/83299
dc.description.abstractOpportunistic 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 prioritisation of candidates, referred to as candidate selection algorithm (CSA), 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 CSAs in order to maximise the distance progress (DP) towards the destination. We compare our proposals with other well-known CSAs proposed in the literature through mathematical analysis and simulation. We show that candidate selection algorithms based on DP achieve almost the same performance as the optimum algorithms proposed in the literature, while the computational cost is dramatically reduced.
dc.format.extent11 p.
dc.language.isoeng
dc.subjectÀrees temàtiques de la UPC::Informàtica::Arquitectura de computadors
dc.subject.lcshRouting protocols (Computer network protocols)
dc.subject.lcshWireless communications systems
dc.subject.otherOR
dc.subject.otherOpportunistic routing
dc.subject.otherCandidate selection
dc.subject.otherMaximum progress distances
dc.subject.otherWireless network
dc.titleCandidate selection algorithms in opportunistic routing based on distance progress
dc.typeArticle
dc.subject.lemacEncaminadors (Xarxes d'ordinadors)
dc.subject.lemacComunicació sense fil, Sistemes de
dc.contributor.groupUniversitat Politècnica de Catalunya. CNDS - Xarxes de Computadors i Sistemes Distribuïts
dc.identifier.doi10.1504/IJAHUC.2015.073168
dc.description.peerreviewedPeer Reviewed
dc.relation.publisherversionhttp://www.inderscience.com/info/inarticle.php?artid=73168
dc.rights.accessOpen Access
drac.iddocument17504032
dc.description.versionPostprint (author's final draft)
upcommons.citation.authorDarehshoorzadeh, A., Cerdà, L., Pla, V.
upcommons.citation.publishedtrue
upcommons.citation.publicationNameInternational journal of Ad Hoc and ubiquitous computing
upcommons.citation.volume20
upcommons.citation.number3
upcommons.citation.startingPage137
upcommons.citation.endingPage147


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record

All rights reserved. This work is protected by the corresponding intellectual and industrial property rights. Without prejudice to any existing legal exemptions, reproduction, distribution, public communication or transformation of this work are prohibited without permission of the copyright holder