- -

Candidate Selection Algorithms in Opportunistic Routing based on Distance Progress

RiuNet: Institutional repository of the Polithecnic University of Valencia

Share/Send to

Cited by

Statistics

Candidate Selection Algorithms in Opportunistic Routing based on Distance Progress

Show full item record

Darehshoorzadeh, A.; Cerdà-Alabern, L.; Pla, V. (2015). Candidate Selection Algorithms in Opportunistic Routing based on Distance Progress. International Journal of Ad Hoc and Ubiquitous Computing. 20(3):137-147. doi:10.1504/IJAHUC.2015.073168

Por favor, use este identificador para citar o enlazar este ítem: http://hdl.handle.net/10251/58350

Files in this item

Item Metadata

Title: Candidate Selection Algorithms in Opportunistic Routing based on Distance Progress
Author:
UPV Unit: Universitat Politècnica de València. Departamento de Comunicaciones - Departament de Comunicacions
Issued date:
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 ...[+]
Subjects: Opportunistic routing , Candidate selection , Maximum progress distances , Wireless network
Copyrigths: Reserva de todos los derechos
Source:
International Journal of Ad Hoc and Ubiquitous Computing. (issn: 1743-8225 ) (eissn: 1743-8233 )
DOI: 10.1504/IJAHUC.2015.073168
Publisher:
Inderscience
Publisher version: http://www.inderscience.com/info/inarticletoc.php?jcode=ijahuc&year=2015&vol=20&issue=3
Type: Artículo

This item appears in the following Collection(s)

Show full item record