Department of Computer Science and Information Systems

Permanent URI for this collectionhttp://localhost:4000/handle/123456789/1928

Browse

Filters

2013 - 20166

Settings

Author: search.filters.author.Dua, AmitSubject: search.filters.subject.Vehicular ad hoc networks (VANETs)

Search Results

Now showing 1 - 6 of 6
  • No Thumbnail Available
    Item
    Learning automata based contention aware data forwarding scheme for safety applications in vehicular Ad Hoc networks
    (IEEE, 2013-12) Dua, Amit
    With an exponential growth of demands of the users to access various resources during mobility lead to the popularity of Vehicular Ad Hoc Networks (VANETs). Users may access various resources from cloud which consists of many resources for the ease of users. VANETs have been used in wide range of applications such as Intelligent Transport Systems (ITS), Safety alarms on roads/in community, online resource access using Internet connectivity etc. Among these applications, safety applications are most important and various proposals exist in literature for the same. But most of the existing proposals have used unicast sender based data forwarding which results an overall performance degradation with respect to the metrics such as packet delivery ratio, end-to-end delay and reliable data transmission. Keeping in view of the above, in this paper, we propose new Learning Automata based Contention Aware Data forwarding scheme for VANETs using cloud infrastructure. Learning Automata (LAs) are assumed to be located in the vehicles which share the information (such as vehicles density, directions of the vehicles or vehicles velocity etc) with the other LAs for taking the adaptive decisions about data forwarding. Based upon these values, automaton performs its action. Corresponding to each action performed by the automaton, its action may be rewarded or penalized by some constant values from the environment where it is working. Based upon the inputs from the environment, each automaton updates its action probability values for the next rounds. An adaptive Learning Automata based Contention Aware Data Forwarding (LACADF) algorithm is also proposed. The proposed scheme is evaluated with respect to different network parameters such as message overhead, throughput, delay etc. with varying density and mobility of the vehicles. The results obtained show that the proposed scheme is better than the other conventional schemes with respect to the above metrics.
  • No Thumbnail Available
    Item
    Efficient TDMA based virtual back off algorithm for adaptive data dissemination in VANETs
    (IEEE, 2014-01) Dua, Amit
    With an exponential growth of Internet related technologies, there is an emergence of new class of efficient data dissemination using Vehicular Ad Hoc networks for the safety of peoples. As there are limited number of channels in IEEE 802.11 a/b/g/p standards, so efficient mechanisms are required to allocate the same for new incoming requests from the users. Keeping in view of the same, we propose a modified TDMA based virtual back off algorithm for VANETs. Vehicles are assumed to be arrived using Poisson distribution and served as exponential. By varying the distance from RSUs, we have provided the analysis of end-to end delay for varying speed of vehicles.
  • No Thumbnail Available
    Item
    Collaborative P2P context-aware information propagation in vehicular ad hoc networks
    (IEEE, 2015) Dua, Amit
    With exponential growth of the Internet users in past few years, there is a need of context-aware information sharing among different inter-connected entities over the Internet. The prime objective of the inter-connected objects is that within a minimum use of available resources, maximum output with respect to parameters such as throughput and delay can be achieved. But, due to high velocity and irrelevant information propagation, there may be a performance degradation in some part of the network with respect to these parameters. To address these issues, we have designed novel algorithms for context-aware information propagation among the vehicles. The proposed scheme consists of algorithms for data access, data dissemination, and data suggestion. These algorithms are based on reliability of vehicle which is calculated as soon as vehicles enter the network and is updated after each successful execution of various operations of information propagation. The scheme works on by increasing the reliability which in turn solve the broadcast storm problem in which sometime irrelevant information may also be sent to the vehicles. Simulation results prove the merit of the proposed scheme over the other existing schemes with respect to parameters such as message overhead, connectivity ratio, and resources utilization.
  • No Thumbnail Available
    Item
    QoS-aware data dissemination for dense urban regions in vehicular ad hoc networks
    (Springer, 2014-12) Dua, Amit
    With an evolution of 5G and related technologies, there is a need of high data rate transfer between different communication objects such as vehicles, sensor nodes, or mesh clients connected to the Internet to maintain Quality of Service (QoS) at various levels. As vehicles in Vehicular Ad Hoc Networks (VANETs) are mainly used for safety related applications, so there is a need of an efficient QoS-aware data dissemination for various applications in different regions especially in dense urban regions where congestion is one of the major issues. Hence, to address this issue, in this paper, we propose a new mechanism to maintain QoS for data dissemination among the different vehicles in VANETs. An intelligent forwarding mechanism is used by newly defined metric which assigns weights to the different routing paths from source to destination. Separate algorithms are designed for route construction, and maintenance in the proposed scheme. The performance of the proposed scheme is studied by extensive simulations with respect to various metrics such as delay incurred, percentage of active links, and load on the network. The results obtained show that the proposed scheme is better than the other state-of-the-art existing schemes in the literature.
  • No Thumbnail Available
    Item
    ReIDD: reliability-aware intelligent data dissemination protocol for broadcast storm problem in vehicular ad hoc networks
    (Springer, 2016-05) Dua, Amit
    Vehicular ad hoc networks (VANETs) have emerged as fast growing networks with aims to provide safety, and comfort to the onboard passengers. But, in this environment reliable data dissemination to the destination nodes is one of the biggest challenges as there may be a congestion in the network due to blind flooding of messages to their final destination, called as broadcast storm which may lead to the performance degradation with respect to the metric such as-message delivery, reliability and response time. To address this issue, in this paper, we propose a reliability-aware intelligent data dissemination protocol for broadcast storm problem in VANETs. We have solved the above specified problem using game theory concepts in which players, strategy space and decisions with respect to the current state of the system. To reduce the message overhead with respect to the communication cost among the players of the game, in the proposed scheme, messages are routed to the next destination by selecting the most reliable path in an intelligent manner. A coalition game is formulated among the vehicles by considering vehicles as the players in the game. Each player in the game has an initial payoff value based upon the parameters such as-communication range, storage requirements, and computation power. Based upon the payoff value of the players in the game, different coalitions/clusters are formulated among the players in the proposed scheme. Then, the players send the messages to the other vehicles/players within the same coalition which increases the reliability of transmission. In the proposed scheme, messages are unicasted to their final destination in an intelligent manner. Different algorithms are designed for coalition formation, maintenance, and reliability-aware data dissemination. The performance of the proposed scheme is evaluated using various evaluation metrics such as-service time, packet delivery ration, and throughput. The results obtained prove the effectiveness of the proposed scheme as compared to the other state-of-the-art existing schemes.
  • No Thumbnail Available
    Item
    Game theoretic approach for real-time data dissemination and offloading in vehicular ad hoc networks
    (Springer, 2016-06) Dua, Amit
    Due to high velocity of the vehicles, data dissemination and mobile data offloading are most difficult tasks to be performed in vehicular ad hoc networks (VANETs). In recent years, due to an exponential increase in the data generated from various sources such as smart devices, gadgets, and actuators, there arises a need of usage of an efficient communication infrastructure to handle the aforementioned issues. Most of the earlier solutions reported in the literature for data offloading problem have used the cellular communication, which may be congested in handing a large number of requests from community of users. This may result a performance bottleneck in terms of call drops and data dissemination to the other vehicles in the VANET environment. Also, these schemes lack a comprehensive approach of data dissemination to meet the quality of service (QoS) in real time. Hence, to overcome this problem, some of the mobile data can be disseminated using the existing vehicular infrastructure and Wi-Fi access points (APs). In this paper, we propose a new schedule based on game theoretic approach where the APs and vehicles act as players in a game and compete for offloading the cellular data. The proposed scheme is based on the selection of the best vehicle or AP based on the utility of the players (vehicles and APs) in the game. The utility of vehicle and AP is decided based on the parameters such as distance, velocity, connectivity to destination, bandwidth, and area of the network. A novel algorithm has been designed using the proposed game theoretic approach for handling mobile data offloading and data dissemination. The proposed solution not only successfully offloads the data but also maintains QoS with respect to the parameters such as end-to-end delay, message progress, and message dissemination speed. Results obtained confirm the superiority of the proposal in comparison with the other existing schemes. Specifically, the proposed scheme achieves improvement of 4.16 and 20.5 % in message progress, 18.91 and 4.75 % in extra messages generated, 11.26 and 54.94 % in message dissemination speed, and 78.71 and 87.94 % in end-to-end delay in sparse network as compared to GyTAR and GPCR, respectively.