Network-based control of stations in a wireless communication network

Information

  • Patent Grant
  • 9215745
  • Patent Number
    9,215,745
  • Date Filed
    Friday, February 22, 2008
    16 years ago
  • Date Issued
    Tuesday, December 15, 2015
    8 years ago
Abstract
Using the feature named “KEY_SEARCH_AD1” in the Atheros 11n chipset, an access point can determine whether to send an ACK packet in response to a message packet in response to whether the BSSID present in the sender address is present in the keycache. The AP can maintain a list of about 128 arbitrarily selected BSSID's, to each of which it will respond with an ACK packet if it receives a message from a mobile station with that BSSID. (1) the number of mobile stations that can be assigned to that AP is relatively greater. (2) the selection of those BSSID's is no longer constrained by having to match the AP's BSSID using a mask. With selection of those BSSID's being no longer so constrained, it is easier to assign BSSID's to mobile stations while allowing those mobile stations to roam among multiple AP's.
Description
RELATED APPLICATIONS

This application claims priority from the following documents.

    • U.S. patent application Ser. No. 11/298,864, filed Dec. 9, 2005 in the name of inventors Vaduvur BHARGHAVAN et al., titled “Seamless Mobility in Wireless Networks”.
    • U.S. patent application Ser. No. 11/715,287, filed Mar. 7, 2007 in the name of inventors Vaduvur BHARGHAVAN et al., titled “Seamless Mobility in Wireless Networks”.


Each of these documents is hereby incorporated by reference as if fully set forth herein. These documents are herein sometimes referred to as the “Incorporated Documents”.


BACKGROUND

Wireless communication systems include mobile stations (MS's), which communicate with access points (AP's), which collectively communicate using wireless and wired techniques. In a wireless communication system operating using an IEEE 802.11 protocol, or variant thereof, each access point controls wireless communication with those mobile stations in a localized communication region (also known as a “cell”). Mobile stations operating according to an IEEE 802.11 protocol, or variant thereof, attempt to determine in which cell they are operating, and attempt to communicate with the particular access point for that cell.


SUMMARY OF THE DESCRIPTION

Using the feature named “KEY_SEARCH_AD1” in the Atheros 11n chipset, an access point can determine whether to send an ACK packet in response to a message packet in response to whether the BSSID present in the receiver address (not the sender address) is present in the keycache. This has the effect that the access point can maintain a list of about 128 arbitrarily selected BSSID's, to each of which it will respond with an ACK packet if it receives a message from a mobile station addressed to that BSSID. (Effectively, each of the access point's BSSID's represents a method for mobile stations to access the AP; this has the effect that BSSID's could be considered either addresses for AP's or addresses for services offered by AP's.) This has two effects: (1) the number of mobile stations that can be assigned to that AP is relatively greater, and (2) the selection of those BSSID's is no longer constrained by having to match the access point's BSSID using a mask. With selection of those BSSID's being no longer so constrained, it is easier to assign BSSID's for use by mobile stations while allowing those mobile stations to roam among multiple access points.







DETAILED DESCRIPTION

Overview


In systems described in the Incorporated Documents, handoff and other functions of wireless communication systems are controlled by access points, themselves under direction of a control element, rather than by the mobile stations seeking out and communicating with access points. The Incorporated Documents describe at least two techniques, “virtual cells” and “personal access points”, and their advantages, including for example roaming among access points without the mobile station having to conduct handoff operations.


In systems using virtual cells, mobile stations are all associated with a common BSSID they might access, which is shared among substantially all of the access points. In such cases, the control element selects one or more access points (typically one at any particular time) to communicate with the mobile station; those one or more access points are the only access points which respond to message packets from the mobile station.


In systems using personal access points, mobile stations are each associated with a unique BSSID they might access, which is associated with the particular one or more access points the system associates with that particular mobile station. In such cases, the mobile station's unique BSSID access ability is moved from one to another access point as it is desired to re-assign the mobile station; the one or more access points maintaining that unique BSSID (typically one at any particular time) are the only access points which respond to message packets from the mobile station.


In one vendor's implementation of access points in the IEEE 802.11n protocol, including at least the Atheros model AR5416 and the Atheros model AR9160 (and of course any other devices having this or a similar capability, whether or not from the same vendor), access points include a feature named “KEY_SEARCH_AD1”, which when enabled provides that the access point, when responding with an acknowledgement (ACK) packet to a message from a mobile station, will match the receiver (i.e., not sender) address of the incoming packet against an entry in a locally maintained table of mobile station address (the “keycache”). For each entry in the keycache, a separate register controls whether the access point will provide ACK packets in response to an address match on that entry.


When the mobile station sends a message packet to the access point, the sender address for that packet is the MAC address associated with the mobile station, and the receiver address is the BSSID for the access point. This has the effect that, if the access point determines whether to send an ACK packet in response to a message packet, it must do so in response to whether its own BSSID is present in the receiver address. In contrast, when an access point sends a message to a mobile station, the sender address for that packet is the BSSID for which the mobile station has been assigned the capability of access, and the receiver address for that packet is the MAC address for the mobile station.


