2011 Fifth International Conference on Genetic and Evolutionary Computing 2011
DOI: 10.1109/icgec.2011.22
|View full text |Cite
|
Sign up to set email alerts
|

Bus Assisted Connectionless Routing Protocol for Metropolitan VANET

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
8
0

Year Published

2013
2013
2017
2017

Publication Types

Select...
4
3

Relationship

0
7

Authors

Journals

citations
Cited by 12 publications
(8 citation statements)
references
References 6 publications
0
8
0
Order By: Relevance
“…Therefore, the VANET performance cannot be guaranteed without using some number of stationary RSUs and TCC. On the other hand, the Footmark Leaving scheme proposed in [16] is not very efficient for destination identification since it uses a form of broadcasting.…”
Section: Related Workmentioning
confidence: 98%
See 1 more Smart Citation
“…Therefore, the VANET performance cannot be guaranteed without using some number of stationary RSUs and TCC. On the other hand, the Footmark Leaving scheme proposed in [16] is not very efficient for destination identification since it uses a form of broadcasting.…”
Section: Related Workmentioning
confidence: 98%
“…Lai proposed a Footmark Leaving scheme in [16] to locate the destination vehicle. It lets each vehicle maintain a table of recently passed vehicles in each road segment.…”
Section: Related Workmentioning
confidence: 99%
“…The inter-contact times between public transport vehicles can be estimated through exponential calculation, assuming that the vehicle nodes act as a backbone [15]. For an efficient transmission path to avoid broadcast storm, a footmark leaving scheme can be used as well in a bus-based network [16]. A better delivery probability can also be achieved by giving a deadline for each packet so that a single-copy routing can be used as an alternative [17].…”
Section: Related Workmentioning
confidence: 99%
“…However, the regular buses can significantly increase the probability that at any time slot the road segment has at least one vehicle. According to the real mobility trace collected by [21], we can know the probability pb that in any time slot the road segment has a bus larger than normal1/normal5. Adding pa and pb, we can derive the probability that the edge between two squares has at least one vehicle is bigger than normal1/normal3.…”
Section: Capacity Of Highway Routingmentioning
confidence: 99%
“…The buses of each road were considered as one bus trajectory. The bus forward scheme was proposed in [21]. Each transmission flow transmits packets via two-hop relay scheme proposed in [22].…”
Section: Introductionmentioning
confidence: 99%