1. Field
The present invention relates generally to communications. More particularly, in aspects the invention relates to establishing and changing one-to-one client-host associations in a wireless network.
2. Background
Portability and functionality of wireless communication devices continue to improve, contributing to the proliferation of wireless communication networks. Many conventionally-wired connections are being replaced with wireless connections, including ad hoc connections made when one wireless device moves into the connectivity area of another wireless device. Of some interest are wireless local area networks (wireless LANs or WLANs), such as wireless networks under the various IEEE 802.11 standards. Of some interest are also wireless personal area networks (wireless PANs or WPANs), which are networks that are often used for communication between or among devices close to one person. The reach of WLANs and WPANs is typically of the order of ten meters, although some networks operate over distances three, ten, or even thirty times as long.
A wireless LAN or PAN network may be used for communications between or among personal devices, or for communications between such personal devices and higher level networks, including the Internet. A wireless network may be implemented using infrared data association (IrDA), Bluetooth, ultra-wide band (UWB), ZigBee, and the IEEE 802.11 standard technologies.
Wireless body area networks may be considered a subset of personal area networks. A wireless body area network may include wireless sensors for monitoring various body parameters and functions. The sensors may transmit real-time data to a base station located, for example, in a person's home.
Links between two wireless devices in a wireless network may be established for one-to-one communication between the two devices. One of the devices—the client—may provide over a link use of a resource exclusively to the other device—the host. An example of such a resource is a display device that can be operated wirelessly from a personal computer, personal digital assistant, or a cellular telephone with wireless capability in addition to cellular connectivity.
A need exists in the art for apparatus, methods, and articles of manufacture that facilitate establishing links in wireless networks, including wireless LANS and wireless PANs. A need also exists for apparatus, methods, and articles of manufacture that facilitate changing availability of resources from one host to another in wireless networks.
Embodiments disclosed herein may address one or more of the above stated needs by providing apparatus, methods, and articles of manufacture for establishing one-to-one wireless network associations in different categories.
A method for providing use of a shared resource of a client over a wireless network is described. The method includes establishing a passive association between the client and a first host for communications over the wireless network. The passive association does not allow use of the shared resource by the first host. The method also includes receiving at the client a request from the first host to establish an active association allowing exclusive use of the shared resource by the first host. The request is received over the wireless network. The method further includes determining at the client whether an active association allowing exclusive use of the shared resource by a second host exists (i.e., whether any previously-established active association with any other host exists), which step is performed in response to the request from the first host. If there is no active association with the second (i.e., any other) host, the method further includes establishing the active association with the first host and allowing the first host exclusive use of the shared resource.
A wireless network client device is described. The client device includes a shared resource, a memory, a receiver of the wireless network, a transmitter of the wireless network, and a controller. The controller is coupled to the receiver, the transmitter, the shared resource, and the memory. The controller is configured to establish a passive association between the client device and a first host for communications over the wireless network. The passive association does not allow use of the shared resource by the first host. The controller is also configured to receive over the wireless network a request from the first host to establish an active association allowing exclusive use of the shared resource by the first host. The controller is further configured to determine, in response to the request from the first host, whether an active association allowing exclusive use of the shared resource by a second host exists. (That is, determine whether any previously-established active association with any other host exists.) If the active association allowing exclusive use of the shared resource by the second host does not exist, the controller is configured to establish the active association with the first host and allow the first host exclusive use of the shared resource.
A machine-readable medium storing instructions is described. When the instructions are executed by at least one processor of a client device having a shared resource and configured to receive and transmit over a wireless network, the instructions cause the client device to perform a number of steps. The steps include establishing a passive association between the client device and a first host for communications over the wireless network. The passive association does not allow use of the shared resource by the first host. The steps also include receiving over the wireless network a request from the first host to establish an active association allowing exclusive use of the shared resource by the first host. The steps further include determining, in response to the request from the first host, whether an active association allowing exclusive use of the shared resource by a second host exists. (That is, determining whether any previously-established active association with any other host exists.) If the step of determining whether an active association allowing exclusive use of the shared resource by the second host exists results in a determination that there is no active association with the second host, the steps further include establishing the active association with the first host and allowing the first host exclusive use of the shared resource.
Another client device is described having a shared resource means, a means for storing data, a means for receiving information over a wireless network, a means for transmitting information over the wireless network, and a controller means for controlling the shared resource means, the means for storing data, the means for receiving, and the means for transmitting. The controller means is configured to establish a passive association between the client device and a first host for communications over the wireless network. The passive association does not allow use of the shared resource means by the first host. The controller means is also configured to receive over the wireless network a request from the first host to establish an active association allowing exclusive use of the shared resource means by the first host. The controller means is further configured to determine, in response to the request from the first host, whether an active association allowing exclusive use of the shared resource means by any other host exists. If the active association allowing exclusive use of the shared resource means by any other host does not exist, the controller means is further configured to establish the active association with the first host and allow the first host exclusive use of the shared resource means.
These and other aspects of the present invention will be better understood with reference to the following description, drawings, and appended claims.
In this document, the words “embodiment,” “variant,” and similar expressions are used to refer to particular apparatus, process, or article of manufacture, and not necessarily to the same apparatus, process, or article of manufacture. Thus, “one embodiment” (or a similar expression) used in one place or context may refer to a particular apparatus, process, or article of manufacture; the same or a similar expression in a different place may refer to a different apparatus, process, or article of manufacture. The expressions “alternative embodiment,” “alternatively,” and similar phrases may be used to indicate one of a number of different possible embodiments. The number of possible embodiments is not necessarily limited to two or any other quantity.
The word “exemplary” may be used herein to mean “serving as an example, instance, or illustration.” Any embodiment or variant described herein as “exemplary” is not necessarily to be construed as preferred or advantageous over other embodiments or variants. All of the embodiments and variants described in this description are exemplary embodiments and variants provided to enable persons skilled in the art to make and use the invention, and not necessarily to limit the scope of legal protection afforded the invention.
The word “association” relates to a communication link established between a client device where a resource resides and a host device that wishes to use the resource. The communication link may be over a wired or wireless medium. An “association” is a temporary relationship established between the corresponding application entities on the host and client devices, where either entity can initiate the association and negotiate the service parameters (quality of service, for example) and/or communication parameters. An “active” association is an association that provides for exclusive use of a shared resource residing at a client or otherwise available through the client. A “passive” association allows negotiation of communication (and possibly other) parameters, but does not provide for the use of the shared resource available at the client. Under a passive association, periodic monitoring messages may be passed between the host and the client (either uni-directionally or bi-directionally), so that the devices are aware of each other's presence within the communication distance of the wireless network; and communication parameters may be maintained or periodically changed depending on various circumstances, such as availability of power, computational resources, and presence of other hosts in the wireless network. Certain aspects of associations are described in a commonly-assigned U.S. provisional patent application Ser. No. 60/951,919, filed on Jul. 25, 2007, entitled Wireless Architecture for a Traditional Wire-Based Protocol.
The host 140 similarly includes a processor 142, a memory 144, a receiver 148 for receiving communications from devices of the wireless network 100, and a transmitter 150 for sending communications to the devices of the wireless network 100. The host 140 also has a human interface output block 152, and a human interface input block 154. The memory 144, the receiver 148, the transmitter 150, the human interface output block 152, and the human interface input block 154 are coupled to the processor 142, which can configure, read, and/or write to these devices.
Each of the processors 122 and 142 may include, for example, one or more controllers, one or more microprocessors, one or more digital signal processors, one or more state machines, or a combination of such devices. Each of the memories 124 and 144 may be internal or external to the corresponding processor (122 or 142), and may include random access memory (RAM), read-only memory (ROM), programmable ROM (PROM), erasable PROM (EPROM), electrically erasable EPROM (EEPROM), dynamic RAM (DRAM), synchronous DRAM (SDRAM), double data rate SDRAM (DDR SDRAM), enhanced SDRAM (ESDRAM), Synchlink DRAM (SLDRAM), direct Rambus RAM (DRRAM), magnetic storage, and/or other memory devices.
In some variants, the communications within the wireless network 100 may span up to ten meters, up to thirty meters, up to one hundred meters, or up to three hundred meters. The communications may be conducted in conformity with the WiMedia standard, the ECMA-368/369 standards, the Bluetooth standard, the IrDA standard, the UWB standard, the ZigBee standard, or one of the IEEE 802.11 standards. (This list is not exclusive.) Accordingly, the receivers 128/148 and the transmitters 130/150 are configured to operate under the applicable standard or standards.
The shared resource 126 may be, for example, a display, such as a projector, a television display, or a computer display. In some variants, the shared resource 126 includes a display device with Mobile Display Digital Interface (MDDI) capabilities. The shared resource 126 may be sound reproduction equipment, such as one or more speakers. It may also be a storage device configured to store and/or provide data. It may be a gateway to another network, such as a wireless or wired network; the other network may be or may connect to the Internet or a telephone network. The shared resource 126 may also be electronic gaming equipment, with the host 140 performing the function of a game controller when an active association between the host 140 and the client 120 is in existence. The shared resource 126 may also be a personal or other computer with preloaded software, allowing the host 140 essentially to perform user input and output functions for the computer using the preloaded software. The shared resource may also be a human interface input, such as a keyboard or a pointing device (mouse, trackball, and similar devices). Still further, the shared resource may include mechanical and optical devices.
The human interface input block 154 may be, for example, a keyboard, a touchpad, and/or a pointing device. The human interface output block 152 may be, for example, a display device, a speaker, and/or a headset. The human interface input and out blocks may also be combined, for example, in a touchscreen.
An association between the client 120 and the host 140 may be established in a variety of ways. A passive association, for example, may be established automatically when the two devices are within communication range (of the wireless network) of each other. The responsibility for automatic discovery of the other device or devices may lie with either the client 120, the host 140, or with each of these devices simultaneously. An active association may be established as a result of a request generated by the user of the host 140, for example, following establishment of a passive association between the two devices.
Either the client 120, the host 140, or each of these devices may have additional elements, including receivers and/or transmitters designed to communicate with other wireless networks, or with networks other than wireless networks, including cellular networks. The cellular networks may operate, for example, under UTRAN or UMTS Terrestrial Radio Access Network standards, including code division multiple access (CDMA) and Global System for Mobile Communication (GSM) network standards.
At flow point 201, the host and the client are operational.
At step 205, at least one of the devices detects the other device within a distance that allows wireless network communications between them. The detecting device may be the client or the host.
At step 210, the client and the host negotiate or otherwise determine communication parameters for a passive association between them. The parameters may include medium access control (MAC) and physical layer (PHY) communication parameters. This step may be performed automatically in response to the detection of the step 205.
At step 215, the host receives a command from its user to establish an active association with the client for exclusive use of the shared resource of the client. The host may receive the command, for example, through the human interface input block of the host.
At step 220, the host sends a request to the client to establish an active association. The request may include introductory information, such as text, audio, video, or other information. The introductory information may identify the operator or owner of the host.
At step 225, the client receives the request.
At decision block 230, the client checks for existence of a previously-established active association with any other host. If such a previously-established active association is currently in existence, process flow branches to steps collectively designated with a reference numeral 235, where such situation may be handled as will be described further below.
If there is no previously-established active association currently in existence, process flow advances to step 280, in which the client grants the requesting host's request and additional parameters are negotiated or otherwise determined for the active association between the host and the client, and the association then becomes active. Previously-determined parameters applicable to communications between the client and the host (e.g., communication parameters determined in the step 210) may be kept, or they may be re-negotiated or otherwise changed.
The additional parameters may include, for example, quality of service (QoS) to be provided by the shared resource to the host. For a display, for example, resolution of the display may be such a parameter. For a connection to another network through the client, the parameters may include QoS of such connection (e.g., bandwidth and latency). A payment for the use of the shared resource may be transferred or authorized by the user as part of the step 280, and a visual or audio indication may signal the user of the availability of the resource. The visual or audio indication may be generated by the host (e.g., from the host's human interface output block), or by the client.
At step 285, the user of the host proceeds to use exclusively the shared resource of the client. The process then terminates at a flow point 299.
One category of active association may be a “solid’ association that does not allow any other host to interrupt the association. In other words, the client does not entertain requests for active association in the presence of a previously-established active solid association. Returning to the decision block 230 of the process 200, existence of a previously-established solid association causes a rejection in the steps 235 of the association requested by the user. On the other hand, if the user manages to establish a solid association in the step 280, requests from other hosts for an active association will be rejected outright, without asking the user of the host with the current ownership of the active solid association whether the solid association may be released. The user with the solid association may or may not be notified of the request by another user.
Another category of association may be a “semi-solid” association that generates a request to the (first) host with the current active association to release the association for acquisition by the requesting (second) host.
If the host owning the previously-established association grants the request prior to timeout, as determined in decision blocks 245B, 246B, and 247B, the previously established association is dropped or transformed into a passive association, at step 249B. Process flow then goes to the steps 280 and 285 (shown in
The request to authorize release may include information describing the association sought to be established, such as the category of the association (solid, semi-solid, or another category). If the request to establish an active association received in the step 225 included introductory information, the query may include all or some of the introductory information. The host owning the previously-established active association may render to its user the introductory information or some derivative of the introductory information.
The host granting or denying the request to release may be preprogrammed to grant or deny the request automatically without regard to other circumstances (e.g., always grant or always deny), it can request an authorization from its user via the human interface blocks (e.g., display “enter YES to grant the request and release the projector”), or it can do so automatically depending on some circumstances, such as the length of the period through which its user has not used the resource.
Still another category of association may be a soft or fragile association, whereby the client upon receipt of a request for an active association automatically releases the previously-established active association (or downgrades it to a passive association) and grants the newly-received request.
Associations may combine the properties of different association categories on a temporal basis. One example of such combined association is an active association that is solid for a predetermined period of time following its establishment, and then transitions to a fragile or a semi-solid association. The time period may be configurable by the user at a host when the association is requested.
In decision block 237, the client determines whether the previously-established active association is a solid active association, as is described above. If so, the client rejects in step 239 the request for an active association outright, that is, without querying the host that owns the previously-established association.
Otherwise, process flow proceeds to decision block 255. Here, the client determines whether the previously-established active association is a fragile active association, as is also described above. If the previously-established active association is a fragile one, that association is released in step 249. Releasing the association may free all or some of the resources dedicated to that association (the shared resource, computational resources, storage resources, and/or possibly other resources). The release may also transform that association into a passive one, by freeing the shared resource and possibly other resources, but keeping a communication link open to the host that owns that association.
From the step 249, process flow continues to the steps 280 and 285 (shown in
Returning now to the decision block 255, if the determination made indicates that the previously-established association is not a fragile one, process flow proceeds to decision block 241 to determine whether the previously-established active association is a semi-solid association, as is also described above. If the previously-established association is not semi-solid, additional association categories are processed in a manner analogous to the processing of solid, fragile, and semi-solid association. If the association is a semi-solid one, the client advances to step 243 to send a query to the host that owns the previously-established association.
The query may cause a message to be generated at that host asking whether the association may be released. The request may include all or part of the introductory information, or information derived from the introductory information.
Note that if there are only these three categories of association (that is, solid, fragile, and semi-solid), the decision block 241 may not be needed, because the negative determinations made in the decision blocks 237 and 255 imply that the previously-established active association must be a semi-solid association.
From the step 243 the process flow proceeds to decision block 245 to determine whether the owner of the previously-established association authorized its release. If the owner authorized the release, the process flow advances to step 249, releasing the previously-established association. From the step 249, the process continues to the steps 280 and 285, establishing the requested association and allowing the requesting host to use the resource.
If, however, release has not yet been authorized as determined in the decision block 245, the client determines whether a negative response to the query has been received, in decision block 246. If the negative response has been received, the client proceeds to the step 239 to reject the request for the new active association.
If the host that owns the previously-established active association has not yet responded (either in the affirmative or in the negative), timeout condition is tested in decision block 247. The timeout condition may be an expiration of a timer defining the period of time from the query until a permission to release is received. If the timer expires, the timeout condition essentially indicates that permission to release the previously-established active association has been constructively denied. The client then proceeds to the step 239 to reject the request for the new active association. If timeout has not taken place, the client returns to the decision block 245, effectively looping until a response to the query is received or timeout takes place.
A different connection scheme resembles the semi-solid association, but with the request to release the previously-established association being transmitted directly from the requesting host to the host that owns the previously-established active association. Here, the previously-established association may be a solid one. When a new host requests an active association, the client rejects the request, indicating that an active association is in existence. The message with the rejection may contain sufficient information for the requesting host to contact the owner of the previously-established active association directly. Alternatively, the requesting host may identify over the wireless network one or all hosts within its communication distance (or identify these hosts by other means, such as a query through a different network, which may be a cellular network). Once the requesting host identifies the owner of the previously-established association, it sends a request to release the previously-established association directly to that host, either using the same wireless network or different means, such as the other network. The request may identify the requesting host. Alternatively, the requesting host may broadcast the request to release, multicast the request to release, or send multiple requests to release to different wireless network devices.
When the owner of the previously established association receives the request to release from the requesting host, it may allow its user to authorize or deny release of the association; it may also authorize, deny, or ignore the request automatically, for example, based on its configuration, preprogramming, or conditions (such as use or non-use of the previously-established association within a predetermined time period). If the host decides to release the association, it may send a release message directly to the client. In some variants, the release message is non-specific, that is, it does not identify the requesting host. In some variants, the release message specifies the requesting host. In the latter case, the client may attempt to establish an active association with the requesting host, or the client may provide a time window for the requesting host to re-request the active association. Requests from other hosts during this time window may be denied outright.
Although steps and decision blocks of various methods may have been described serially in this disclosure, some of these steps and decisions may be performed by separate elements in conjunction or in parallel, asynchronously or synchronously, in a pipelined manner, or otherwise. There is no particular requirement that the steps and decisions be performed in the same order in which this description lists them, except where explicitly so indicated, otherwise made clear from the context, or inherently required. It should be noted, however, that in selected variants the steps and decisions are performed in the particular sequences described above and/or shown in the accompanying Figures. Furthermore, not every illustrated step and decision may be required in every system in accordance with the invention, while some steps and decisions that have not been specifically illustrated may be desirable or necessary in some systems in accordance with the invention.
Those skilled in the art would understand that the concepts described in this document are applicable to various networks, including wireless local area networks, such as networks operating under the IEEE 802.11 standards, and wireless personal area networks.
Those of skill in the art would also understand that information and signals may be represented using any of a variety of different technologies and techniques. For example, data, instructions, commands, information, signals, bits, symbols, and chips that may be referenced throughout the above description may be represented by voltages, currents, electromagnetic waves, magnetic fields or particles, optical fields or particles, or any combination thereof.
Those of skill would further appreciate that the various illustrative logical blocks, modules, circuits, and algorithm steps described in connection with the embodiments disclosed herein may be implemented as electronic hardware, computer software, or combinations of both. To show clearly this interchangeability of hardware and software, various illustrative components, blocks, modules, circuits, and steps may have been described above generally in terms of their functionality. Whether such functionality is implemented as hardware, software, or combination of hardware and software depends upon the particular application and design constraints imposed on the overall system. Skilled artisans may implement the described functionality in varying ways for each particular application, but such implementation decisions should not be interpreted as causing a departure from the scope of the present invention.
The various illustrative logical blocks, modules, and circuits described in connection with the embodiments disclosed herein may be implemented or performed with a general purpose processor, a digital signal processor (DSP), an application specific integrated circuit (ASIC), a field programmable gate array (FPGA) or other programmable logic device, discrete gate or transistor logic, discrete hardware components, or any combination thereof designed to perform the functions described herein. A general purpose processor may be a microprocessor, but in the alternative, the processor may be any conventional processor, controller, microcontroller, or state machine. A processor may also be implemented as a combination of computing devices, e.g., a combination of a DSP and a microprocessor, a plurality of microprocessors, one or more microprocessors in conjunction with a DSP core, or any other such configuration.
The steps of a method or algorithm that may have been described in connection with the embodiments disclosed herein may be embodied directly in hardware, in a software module executed by a processor, or in a combination of the two. A software module may reside in RAM memory, flash memory, ROM memory, EPROM memory, EEPROM memory, registers, hard disk, a removable disk, a CD-ROM, or any other form of storage medium known in the art. An exemplary storage medium is coupled to the processor such that the processor can read information from, and write information to, the storage medium. In the alternative, the storage medium may be integral to the processor. The processor and the storage medium may reside in an ASIC. The ASIC may reside in an access terminal. Alternatively, the processor and the storage medium may reside as discrete components in an access terminal.
The previous description of the disclosed embodiments is provided to enable any person skilled in the art to make or use the present invention. Various modifications to these embodiments will be readily apparent to those skilled in the art, and the generic principles defined herein may be applied to other embodiments. Thus, the present invention is not intended to be limited to the embodiments shown herein, but is to be accorded the widest scope consistent with the principles and novel features disclosed herein.
Number | Name | Date | Kind |
---|---|---|---|
4791554 | Hirota et al. | Dec 1988 | A |
5835723 | Andrews et al. | Nov 1998 | A |
5925137 | Okanoue et al. | Jul 1999 | A |
6049549 | Ganz et al. | Apr 2000 | A |
6195680 | Goldszmidt et al. | Feb 2001 | B1 |
6252889 | Patki et al. | Jun 2001 | B1 |
6424626 | Kidambi et al. | Jul 2002 | B1 |
6515992 | Weston et al. | Feb 2003 | B1 |
6594699 | Sahai et al. | Jul 2003 | B1 |
6608841 | Koodli | Aug 2003 | B1 |
6748195 | Phillips | Jun 2004 | B1 |
6760772 | Zou et al. | Jul 2004 | B2 |
6801530 | Brandt et al. | Oct 2004 | B1 |
6876857 | Nee et al. | Apr 2005 | B1 |
6917976 | Slaughter et al. | Jul 2005 | B1 |
7035281 | Spearman et al. | Apr 2006 | B1 |
7085420 | Mehrotra | Aug 2006 | B2 |
7324462 | Page et al. | Jan 2008 | B1 |
7328021 | Satapathy | Feb 2008 | B1 |
7333464 | Yang et al. | Feb 2008 | B2 |
7366204 | Kang et al. | Apr 2008 | B2 |
7477659 | Nee et al. | Jan 2009 | B1 |
7519470 | Brasche et al. | Apr 2009 | B2 |
7529823 | Trufinescu et al. | May 2009 | B2 |
7565357 | Rao | Jul 2009 | B2 |
7688859 | Chen et al. | Mar 2010 | B2 |
7696980 | Piot et al. | Apr 2010 | B1 |
7712670 | Sauerwein, Jr. et al. | May 2010 | B2 |
7716385 | Saint-Hilaire et al. | May 2010 | B2 |
7719972 | Yuan et al. | May 2010 | B2 |
7720096 | Klemets | May 2010 | B2 |
7868890 | Ludwin et al. | Jan 2011 | B2 |
7881315 | Haveson et al. | Feb 2011 | B2 |
7929475 | Simonson et al. | Apr 2011 | B2 |
8001384 | Yamamoto et al. | Aug 2011 | B2 |
8102849 | Martinez Bauza et al. | Jan 2012 | B2 |
8157168 | Sauerwein, Jr. et al. | Apr 2012 | B2 |
8364201 | Fujisaki | Jan 2013 | B1 |
8406961 | Pathak et al. | Mar 2013 | B2 |
8437347 | Casaccia et al. | May 2013 | B2 |
8466870 | Cohen et al. | Jun 2013 | B2 |
8517251 | Cohen et al. | Aug 2013 | B2 |
20020007494 | Hodge | Jan 2002 | A1 |
20030033417 | Zou et al. | Feb 2003 | A1 |
20030064752 | Adachi et al. | Apr 2003 | A1 |
20030110297 | Tabatabai et al. | Jun 2003 | A1 |
20030152098 | Zhu | Aug 2003 | A1 |
20030225737 | Mathews | Dec 2003 | A1 |
20040071169 | Abe et al. | Apr 2004 | A1 |
20040103282 | Meier et al. | May 2004 | A1 |
20040160967 | Fujita et al. | Aug 2004 | A1 |
20040214571 | Hong | Oct 2004 | A1 |
20050021810 | Umemura et al. | Jan 2005 | A1 |
20050044142 | Garrec et al. | Feb 2005 | A1 |
20050060750 | Oka et al. | Mar 2005 | A1 |
20050096086 | Singamsetty | May 2005 | A1 |
20050102699 | Kim et al. | May 2005 | A1 |
20050111361 | Hosein | May 2005 | A1 |
20050130611 | Lu et al. | Jun 2005 | A1 |
20050136990 | Hardacker et al. | Jun 2005 | A1 |
20050138193 | Encarnacion et al. | Jun 2005 | A1 |
20050144225 | Anderson et al. | Jun 2005 | A1 |
20050166241 | Kim et al. | Jul 2005 | A1 |
20050176429 | Lee et al. | Aug 2005 | A1 |
20050184993 | Ludwin et al. | Aug 2005 | A1 |
20050198663 | Chaney et al. | Sep 2005 | A1 |
20050266798 | Moloney et al. | Dec 2005 | A1 |
20060002320 | Costa-Requena et al. | Jan 2006 | A1 |
20060013182 | Balasubramanian et al. | Jan 2006 | A1 |
20060028398 | Willmore | Feb 2006 | A1 |
20060050640 | Jin et al. | Mar 2006 | A1 |
20060058003 | Lee | Mar 2006 | A1 |
20060069797 | Abdo et al. | Mar 2006 | A1 |
20060098593 | Edvardsen et al. | May 2006 | A1 |
20060101146 | Wang | May 2006 | A1 |
20060133414 | Luoma et al. | Jun 2006 | A1 |
20060136963 | Oh et al. | Jun 2006 | A1 |
20060187964 | Li et al. | Aug 2006 | A1 |
20060198448 | Aissi et al. | Sep 2006 | A1 |
20060199537 | Eisenbach | Sep 2006 | A1 |
20060202809 | Lane et al. | Sep 2006 | A1 |
20060209787 | Okuda | Sep 2006 | A1 |
20060218298 | Knapp et al. | Sep 2006 | A1 |
20060233191 | Pirzada | Oct 2006 | A1 |
20060256851 | Wang et al. | Nov 2006 | A1 |
20060268869 | Boers et al. | Nov 2006 | A1 |
20060270417 | Chi | Nov 2006 | A1 |
20060288008 | Bhattiprolu et al. | Dec 2006 | A1 |
20070004387 | Gadamsetty et al. | Jan 2007 | A1 |
20070008922 | Abhishek et al. | Jan 2007 | A1 |
20070016654 | Bowles et al. | Jan 2007 | A1 |
20070022195 | Kawano et al. | Jan 2007 | A1 |
20070037600 | Fukuda | Feb 2007 | A1 |
20070057865 | Song et al. | Mar 2007 | A1 |
20070057885 | Kurumisawa et al. | Mar 2007 | A1 |
20070061433 | Reynolds et al. | Mar 2007 | A1 |
20070104215 | Wang et al. | May 2007 | A1 |
20070126715 | Funamoto | Jun 2007 | A1 |
20070141984 | Kuehnel et al. | Jun 2007 | A1 |
20070141988 | Kuehnel et al. | Jun 2007 | A1 |
20070171910 | Kumar et al. | Jul 2007 | A1 |
20070182728 | Fujimori | Aug 2007 | A1 |
20070259662 | Lee et al. | Nov 2007 | A1 |
20070264988 | Wilson et al. | Nov 2007 | A1 |
20070264991 | Jones et al. | Nov 2007 | A1 |
20070274400 | Murai et al. | Nov 2007 | A1 |
20070291636 | Rajagopal et al. | Dec 2007 | A1 |
20070292135 | Guo et al. | Dec 2007 | A1 |
20080005348 | Kosiba et al. | Jan 2008 | A1 |
20080013658 | Lewis et al. | Jan 2008 | A1 |
20080018657 | Montag | Jan 2008 | A1 |
20080031210 | Abhishek et al. | Feb 2008 | A1 |
20080037506 | Dharmaraju et al. | Feb 2008 | A1 |
20080037785 | Gantman et al. | Feb 2008 | A1 |
20080045149 | Dharmaraju et al. | Feb 2008 | A1 |
20080046944 | Lee et al. | Feb 2008 | A1 |
20080109763 | Lee | May 2008 | A1 |
20080129879 | Shao et al. | Jun 2008 | A1 |
20080198848 | Yamagishi | Aug 2008 | A1 |
20080205394 | Deshpande et al. | Aug 2008 | A1 |
20080232402 | Higuchi et al. | Sep 2008 | A1 |
20080270532 | Billmaier et al. | Oct 2008 | A1 |
20080273485 | Tsigler et al. | Nov 2008 | A1 |
20080304408 | Kraemer et al. | Dec 2008 | A1 |
20080307349 | Wang et al. | Dec 2008 | A1 |
20080310391 | Schneidman et al. | Dec 2008 | A1 |
20090002263 | Pasetto | Jan 2009 | A1 |
20090013081 | Laroia et al. | Jan 2009 | A1 |
20090031035 | Dharmaraju et al. | Jan 2009 | A1 |
20090070404 | Mazzaferri | Mar 2009 | A1 |
20090089453 | Bohan et al. | Apr 2009 | A1 |
20090102838 | Bullard et al. | Apr 2009 | A1 |
20090109974 | Shetty et al. | Apr 2009 | A1 |
20090133122 | Koo et al. | May 2009 | A1 |
20090141692 | Kasslin et al. | Jun 2009 | A1 |
20090153737 | Glen | Jun 2009 | A1 |
20090162029 | Glen | Jun 2009 | A1 |
20090252130 | Sheth et al. | Oct 2009 | A1 |
20100027467 | Wu et al. | Feb 2010 | A1 |
20100073334 | Cohen et al. | Mar 2010 | A1 |
20100118200 | Gelman et al. | May 2010 | A1 |
20100123826 | Sagi | May 2010 | A1 |
20100134312 | Park et al. | Jun 2010 | A1 |
20100146143 | Thorup | Jun 2010 | A1 |
20100146583 | Prehofer et al. | Jun 2010 | A1 |
20100153553 | Sheth et al. | Jun 2010 | A1 |
20100166017 | Na et al. | Jul 2010 | A1 |
20100172320 | Suzuki | Jul 2010 | A1 |
20100189131 | Branam et al. | Jul 2010 | A1 |
20100199187 | Lin et al. | Aug 2010 | A1 |
20100205321 | Martinez Bauza et al. | Aug 2010 | A1 |
20100257450 | Go et al. | Oct 2010 | A1 |
20100281103 | Imai et al. | Nov 2010 | A1 |
20100289871 | Tatsuta et al. | Nov 2010 | A1 |
20100289872 | Funabiki et al. | Nov 2010 | A1 |
20110002255 | Dharmaraju et al. | Jan 2011 | A1 |
20110019620 | Wang | Jan 2011 | A1 |
20110037447 | Mair | Feb 2011 | A1 |
20110069720 | Jacobs et al. | Mar 2011 | A1 |
20110072473 | Funabiki et al. | Mar 2011 | A1 |
20110107388 | Lee et al. | May 2011 | A1 |
20110115818 | Chung et al. | May 2011 | A1 |
20110128442 | Blanchard et al. | Jun 2011 | A1 |
20110145879 | Rajamani et al. | Jun 2011 | A1 |
20110149806 | Verma et al. | Jun 2011 | A1 |
20110157470 | Tsuruga et al. | Jun 2011 | A1 |
20110182195 | Oikawa | Jul 2011 | A1 |
20110186138 | Hanna et al. | Aug 2011 | A1 |
20110205433 | Altmann | Aug 2011 | A1 |
20110216239 | Raveendran | Sep 2011 | A1 |
20110216785 | Begen et al. | Sep 2011 | A1 |
20110216829 | Raveendran | Sep 2011 | A1 |
20110281557 | Choi et al. | Nov 2011 | A1 |
20110314168 | Bathiche et al. | Dec 2011 | A1 |
20120036543 | George et al. | Feb 2012 | A1 |
20120036549 | Patel et al. | Feb 2012 | A1 |
20120044985 | Tao et al. | Feb 2012 | A1 |
20120113113 | Hong | May 2012 | A1 |
20130002949 | Raveendran et al. | Jan 2013 | A1 |
20130003621 | Huang et al. | Jan 2013 | A1 |
20130003622 | Huang et al. | Jan 2013 | A1 |
20130003623 | Raveendran et al. | Jan 2013 | A1 |
20130003624 | Huang et al. | Jan 2013 | A1 |
20130009873 | Huang et al. | Jan 2013 | A1 |
20130009887 | Huang et al. | Jan 2013 | A1 |
20130009996 | Raveendran et al. | Jan 2013 | A1 |
20130013318 | Huang et al. | Jan 2013 | A1 |
20130033435 | Raveendran et al. | Feb 2013 | A1 |
20130033496 | Raveendran et al. | Feb 2013 | A1 |
20130047189 | Raveendran et al. | Feb 2013 | A1 |
20130238702 | Sheth et al. | Sep 2013 | A1 |
20130246665 | Lee et al. | Sep 2013 | A1 |
20130272628 | Lee | Oct 2013 | A1 |
Number | Date | Country |
---|---|---|
1437355 | Aug 2003 | CN |
1561609 | Jan 2005 | CN |
1596004 | Mar 2005 | CN |
1774106 | May 2006 | CN |
1832481 | Sep 2006 | CN |
1983945 | Jun 2007 | CN |
101033825 | Dec 2007 | CN |
101247250 | Aug 2008 | CN |
1203080 | May 2002 | EP |
1203080 | May 2002 | EP |
1206080 | May 2002 | EP |
1206080 | May 2002 | EP |
1233326 | Aug 2002 | EP |
1233326 | Aug 2002 | EP |
1325591 | Jul 2003 | EP |
1333373 | Aug 2003 | EP |
1385336 | Jan 2004 | EP |
1423778 | Jun 2004 | EP |
1517228 | Mar 2005 | EP |
1517228 | Mar 2005 | EP |
1550264 | Jul 2005 | EP |
1653678 | May 2006 | EP |
1653678 | May 2006 | EP |
1944946 | Jul 2008 | EP |
1959686 | Aug 2008 | EP |
2012461 | Jan 2009 | EP |
2037683 | Mar 2009 | EP |
2190202 | May 2010 | EP |
2383920 | Jul 2003 | GB |
2000278320 | Oct 2000 | JP |
2000354031 | Dec 2000 | JP |
2002165248 | Jun 2002 | JP |
2002165248 | Jun 2002 | JP |
2002262341 | Sep 2002 | JP |
2002262341 | Sep 2002 | JP |
2003143237 | May 2003 | JP |
2003143237 | May 2003 | JP |
2004054783 | Feb 2004 | JP |
2004505531 | Feb 2004 | JP |
2004505531 | Feb 2004 | JP |
2004192140 | Jul 2004 | JP |
2004274159 | Sep 2004 | JP |
2004531916 | Oct 2004 | JP |
2005515714 | May 2005 | JP |
2005142808 | Jun 2005 | JP |
2005142808 | Jun 2005 | JP |
2005204016 | Jul 2005 | JP |
2006514353 | Apr 2006 | JP |
2006121562 | May 2006 | JP |
2006254328 | Sep 2006 | JP |
2007082070 | Mar 2007 | JP |
2007088539 | Apr 2007 | JP |
2007206644 | Aug 2007 | JP |
2007274150 | Oct 2007 | JP |
2007282219 | Oct 2007 | JP |
2008191929 | Aug 2008 | JP |
2008547264 | Dec 2008 | JP |
2008547264 | Dec 2008 | JP |
1020050007533 | Jan 2005 | KR |
20060060717 | Jun 2006 | KR |
2207723 | Jun 2003 | RU |
2004110228 | Mar 2005 | RU |
2005113275 | Oct 2005 | RU |
2269873 | Feb 2006 | RU |
496058 | Jul 2002 | TW |
234954 | Jun 2005 | TW |
I234954 | Jun 2005 | TW |
239179 | Sep 2005 | TW |
I239179 | Sep 2005 | TW |
200618653 | Jun 2006 | TW |
200838310 | Sep 2008 | TW |
200943168 | Oct 2009 | TW |
0184291 | Nov 2001 | WO |
WO0184291 | Nov 2001 | WO |
0210942 | Feb 2002 | WO |
WO02010942 | Feb 2002 | WO |
0223825 | Mar 2002 | WO |
0249314 | Jun 2002 | WO |
WO0249314 | Jun 2002 | WO |
03023587 | Mar 2003 | WO |
03061240 | Jul 2003 | WO |
WO-03104834 | Dec 2003 | WO |
2004034646 | Apr 2004 | WO |
2004051962 | Jun 2004 | WO |
WO-2005107187 | Nov 2005 | WO |
WO-2005109781 | Nov 2005 | WO |
05122509 | Dec 2005 | WO |
WO2005122509 | Dec 2005 | WO |
2006135289 | Dec 2006 | WO |
WO2006135289 | Dec 2006 | WO |
2007000757 | Jan 2007 | WO |
WO2007000757 | Jan 2007 | WO |
2007021269 | Feb 2007 | WO |
WO2007021269 | Feb 2007 | WO |
WO-2007033049 | Mar 2007 | WO |
2008027724 | Mar 2008 | WO |
2008087713 | Jul 2008 | WO |
Entry |
---|
Dorot, V., et al., “An Explanatory Dictionary of Modern Computer Terms,” 2nd Edition, bhv, Saint Petersburg, 2001, ‘Program Product’ on p. 339. |
Zhanping Yin et al: “Third-party handshake protocol for efficient peer discovery in IEEE 802.15.3 WPANs” Broadband Networks, 2005 2nd International Conference on Boston, MA Oct. 3-7, 2005, Piscataway, NJ, USA IEEE, October 3, 2005, pp. 902-911, XP010890303. |
Media Content Distribution (MCD); 3D 1-30 Gaming Graphics Delivery Overview, Technical Report, European Telecommunications Standards Institute (ETSI), 650, Route Des Lucioles ; F-06921 Sophia-Antipolis ; France, vol . MCD, No. V1. 1. 1, Dec. 1, 2010, XP014061814, section 5. |
Minai Mitrea et al: “Novel approaches to 1-30 remote display representations: BiFS-solution and its deployment within the FP7 MobiThin project”, 87. MPEG Meeting; Feb. 2, 2009-Jun. 2, 2009; Lausanne; (Motion Picture Expert Group or ISO/IEC JTC1/SC29/WG11),, No. M16058, Jan. 29, 2009, XP030044655, sections 2 and 3. |
Apple, Safari Web Content Guide, Chapter 6, Handling Events, Oct. 12, 2011, retrieved from http://developer.apple.com/library/safari/#documentation/AppleApplications/Reference/SafariWebContent/HandlingEvents/HandlingEvents.html. |
Basso et al., “RTP Payload Format for MPEG-4 Streams; draft-ietf-avt-mpeg4-multisi-03.txt”, vol. avt, No. 3, Nov. 1, 2001, XP015015620, ISSN: 0000-0004. |
Doerffel T., “User manual iTALC—Intelligent Teaching and Learning with Computers Version 1.0.4”, Jan. 29, 2008, pp. 1-17, XP55025785, Retrieved from the Internet: URL:http://italc.sourceforge.net/italc-manual-2007-01-29.pdf [retrieved on Apr. 26, 2012] the whole document. |
Dorot V., et al., “An Explanatory Dictionary of Modern Computer Terms,” 2nd Edition, 2001, ‘Program Product’ on p. 339, BHV-Petersburg Publishers, Saint Petersburg. |
Euihyeok Kwon, et al., “An idle timeslot reuse scheme for IEEE 802.15.3 high-rate wireless personal area networks” Vehicular Technology Conference, 2005. VTC-2005-Fall. 2005 IEEE 62nd Dallas, TX, USA Sep. 25-28, 2005, Piscataway, NJ, USA, IEEE, Sep. 25. |
Helmy A: “Architectural framework for large-scale multicast in mobile ad hoc networks” Proceedings of IEEE International Conference on Communications—Apr. 28-May 2, 2002—New York, NY, USA, IEEE, Piscataway, NJ, USA LNKDDOI: 10.1109/ICC.2002.997206, vol. 4, Apr. 28, 2002, pp. 2036-2042, XP010589844 ISBN: 978-0-7803-7400-3. |
IEEE 802.15.3, “Part 15.3: Wireless Medium Access Control (MAC) and Physical Layer (PHY) Specifications for High Rate Wireless Personal Area Networks (WPANs),” IEEE Computer Society, 2003. |
International Preliminary Report on Patentability—PCT/US2010/023842—The International Bureau of WIPO—Geneva, Switzerland, Mar. 17, 2011. |
International Search Report—PCT/US07/069813, International Search Authority—European Patent Office, Jan. 18, 2008, US2007. |
International Search Report—PCT/US07/069815, International Search Authority—European Patent Office, Jul. 2, 2008, US2007. |
International Search Report—PCT/US08/071147, International Search Authority—European Patent Office, Feb. 5, 2009, US2008/071147. |
International Search Report and Written Opinion—PCT/US2010/060249, International Search Authority—European Patent Office—Mar. 8, 2011. |
International Search Report and Written Opinion—PCT/US2012/022064—ISA/EPO—Jun. 25, 2012. |
International Search Report and Written Opinion—PCT/US2012/022068—ISA/EPO—Jun. 22, 2012. |
International Search Report and Written Opinion—PCT/US2012/022072—ISA/EPO—Jun. 22, 2012. |
International Search Report and Written Opinion—PCT/US2012/022076—ISA/EPO—Jun. 22, 2012. |
International Search Report and Written Opinion—PCT/US2012/022080—ISA/EPO—May 31, 2012. |
International Search Report and Written Opinion—PCT/US2012/022087—ISA/EPO—Jul. 2, 2012. |
International Search Report and Written Opinion—PCT/US2012/022090—ISA/EPO—May 31, 2012. |
International Search Report and Written Opinion—PCT/US2012/023842—ISA/EPO—May 18, 2012. |
International Search Report and Written Opinion—PCT/US2012/023848—ISA/EPO—May 15, 2012. |
International Search Report and Written Opinion—PCT/US2012/023851—ISA/EPO—Aug. 28, 2012. |
International Search Report and Written Opinion—PCT/US2010/023834, International Search Authority—European Patent Office—Jul. 12, 2010. |
International Search Report and Written Opinion—PCT/US2010/023842, International Search Authority—European Patent Office—Jul. 13, 2010. |
International Search Report and Written Opinion—PCT/US2010/040650—International Search Authority, European Patent Office,Nov. 16, 2010. |
International Search Report—PCT/US2009/039564—International Search Authority—European Patent Office, Jul. 29, 2009. |
International Search Report/Written Opinion—PCT/US09/067632—International Search Authority EPO—Apr. 29, 2010, US2009/067632. |
McKnight et al. (TPRC 30th Research Conference on Communication, Information and Internet Policy, Aug. 2002) Virtual Markets in Wireless Grids: Peering Policy Obstacles, hereinafter referred as McKnight, pp. 1 and 20. |
Media Content Distribution (MCD); 3D 1-30 Gaming Graphics Delivery Overview, Technical Report, European Telecommunications Standards Institute (EISI), 650, Route Des Lucioles ; F-06921 Sophia-Antipolis ; France, vol . MCD, No. V1. 1. 1, Dec. 1, 2010, XP014061814, section 5. |
Mihai Mitrea et al: “Novel approaches to 1-30 remote display representations: BiFS-based solution and its deployment within the FP7 MobiThin project”, 87. MPEG Meeting; Feb. 2, 2009-Jun. 2, 2009; Lausanne; (Motion Picture Expert Group or ISO/IEC JTC1/SC29/WG11),, No. M16058, Jan. 29, 2009, XP030044655, sections 2 and 3. |
Miller B., et al., “Mapping salutation architecture APIs to Bluetooth service discovery layer,” Bluetooth White Paper, [Online} pp. 1-25, Jul. 1, 1999, XP002511956. |
MSDN DirectShow, retrieved Nov. 28, 2011 from: http://msdn.microsoft.com/en-us/library/dd375454(VS.85).aspx. |
MSDN Windows Sockets 2, retrieved Nov. 28, 2011 from: http://msdn.microsoft.com/en-us/library/ms740673(VS.85).aspx. |
Myers, et al: “Collaboration Using Multiple PDAS Connected to a PC,” Proceedings of the ACM Conference on Computer Supported Cooperative Work (CSCW), Nov. 14, 1998, pp. 285-294, ISBN: 978-1-58113-009-6. |
Nave I et al., “Games@large graphics streaming architecture”, Consumer Electronics, 2008. ISCE 2008. IEEE International Symposium on, IEEE, Piscataway, NJ, USA, Apr. 14, 2008, pp. 1-4, XP031283619, ISBN: 978-1-4244-2422-1 abstract col. 2-col. 6. |
Nordbotten, N.A. et al., “Methods for service discovery in Bluetooth scatternets,” Computer Communications, Elsevier Science Publishers BV, Amdsterdam, NL, vol. 27, No. 11, Jul. 1, 2004, pp. 1087-1096, XP004503638. |
Schulzrinne, et al., “RTP: A Transport Protocol for Real-Time Applications”, rfc3550.txt, Jul. 1, 2003, XP015009332, ISSN: 0000-0003. |
Shoji Y., et al., “Research and Standardization activty for IEEE802.15.3c mmW WPAN: (2) Target applications and Usage Models”, IEICE Tech. Rep., vol. 106, No. 555, RCS2006-279, pp. 179-182, Feb. 2007. |
Taiwan Search Report—TW097128564—TIPO—Nov. 22, 2011. |
Taiwanese Search Report—096119014—TIPO—Jul. 31, 2010. |
Wenger et al., “RTP Payload Format for H.264 Video,” Network Working Group, RFC 3984, Feb. 2005, 78 pp. |
Written Opinion—PCT/US08/071147, International Search Authority—European Patent Office, Feb. 5, 2009. |
Written Opinion—PCT/US2007/069813, International Search Authority, European Patent Office, Jan. 18, 2008, US2008/071147. |
Written Opinion—PCT/US2007/069815, International Search Authority, European Patent Office, Feb. 7, 2008. |
Written Opinion—PCT/US2009/039564, International Search Authority, European Patent Office, Jul. 29, 2009. |
Zhanping Yin et al: “Third-party handshake protocol for efficient peer discovery in IEEE 802.15.3 WPANs” Broadband Networks, 2005 2nd International Conference on Boston, MA Oct. 3-7, 2005, Piscataway, NJ, USA IEEE, Oct. 3, 2005, pp. 902-911, XP010890303. |
Brandenburg, et al., AVTCore, RTCP for inter-destination media syncronization, Internet Draft, draft-ietf-avtcore-idms-092.txt, Oct. 31, 2011. |
Co-pending U.S. Appl. No. 10/236,657, filed Sep. 6, 2002. |
Taiwan Search Report—TW098111391—TIPO—Dec. 4, 2012. |
Video Electronics Standards Association (VESA) Mobile Display Digital Interface Standard (MDDI), Jul. 2004. |
Taiwan Search Report—TW096140444—TIPO—Sep. 16, 2013. |
Casner, S., et al., “Compressing IP/UDP/RTP Headers for Low-Speed Serial Links,” IETF Network Working Group, RFC 2508 (Feb. 1992). |
Gentric., et al., “RTP Payload Format for MPEG-4 Streams”, Internet Engineering Task Force, draft-ietf-avt-mpeg4-multisl-03.txt, Nov. 2001, pp. 13,14,25 and 33 . . . |
Handley, M. et al., “SDP: Session Description Protocol” Network Working Group, Request for Comments: 2327, Category: Standards Track. ISI/LBNL, Apr. 1998, pp. 1-42. |
“Bluetooth Specification Version 1.1” published Feb. 22, 2001; Section 1 pp. 41-42; Section 2.1, p. 43; Section 4.1-2, pp. 47-50; Section 10.9, p. 120; and Section 11, pp. 126-137. |
Byungjoo Lee, Provisional U.S. Appl. No. 61/433,942, filed Jan. 18, 2011. |
Taiwan Search Report—TW098111391—TIPO—Nov. 1, 2013. |
Number | Date | Country | |
---|---|---|---|
20090252130 A1 | Oct 2009 | US |