In many implementations of the IEEE 802.11n protocol, the access point can also mask some of the bits of its BSSID. This has the effect that the access point can respond to multiple BSSID's, but the number of possibilities is limited by the ability to maintain unique BSSID's that still match the access point's own BSSID after masking. Mobile stations can thus be assigned the ability to access BSSID's that match the access point's own BSSID after masking, but the number of such BSSID's would be relatively limited. In systems using personal access points, this has the effect of limiting the number of mobile stations that can be assigned to the access point, as well as constraining the BSSID's that can be accessible by mobile stations while allowing those mobile stations to roam among multiple access points.


When using the feature named “KEY_SEARCH_AD1”, the access point can determine whether to send an ACK packet in response to a message packet in response to whether the BSSID present in the receiver address is present in the keycache. This has the effect that the access point can maintain a list of about 128 arbitrarily selected BSSID's, to each of which it will respond with an ACK packet if it receives a message from a mobile station assigned to that BSSID. This has two effects: (1) the number of mobile stations that can be assigned to that access point is relatively greater, and (2) the selection of those BSSID's is no longer constrained by having to match the access point's BSSID using a mask. With selection of those BSSID's being no longer so constrained, it is easier to assign BSSID's for access by mobile stations while allowing those mobile stations to roam among multiple access points.


FIGURES AND TEXT


FIG. 1



FIG. 1 shows a block diagram of a system according to this application.


A wireless communication system 100 includes a control element 110, a set of access points 120, and a set of mobile stations 130.


Each access point 120 includes registers maintaining its own AP BSSID 121, a “KEY_SEARCH_AD1 enabled” bit 122, and a keycache 123. The keycache 123 includes approximately 128 keycache registers 124, each including a MAC address associated with a mobile station 130. Each mobile station 130 includes a register maintaining its own MAC address 131.


Mobile stations 130 send message packets 132 wirelessly, those message packets 132 each including a sender address 133 and a receiver address 134. Each access point 120 is disposed for receiving those message packets 132. In operation, when an access point 120 receives a message packet 132, it uses the KEY_SEARCH_AD1 feature to determine whether to respond with an ACK packet 125. This has the effect that the access point 120 compares the receiver address 134 of the message packet 132 with its keycache registers 124. The access point 120 responds with an ACK packet 125 if and only if that receiver address 134 matches one of those keycache registers 124; otherwise it does not respond with an ACK packet 125.


In operation, the access point 120 is directed by the control element 110 to insert a BSSID to be accessible by a selected mobile station 130 into its keycache 123 when the control element 110 assigns that particular mobile station 130 to that access point 120. Similarly, the access point 120 is directed by the control element 110 to delete a BSSID previously accessible by a selected mobile station 130 from its keycache 123 when the control element 110 de-assigns that particular mobile station 130 from that access point 120.



FIGS. 2 AND 3



FIG. 2 shows a block diagram of a software ACK system according to this application.



FIG. 3 shows a process flow diagram of a software ACK method according to this application.


One problem with the “KEY_SEARCH_AD1” feature is that current implementations by the Atheros model AR5416 and the Atheros model AR9160 access points 120 erroneously treat recovery from failed transmissions of message packets (sometimes known as “multiple retries”). More specifically, in proper operation, when a device, whether an access point 120 or otherwise, sends a unicast message packet, it should wait a designated duration of time for an ACK packet 125. If no ACK packet 125 arrives within that designated duration of time, the device resends the message packet, until a matching ACK packet 125 arrives or a maximum designated number of retries have been attempted. In many cases, the data-rate for transmission of the retried message packets is different, typically decreasing with each retry, with the effect that the chance of successful transmission is increased with each retry.


In current implementations by (at least) the Atheros model AR5416 and the Atheros model AR9160 access points 120, it is possible for software controlling the access point to designate a set of parameters for the access point 120 to use when attempting multiple retries. More specifically, that set of parameters might specify the maximum number of retries and the data-rate for each such retry. In such cases, when the access point 120 is ready to transmit a message packet, it should transmit the message packet and await an ACK packet 125 according to the designated set of parameters. If the access point 120 does not receive an ACK packet 125 within the designated duration of time for an ACK packet 125, it should retry transmission, according to the designated set of parameters, until either an ACK packet 125 is received or the designated maximum number of retries is reached. If an ACK packet 125 is ultimately received, the access point 120 should return a status code to the controlling software indicating successful transmission, while if no ACK packet 125 is received after the designated maximum number of retries is reached, the access point 120 should return a status code to the controlling software indicating failure of the transmission.


However, in current implementations by (at least) the Atheros model AR5416 and the Atheros model AR9160 access points 120, when the “KEY_SEARCH_AD1” feature is set. In such cases, the access point 120 fails to match received ACK packets 125 to those transmitted message packets. This has the effect that the access point 120 will fail to recognize receipt of any ACK packets 125; the access point 120 will therefore retry the message packet until the designated maximum number of retries is reached, and therefore always return a status code to the controlling software indicating failure of the transmission.


