Routing in Sparse Vehicular Ad Hoc Wireless Networks

Wisitpongphan, Nawaporn; Bai, Fan; Mudalige, Priyantha; Sadekar, Varsha; Tonguz, O.K.

doi:10.1109/jsac.2007.071005

Cited by 467 publications

(347 citation statements)

References 21 publications

Supporting

Mentioning

341

Contrasting

Order By: Relevance

“…Based on investigations in [11], it is observed that vehicles tend to move in clusters where two consecutive clusters of vehicles are normally separated by a relatively large distance. Also, it is observed that the probability distribution of the spacing between equipped vehicles in a network with can be approximated as an exponential distribution with parameter λ s , given by…”

Section: Characteristics Of Disconnected Vehicular Ad Hoc Networkmentioning

confidence: 99%

Disseminating a Large Amount of Data to Vehicular Network in an Urban Area

Taheri

Hendesi

2011

International Journal of Vehicular Technology

View full text Add to dashboard Cite

The problem of distributing a large amount of data from multiple sources in an urban area is investigated. We explore an opportunistic approach for information collection, in which a vehicle obtains information about resources from encountered vehicles. This protocol could be applied in both dense and sparse vehicular networks. Due to the highly dynamic nature of the underlying vehicular network topology, we depart from architectures requiring centralized coordination, reliable MAC scheduling, or global network state knowledge, and instead adopt a distributed paradigm with simple protocols. In other words, a reliable dissemination is introduced from multiple sources when each node in the network shares a limited amount of its resources for cooperating with others. By using rateless coding at the Road Side Unit (RSU) and using vehicles as data carriers, an efficient way to achieve reliable dissemination to all nodes (even disconnected clusters in the network) is described.

show abstract

Section: Characteristics Of Disconnected Vehicular Ad Hoc Networkmentioning

confidence: 99%

Disseminating a Large Amount of Data to Vehicular Network in an Urban Area

Taheri

Hendesi

2011

International Journal of Vehicular Technology

View full text Add to dashboard Cite

show abstract

“…Several analytic mobility models for VANETs have been proposed [9,14]. Mohimani et al [9] model VANET mobility by employing an open queueing network comprising M/G/∞ nodes.…”

Section: Related Workmentioning

confidence: 99%

“…Mohimani et al [9] model VANET mobility by employing an open queueing network comprising M/G/∞ nodes. Wisitpongphan et al [14] propose an analytical model based on realistic traffic traces to evaluate the routing performance of vehicular networks at highways. But since the analysis concentrates on approximation through mean value studies, the re-healing time results shows some inaccuracies, while our model derives the probability distribution to acquire the relatively accurate delay bound of multi-copy routing.…”

Section: Related Workmentioning

confidence: 99%

“…Since we consider only sparse networks, the vehicle speed does not depend on the preceding vehicle, as in the car following model [4], but rather on the speed limit of the road. Thus, we assume that vehicles travel at a constant speed of v avg on each road, which is consistent with [2,6] and [14]. Therefore, if a vehicle does not exist within the transmission range at the message-forwarding direction, then the message has to be stored-and-carried until it reaches the next intersection, which should be more crowded than the road section due to traffic lights or stop signs [3,4].…”

Section: System Modelmentioning

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%

See 2 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