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

RMRPTS: a reliable multi-level routing protocol with tabu search in VANET

Author

Listed:
  • Elham Moridi

    (Dezful Branch, Islamic Azad University)

  • Hamid Barati

    (Dezful Branch, Islamic Azad University)

Abstract

Vehicular ad hoc network (VANET), a subclass of mobile ad hoc networks (MANETs), is a promising approach for the intelligent transportation system (ITS). One of the main challenges in VANETs is establishment of vehicular communication and stable routing. Another problem of VANETs is their tendency of being trapped in a local optimum. In this paper, a reliable multi-level routing protocol based on clustering, RMRPTS has been introduced in VANETs. Even if this topology constantly changes, clustering based multi-level routing will create the possibility of self-organization and route maintaining; moreover, it will solve the problem of developing a trap in the local optimum using tabu search. At the first level, the proposed protocol is an extension of AODV routing protocol that has been improved using fuzzy logic in order to create reliable routing between cluster members. Tabu search has been used at a higher level for routing between cluster heads and destination. Tabu search is a meta-heuristic improved learning method used for solving hybrid optimization problems, and it uses cost function to select a solution among a set of possible solutions. The effective parameters used in the proposed method to select the best path include nodes distance, the velocity of nodes, node’s angle, link stability, and link reliability. The proposed protocol was simulated using an NS-2 simulator, and the results of its performance showed increased average packet delivery rate and decreased average end to end delays, number of packet losses compared with earlier protocols.

