NACS: non-overlapping AP's caching scheme to reduce handoff in 802.11 wireless LAN
Usman Tariq, Yasir Malik, Man-Pyo Hong

TL;DR
This paper introduces NACS, a caching scheme for wireless LANs that reduces handoff signaling by propagating mobile node context only to non-overlapping access points, improving efficiency in public Wi-Fi networks.
Contribution
The paper proposes NACS, a novel scheme that selectively propagates mobile node context to non-overlapping APs using a non-overlapping graph, reducing signaling costs during handoff.
Findings
NACS reduces signaling cost in handoff scenarios.
Simulation shows improved efficiency over existing methods.
Non-overlapping graph effectively captures AP topology.
Abstract
With the escalation of the IEEE 802.11 based wireless networks, voice over IP and analogous applications are also used over wireless networks. Recently, the wireless LAN systems are spaciously deployed for public Internet services. In public wireless LAN systems, reliable user authentication and mobility support are indispensable issues. When a mobile device budges out the range of one access point (AP) and endeavor to connect to new AP, it performs handoff. Contemporarily, PNC and SNC were proposed to propagate the MN context to the entire neighboring AP's on the wireless network with the help of neighbor graph. In this paper, we proposed a non-overlapping AP's caching scheme (NACS), which propagates the mobile node context to those AP's which do not overlap with the current AP. To capture the topology of non-overlapping AP's in the wireless network, non-overlapping graph (NOG) is…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
