Abstract

This chapter gives an overview of research works on secure routing protocol and also describes a Novel Secure Routing Protocol RSRP proposed by the authors. The routes, which are free from any malicious node and which belong to the set of disjoint routes between a source destination pair, are considered as probable routes. Shamir’s secret sharing principle is applied on those probable routes to obtain secure routes. Finally, the most trustworthy and stable route is selected among those secure routes using some criteria of the nodes present in a route (e.g., battery power, mobility, and trust value). In addition, complexity of key generation is reduced to a large extent by using RSA-CRT instead of RSA. In turn, the routing becomes less expensive and highly secure and robust. Performance of this routing protocol is then compared with non-secure routing protocols (AODV and DSR), secure routing scheme using secret sharing, security routing protocol using ZRP and SEAD, depending on basic characteristics of these protocols. All such comparisons show that RSRP shows better performance in terms of computational cost, end-to-end delay, and packet dropping in presence of malicious nodes in the MANET.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call