2015
DOI: 10.1109/tc.2014.2349509
|View full text |Cite
|
Sign up to set email alerts
|

An Improved Stochastic Modeling of Opportunistic Routing in Vehicular CPS

Abstract: Vehicular Cyber-Physical System (VCPS) provides CPS services via exploring the sensing, computing and communication capabilities on vehicles. VCPS is deeply influenced by the performance of the underlying vehicular network with intermittent connections, which make existing routing solutions hardly to be applied directly. Epidemic routing, especially the one using random linear network coding, has been studied and proved as an efficient way in the consideration of delivery performance. Much pioneering work has … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
6
0

Year Published

2016
2016
2021
2021

Publication Types

Select...
8
2

Relationship

0
10

Authors

Journals

citations
Cited by 21 publications
(6 citation statements)
references
References 35 publications
0
6
0
Order By: Relevance
“…Cellular-based V2X Figure 2: Illustration of a heterogeneous MDVNET in an urban area either using a "hop-by-hop" mechanism or "store-and-forward" one [56]. The main difference between these two mechanisms is whether the intermediate vehicles forward the received packets immediately or carry them until the corresponding routing algorithm makes a forward decision [57]. In the existing research, unicast routing protocols have been investigated in two ways: greedy and opportunistic.…”
Section: B Routing Protocolsmentioning
confidence: 99%
“…Cellular-based V2X Figure 2: Illustration of a heterogeneous MDVNET in an urban area either using a "hop-by-hop" mechanism or "store-and-forward" one [56]. The main difference between these two mechanisms is whether the intermediate vehicles forward the received packets immediately or carry them until the corresponding routing algorithm makes a forward decision [57]. In the existing research, unicast routing protocols have been investigated in two ways: greedy and opportunistic.…”
Section: B Routing Protocolsmentioning
confidence: 99%
“…In such a network, all nodes in the network are always active. Under the circumstance of no channel conflict, the sender transmits data to the node nearest to the sink within its communication range, which is the classic shortest routing algorithm [29], [49], [50]. The advantage of this kind of network is that the delay of data transmission is minimal.…”
Section: A Data Collection In Wsns With Non-duty Cycle Modementioning
confidence: 99%
“…The basic algorithm, data management process, visualization technique, and operational interface they use are common to all GIS. The same algorithms and data can be applied to different systems [21]. Therefore, as long as the algorithm combination problem, business parameter input, and task scheduling are solved, the establishment and execution of new business processes can be completed quickly, the coupling degree of the geographic information service platform and the business system is improved, and the difficulty of developing a GIS business system is reduced [22].…”
Section: The On-demand Extended Model For Gis Data Processingmentioning
confidence: 99%