2011 IEEE 73rd Vehicular Technology Conference (VTC Spring) 2011
DOI: 10.1109/vetecs.2011.5956793
|View full text |Cite
|
Sign up to set email alerts
|

Reliable Broadcast Transmission in Vehicular Networks Based on Fountain Codes

Abstract: Car-to-car and car-to-infrastructure communications are currently under intense research as they enable a wide variety of applications. Besides security-driven applications which require only small amounts of individual data there are also applications which require medium to high amounts of uniform data delivered to an unknown number of nodes. For this kind of broadcast and multicast applications, the use of fountain codes is highly suitable. In this paper, we investigate the applicability of fountain codes i… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
8
0

Year Published

2012
2012
2022
2022

Publication Types

Select...
4
2

Relationship

0
6

Authors

Journals

citations
Cited by 6 publications
(8 citation statements)
references
References 10 publications
0
8
0
Order By: Relevance
“…The application of network coding and rateless codes in vehicular networks has been previously investigated . The DDRC algorithm merges the roadside‐to‐vehicle and vehicle‐to‐vehicle communication, and a reliable data dissemination without a need for complex routing protocols is obtained.…”
Section: Related Workmentioning
confidence: 99%
“…The application of network coding and rateless codes in vehicular networks has been previously investigated . The DDRC algorithm merges the roadside‐to‐vehicle and vehicle‐to‐vehicle communication, and a reliable data dissemination without a need for complex routing protocols is obtained.…”
Section: Related Workmentioning
confidence: 99%
“…If errors occur, this packet will be dropped by the receiver. A fountain code decoder tries to recover the source packets from the received encoded packets after accumulating a sufficient number of correct encoded packets, usually this sufficient number is slightly higher than K, an additional overhead of about 5 − 10% of K is typically required [11]. As users with different conditions have different packet loss rate, they need different transmission time to receive a sufficient number of packets and decode the message.…”
Section: Fountain Codementioning
confidence: 99%
“…In this section, the probability mass function (PMF) p LT (n) and the cumulative density function (CDF) F LT (n) are used to analyze the decoding process. See [9] for the further detailed information. F LT (n) can be calculated as:…”
Section: Broadcast Modelmentioning
confidence: 99%