On-demand multicast routing protocol
This paper presents a novel multicast routing protocol for mobile ad hoc wireless networks. The protocol, termed ODMRP (on-demand multicast routing protocol), is a mesh-based, rather than a conventional tree-based multicast scheme and uses a forwarding group concept (only a subset of nodes forwards the multicast packets via scoped flooding). It applies on-demand procedures to dynamically build routes and maintain multicast group membership. ODMRP is well suited for ad hoc wireless networks with mobile hosts where bandwidth is limited, topology changes frequently, and power is constrained. We evaluate ODMRP’s scalability and performance via simulation.
 AODV routing protocol implementation design
To date, the majority of ad hoc routing protocol research has been done using simulation only. One of the most motivating reasons to use simulation is the difficulty of creating a real implementation. In a simulator, the code is contained within a single logical component, which is clearly defined and accessible. On the other hand, creating an implementation requires use of a system with many components, including many that have little or no documentation. The implementation developer must understand not only the routing protocol, but all the system components and their complex interactions. Further, since ad hoc routing protocols are significantly different from traditional routing protocols, a new set of features must be introduced to support the routing protocol. In this paper we describe the event triggers required for AODV operation, the design possibilities and the decisions for our ad hoc on-demand distance vector (AODV) routing protocol implementation, AODV-UCSB. This paper is meant to aid researchers in developing their own on-demand ad hoc routing protocols and assist users in determining the implementation design that best fits their needs.
 A secure routing protocol for ad hoc networks
Most recent ad hoc network research has focused on providing routing services without considering security. We detail security threats against ad hoc routing protocols, specifically examining AODV and DSR. In light of these threats, we identify three different environments with distinct security requirements. We propose a solution to one, the managed-open scenario where no network infrastructure is pre-deployed, but a small amount of prior security coordination is expected. Our protocol, authenticated routing for ad hoc networks (ARAN), is based on certificates and successfully defeats all identified attacks.
 WSN: Lifetime Maximization of Rumor Routing Protocol with Optimization Scheme and Bandwidth Evaluation
Rumor routing protocol in wireless sensor networks (WSNs), is based on query system. It selects the next hop randomly, but the resultant path from source to destination is not optimal. Most of the work reported on energy efficient and bandwidth estimation in the literature are based on hierarchical protocol. However in this work we have considered data centric protocol and used optimization scheme. We have used ant colony optimization (ACO) in rumor routing protocol. This approach optimizes the route search and helps in establishing a complete route by minimizing the probability of the loop route generated by routing scheme. Energy of the nodes has been calculated and compared for normal routing process with optimizing route searching using ACO. Results are compared with non-optimized route of rumor routing protocol. Further the bandwidth of non-optimal route has been calculated and compared with optimize route.
 A Comparative Analysis of Jellyfish Attacks and Black Hole Attack with Selfish Behavior Attack under AODV Routing Protocol
The applications of mobile adhoc network (MANET) are increasing day-by-day due to the flexibility they provide to seamless communication. However MANETS are vulnerable to number of attacks because of properties like non-existing infrastructure, dynamic topology, multihop network etc. Lot of previous works have focused on the impact of various attack on routing protocol. Some attacks like jellyfish attack even follow all the rules and regulations of routing protocol then also they may cause damage to the communication. On the other hand, some attacks like blackhole attack have malicious intentions and causes destruction by dropping the sent packets. There also exist one other category of attack called selfish node attack that do not causes any destruction by modifying the field of the packet rather they do not cooperate in forwarding the packet. In a typical MANET scenario which may be in use for few minutes or even hours, the attacking node will have time to intervene in to the routing process, and able to make some destruction. But, if the network under consideration will be in use for limited short time for a particular military like quick rescue scenario, then how a malicious node will intervene in to the routing process and make considerable damage to the network within that short duration – this is the research question addressed in this work.
 Lee, S.J., Gerla, M. and Chiang, C.C., 1999, September. On-demand multicast routing protocol. In WCNC. 1999 IEEE Wireless Communications and Networking Conference (Cat. No. 99TH8466) (Vol. 3, pp. 1298-1302). IEEE.
 Chakeres, I.D. and Belding-Royer, E.M., 2004, March. AODV routing protocol implementation design. In 24th International Conference on Distributed Computing Systems Workshops, 2004. Proceedings. (pp. 698-703). IEEE.
 Sanzgiri, K., Dahill, B., Levine, B.N., Shields, C. and Belding-Royer, E.M., 2002, November. A secure routing protocol for ad hoc networks. In 10th IEEE International Conference on Network Protocols, 2002. Proceedings. (pp. 78-87). IEEE.
 Arya, R. and Sharma, S.C., 2015. WSN: Lifetime maximization of rumor routing protocol with optimization scheme and bandwidth evaluation. Journal of Advances in Mathematics and Computer Science, pp.266-279.
 Singla, B., Verma, A.K. and Raheja, L.R., 2017. A Comparative Analysis of Jellyfish Attacks and Black Hole Attack with Selfish Behavior Attack under AODV Routing Protocol. Journal of Advances in Mathematics and Computer Science, pp.1-18.