Shortest and secure routing protocol for multi-hop cellular networks (SSRP-MCN)

Nowadays, many advanced are developed and become available for users. So, the demand for a higher data rate wireless access significantly increases. For that reason, new cellular wireless networks have been introduced such as Worldwide Interoperability for Microwave Access (WiMAX), Long Term Evolution (LTE) and LTE-advanced. However, the centralized topology of these technologies requires that the users have a direct connection to the Base Station (BS). Such topology suffers from congestion problem when a large number of users are communicating in the same time. To overcome the congestion problem, the Device-to-device and the mobile relays communications have been proposed to overcome the limitations of the conventional cellular architecture. These technologies can improve the cellular network capacity and reduce the infrastructure costs. However, security in multi-hop cellular networks (MCNs) is a great challenge especially when other mobile nodes participate in the routing process. Existing works on this topic focus on ensuring security for routing information. However, most studies do not secure the data transmission after the route selection and do not simultaneously ensure all the security requirements. In this paper, we propose a new secure and reliable routing protocol for MCNs. The main objective of this protocol is to select only the trustworthy intermediate nodes to participate in the route construction. These trustworthy nodes perform the route discovery process in a secure way and so discover a secure path that does not contain any attacker as an intermediate node. The intermediate nodes of the selected route participate in establishing a group key. This key is used to secure the data transmission phase after route selection. To achieve anonymity, the BS assigns to each mobile that participates in the selected route a temporary identity. We evaluate our proposed protocol in terms of security using AVISPA tool, and we conduct some simulations using Network Simulator (NS-2). The simulation results show that it is reliable and provides acceptable performance in terms of throughput, end-to-end delay and normalized routing load. Copyright © 2016 John Wiley & Sons, Ltd.

[1]  Ren-Junn Hwang,et al.  Anonymous Routing Protocol Based on Weil Pairing for Wireless Mesh Networks , 2014, Comput. J..

[2]  Ying-Dar Lin,et al.  Multihop cellular: a new architecture for wireless communications , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[3]  M. Laddomada.  IEEE Transactions on Wireless Communications - Table of Contents , 2006 .

[4]  Xiaoyan Hong,et al.  Performance evaluation of anonymous routing protocols in MANETs , 2006, IEEE Wireless Communications and Networking Conference, 2006. WCNC 2006..

[5]  Seong-Moo Yoo,et al.  Black hole attack in mobile Ad Hoc networks , 2004, ACM-SE 42.

[6]  Reza Hoshyar,et al.  Integrated Radio Resource Allocation for Multihop Cellular Networks With Fixed Relay Stations , 2006, IEEE Journal on Selected Areas in Communications.

[7]  Manel Guerrero Zapata.  Secure Ad hoc On-Demand Distance Vector (SAODV) Routing , 2006 .

[8]  V. Chandrasekar,et al.  Optimal Transmission in Multihop Cellular Networks by Detecting Irrational Nodes , 2013 .

[9]  Chunming Qiao,et al.  Integrated cellular and ad hoc relaying systems: iCAR , 2001, IEEE J. Sel. Areas Commun..

[10]  Charles E. Perkins,et al.  Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers , 1994, SIGCOMM.

[11]  Mathieu Turuani,et al.  The CL-Atse Protocol Analyser , 2006, RTA.

[12]  Gregory A. Hansen,et al.  The Optimized Link State Routing Protocol , 2003 .

[13]  T. Andrew Yang,et al.  Scenario Based Performance Evaluation of Secure Routing in MANETs , 2005, ICWN.

[14]  Mohamed Elsalih.  Anonymous and Authenticated Routing in Multi-hop Cellular Networks , 2009 .

[15]  Sebastian Mödersheim,et al.  An On-the-Fly Model-Checker for Security Protocol Analysis , 2003, ESORICS.

[16]  Philippe Jacquet,et al.  Optimized Link State Routing Protocol (OLSR) , 2003, RFC.

[17]  Yih-Chun Hu,et al.  Secure Unified Cellular Ad Hoc Network Routing , 2009, GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference.

[18]  Yih-Chun Hu,et al.  SEAD: secure efficient distance vector routing for mobile wireless ad hoc networks , 2003, Ad Hoc Networks.

[19]  Pascal Lafourcade,et al.  Comparison of Cryptographic Verification Tools Dealing with Algebraic Properties , 2009, Formal Aspects in Security and Trust.

[20]  Adriano Valenzano,et al.  Tools for cryptographic protocols analysis: A technical and experimental comparison , 2009, Comput. Stand. Interfaces.

[21]  Pallavi Kaliyar,et al.  A secure routing protocol for MANETs against byzantine attacks , 2013 .

[22]  Alessandro Armando,et al.  An Optimized Intruder Model for SAT-based Model-Checking of Security Protocols , 2005, ARSPA@IJCAR.

[23]  Zygmunt J. Haas,et al.  Hybrid routing in ad hoc networks with a dynamic virtual backbone , 2006, IEEE Transactions on Wireless Communications.

[24]  J. Broch,et al.  Dynamic source routing in ad hoc wireless networks , 1998 .

[25]  Danny Dolev,et al.  On the security of public key protocols , 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).

[26]  Javier Gozálvez,et al.  Contextual optimization of location-based routing protocols for multi-hop cellular networks using mobile relays , 2016, Telecommun. Syst..

[27]  C. Palanisamy,et al.  Overview of AODV , DSDV and RWMM 3 . 1 Ad Hoc on-demand distance vector routing ( AODV ) , 2018 .

[28]  Hongsheng Xi,et al.  Secure Opportunistic Routing for Wireless Multi-Hop Networks Using LPG and Digital Signature , 2010 .

[29]  Charles E. Perkins,et al.  Ad-hoc on-demand distance vector routing , 1999, Proceedings WMCSA'99. Second IEEE Workshop on Mobile Computing Systems and Applications.