Modeling of Intermittent Connectivity in Opportunistic Networks: The Case of Vehicular Ad hoc Networks

Plenty of multimedia contents such as traffic images, music, and movies pose great challenges for content downloading due to the high mobility of vehicles and intermittent connectivity for vehicular ad hoc networks. Roadside units or APs can improve the efficiency of content downloading but with the cost of large investments. In this paper, an efficient content downloading scheme is proposed with the assistance of parking clusters, which are formed by roadside parked cars. After receiving the downloading request, the parking clusters, which the downloader will travel through according to the estimated trajectory, will make a download scheduling for the downloader. Then the downloader acquires the content chunks while it drives through the parking clusters. Simulation results show that the proposed scheme achieves better performance than intervehicle approach and RSU based approach.

Download Full-text

Parameter Based Efficient & Reliable Routing Technique to Enhance Network Lifetime for Vehicular Ad Hoc Networks

International Journal of Engineering & Technology ◽

10.14419/ijet.v7i3.12.15863 ◽

2018 ◽

Vol 7 (3.12) ◽

pp. 57

Author(s):

Asha K S ◽

Rajeshwari Hegde

Keyword(s):

Ad Hoc Networks ◽

Vehicular Ad Hoc Networks ◽

Ad Hoc ◽

Routing Algorithm ◽

Data Communication ◽

Average Delay ◽

Reliable Routing ◽

Intermittent Connectivity ◽

Hoc Networks ◽

The Impact

Some Inherent Vehicular Ad Hoc Networks (VANETs) characteristics such as intermittent connectivity, highly dynamic topology, and hard delay constraints, make data communication a challenging task in these networks. Due to such peculiarities, in this paper we study the impact of using vehicles predicted locations as a metric for data communication in VANETs. This paper deals with PBERR (Parameter Based Efficient Reliable Routing) for VANETs, which is a multilevel routing algorithm. The focus of this algorithm is 100% data transmission from end to end with no loss or drop of data packets by selecting the reliable path. The proposed algorithm will use the data of the digital maps to limit the scope of message exchanges in the shortest path for vehicles between source and destination. Our results clearly demonstrate the efﬁciency of the proposed solution in different scenarios, especially in terms of Network throughput, Energy consumption and Average delay.

Download Full-text

SF-APP

International Journal of Web Services Research ◽

10.4018/ijwsr.2018040103 ◽

2018 ◽

Vol 15 (2) ◽

pp. 47-66

Author(s):

Prashant Kumar ◽

Naveen Chauhan ◽

Narottam Chand ◽

Lalit K. Awasthi

Keyword(s):

Ad Hoc Networks ◽

Trust Management ◽

Privacy Preservation ◽

Ad Hoc ◽

Security Analysis ◽

Opportunistic Networks ◽

Security Requirements ◽

Intermittent Connectivity ◽

Self Organized ◽

Hoc Networks

Opportunistic networks are the special class of ad hoc networks where permanent link among the nodes are almost absent and communication occurs when an “opportunity” is found. The opportunistic networks have more diverse features than traditional ad hoc networks, like self-organized nature, intermittent connectivity, store-carry-forward routing mechanism, etc. All these features make opportunistic networks more prone to security threats. This article discusses security challenges and threats to opportunistic networks. Focusing on the specific security requirements of opportunistic networks, proposed is a secure framework for authentication and privacy preservation (SF-APP) for opportunistic networks. The proposed algorithm takes care of authentication, privacy preservation, and trust management. Within this article is a performed security analysis of SF-APP and simulation results show that the proposed framework is capable of fulfilling the security requirements of opportunistic networks.

Download Full-text