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

Delay-Constrained Data Aggregation in VANETs

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
9
0

Year Published

2016
2016
2023
2023

Publication Types

Select...
6
2
1

Relationship

0
9

Authors

Journals

citations
Cited by 19 publications
(9 citation statements)
references
References 32 publications
0
9
0
Order By: Relevance
“…Numerous data collection solutions have been proposed in vehicular networks, most of which consider metrics such as end-to-end delay, collection ratio, and communication cost. Using dynamic programming, the authors in [14] constructed a data aggregation tree with a waiting time budget at each node, producing much lower transmission overhead while achieving the same QoS performance as other schemes. The delaybounded routing protocols presented in [15] provided a routing scheme that satisfies user-defined delay requirements while maintaining a low level of channel utilization.…”
Section: B Data Collection In Vehicular Networkmentioning
confidence: 99%
See 1 more Smart Citation
“…Numerous data collection solutions have been proposed in vehicular networks, most of which consider metrics such as end-to-end delay, collection ratio, and communication cost. Using dynamic programming, the authors in [14] constructed a data aggregation tree with a waiting time budget at each node, producing much lower transmission overhead while achieving the same QoS performance as other schemes. The delaybounded routing protocols presented in [15] provided a routing scheme that satisfies user-defined delay requirements while maintaining a low level of channel utilization.…”
Section: B Data Collection In Vehicular Networkmentioning
confidence: 99%
“…The amount of aggregated traffic carried by a link should not exceed its capacity. Capacity constraints C a (14) and C b (15) are for V2V links and cellular links, respectively. Each traffic flow has a delay constraint D k which is reflected in constraint (16).…”
Section: B Optimization Problemmentioning
confidence: 99%
“…Another scheme from Ref. 18 focuses on the delay-constrained data aggregation problem in VANETs for maximizing the amount of collected information. The chain heuristic, which finds a set of paths for each destination within the delay limit, is proposed to meet delay bound for multicast networks (see Refs.…”
Section: Related Workmentioning
confidence: 99%
“…A sensing process consists of a series of sensing tasks for collecting the same kind of sensing data (i.e. air quality, noise level, or traffic status, GPS trajectories, [26][27][28] radio signal strength.) [29][30][31][32][33] A sensing process is divided by time slots, shown in Figure 2.…”
Section: System Modelmentioning
confidence: 99%