Accordingly, in one embodiment, software performs matching of transmitted message packets and received ACK packets 125.


In the FIG. 2, the access point 120 includes a hardware transmit queue 210, a receive queue 220, and for each mobile station 130, a mobile station queue 230.


A method 300 includes a set of flow labels and method steps as shown in the FIG. 3, including at least the following.


BEGINNING OF METHOD

Reaching the flow label 300A indicates the beginning of the method.


At a method step 310 a packet is removed from the mobile station queue followed by a method step 312 wherein the MS queue is blocked preventing further queuing.


At a method step 314 the original packet descriptor is saved for later recall and setting the MAXRETRY parameter of the packet to 1 for providing only a subset of possible retries for the transmission.


The method step 316 provides for placing the modified packet (the TX packet) with the hardware (HW) queue for transmission reaching the flow label 300D.


Reaching a flow label 300B indicates the TX packet transmission is complete.


At a method step 318 the TX packet is removed from the HW queue and at a method step 320 provides for storing the TX packet for later ACK matching. Reaching a method step 340 wherein a timer is set or timing indication is recorded. Upon completion of a timing indication, if a packet has not been received, then at a method label 300F reaching a timeout wherein operation transfers to a method step 334.


Reaching the flow label 300C indicates reception of an RX packet.


At a method step 322 the RX packet is removed from the received queue and tested in a method step 324. If the RX packet is not a complementary packet such as an ACK packet, the packet is passed unchanged to the access point (AP) software in a method step 326 thus reaching the end of the method at flow label 300E.


If the determination in the method step 324 is that the RX packet is a complementary packet such as an ACK packet, the ACK packet is stored for later matching in the method step 328.


A method step 330 provides for comparing the RX packet stored in the method step 328 with the TX packet stored in the method step 320 wherein the two packets are compared to determine if the RX packet is a complementary packet corresponding to the TX packet.


The method step 332 provides for the determination of a match wherein if there is a match, operation proceeds from the method step 336. If there is not a match, operation moves to a method step 334 wherein the number of retries is compared to a predetermined retry limit. If the retry limit is exceeded, operation proceeds to a method step 336. If the retry limit is not exceeded, operation proceeds to the method step 338.


At a method step 338 the TX packet is prepared for requeuing. This may include adjusting one or more transmission parameters, such as the transmission rate, to provide for more reliable communications with a mobile station. A method step 338 provides for incrementing a retry counter associated with the packet under consideration. When the method step 338 is completed, operation moves to a method step 316 for further transmission according to the foregoing description.


Returning to the method step 334, if the retry limit is found to be exceeded, operation moves to the method step 336. In the method step 336, the original descriptor from the method step 314 is restored to the packet. A flag indicating transmission success or failure is set, said flag indication being based on a comparison between the number of retries and a predetermined amount. The number of retries is associated with the packet before operation moves to a method step 338a.


The method step 338a unblocks the MS queue that has been previously blocked in the method step 312 thus allowing for system operation involving future packets. Operation then moves to the method step 326 wherein the packet is passed to the access point.


The method 300 terminates at the flow label 300E.


END OF METHOD


In one embodiment, the method 300 is repeated continually by the wireless communication system for each message packet to be transmitted.


To prevent re-ordering of message packets, the method 300 requires that only one frame per mobile station 130 is allowed to be enqueued at the hardware transmit queue 210 from the mobile station queue 230 for that mobile station 130. Accordingly, upon moving a message packet from the mobile station queue 230 for that mobile station 130, the method 300 requires the mobile station queue 230 for that mobile station 130 to wait for successful transmission of that message packet before attempting to move a further message packet from the mobile station queue 230 for that mobile station 130 onto the hardware transmit queue 210 for the access point 120.


ALTERNATIVE EMBODIMENTS

After reading this application, those skilled in the art would recognize that the scope and spirit of the invention includes other and further embodiments beyond the specifics of those disclosed herein, and that such other and further embodiments would not require new invention or undue experimentation.

