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

Abstract

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.

Online War-Driving by Compressive Sensing

“…where g(·) denotes the Gaussian probability density function as in (2), K is the number of RSUs, µ j and σ j are the mean and standard deviation of the RSS measurement r derived from (1). Eq.…”

“…WiFi routers, base stations, mesh nodes, sensors and others) that can support communications with infrastructure in vehicular networks. These RSUs provide better signals, spare spectrum and higher bandwidth to enable applications such as mobile data dissemination, Internet access services, and nearby information sharing [1], [2], [3], [4]. Vehicle-to-Infrastructure communication depends on the number and locations of RSUs being used opportunistically by end users [5], [6].…”

A Customized Web Service Constructing Model Based On Private Cloud

“…To enhance the robustness of the model, we should take service registration [20], service discovery [21,22,23], service retrieval into account. Therefore a stronger service engine will be designed in the future work.…”

A Novel Markov Model-Based Low-Power and Secure Multihop Routing Mechanism

“…A wireless ad hoc network is a kind of noncentral network which is established by a large number of sensor nodes through self-organization. A wireless ad hoc network with self-organized, distributed, and dynamic characteristics can often be deployed in a harsh environment without relying on fixed facilities [1][2][3]. Compared with the traditional centralized network, the distributed wireless multihop network has the advantage of lower cost, better universality, and wider application field [4][5][6][7].…”