IDEAS home Printed from https://ideas.repec.org/a/spr/telsys/v64y2017i3d10.1007_s11235-016-0184-0.html
   My bibliography  Save this article

ReIDD: reliability-aware intelligent data dissemination protocol for broadcast storm problem in vehicular ad hoc networks

Author

Listed:
  • Amit Dua

    (Thapar University)

  • Neeraj Kumar

    (Thapar University)

  • Seema Bawa

    (Thapar University)

Abstract

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.

Suggested Citation

  • Amit Dua & Neeraj Kumar & Seema Bawa, 2017. "ReIDD: reliability-aware intelligent data dissemination protocol for broadcast storm problem in vehicular ad hoc networks," Telecommunication Systems: Modelling, Analysis, Design and Management, Springer, vol. 64(3), pages 439-458, March.
    • Handle: RePEc:spr:telsys:v:64:y:2017:i:3:d:10.1007_s11235-016-0184-0
    DOI: 10.1007/s11235-016-0184-0
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s11235-016-0184-0
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s11235-016-0184-0?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Cook, Jason L. & Ramirez-Marquez, Jose Emmanuel, 2007. "Two-terminal reliability analyses for a mobile ad hoc wireless network," Reliability Engineering and System Safety, Elsevier, vol. 92(6), pages 821-829.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Muhammad Akram Mujahid & Kamalrulnizam Abu Bakar & Tasneem S. J. Darwish & Fatima Tul Zuhra, 2021. "Cluster-based location service schemes in VANETs: current state, challenges and future directions," Telecommunication Systems: Modelling, Analysis, Design and Management, Springer, vol. 76(3), pages 471-489, March.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Rocco S, Claudio M. & Ramirez-Marquez, José Emmanuel, 2009. "Deterministic network interdiction optimization via an evolutionary approach," Reliability Engineering and System Safety, Elsevier, vol. 94(2), pages 568-576.
    2. Cook, Jason L. & Ramirez-Marquez, Jose Emmanuel, 2009. "Optimal design of cluster-based ad-hoc networks using probabilistic solution discovery," Reliability Engineering and System Safety, Elsevier, vol. 94(2), pages 218-228.
    3. Padmavathy, N. & Chaturvedi, Sanjay K., 2013. "Evaluation of mobile ad hoc network reliability using propagation-based link reliability model," Reliability Engineering and System Safety, Elsevier, vol. 115(C), pages 1-9.
    4. J. L. Cook & J. E. Ramirez-Marquez, 2007. "Reliability of capacitated mobile ad hoc networks," Journal of Risk and Reliability, , vol. 221(4), pages 307-318, December.
    5. Xu, Bei & Liu, Tao & Bai, Guanghan & Tao, Junyong & Zhang, Yun-an & Fang, Yining, 2022. "A multistate network approach for reliability evaluation of unmanned swarms by considering information exchange capacity," Reliability Engineering and System Safety, Elsevier, vol. 219(C).
    6. Chakraborty, Suparna & Goyal, N.K. & Mahapatra, S. & Soh, Sieteng, 2020. "A Monte-Carlo Markov chain approach for coverage-area reliability of mobile wireless sensor networks with multistate nodes," Reliability Engineering and System Safety, Elsevier, vol. 193(C).
    7. Cook, Jason L. & Ramirez-Marquez, Jose Emmanuel, 2008. "Reliability analysis of cluster-based ad-hoc networks," Reliability Engineering and System Safety, Elsevier, vol. 93(10), pages 1512-1522.
    8. Chen, Binchao & Phillips, Aaron & Matis, Timothy I., 2012. "Two-terminal reliability of a mobile ad hoc network under the asymptotic spatial distribution of the random waypoint model," Reliability Engineering and System Safety, Elsevier, vol. 106(C), pages 72-79.
    9. Ramirez-Marquez, José Emmanuel & Rocco, Claudio M., 2008. "All-terminal network reliability optimization via probabilistic solution discovery," Reliability Engineering and System Safety, Elsevier, vol. 93(11), pages 1689-1697.
    10. Jane, Chin-Chia & Shen, Wu-Hsien & Laih, Yih-Wenn, 2009. "Practical sequential bounds for approximating two-terminal reliability," European Journal of Operational Research, Elsevier, vol. 195(2), pages 427-441, June.
    11. Gaurav Khanna & S. K. Chaturvedi & Sieteng Soh, 2019. "Reliability evaluation of mobile ad hoc networks by considering link expiration time and border time," International Journal of System Assurance Engineering and Management, Springer;The Society for Reliability, Engineering Quality and Operations Management (SREQOM),India, and Division of Operation and Maintenance, Lulea University of Technology, Sweden, vol. 10(3), pages 399-415, June.
    12. Forghani-elahabad, Majid & Mahdavi-Amiri, Nezam, 2015. "An efficient algorithm for the multi-state two separate minimal paths reliability problem with budget constraint," Reliability Engineering and System Safety, Elsevier, vol. 142(C), pages 472-481.
    13. Stern, R.E. & Song, J. & Work, D.B., 2017. "Accelerated Monte Carlo system reliability analysis through machine-learning-based surrogate models of network connectivity," Reliability Engineering and System Safety, Elsevier, vol. 164(C), pages 1-9.
    14. Radislav Vaisman & Ofer Strichman & Ilya Gertsbakh, 2015. "Model Counting of Monotone Conjunctive Normal Form Formulas with Spectra," INFORMS Journal on Computing, INFORMS, vol. 27(2), pages 406-415, May.
    15. Xiang, Shihu & Yang, Jun, 2018. "Performance reliability evaluation for mobile ad hoc networks," Reliability Engineering and System Safety, Elsevier, vol. 169(C), pages 32-39.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:telsys:v:64:y:2017:i:3:d:10.1007_s11235-016-0184-0. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.