Claims
  • 1. A computer-implemented method in an access point of a plurality of access points managed by a controller of a wireless communication network, the method for utilizing BSSIDs (basic service set identifiers) to maintain individual control of stations that communicate using a protocol inherent to the stations, the method comprising the steps of: storing, in the access point, a BSSID assigned to the access point by the controller;storing, in the access point, a plurality of persistent, uniquely-assigned BSSIDs, each persistent, uniquely-assigned BSSID being individually assigned to each station by the controller responsive to stations assigned to the access point for servicing, wherein uniqueness of the BSSID allows the controller to individually manage stations, and wherein persistence of the BSSID allows the controller to maintain individual control over each station after moving to a second access point of the plurality of access points from the access point, wherein each persistent, uniquely-assigned BSSID is stored at both a station and the access point, each of the plurality of access points independently using layer 2 communications, and each persistent, uniquely-assigned BSSID configured in the station by the access point with a beacon frame or a probe response frame sent from the access point to the mobile station;receiving a message frame from a station, the modified message frame comprising a receiver address defined by the persistent, uniquely-assigned BSSID and a sender address defined by a MAC address unique to the station;determining whether to send an ACK frame to the station, the ACK frame comprising a receiver address defined by the unique MAC address of the mobile station and a sender address defined by the persistent, uniquely-assigned BSSID of the station, the determination comprising comparing the receiver address of the received modified message frame to one of the stored plurality of persistent, uniquely assigned BSSIDs; andresponsive to matching the receiver address of the received modified message frame to one of the stored plurality of persistent, uniquely-assigned BSSIDs, generating the ACK frame indicative of a successful transmission.
  • 2. The method of claim 1, further comprising: enabling a key search bit, wherein matching the persistent, uniquely-assigned BSSID to one of the stored plurality of persistent, uniquely assigned BSSIDs is responsive to the enabled key search bit.
  • 3. The method of claim 1, further comprising: disabling a key search bit; andresponsive the disabled key search bit, matching the receiver address of the received modified message frame to the plurality of persistent, uniquely-assigned BSSIDs.
  • 4. The method of claim 1, further comprising: disabling a key search bit;responsive the disabled key search bit, sending an unmodified message frame to the station rather than a modified message frame, the unmodified message frame comprising the sender address defined by the persistent, uniquely-assigned BSSID and the receiver address defined by the mobile station MAC address; andresponsive the disabled key search bit, matching the sender address of the received ACK frame to the plurality of persistent, uniquely-assigned BSSIDs.
  • 5. The method of claim 1, wherein storing the plurality of BSSIDs comprises: storing the plurality of persistent, uniquely-assigned BSSIDs in a key cache integrated within a processor of the access point.
  • 6. The method of claim 5, wherein the key cache comprises a plurality of registers, each register storing one of the plurality of persistent, uniquely-assigned BSSIDs.
  • 7. The method of claim 1, wherein the persistent, uniquely-assigned BSSID cannot be identified by masking one of the plurality of persistent, uniquely-assigned BSSIDs.
  • 8. The method of claim 1, further comprising: storing the persistent, uniquely-assigned BSSID based on the controller assigning the station to the access point among a plurality of access points being controlled.
  • 9. The method of claim 1, further comprising: deleting the persistent, uniquely-assigned BSSID based on a controller de-assigning the station to the access point among a plurality of access points being controlled.
  • 10. A non-transitory computer readable medium storing a computer program product to perform a method in an access point of a plurality of access points managed by a controller of a wireless communication network, the method for utilizing BSSIDs (basic service set identifiers) to maintain individual control of stations that communicate using a protocol inherent to the stations, the method comprising the steps of: storing, in the access point, a BSSID assigned to the access point by the controller;storing, in the access point, a plurality of persistent, uniquely-assigned BSSIDs, each persistent, uniquely-assigned BSSID being individually assigned to each station by the controller responsive to stations assigned to the access point for servicing, wherein uniqueness of the BSSID allows the controller to individually manage stations, and wherein persistence of the BSSID allows the controller to maintain individual control over each station after moving to a second access point of the plurality of access points from the access point, wherein each persistent, uniquely-assigned BSSID is stored at both a station and the access point, each of the plurality of access points independently using layer 2 communications, and each persistent, uniquely-assigned BSSID configured in the station by the access point with a beacon frame or a probe response frame sent from the access point to the mobile station;receiving a message frame from a station, the modified message frame comprising a receiver address defined by the persistent, uniquely-assigned BSSID and a sender address defined by a MAC address unique to the station;determining whether to send an ACK frame to the station, the ACK frame comprising a receiver address defined by the unique MAC address of the mobile station and a sender address defined by the persistent, uniquely-assigned BSSID of the station, the determination comprising comparing the receiver address of the received modified message frame to one of the stored plurality of persistent, uniquely assigned BSSIDs; andresponsive to matching the receiver address of the received modified message frame to one of the stored plurality of persistent, uniquely-assigned BSSIDs, generating the ACK frame indicative of a successful transmission.
  • 11. An access point of a system including a plurality of access points managed by a controller of a wireless communication network, the system to utilize BSSIDs (basic service set identifiers) to maintain individual control of stations that communicate using a protocol inherent to the stations, the access point comprising: a register to store a BSSID assigned to the access point by the controller, the register to internally store a plurality of persistent, unique-assigned BSSIDs, each uniquely-assigned BSSID being individually assigned to each station by the controller responsive to stations assigned to the access point for servicing, wherein uniqueness of the BSSID allows the controller to individually manage stations, and wherein persistence of the BSSID allows the controller to maintain individual control over each station after moving to a second access point of the plurality of access points from the access point, wherein each persistent, uniquely-assigned BSSID is stored at both a station and the access point, each of the plurality of access points independently using layer 2 communications, and each persistent, uniquely-assigned BSSID configured in the station by the access point with a beacon frame or a probe response frame sent from the access point to the mobile station; andan interface, coupled in communication with the register and the processor, to receive a modified message frame from a station, the modified message frame comprising a receiver address defined by the persistent, uniquely-assigned BSSID and a sender address defined by a MAC address unique to the station;a processor to determine whether to send an ACK frame to the station, the ACK frame comprising a receiver address defined by the unique MAC address of the mobile station and a sender address defined by the persistent, uniquely-assigned BSSID of the station, the determination comprising comparing the receiver address of the received modified message frame to one of the stored plurality of persistent, uniquely assigned BSSIDs and responsive to matching the receiver address of the received modified message frame to one of the stored plurality of persistent, uniquely-assigned BSSIDs, generating the ACK frame indicative of a successful transmission.
