A static-node assisted adaptive routing protocol in vehicular networks

Ding, Yong; Wang, Chen; Xiao, Li

doi:10.1145/1287748.1287758

Cited by 165 publications

(117 citation statements)

References 22 publications

(21 reference statements)

Supporting

Mentioning

113

Contrasting

Order By: Relevance

“…Many routing protocols have been proposed to deal with the disconnection problem in sparse vehicular networks [2,5,6,10,15]. Vehicle-Assisted Data Delivery (VADD) [15] uses global statistical traffic information, such as vehicle speed and density to measure the expected delay at each road, and in result, finds the path with the lowest expected end-to-end delay.…”

Section: Related Workmentioning

confidence: 99%

“…The aforementioned approaches assumed that realtime global traffic information of the area, which may extend up to tens or even hundreds of square miles depending on the location of the destination, is known to the vehicles a priori, which may not be practical. Static-node assisted Adaptive data Dissemination (SADV) [2] improves VADD with the assistance of static nodes at intersections. The static node assists the vehicles by storing a message until a vehicle appears along the best delivery path to reduce the end-to-end delay, and also measures the delay between adjacent static nodes at real time.…”

Section: Related Workmentioning

confidence: 99%

“…VANETs at low densities may get disconnected due to low node density at the time of day such as night times or low deployment rate at market introduction phase [2,5,6,10,14,15]. As a result, a mobile node can be used as a carrier to deliver messages, i.e., store-and-carry forwarding which is a technique developed by the delay tolerant network (DTN) community [1,11].…”

Section: Introductionmentioning

confidence: 99%

“…We refer to this phenomenon as multi-copy diversity gain, and the multicopy diversity effect on DTNs with random mobility is evaluated in [16]. Epidemic routing, with some improvements, has recently been applied to the vehicular networks to combat the network disconnection problem [2,5,6,10,15]. The main difference of epidemic routing in vehicular networks is that the packet replication is only made at the intersection, where multiple available road paths to the destination may exist.…”

Section: Introductionmentioning

confidence: 99%

“…We show that AMR achieves multi-copy diversity close to maximum while limiting the routing overhead. AMR also utilizes only the local delay measurements, while previous sparse routing protocols [2,10,15] requires global network information at real time.…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

The multi-copy diversity for routing in sparse vehicular ad hoc networks

Yoo¹,

Choi

Kim

2010

Telecommun Syst

View full text Add to dashboard Cite

The need for routing based on store-and-carry forwarding has been motivated in sparse vehicular ad hoc networks (VANETs), since the traditional end-to-end unicast routing is infeasible due to the network disconnection problem. In store-and-carry based routing, the end-to-end message delivery delay is dominated by the store-and-carry procedure rather than the wireless transmission. Therefore, the end-to-end delay in such sparse VANETs can be further reduced by replicating multiple copies of the message to other nodes when possible, i.e., multi-copy routing, to increase the chance of finally finding the destination, which we call this gain as multi-copy diversity. In this paper, we present an analytic framework to evaluate the performance of routing by assessing the multi-copy diversity gain in sparse VANETs. By using this model, we first derive an upper and lower-bound of end-to-end routing delay in sparse VANETs. Our analytic results show that a high level of multi-copy diversity gain is achieved when the network is partially connected, which is in contrast to the conventional expectation that multi-copy routing performs better in severely disconnected networks. Second, we propose a new adaptive multi-copy VANET routing scheme called AMR by exploiting these analytic results. AMR adapts to the local J. Yoo ( ) Computer Science Department, UCLA, 420 Westwood Plaza, Los Angeles, CA, 90095, USA e-mail: joonyoo2@ucla.edu S. Choi School of Electrical Engineering, Kookmin University, Seoul 136-702, Republic of Korea C.-k. Kim School of Electrical Engineering and Computer Science, Seoul National University, Seoul 151-742, Republic of Korea network connectivity and increases the level of multi-copy diversity at significantly reduced routing overhead compared to the well known epidemic routing. We validate the accuracy of our analytic model and the performance of AMR via simulation studies.

show abstract

Section: Related Workmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

The multi-copy diversity for routing in sparse vehicular ad hoc networks

Yoo¹,

Choi

Kim

2010

Telecommun Syst

View full text Add to dashboard Cite

show abstract

Reducing wireless multi‐hop delay via RSU re‐routing in vehicular wireless networks

Wang

Tseng

2014

Int J Communication

View full text Add to dashboard Cite

Summary Vehicular wireless networks offer wireless multi‐hop communications between vehicles and roadside units (RSUs). To reduce deployment cost, the distance between two RSUs could be long; that is, the communications between an RSU and a vehicle may be carried out through multi‐hops among intermediate vehicles. When a vehicle is driven from one RSU to another, the wireless multi‐hop delay becomes more serious as the number of multi‐hop relays increases. The wireless multi‐hop delay is critical for some emergency service. For instance, in a traffic accident, when a patient was sent to the hospital by ambulance, the life information of the patient must be transmitted to the hospital on time through the multi‐hop wireless network. If the ambulance is moved from one RSU to another, the wireless multi‐hop delay becomes more and more serious as the ambulance is closing to another RSU. In this paper, we propose an RSU re‐routing strategy that dynamically alters multi‐hop communications until the best RSU with the shortest path using location information is found. Moreover, we compare the proposed strategy with the existing strategy in terms of broadcasting costs, re‐routing delay, and wireless multi‐hop delay of data transmission. Performance results show that the proposed strategy can reduce the wireless multi‐hop delay significantly. Copyright © 2014 John Wiley & Sons, Ltd.

show abstract