The security approach mainly involves understanding the certain misbehavior of nodes e.g. feasibility of nodes to cooperate in network, feasibility of attack by malicious node in the cluster etc. The framework also involves detection of malicious nodes by the destination node as well as isolation of the malicious node along with capability of the regular node to update the neighborhood clusters about the attack information. An approach of game theoretic is used for this purpose, where the simulation results show a satisfactory result by estimating the probability of cooperation as well as attack.

Lately, the concept of VANETs (Vehicular Ad hoc Networks) has gotten a huge attention as more wireless communication technologies becoming available. Such network is expected to be one of the most valuable technology for improving efficiency and safety of the future transportation. Vehicular networks are characterized by high mobility nodes which pose many communication challenging problems. In vehicular networks, routing Collision Avoidance Messages (CAMs) among vehicles is a key communication problem. Failure in routing CAMs to their intended destination within the time constraint can render these messages useless. Many routing protocols have been adapted for VANETs, such as DSDV (Destination Sequenced Distance Vector), AODV (Ad-hoc On demand Distance Vector), and DSR (Dynamic Source Routing).This work compares the performance of those routing protocols at different driving environments and scenarios created by using the mobility generator (VanetMobiSim) and network simulator (NS2). The obtained results at different vehicular densities, speeds, road obstacles, lanes, traffic lights, and transmission ranges showed that on average AODV protocol outperforms DSR and DSDV protocols in packet delivery ratio and end-toend delay. However, at certain circumstances (e.g., at shorter transmission ranges) DSR tends to have better performance than AODV and DSDV protocols.