Secure routing in MANETs using three reliable matrices

Reliable LET Matrices has proposed to make secure routing in mobile ad hoc networks. Knapsack algorithm technique is used to find MaxLET, MinLET, and AvgLET. The node which sending packets first will calculate maximum LET (MaxLET), minimum LET (MinLET) and average LET (AvgLET). In the process of transmitting data, the sending node can be use either MaxLET or MinLET for sending the packets and each packet may travel the different routes for sending the packets at the same time. The number of packets send to the receiver node will depend on the available bandwidth. This procedure is repeated until all the packets reach the destination node. To verify whether the corrective data has received or not a Message Authentication Code (MAC) applied for authentication using LET. It is applied so that the receiver can verify that the LET has not been altered on the way.

[1]  Shengming Jiang,et al.  A prediction-based link availability estimation for routing metrics in MANETs , 2005, IEEE/ACM Transactions on Networking.

[2]  Youyuan Liu,et al.  Multipath Routing for Mobile Ad Hoc Network , 2009 .

[3]  Shariq Mahmood Khan,et al.  A Novel Approach for Reliable Route Discovery in Mobile Ad-Hoc Network , 2015, Wirel. Pers. Commun..

[4]  Natarajan Meghanathan,et al.  Survey and Taxonomy of Unicast Routing Protocols for Mobile Ad Hoc Networks , 2009 .

[5]  Hadi Noureddine,et al.  A new link lifetime estimation method for greedy and contention-based routing in mobile ad hoc networks , 2014, Telecommun. Syst..

[6]  Natarajan Meghanathan,et al.  Predicted Link Expiration Time Based Connected Dominating Sets for Mobile Ad hoc Networks , 2010 .

[7]  Yih-Chun Hu,et al.  Ariadne: A Secure On-Demand Routing Protocol for Ad Hoc Networks , 2005, Wirel. Networks.

[8]  Yih-Chun Hu,et al.  SEAD: secure efficient distance vector routing for mobile wireless ad hoc networks , 2002, Proceedings Fourth IEEE Workshop on Mobile Computing Systems and Applications.

[9]  Ruay-Shiung Chang,et al.  Long-lived path routing with received signal strength for ad hoc networks , 2006, 2006 1st International Symposium on Wireless Pervasive Computing.

[10]  Yu-Chee Tseng,et al.  On Route Lifetime in Multihop Mobile Ad Hoc Networks , 2003, IEEE Trans. Mob. Comput..

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

[12]  Sung-Ju Lee,et al.  Mobility prediction and routing in ad hoc wireless networks , 2001, Int. J. Netw. Manag..

[13]  Neng-Chung Wang,et al.  A reliable on-demand routing protocol for mobile ad hoc networks with mobility prediction , 2005, Comput. Commun..

[14]  Taieb Znati,et al.  A path availability model for wireless ad-hoc networks , 1999, WCNC. 1999 IEEE Wireless Communications and Networking Conference (Cat. No.99TH8466).

[15]  Nachiappan Alamelu,et al.  Adaptive QoS Multicast Routing with Mobility Prediction in MANETs , 2010 .

[16]  Elizabeth M. Belding-Royer,et al.  A secure routing protocol for ad hoc networks , 2002, 10th IEEE International Conference on Network Protocols, 2002. Proceedings..