The Feasibility of a Search Engine for Metropolitan Vehicular Ad-Hoc Networks

Wewetzer, Christian; Caliskan, M.; Luebke, A.

doi:10.1109/glocomw.2007.4437818

Cited by 7 publications

(5 citation statements)

References 19 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Vehicles that have the service that satisfies the request, send a service reply to the requesting vehicle. In [6], Wewetzer et al propose a service discovery protocol based on flooding. Dikaiakos et al provided in [7] location-aware services over vehicular ad hoc networks using car-to-car communication.…”

Section: Related Workmentioning

confidence: 99%

“…Dikaiakos et al provided in [7] location-aware services over vehicular ad hoc networks using car-to-car communication. In [6], Wewetzer et al proposed on-demand service discovery protocols using two different search methods: geographic hash table (GHT), and distributed hash table (DHT). In [5], Riva et al proposed a context-aware service discovery protocol.…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

A Scalable Bandwidth-Efficient Hybrid Adaptive Service Discovery Protocol for Vehicular Networks with Infrastructure Support

Abrougui¹,

Boukerche²,

Pazzi³

et al. 2014

IEEE Trans. on Mobile Comput.

View full text Add to dashboard Cite

In recent years, we have witnessed a growing interest in Vehicular Networks from both the research community and industry. Several potential applications of Vehicular Networks are envisioned such as road safety and security, streaming services, traffic monitoring and driving comfort, just to mention a few. It is critical that the existence of convenience or driving comfort services do not negatively affect the performance of safety services. In essence, the dissemination of safety services or the discovery of convenience applications require the communication among service providers and service requesters through constrained bandwidth resources. Therefore, service discovery techniques for vehicular networks must efficiently use the available common resources. In this paper, we present a bandwidth-efficient and scalable hybrid adaptive service discovery protocol (VSDP) for Vehicular Networks. VSDP aims at providing high success ratio while guaranteeing low response time and good scalability when the number of requests increases. Our proposed protocol finds the service provider and its routing information simultaneously which results in overall bandwidth savings. It uses diverse channels to exchange discovery and routing packets, thereby decreasing the congestion on single channels and decreasing the delay of service discovery. Our proposed service discovery protocol adapts the advertisement zone size of service providers based on an efficient adaptation mechanism that takes into consideration network condition and application requirements. The adaptation process is based on an adjustment technique and a prediction technique. We discuss the implementation of our protocol, present its proof of correctness as well as the performance evaluation through an extensive set of simulation experiments and using different mobility models. Our results show the scalability of our protocol. They indicate that our techniques can achieve significant success rate (more than 90 percent), while guaranteeing low response time (in the order of milliseconds) and low bandwidth usage when compared to existing service discovery techniques.

show abstract

Section: Related Workmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

A Scalable Bandwidth-Efficient Hybrid Adaptive Service Discovery Protocol for Vehicular Networks with Infrastructure Support

Abrougui¹,

Boukerche²,

Pazzi³

et al. 2014

IEEE Trans. on Mobile Comput.

View full text Add to dashboard Cite

show abstract

“…However, this kind of approaches has poor scalability, long search latency and high cost. In [13], a location-invariant approach, called GHT, is introduced. The map is divided into grids and quorums are grids which are computed by a specific hash function.…”

Section: Related Workmentioning

confidence: 99%

“…Each resource holder S stores its information to two buddies in its update area, while requester Q sends its query to two buddies in its query area for querying resource R (see Figure 3.3(c)). In this Section, we compare the performance of BGR, NSFS, RLSMP [10], flooding based and GHT [13].…”

Section: B Buddy Grid Reference (Bgr)mentioning

confidence: 99%

See 1 more Smart Citation

Typhoon: Resource Sharing Protocol for Metropolitan Vehicular Ad Hoc Networks

Chang

Sheu

2010

2010 IEEE Wireless Communication and Networking Conference

View full text Add to dashboard Cite

In this paper, we propose a realistic resource sharing protocol for VANET. The main idea of our protocol comes from typhoons. Typhoons move according to their eyes' mobility, i.e., quorums which are responsible for a given resource holder/requester "moves" according to the resource holder's/ requester's mobility. Our protocol exploits spatial locality between requesters and resource holders. When resource requesters get their desired resources, they are able to be new resource holders. For hot-resources, requesters are so numerous that the spatial locality is much enhanced over time. Besides, lots of applications (e.g., available parking slot information) in VANET are location-aware which have spatial locality between requesters and resource holders. By the aid of the spatial locality, resource holders/requesters share/query sources in their vicinity in our protocol. Simulation results show that our protocol has lower search latency and well scalability comparing to the previous work. Besides, due to that the spatial locality is enhanced over time, successful rate increases over time.

show abstract