Show simple item record

dc.contributor.authorDarehshoorzadeh, Amir
dc.contributor.authorCerdà Alabern, Llorenç
dc.contributor.otherUniversitat Politècnica de Catalunya. Departament d'Arquitectura de Computadors
dc.date.accessioned2011-09-27T12:50:03Z
dc.date.available2011-09-27T12:50:03Z
dc.date.created2011-09-15
dc.date.issued2011-09-15
dc.identifier.citationDarehshoorzadeh, A.; Cerdà, L. Modeling and comparison of candidate selection algorithms in opportunistic routing. "Computer networks", 15 Setembre 2011, vol. 55, núm. 13, p. 2886-2898.
dc.identifier.issn1389-1286
dc.identifier.urihttp://hdl.handle.net/2117/13362
dc.description.abstractOpportunistic 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 to traditional routing, where traffic is sent along pre-determined paths, in OR an ordered set of candidates is selected for each next-hop. Upon each transmission, the candidates coordinate such that the most priority one receiving the packet actually forward it. Most of the research in OR has been ddressed to investigate candidate selection algorithms. In this paper we compare a selected group of algorithms that have been proposed in the literature. Our main conclusion is that optimality is obtained at a high computational cost, with a performance gain very similar to that of much simpler but non optimal algorithms. Therefore, we conclude that fast and simple OR candidate selection algorithms may be preferable in dynamic networks, where the candidate sets are likely to be updated frequently.
dc.format.extent13 p.
dc.language.isoeng
dc.subjectÀrees temàtiques de la UPC::Enginyeria de la telecomunicació::Telemàtica i xarxes d'ordinadors::Protocols de comunicació
dc.subjectÀrees temàtiques de la UPC::Informàtica::Arquitectura de computadors
dc.subject.lcshComputer networks -- Architecture
dc.subject.lcshNetwork protocols
dc.subject.lcshWireless communication
dc.titleModeling and comparison of candidate selection algorithms in opportunistic routing
dc.typeArticle
dc.subject.lemacProtocols de xarxes d'ordinador
dc.contributor.groupUniversitat Politècnica de Catalunya. CNDS - Xarxes de Computadors i Sistemes Distribuïts
dc.identifier.doi10.1016/j.comnet.2011.06.009
dc.description.peerreviewedPeer Reviewed
dc.relation.publisherversionhttp://dl.acm.org/citation.cfm?id=2016440
dc.rights.accessRestricted access - publisher's policy
drac.iddocument5960340
dc.description.versionPostprint (published version)
upcommons.citation.authorDarehshoorzadeh, A.; Cerdà, L.
upcommons.citation.publishedtrue
upcommons.citation.publicationNameComputer networks
upcommons.citation.volume55
upcommons.citation.number13
upcommons.citation.startingPage2886
upcommons.citation.endingPage2898


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