2011
DOI: 10.5120/3059-4177
|View full text |Cite
|
Sign up to set email alerts
|

Fast Handoff Mechanism in Wireless Local Area Networks 'WLAN' using Neighbor Graph Algorithm

Abstract: Rapid progress in the research and development in wireless technology has created different types of high performance and highly optimized wireless networks. They provide various types services like VoIP, multimedia, video conference, chatting etc. Unreliable and inefficient handoff procedures reduce the quality and reliability of the networks. So to maintain a certain level of Quality of Service (QoS) a seamless handoff should be ensured. Throughout the last few years there has been plenty of research aimed t… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
4
0

Year Published

2012
2012
2016
2016

Publication Types

Select...
3
3
1

Relationship

0
7

Authors

Journals

citations
Cited by 9 publications
(4 citation statements)
references
References 8 publications
0
4
0
Order By: Relevance
“…From the neighbor graph server, Station gets better scanned AP's data if there is necessity of handoff and handoff delay can be lessened. The overall execution of NG is as follow: The main advantages of this scheme are to sort out and manage the wireless systems and perform load balancing [8].…”
Section: Handoff Using Neighbor Graph (Ng)mentioning
confidence: 99%
“…From the neighbor graph server, Station gets better scanned AP's data if there is necessity of handoff and handoff delay can be lessened. The overall execution of NG is as follow: The main advantages of this scheme are to sort out and manage the wireless systems and perform load balancing [8].…”
Section: Handoff Using Neighbor Graph (Ng)mentioning
confidence: 99%
“…Multicast technique can improve the efficiency of the deficient wireless link when sending the same multimedia data such as live-video, news and sports broadcasting [3,6]. A number of researches have progressed to solve the problems such as the overlay tree being cut off easily because of MNs' movement and excessive consumption of deficient wireless link bandwidth is due to the multiple copies of the same multimedia data [7,8,9,10]. But such researches are dealt with only one problem.…”
Section: Introductionmentioning
confidence: 99%
“…In this case, the APs generate their own AP_# only within AP_# fields. The IP address and AP_# assigned for the first time remain unchanged even though the MN travels among APs except the case that MN receives a MGA packet from the BMSA [5,6]. Thus, the two AP_#s of three AP_# fields are changed according to the MN's movement among APs.…”
Section: The Structure Of Ip Headermentioning
confidence: 99%
“…For solving these problems, this paper adopts the multicast technique to reduce the number of channels of a server and the service delay. It also adopts handover mechanism using AP identification numbers (AP_#s) as the Internet Protocol (IP) header to prevent cutoff service and reconnection caused by the MNs' movement [6,7]. This paper uses the buffered multicasting/switching agent (BMSA) to perform multicast in WLAN.…”
Section: Introductionmentioning
confidence: 99%