Friendly Group Architecture for Securely Promoting Selfish Node Cooperation in Wireless Ad-hoc Network

Wireless Ad-hoc Network is characterized by a decentralized communication scheme with self-configuring nodes which has witnessed a wide range of practical wireless applications. However, this characteristic also results in various security threats in vulnerable wireless environment irrespective of presence of various routing protocols. Review of existing literature shows that there is very less emphasis towards securing Dynamic Source Routing (DSR) while majority of solutions uses encryption- based operation. Therefore, this manuscript introduces a novel non-encryption-based scheme called as Friendly Group Architecture which intends to identify the presence of selfish node followed by presenting a method to promote the secure cooperation of it. The complete modelling is analytically designed using probability-based computation and dynamic thresholding. The simulation outcome carried out in MATLAB exhibits that it outperforms existing system with respect to energy, overhead, and security.