LAUSR

It is obvious that providing continuous service for a Mobile Node (MN) which is in frequent movement is a major challenge nowadays. Finding and fixing the best neighboring Access Point (AP) for Mobile Node which is in movement is a tedious task. In the existing system time period of Mobile Nodes waiting for all neighboring APs to respond is too long. AP which are busy may not be able to respond to the request. For this reason, novel idea to fix target access point during handoff in WLAN is proposed. A Neighboring Graph Model (NGM) is used which is built to store and retrieve the neighbors of the current AP. The lists of neighboring APs are provided by the NG and target AP is selected based on the low load. The simulation results showed that the proposed handoff considerably decreases the time to fix the target Access Point .