Suggested Citation

  • Elham Moridi & Hamid Barati, 2017. "RMRPTS: a reliable multi-level routing protocol with tabu search in VANET," Telecommunication Systems: Modelling, Analysis, Design and Management, Springer, vol. 65(1), pages 127-137, May.
    • Handle: RePEc:spr:telsys:v:65:y:2017:i:1:d:10.1007_s11235-016-0219-6
    DOI: 10.1007/s11235-016-0219-6
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s11235-016-0219-6
    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-0219-6?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. Laguna, Manuel & Kelly, James P. & Gonzalez-Velarde, JoseLuis & Glover, Fred, 1995. "Tabu search for the multilevel generalized assignment problem," European Journal of Operational Research, Elsevier, vol. 82(1), pages 176-189, April.
    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.
    2. Mohammad Vafaei & Ahmad Khademzadeh & Mohammad Ali Pourmina, 2020. "QoS-aware multi-path video streaming for urban VANETs using ACO algorithm," Telecommunication Systems: Modelling, Analysis, Design and Management, Springer, vol. 75(1), pages 79-96, September.

    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. Mutsunori Yagiura & Toshihide Ibaraki & Fred Glover, 2004. "An Ejection Chain Approach for the Generalized Assignment Problem," INFORMS Journal on Computing, INFORMS, vol. 16(2), pages 133-151, May.
    2. Mattfeld, D. C. & Kopfer, H., 2003. "Terminal operations management in vehicle transshipment," Transportation Research Part A: Policy and Practice, Elsevier, vol. 37(5), pages 435-452, June.
    3. Samir A. Abass, 2012. "0-1 integer interval number programming approach for the multilevel generalized assignment problem," E3 Journal of Business Management and Economics., E3 Journals, vol. 3(9), pages 326-329.
    4. Malichan Thongkham & Sasitorn Kaewman, 2018. "Methodology to Solve the Combination of the Generalized Assignment Problem and the Vehicle Routing Problem: A Case Study in Drug and Medical Instrument Sales and Service," Administrative Sciences, MDPI, vol. 9(1), pages 1-21, December.
    5. Pentico, David W., 2007. "Assignment problems: A golden anniversary survey," European Journal of Operational Research, Elsevier, vol. 176(2), pages 774-793, January.
    6. Zäpfel, Günther & Bögl, Michael, 2012. "Two heuristic solution concepts for the vehicle selection problem in line haul transports," European Journal of Operational Research, Elsevier, vol. 217(2), pages 448-458.
    7. Helena Ramalhinho-Lourenço & Daniel Serra, 1998. "Adaptive approach heuristics for the generalized assignment problem," Economics Working Papers 288, Department of Economics and Business, Universitat Pompeu Fabra.
    8. Sexton, Randall S. & Alidaee, Bahram & Dorsey, Robert E. & Johnson, John D., 1998. "Global optimization for artificial neural networks: A tabu search application," European Journal of Operational Research, Elsevier, vol. 106(2-3), pages 570-584, April.
    9. Diaz, Juan A. & Fernandez, Elena, 2001. "A Tabu search heuristic for the generalized assignment problem," European Journal of Operational Research, Elsevier, vol. 132(1), pages 22-38, July.
    10. Amini, Mohammad M. & Racer, Michael & Ghandforoush, Parviz, 1998. "Heuristic sensitivity analysis in a combinatoric environment: An exposition and case study," European Journal of Operational Research, Elsevier, vol. 108(3), pages 604-617, August.
    11. Mar-Ortiz, Julio & Castillo-García, Norberto & Gracia, María D., 2020. "A decision support system for a capacity management problem at a container terminal," International Journal of Production Economics, Elsevier, vol. 222(C).
    12. Woodcock, Andrew J. & Wilson, John M., 2010. "A hybrid tabu search/branch & bound approach to solving the generalized assignment problem," European Journal of Operational Research, Elsevier, vol. 207(2), pages 566-578, December.
    13. Gelareh, Shahin & Glover, Fred & Guemri, Oualid & Hanafi, Saïd & Nduwayo, Placide & Todosijević, Raca, 2020. "A comparative study of formulations for a cross-dock door assignment problem," Omega, Elsevier, vol. 91(C).
    14. Tzur, Michal & Drezner, Ehud, 2011. "A lookahead partitioning heuristic for a new assignment and scheduling problem in a distribution system," European Journal of Operational Research, Elsevier, vol. 215(2), pages 325-336, December.
    15. G. Hernández-Díaz, Alfredo & Guerrero Casas, Flor M. & Caballero Fernández, Rafael & Molina Luque, Julián, 2006. "Algoritmo Tabú para un problema de distribución de espacios = Tabu Search Algorithm for a Room Allocation Problem," Revista de Métodos Cuantitativos para la Economía y la Empresa = Journal of Quantitative Methods for Economics and Business Administration, Universidad Pablo de Olavide, Department of Quantitative Methods for Economics and Business Administration, vol. 1(1), pages 25-37, June.
    16. Robert M. Nauss, 2003. "Solving the Generalized Assignment Problem: An Optimizing and Heuristic Approach," INFORMS Journal on Computing, INFORMS, vol. 15(3), pages 249-266, August.
    17. Freville, Arnaud, 2004. "The multidimensional 0-1 knapsack problem: An overview," European Journal of Operational Research, Elsevier, vol. 155(1), pages 1-21, May.
    18. Talla Nobibon, Fabrice & Leus, Roel & Spieksma, Frits C.R., 2011. "Optimization models for targeted offers in direct marketing: Exact and heuristic algorithms," European Journal of Operational Research, Elsevier, vol. 210(3), pages 670-683, May.
    19. Vié, Marie-Sklaerder & Zufferey, Nicolas & Cordeau, Jean-François, 2019. "Solving the Wire-Harness Design Problem at a European car manufacturer," European Journal of Operational Research, Elsevier, vol. 272(2), pages 712-724.
    20. Hongsheng Zhong & Randolph W. Hall & Maged Dessouky, 2007. "Territory Planning and Vehicle Dispatching with Driver Learning," Transportation Science, INFORMS, vol. 41(1), pages 74-89, February.

    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:65:y:2017:i:1:d:10.1007_s11235-016-0219-6. 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.