No abstract

In this paper the idea is to rationale a new active queue management technique (MGF-RED) based on Random Early Detection (RED), a well known active queue management technique for congestion avoidance. The conventional RED uses the concept of minimum threshold, maximum threshold and average queue length. If the average queue length increases by minimum threshold then the algorithm start dropping the packets with some probability using linear function of average queue size. If the average queue size is greater than the maximum threshold then packets are dropped with 1 probability. The proposed algorithm will use Modified Gaussian function for calculating the likelihood of packet drop as the average queue length increases the minimum threshold. Simulation has been performed using NS-2.34. The simulation results show that the proposed algorithm will present better network performance in throughput, packet delivery fraction and number of dropped packets. General TermsMANET, RED, Gaussian Function.

No abstract

MANETs is a collection of multi-hop wireless mobile nodes that communicate with each other without centralized control or established infrastructure. It is the network with dynamically and frequently changing topologies as each node (hop) in it is moving. Due to a number of constraints in self-organizing and self-operating networks, routing of it is a challenging problem. To find the optimum routes with minimum control overhead and network resources, there are a lot of routing-protocols namely DSDV, DSR, AODV, TORA, etc. This paper gives a review of existing routing protocols by giving their characteristics, functionality, benefits, limitations and the comparison between them.

A wireless Adhoc network is a collection of mobile nodes with no pre-established infrastructure, forming a temporary network. In the absence of a fixed infrastructure, nodes have to cooperate in order to provide the necessary network functionality. One of the principal routing protocols used in Ad hoc networks is AODV (Ad hoc On-Demand Distance Vector) protocol. The security of the AODV protocol is compromised by a particular type of attack called 'Black Hole' attack [1]. In this attack a malicious node advertises itself as having the shortest path to the node whose packets it wants to intercept. It is proposed to wait and check the replies from all the neighboring nodes to find the Black hole nodes. In this research paper, we have detect the black hole node or unauthorized node on the based of broadcast ID. Firstly, to determine and propose routing algorithm for detection and correction of black hole in AODV.Secondly to implement this along on NS2 and analyze the result. Thirdly to obtain the comparison of the following parameters like End to End delay, Routing overheads and Packet delivery with the already proposed protocols. By doing this our proposed algorithm shows better performance than the conventional AODV.