US Referenced Citations (133)
Number Name Date Kind
3956749 Magorian May 1976 A
5038151 Kaminski Aug 1991 A
5125108 Talwar Jun 1992 A
5177788 Schanning et al. Jan 1993 A
5337397 Lebby et al. Aug 1994 A
5519706 Bantz et al. May 1996 A
5966094 Ward et al. Oct 1999 A
6023621 Jackson et al. Feb 2000 A
6658047 Komulainen et al. Dec 2003 B1
6721334 Ketcham Apr 2004 B1
6728603 Pruzan et al. Apr 2004 B2
6760318 Bims Jul 2004 B1
6788658 Bims Sep 2004 B1
6839038 Weinstein Jan 2005 B2
6877043 Mallory et al. Apr 2005 B2
6894649 Ostervall May 2005 B2
6933909 Theobold Aug 2005 B2
6950629 Nagy Sep 2005 B2
6954177 Channabasappa et al. Oct 2005 B2
6978158 Ghavami Dec 2005 B2
6999802 Kim Feb 2006 B2
7057566 Theobold Jun 2006 B2
7171215 Khouaja et al. Jan 2007 B2
7194008 Chu et al. Mar 2007 B2
7197308 Singhal et al. Mar 2007 B2
7277728 Kauhanen Oct 2007 B1
7319685 Kim et al. Jan 2008 B2
7321580 Ramanathan et al. Jan 2008 B1
7333455 Bolt et al. Feb 2008 B1
7359362 King et al. Apr 2008 B2
7379435 Kinder May 2008 B1
7400604 Lee et al. Jul 2008 B2
7403506 Lee et al. Jul 2008 B2
7406319 Kostic et al. Jul 2008 B2
7420942 Wang Sep 2008 B2
7426388 Wright et al. Sep 2008 B1
7430397 Suda et al. Sep 2008 B2
7433722 Sakamoto et al. Oct 2008 B2
7444425 Lehmann, Jr. et al. Oct 2008 B2
7466981 Abdelhamid et al. Dec 2008 B1
7499673 Saliga et al. Mar 2009 B2
7515909 Jain et al. Apr 2009 B2
7555287 Heinonen et al. Jun 2009 B1
7630402 Un et al. Dec 2009 B2
7630403 Ho et al. Dec 2009 B2
7693513 Chou Apr 2010 B2
7826426 Bharghavan et al. Nov 2010 B1
7843910 Loughran et al. Nov 2010 B2
7996554 Venkatraman Aug 2011 B1
8027637 Bims Sep 2011 B1
8090374 Rezvani et al. Jan 2012 B2
8472359 Bharghavan et al. Jun 2013 B2
8787309 Bharghavan et al. Jul 2014 B1
20020022483 Thompson et al. Feb 2002 A1
20020060995 Cervello et al. May 2002 A1
20020086640 Belcher et al. Jul 2002 A1
20020112008 Christenson et al. Aug 2002 A1
20020147031 Hood Oct 2002 A1
20020181629 Shibata Dec 2002 A1
20030162546 Jordan Aug 2003 A1
20030198305 Taylor et al. Oct 2003 A1
20030199247 Striemer Oct 2003 A1
20030206532 Shpak Nov 2003 A1
20030206535 Shpak Nov 2003 A1
20030207697 Shpak Nov 2003 A1
20030207698 Shpak Nov 2003 A1
20030207699 Shpak Nov 2003 A1
20030236103 Tamaki et al. Dec 2003 A1
20040051668 Chang Mar 2004 A1
20040063455 Eran et al. Apr 2004 A1
20040121770 Tigerstedt Jun 2004 A1
20040141617 Volpano Jul 2004 A1
20040156399 Eran Aug 2004 A1
20040183726 Theobold Sep 2004 A1
20040185904 Yamakita Sep 2004 A1
20040235453 Chen et al. Nov 2004 A1
20050054370 Shpak Mar 2005 A1
20050111405 Kanterakis May 2005 A1
20050122919 Touag Jun 2005 A1
20050135321 Sharony Jun 2005 A1
20050152314 Sun et al. Jul 2005 A1
20050153713 Sharony Jul 2005 A1
20050156794 Theobold et al. Jul 2005 A1
20050156799 Theobold Jul 2005 A1
20050195110 Lin et al. Sep 2005 A1
20050219143 Schadler et al. Oct 2005 A1
20050220048 Lee et al. Oct 2005 A1
20050238054 Sharma Oct 2005 A1
20050261970 Vucina et al. Nov 2005 A1
20060002331 Bhagwat et al. Jan 2006 A1
20060025127 Cromer et al. Feb 2006 A1
20060049987 Herrick Mar 2006 A1
20060056443 Tao et al. Mar 2006 A1
20060098613 Kish et al. May 2006 A1
20060111112 Maveddat May 2006 A1
20060132360 Caimi et al. Jun 2006 A1
20060203819 Farinacci et al. Sep 2006 A1
20060215691 Kobayashi et al. Sep 2006 A1
20060221993 Liao et al. Oct 2006 A1
20060281500 Huang et al. Dec 2006 A1
20070014267 Lam et al. Jan 2007 A1
20070026807 Kish Feb 2007 A1
20070081477 Jakkahalli et al. Apr 2007 A1
20070117514 Gainey et al. May 2007 A1
20070165610 Tseng et al. Jul 2007 A1
20070195725 Iino et al. Aug 2007 A1
20070213071 Hwang Sep 2007 A1
20080014956 Balasubramanian Jan 2008 A1
20080102835 Zhao et al. May 2008 A1
20080112373 Shpak May 2008 A1
20080153497 Kalhan Jun 2008 A1
20080165866 Teo et al. Jul 2008 A1
20080167093 Nagano et al. Jul 2008 A1
20080212535 Karaoguz et al. Sep 2008 A1
20080242305 Kahlert et al. Oct 2008 A1
20080287130 Laroia et al. Nov 2008 A1
20090022127 Traynor et al. Jan 2009 A1
20090023434 Trainor et al. Jan 2009 A1
20090061873 Bao et al. Mar 2009 A1
20090061879 Gallagher et al. Mar 2009 A9
20090111472 Promenzio Apr 2009 A1
20090252165 Zhang et al. Oct 2009 A1
20100080151 Proctor et al. Apr 2010 A1
20110040969 Yao et al. Feb 2011 A1
20110188484 Reznik et al. Aug 2011 A1
20110305217 Seok Dec 2011 A1
20120307792 Ram et al. Dec 2012 A1
20120314696 Liu Dec 2012 A1
20120317619 Dattagupta et al. Dec 2012 A1
20130148609 Ram et al. Jun 2013 A1
20130188539 Han et al. Jul 2013 A1
20140112322 Ram et al. Apr 2014 A1
20140126466 Hamdi et al. May 2014 A1
Foreign Referenced Citations (2)
Number Date Country
2005311580 Nov 2005 JP
2006229972 Aug 2006 JP
Non-Patent Literature Citations (55)
Entry
“Information technology—Telecommunications and information exchange between systems—Local and metropolitan area networks—Specific requirements—Part 11: Wireless LAN Medium Access Control (MAC) and Physical Layer (PHY) Specifications,” ANSI/IEEE Std 802.11, 1999 Edition (R2003) , vol., no., pp. i-513, 2003.
Habib et al. “Multi-antenna techniques for OFDM based WLAN.” Proceedings of First International Conference on Next-Generation Wireless Systems, Jan. 2006, pp. 186-190.
Kitahara et al. “A base station adaptive antenna for downlink transmission in a DS-CDMA system.” IEEE 51st Vehicular Technology Conference Proceedings, 2000 (abstract).
Mahler et al. “Design and optimisation of an antenna array for WiMAX base stations.” IEEE/ACES International Conference on Wireless Communications and Applied Computational Electromagnetics, 2005 (abstract).
Miaris et al. “On the base stations antenna system design for mobile communications.” Electrical Engineering, 2006, pp. 157-163, vol. 88.
Miura et al. “Study of array pattern tuning method using hybrid genetic algorithms for figure-8 satellite's earth station antenna.” Asia-Pacific Microwave Conference Proceedings, 2000 (abstract).
Ponnapalli et al. “Design and packaging of antennas for wireless systems.” Proceedings of Electrical Performance of Electrical Packaging, 1995 (abstract).
Sarolic. “Base station antenna near-field radiation pattern distortion analysis.” Sixth International Conference on Computational Methods for the Solution of Electrical and Electromagnetic Engineering Problems Incorporating Electromagnetic Effects on Human Beings and Equipment Seminar, 2003 (abstract).
IEEE. “Information technology—Telecommunications and information exchange between systems—Local and metropolitan area networks—Specific requirements—Part 11: Wireless LAN Medium Access Control (MAC) and Physical Layer (PHY) specifications.” IEEE Std 802.11-1997, Nov. 1997, pp. i-445 (Abstract).
Amir. “Fast handoff for seamless wireless mesh networks.” MobiSys '06, Jun. 19-22, 2006, pp. 83-95, ACM, Uppsala, Sweden.
IEEE. “Part 11: Wireless LAN Medium Access Control (MAC) and Physical Layer (PHY) specifications.” IEEE Std 802.11-1997, vol. no. pp. i-445, Nov. 18, 1997.
Chen et al. “A seamless handoff mechanism for DHCP-Based IEEE 802.11 WLANS.” IEEE Communications Letters, vol. 1, No. 8, Aug. 2007, pp. 665-667.
Cheung et al. “Network configurations for seamless support of CDMA soft handoffs between cell clusters.” IEEE Journal on Selected Areas in Communications, vol. 15, No. 7, Sep. 1997, pp. 1276-1288.
Murray et al. “Intelligent access and mobility management in heterogeneous wireless networks using policy.” First International Workshop on Information and Communication Technologies, ACM, 2003, pp. 181-186.
Chui et al. “An Access point coordination system for improved VoIP/WLAN handover performance.” IEEE 2006, pp. 501-505.
Fan et al. “Managing heterogeneous access networks.” 32nd IEEE Conference on Local Computer Networks, IEEE 2007, pp. 651-658.
Huang et al. “Incorporating AP selection and call admission control for seamless handoff procedure.” Proceedings of the International Conference on Computer and Communication Engineering 2008, pp. 823-826, 2008.
Huang et al. “SAP: Seamless authentication protocol for vertical handoff in heterogeneous wireless networks.” Third International Conference on Quality of Service in Heterogeneous Wired/Wireless Networks, Aug. 7-9, 2006, ACM, Waterloo, ON, Canada, pp. 1-10.
Wei et al. “Seamless handoff support in wireless mesh networks.” IEEE 2006, pp. 1-8.
Zhou et al. “A seamless handoff scheme for Mobile IP.” IEEE Vehicular Technology Conference, vol. 2, pp. 927-931, 2006.
Manodham et al. “A Seamless handoff scheme with new AP module for wireless LANs support VoIP.” Proceedings of the 2005 Symposium on Applications and the Internet. IEEE, 2006, pp. 1-6.
Kist. “Instant handoffs for wireless infrastructure meshed networks,” Proceedings of the 2008 Australasian Telecommunication Networks and Applications Conference, pp. 288-293, 2008.
Liao et al. “Practical schemes for smooth MAC layer handoff in 802.11 wireless networks.” Proceedings of the 2006 International Symposium on a World of Wireless, Mobile and Multimedia Networks, IEEE, pp. 1-10.
LV. “Intelligent seamless vertical handoff algorithm for the next generation wireless networks.” Mobilware '08, Feb. 12-15, 2008, Innsbruck, Austria, pp. 1-10.
Amir. “Fast Handofffor Seamless Wireless Mesh Networks.” MobiSys '06, Jun. 19-22, 2006, pp. 83-95, ACM, Uppsala, Sweden.
Business Wire. “Meru Networks Delivers Industry's Only Zero-Loss Mobility Across WLAN Access Points and IP Subnets.” Jun. 21, 2004, pp. 1-2.
Chen et al. “A Seamless Handoff Mechanism for OHCP-Based IEEE 802.11 WLANS.” IEEE Communications Letters, Aug. 2007, pp. 665-667, vol. 1, No. 8.
Cheung et al. “Network Configurations for Seamless Support of COMA Soft Handoffs Between Cell Clusters.” IEEE Journal on Selected Areas in Communications, Sep. 1997, pp. 1276-1278, vol. 15, No. 7.
Chou et al. “Intelligent Agent Over WLAN With Seamless Handover and Load Balancing.” 2006 International Conference on Communication Technology, Nov. 27-Nov. 30, 2006, pp. 1-7, IEEE. (Abstract).
Chui et al. “An Access Point Coordination System for Improved VoIP/WLAN Handover Performance.” IEEE, 2006, pp. 501-505.
Fan et al. “Managing Heterogeneous Access Networks.” 32nd IEEE Conference on Local Computer Networks, 2007, pp. 651-658, IEEE 2007, pp. 651-658.
Finneran. “Can WLAN switches support voice? Today's controllers offer key security and QoS capabilities, but as always, the devil's in the details.” Business Communications Review, Oct. 2006, pp. 42-47.
Huang et al. “Incorporating AP Selection and Call Admission Control for Seamless Handoff Procedure.” Proceedings of the International Conference on Computer and Communication Engineering 2008, pp. 823-826.
Huang et al. “SAP: Seamless Authentication Protocol for Vertical Handoff in Heterogeneous Wireless Networks.” Third International Conference in Heterogeneous Wired/Wireless Networks, Aug. 7-9, 2006, pp. 1-10, Waterloo, ON, CA.
Hur et al. “A Distributed-Request-Based Diffsery CAC for Seamless Fast-Handoff in Mobile Internet.” J. Sole-Pareta et al. (Eds.): Q of IS 2004: International Workshop on Quality of Future Internet Services, LNCS 3266, pp. 184-193, 2004.
IEEE Std 802. Nov. 1997 Information Technology—telecommunications and Information exchange between systems—Local and Metropolitan Area Networks—specific Requirements—part 11: Wireless Lan Medium Access Control (MAC) and Physical Layer (PHY) Specifications, IEEE Std 802.11-1997, vol., no., pp. i-445, Nov. 18, 1997.
IEEE. “Part 11: Wireless LAN Medium Access Control (MAC) and Physical Layer (PHY) specifications.” IEEE Std. 802.11, 1999 Edition (R2003), 2003, vol. no. pp. i-513.
Jang et al. “Mobility Support Algorithm Based on Wireless 802.11 b LAN for Fast Handover.” 5th International Conference, PDCAT 2004, Dec. 8-10, 2004, pp. 715-718, Springer Verlag. (Abstract).
Zhou et al. “A Seamless Handoff Scheme for Mobile IP.” 2006 IEEE 63rd Vehicular Technology Conference, VTC 2006-Spring, May 7-Jul. 102006, pp. 927-931, IEEE. (Abstract).
Kist. “Instant Handoffs for Wireless Infrastructure Meshed Networks.” Proceedings of the 2008 Australasian Telecommunication Networks and Applications Conference, 2008, pp. 288-293.
Liao et al. “Practical Schemes for Smooth MAC Layer Handoff in 802.11 Wireless Networks.” Proceedings of the 2006 International Symposium on a World of Wireless, Mobile and Multimedia Networks. IEEE, 2006, pp. 1-10.
LV. “Intelligent Seamless Vertical Handoff Algorithm for the Next Generation Wireless Networks.” Mobilware '08, Feb. 12-15, 2008, pp. 1-10, Innsbruck, Austria.
Mannion. “Foundry Networks enters WLAN management fray—Bets on integration with wired infrastructure, market timing to take on Cisco.” Electronic Engineering Times, Sep. 8, 2003, p. 32, No. 1286.
Manodham. “A Seamless Handoff Scheme with New AP Module for Wireless LANs Support VoIP.” 2006. International Symposium on Applications and the Internet, SAINT 2006, Jan. 23-27, 2006, pp. 253-258, IEEE. (Abstract).
Manodham et al. “A Seamless Handoff Scheme with New AP Module for Wireless LANs support VoIP.” Proceedings of the 2005 Symposium on Applications and the Internet, 2006, pp. 1-6, IEEE.
Marsh. “Power and wireless options extend Ethernet's reach: Ethernet's power-delivery and wireless abilities offer new application potential that hugely extends the reach of the IEEE's 802.X series of standards.” EDN, Nov. 11, 2004, p. 67, Reed Business Information.
Murray et al. “Intelligent Access and Mobility Management in Heterogeneous Wireless Networks Using Policy.” ACM First International Workshop on Information and Communication Technologies, 2003, pp. 181-186.
Rist et al. “Wireless LANs—Look, Ma. . . . No Wires—Wireless networking products prove they are finally ready for prime time.” Internetweek, Mar. 20, 2000, p. 41, No. 805, CMP Media, Inc.
Sattari et al. “Seamless Handover Between WLAN and UMTS.” 2004 IEEE 59th Vehicular Technology Conference, VTC2004-Spring: Towards a Global Wireless World, May 17-19, 2004, pp. 3035-3038, IEEE. (Abstract).
Thomsen. “Development Platform for Dynamic Bandwidth Allocation Schemes in Future MPCP Enabled Ethernet Passive Optical Network (EPON).” WSEAS Transactions on Communications, Apr. 5, 2006, pp. 92-98, WSEAS. (Abstract).
Wei et al. “Seamless Handoff Support in Wireless Mesh Networks.” 2006, pp. 1-8, IEEE.
Xhafa et al. “Seamless Handover in Building Using HVAC Ducts: A New System Architecture.” IEEE Global Telecommunications Conference GLOBECOM'03, Dec. 1-5, 2003, pp. 3093-3097, IEEE. (Abstract).
Yaakob et al. “An Integration of Mobile Motion Prediction with Dedicated Solicitation Message for Seamless Handoff Provisioning in High Speed Wireless Environment.” 2008 International Conference on Electronic Design, Dec. 1-3, 2008, Pernang, Malaysia, pp. 1-5.
Yamagata et al. “Seamless Handover for Hotspot Network Using Adaptive Flow Control Method.” 2005 Asia-Pacific Conference on Communications, Oct. 3-5, 2005, pp. 502-506, IEEE. (Abstract).
Zhou et al. A Seamless Handoff Scheme for Mobile IP. IEEE Vehicular Technology Conference, 2006, pp. 927-931, vol. 2.
Continuations (1)
Number Date Country
Parent 11298864 Dec 2005 US
Child 11715287 US
Continuation in Parts (1)
Number Date Country
Parent 11715287 Mar 2007 US
Child 12035925 US