ELLIPTICAL PRIORITY SCHEDULING IN WIRELESS LOCAL AREA NETWORKS FOR CONGESTION AVOIDANCE

In wireless local area networks (WLANs) packet classification is done to report matched packet to its destination node. Although several schemes are proposed, they suffer from execution corruption. In this paper initially a choleric layer is being constructed in WLANs to increase the bandwidth and performance of WLANs .We use Joint-Interface to combine all the layers. By using cross layer co-ordination among all layer is increased while comparing to the traditional layer architecture. When the packet arrives they are moved to routing table where all possible path to the nearest neighbor are found out and moved to, forwarding table which contains only the route chosen by the routing algorithm. Routing table is constructed using Ad-hoc on demand distance vector protocol. While forwarding packet, it is being double encrypted and decrypted. In order to avoid congestion occurrence near destination elliptical priority scheduling is used where time slot is given for each packet to be