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.