PRAVDA: Pseudo random network coding in vanet for data download

dc.creatorAstudillo Salinas, Darwin Fabián
dc.date2018-01-11T16:47:28Z
dc.date2018-01-11T16:47:28Z
dc.date2014-11-12
dc.dateinfo:eu-repo/date/embargoEnd/2022-01-01 0:00
dc.date.accessioned2018-03-14T20:32:20Z
dc.date.available2018-03-14T20:32:20Z
dc.identifier21569711
dc.identifierhttps://www.scopus.com/inward/record.uri?eid=2-s2.0-84937777809&doi=10.1109%2fWD.2014.7020833&partnerID=40&md5=629a93b7b01c1fe14609f8f9a8b0293f
dc.identifierhttp://dspace.ucuenca.edu.ec/handle/123456789/29120
dc.identifier10.1109/WD.2014.7020833
dc.identifier.urihttp://repositorioslatinoamericanos.uchile.cl/handle/2250/1136022
dc.descriptionThis paper introduces PRAVDA, a new approach for infrastructure based content distribution in a vehicular network. PRAVDA is built on broadcasting and pseudo random network coding. Its first strength is that, being broadcast based, it does not need any feedback channel and thus consumes very little throughput. Data is transmitted through network coding: multiple linear combinations of data are sent. A vehicle needs to receive a defined number of independent linear combinations to decode the data. The server will send a larger number of different linear combinations. The unreliability of broadcast is thus fought through a useful redundancy rather than through re-transmission. Finally, computation of the linear combination coefficients is done so that the overhead is the same as it would be without network coding.
dc.descriptionRio de Janeiro
dc.languageen_US
dc.publisherIEEE COMPUTER SOCIETY
dc.rightsinfo:eu-repo/semantics/openAccess
dc.rightshttp://creativecommons.org/licenses/by-nc-sa/3.0/ec/
dc.sourceinstname:Universidad de Cuenca
dc.sourcereponame:Repositorio Digital de la Universidad de Cuenca
dc.sourceIFIP Wireless Days
dc.titlePRAVDA: Pseudo random network coding in vanet for data download
dc.typeArtículos de revistas


Este ítem pertenece a la siguiente institución