In wireless communication, devices can send and receive messages without being physically coupled. Wireless devices (sometimes called “mobile units” or “MU's”) can include portable computers, telephones, location sensors (such as those using GPS), and the like. Portable computers with wireless communication capability can be coupled to a computer network, such as the Internet or the World Wide Web.
The IEEE 802.11 standard (including 802.11a, 802.11b, and 802.11g) is one known technique for coupling MU's to a computer network. In 802.11, MU's seek out and select “access points” (sometimes called “AP's”), which are themselves physically coupled, for computer communication, to at least a network controller. Each MU associates itself with a particular AP, with which it communicates. Each MU (which might move before, during, or after communication) determines from time to time if it has good communication with its associated AP, and whether it would have better communication with a different AP. Each AP might be coupled to a single device, a collection of devices, or to a computer network.
In alternative embodiments, MU's might communicate directly without using intermediate AP's or system infrastructure. This form of MU-to-MU communication is sometimes referred to herein as a “peer-to-peer” or an “ad hoc” mode of communication between MU's. As described below, security in wireless communication systems should also protect against peer-to-peer modes of communication involving unauthorized devices.
Wireless communication is subject to use by unauthorized (sometimes called “bad” or “rogue”) devices. Rogue devices might include AP's or MU's.
There are at least three types of “active” rogue attacks, that is, rogue attacks that involve communication by the rogue device with at least some elements of the wireless communication system.
There are also at least three types of “passive” rogue attacks, that is, rogue attacks that involve listening by the rogue device to messages in the wireless communication system.
Known methods of enforcing security in a wireless communication system are subject to several problems.
A 1st known issue is that policing a wireless communication system against rogue devices can be evaded by those unauthorized devices.
The invention includes techniques for enforcing security in wireless communication systems at an L1 layer, preferably in addition to, but possibly in lieu of, enforcing security at other layers. AP's are capable of both servicing authorized devices, and when not servicing, scanning for rogue devices (possibly on multiple channels). AP's are also capable of both servicing authorized devices on one channel and scanning for rogue devices on other channels. Rogue devices are detected, isolated (sometimes called “quarantined”), and expelled from the system with substantially no communication overhead. AP's can also prevent rogue devices from passive listening to messages by jamming L1 protocol messages for substantially all devices except the sender and receiver.
In an aspect of the invention, L1 protocol messages (sometimes called “frames”) include a frame header and a frame payload. Scanning AP's, in hearing range of those frames, listen to the frame header and determine if that frame is authorized or not. If authorized, the scanning AP either receives the frame or allows the frame to be received by its destination AP. If not authorized, the scanning AP kills the frame, for example, by inserting a noise spike in a portion of the frame payload. In a preferred embodiment, frame payloads (which can vary from about 400 microseconds at about 54 Mbps, to about 5,000 microseconds at about 2 Mbps) are substantially longer than frame headers (which can vary from about 50 at about 54 Mbps, to about 150 microseconds at about 2 Mbps), with the effect that after reading and parsing the frame header, scanning AP's have enough time to determine whether or not to kill the frame during the frame payload.
In an aspect of the invention, scanning AP's need not be distinct from serving AP's. For a 1st example, if the interference zones of two AP's intersect at a particular MU, at least one of those two AP's must be silent when that MU is receiving or sending. The other AP can switch dynamically from serving to scanning. For a 2nd example, if an AP hears a frame from a rogue device, it can switch dynamically from serving to killing frames from that rogue device. This has the additional effect of also killing all IEEE beacons and probes from the rogue device, with the effect that rogue AP's become invisible to their clients, and rogue clients become invisible to all AP's.
In an aspect of the invention, scanning AP's need not stop scanning after detecting a rogue frame. If a scanning AP, after killing a rogue frame, has sufficient time to keep scanning for one or more additional frame headers, that AP can continue scanning, with the effect of providing scanning capacity equivalent to multiple scanning AP's. In a preferred embodiment, the frame header indicates the length of the frame, so the scanning AP knows the time when it must return to serving.
In an aspect of the invention, each AP might include a dual-mode (receive and transmit) multi-frequency omni-directional antenna, with the effect that when an AP receives a frame, it can assure that no other AP or MU within hearing distance of the receiving AP receives that frame. Receiving AP's identify frames as directed to them as recipients. They receive the frame data themselves at the receive portion of the antenna, and insert a noise spike from the transmit portion of the antenna. This has the effect that only the receiving AP itself can hear the frame data. (Even the sending AP or MU cannot hear the frame data, but it already knows what it is sending and thus does not even listen to the frames it sends.)
This application should be read in the most general possible form. This includes, without limitation, the following:
After reading this application, those skilled in the art would see the generality of this description.
The general meaning of each of these following terms is intended to be illustrative and in no way limiting.
The scope and spirit of the invention is not limited to any of these definitions, or to specific examples mentioned therein, but is intended to include the most general concepts embodied by these and other terms.
System Elements
Communication System
One embodiment of a system 100 includes elements shown in the figure, including at least the following:
The system coordinator 110 includes elements shown in the figure, including at least the following:
The coordinator circuit 111 includes a computing device, such as a processor, program and data memory, and optionally mass storage. In cases in which the coordinator circuit 111 includes a programmable computing device, it also operates under control of software, optionally distinguished as operating system software and application software.
The coordinator database 112 includes information relating to the status of the system 100, its access points (AP's) 130, and its mobile units (MU's) 140. The coordinator circuit 111 operates with the coordinator database 112 to perform functions described below. These functions include at least the following:
The system local network 120 includes any technique for sending and receiving information between the system coordinator 110 and the AP's 130. In a 1st set of preferred embodiments, the system local network 120 includes an L2/L3 network, capable of substantially reliably communicating data packets between the system coordinator 110 and the AP's 130. However, in the context of the invention, there is no particular requirement for using this technique.
Each MU 140 includes elements shown in the figure, including at least the following:
In a 1st set of preferred embodiments, the device control circuit 141 includes a computing device preprogrammed to implement one or more of the IEEE 802.11a, 11b, or 11g protocols, and includes one or multiple radios. One example of a mobile unit could be a telephone or mobile computer preprogrammed to operate in a wireless environment.
However, in the context of the invention, there is no particular requirement that the device control circuit 141 must be preprogrammed; it may instead include programmable memory, data memory, and optionally mass storage. One example of this distinct type of mobile unit could be a mobile computer, programmable to discover its wireless environment and operate therein.
Access Points
In a preferred embodiment, each access point (AP) 130 includes elements shown in the figure, including at least the following:
The AP control circuit 131 includes a computing device, such as a processor, program and data memory, and optionally mass storage. In cases in which the AP control circuit 131 includes a programmable computing device, it also operates under control of software, optionally distinguished as operating system software and application software.
In a sending portion of the AP 130, the AP control circuit 131 determines which signals it desires to send and on what frequencies, multiplexes those signals onto those frequencies, and sends those multiplexed signals to the antenna 132. The antenna 132 broadcasts those multiplexed signals using wireless communication.
Similarly, in a receiving portion of the AP 130, the antenna 132 receives signals substantially omni-directionally using wireless communication. The AP control circuit 131 de-multiplexes those signals from those frequencies, and parses and examines those signals as they are received.
In the context of the invention, there is no particular requirement that the antenna 132 needs to be dual-mode or multi-frequency (as described herein) for scanning and jamming by the AP 130. For example, the AP 130 might receive the frame header 210 (as described herein) using any appropriate antenna 132, and transmit using any appropriate antenna 132 to create a noise spike in the frame payload 220 (as described herein).
In a preferred embodiment, the dual-mode features of the antenna 132 are used in conjunction with micro jamming techniques (as described herein). Each part of the antenna 132 either sends or receives. When the AP 130 receives a frame 200, it receives that frame 200 using a 1st portion of the antenna 132, and performs micro-jamming using a 2nd portion of the antenna 132. This has the effect that micro-jamming can proceed concurrently with receiving.
Timing Diagram
A wireless communication frame 200 includes elements as shown in the figure, including at least the following:
The frame start signal 201 indicates the beginning of the frame 200. In a preferred embodiment, the frame start signal 201 might include a “guard time” between a previous frame 200 and this particular frame 200.
Similarly, the frame end signal 202 indicates the end of the frame 200. Similarly, in a preferred embodiment, the frame end signal 202 might include a “guard time” between this particular frame 200 and a next frame 200.
Each frame header 210 includes elements as shown in figure, including at least the following:
Similarly to the frame 200, the frame header 210 includes a frame header start signal 211 that indicates the beginning of the frame header 210. In a preferred embodiment, the frame header start signal 211 might include a “guard time” between the beginning of the frame and the beginning of the frame header 210.
The destination indicator 212 identifies a device to which this particular frame 200 is intended to be delivered. In a preferred embodiment, the destination indicator 212 includes a MAC address, such as a six octet (six byte) code, uniquely identifying the destination device.
The source indicator 213 identifies a device from which this particular frame 200 was sent. In a preferred embodiment, the source indicator 213 includes a MAC address, such as a six octet (six byte) code, uniquely identifying the sending device.
The frame length indicator 214 identifies the length of the frame 200, in a standardized measure. In a preferred embodiment, the frame length indicator 214 identifies a number of octets (bytes) between the end of the frame header 210 and the end of the frame 200.
Similarly to the frame 200, the frame header and signal 215 indicates the end of the frame header 210. Similarly, in a preferred embodiment, the frame header end signal 215 might include a “guard time” between the end of the frame header 210 and the beginning of the frame payload 220.
The frame payload 220 includes data to be delivered to the destination device from the source device.
The frame checksum 230 includes a checksum or other redundant information, with the effect that the destination device can confirm that it has properly received the frame 200.
Methods of Operation
A method 300 includes a technique for scanning and possibly intercepting frames 200 that have been generated by rogue devices. This method 300 includes flow points and steps shown in the figure, including at least the following:
A flow point 310A defines a beginning of the method 300.
At a step 311, the AP 130 completes servicing a particular channel, and is ready to scan that channel for rogue devices while other AP's 130 are using that channel.
At a step 312, the controller 120 sends, and the AP 130 receives, information identifying which devices are valid users of the system 100, and which devices are rogue devices. In the context of the invention, there is no particular requirement that this step need be performed all at once. For example, the AP 130 might consult with the controller from time to time regarding those devices it spots, to ask if those devices are authorized or are rogue devices.
And a step 313, the AP 130 scans that channel until it receives the beginning of a frame 200 on that channel, or until a selected “dwell” time elapses. Techniques for determining an amount of time to scan before scanning another channel already exist; in the context of the invention, there is no particular requirement or advantage any one such technique, and those skilled in the art would be able to select an appropriate technique without new invention or undue experiment. As part of this step, the AP 130 receives the frame header 210 from the frame 200.
At a step 314, the AP 130 parses that frame header 210, with the effect of identifying the destination indicator 212, the source indicator 213, and the frame length indicator 214.
At a step 315, the AP 130 compares the destination indicator 212 with its list of identified rogue devices. Similarly, as part of this, the AP 130, compares the source indicator 213, with its list of identified rogue devices. As a result of this step, the AP 130 can determine if the frame 200 should be allowed to proceed within the system number 100.
If the AP 130 determines that the frame 200 should be allowed to proceed within the system; that is, the AP 130 does not wish to destroy the frame 200, the method 300 skips the next step.
If the AP 130 determines that the frame 200 should not be allowed to proceed within the system; that is, the AP 130 wishes to destroy the frame 200, the method 300 proceeds with the next step.
At a step 316, the AP 130 inserts a “noise spike” into the frame payload 220, with the effect that frame 200 is destroyed. In a preferred embodiment, the “noise spike” is any frame or partial frame with the effect of destroying the frame 200. In the context of the invention, there is no particular requirement that the “noise spike” need include “noise” (as sometimes known in the art), or that it include a sufficient power difference to qualify as a “spike” (as sometimes known in the art). For example, an ACK (acknowledgement) message by the AP 130 would be adequate to destroying the frame 200.
This action by the AP 130 has the effect that, even if the frame 200 is successfully routed to its destination device, the frame payload 220 will not match the frame checksum 230. This has the effect that destination device will discard the frame 200 as broken. Even if the destination device does not discard the frame 200, at least some portion of the frame payload 220 will have been eradicated by collision with the “noise spike” (as described above) from the AP 130.
A flow point 310B defines an end of the method 300.
Generality of the Invention
This invention should be read in the most general possible form. This includes, without limitation, the following possibilities included within the scope of, or enabled by, the invention.
After reading this application, those skilled in the art would see the generality of this application.
This application is a continuation of prior U.S. patent application Ser. No. 11/396,400, now allowed, filed Mar. 31, 2006, in the name of the same inventors, which is hereby incorporated by reference as if fully set forth herein.
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 |
5884272 | Walker et al. | Mar 1999 | A |
5966094 | Ward et al. | Oct 1999 | A |
6023621 | Jackson et al. | Feb 2000 | A |
6658047 | Komulainen et al. | Dec 2003 | 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 | Channabassappa et al. | Oct 2005 | B2 |
6978158 | Ghavami | Dec 2005 | B2 |
6999802 | Kim | Feb 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 |
7333455 | Bolt et al. | Feb 2008 | B1 |
7359362 | King et al. | Apr 2008 | B2 |
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 |
7466981 | Abdelhamid et al. | Dec 2008 | B1 |
7515909 | Jain et al. | Apr 2009 | B2 |
7555287 | Heinonen et al. | Jun 2009 | B1 |
7630402 | Un et al. | Dec 2009 | B2 |
7693513 | Chou | Apr 2010 | B2 |
7826426 | Bharghavan et al. | Nov 2010 | B1 |
7843910 | Loughran et al. | Nov 2010 | B2 |
8027637 | Bims | Sep 2011 | B1 |
8090374 | Rezvani et al. | Jan 2012 | B2 |
8472359 | Bharghavan et al. | Jun 2013 | B2 |
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 et al. | Jun 2004 | A1 |
20040141617 | Volpano | Jul 2004 | A1 |
20040156399 | Eran | Aug 2004 | A1 |
20040183726 | Theobald | 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 | Theobald et al. | Jul 2005 | A1 |
20050156799 | Theobald | 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 |
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 |
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 |
20070117514 | Gainey et al. | May 2007 | A1 |
20070165610 | Tseng et al. | Jul 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 |
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 et al. | Apr 2009 | A1 |
20100080151 | Proctor et al. | Apr 2010 | A1 |
20130148609 | Ram et al. | Jun 2013 | A1 |
Number | Date | Country |
---|---|---|
2005311580 | Nov 2005 | JP |
2006229972 | Aug 2006 | JP |
Entry |
---|
Amir. “Fast Handoff for 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. |
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. |
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 Diffserv 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. 11-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. 10, 2006, 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. |
Kitahara et al. “A base station adaptive antenna for downlink transmission in a OS-COMA system.” IEEE 51 st Vehicular Technology Conference Proceedings, 2000 (abstract). |
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. |
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). |
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. |
Miaris et al. “On the base stations antenna system design for mobile communications.” Electrical Engineering, 2006, vol. 88, pp. 157-163. |
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). |
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. |
Ponnapalli et al. “Design and packaging of antennas for wireless systems.” Proceedings of Electrical Performance of Electrical Packaging, 1995 (abstract). |
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. |
Sarolic. “Base station antenna near-field radiation pattern distortion analysis.” Transactions on Engineering Sciences, 2003, pp. 1-10, vol. 41, WIT Press. |
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. |
Number | Date | Country | |
---|---|---|---|
Parent | 11396400 | Mar 2006 | US |
Child | 13290345 | US |