Selfish aware queue scheduler for packet scheduling in MANET

This paper mainly deals with the analysis of selfish aware queue scheduler scheme in Ad-Hoc Network which mainly requires the Co-ordination of the buffer manager and the queues that forms the part of all nodes in the networks. Selfish Scheduler Queue Methodology (SSQM) has been proposed as one of the optimal solution in Ad-Hoc networks where the presence of the malicious nodes like selfish nodes as the forwarding node may degrade the network performance and in turn reduces the network life time of the nodes. In order to avoid the degradation SSQM is implemented in an Ad-hoc environment, which provides a reactive solution to all these malicious nodes in the network which may fail due the availability of the energy, because the limited battery power is the main drawback of all the mobile nodes. The proposed work presents a Selfish scheduler Queue Methodology named SSQM that can effectively and efficiently provide a reactive solution that could manage the queues through which the packets are forwarded from the source to the destination through the selfish nodes. The mechanism of SSQM has been simulated through ns-2. Based on the numerical calculations and graphical representations it reveals the fact that the proposed work depicts that the SSQM increases packet delivery ratio but decreases, control overhead and the total overhead. Since, the node overhead for each node computation is minimum, the solution is mainly suited for implementing it in the MANETs environment. The performance can be analyzed by varying the number of mobile nodes in the network. The base protocol used for the implementation this strategy is AODV, which is a Reactive protocol.