System and method for avoiding and resolving conflicts in a wireless mobile display digital interface multicast environment

Information

  • Patent Grant
  • 9264248
  • Patent Number
    9,264,248
  • Date Filed
    Thursday, July 2, 2009
    15 years ago
  • Date Issued
    Tuesday, February 16, 2016
    8 years ago
Abstract
Systems and methods for avoiding conflict in a wireless mobile display digital interface (WMDDI) environment including both host and client devices. In one aspect, the presently claimed invention includes a system and/or method that is configured for broadcasting a first multicast MAC address by a first host to at least one first client in a predetermined geographic area and broadcasting the first multicast MAC address by a second host to at least one second client in the predetermined geographic area. The system and/or method can be further configured for determining a priority between the first host and the second host when the second host receives multicast packets transmitted by the first host and changing to a second multicast MAC address by a least priority host of the first host and the second host.
Description
REFERENCE TO CO-PENDING APPLICATIONS FOR PATENT

The present Application for Patent is related to the following co-pending U.S. patent applications:


“Wireless Architecture for a Traditional Wire-Based Protocol”, U.S. patent application Ser. No. 11/624,642, filed on Jan. 18, 2007;


“Wireless Architecture for a Traditional Wire Based Protocol”, U.S. patent application Ser. No. 11/624,634, filed on Jan. 18, 2007; and


“Wireless Architecture for a Traditional Wire-Based Protocol”, U.S. patent application Ser. No. 12/179,411, filed Jul. 24, 2008, all filed concurrently herewith, assigned to the assignee hereof and expressly incorporated by reference herein.


BACKGROUND

1. Field


The presently claimed invention relates generally to the field of communications, and more specifically to the field of wireless communications in a network having multiple nodes.


2. Background


Recent trends in communications have demonstrated that visual content is becoming a more important aspect of both the communications themselves as well as the devices that enable such communications. For example, displays have become much more integral to the operation of mobile phones in recent years. The mobile display digital interface (MDDI) protocol has been adopted by many manufacturers and users as a cost-effective and low-power solution that enables high-speed short-range communication with a display device, for example a display portion of a clamshell-type or flip-phone. The MDDI protocol typically utilizes a miniature connector system and a thin flexible cable for connecting portable computing, communications and entertainment devices to displays, generally referred to as a host and a client, respectively. However, with the development of high-speed wireless technologies such as ultra wideband and 802.11n, there is a growing desire for wireless communications between computing platforms and displays. Wireless USB has been introduced as one option for wireless communication between devices. However, unlike a MDDI system, wireless USB operates within the framework of the wiMedia UWB MAC, which unfortunately ties the communications protocol very heavily to the underlying MAC structure, which in turn complicates operation of wireless USB systems making them less than optimal for many applications.


As noted above, in a wired MDDI system, the host and client devices are connected by actual cabling, which forms the basis for the association between the host and the client. In a wireless system; however, there is no automatic, physical link creating an association between the host and client, which can lead to numerous difficulties with association, security, inefficient use of air link bandwidth, and conflicting addresses, packets and/or communication protocols from differing hosts and/or clients.


Accordingly, there is a need in the art for a system and/or method for wireless MDDI communications that ensures proper association between a host and a client, as well as efficient and secure communications there between.


SUMMARY

The presently claimed invention includes systems and methods for avoiding conflict in a wireless mobile display digital interface (WMDDI) environment including both host and client devices. In one aspect, the presently claimed invention includes a system and/or method that are configured for broadcasting a first multicast address by a first host to at least one first client in a predetermined geographic area and broadcasting the first multicast address by a second host to at least one second client in the predetermined geographic area.


The system and/or method can be further configured for determining a priority between the first host and the second host when the second host receives multicast packets transmitted by the first host and changing to a second multicast address by a least priority host of the first host and the second host.


In another aspect, the presently claimed invention includes a system and/or method for resolving and/or preventing conflicts in a multicast address digital communication system. The system and/or method of conflict resolution can include the step of receiving a first multicast address broadcast by a first device in a first predetermined geographic area at a second device in a predetermined geographic area wherein the first and second geographic areas are at least partially distinct from one another. Upon receipt, the second device can rebroadcast the first multicast address in the second predetermined geographic area, where it can be received by a third, distinct device in the second predetermined geographic area. In other aspects of the presently claimed invention, the third device can then determine if the first and second multicast addresses are identical, and if so, determine a priority between the first and second devices. If the first device is the priority device, then the third device can select and/or generate a third, distinct, multicast address. Likewise, if the second device is the priority device, then the first device can select and/or generate a third, distinct multicast address, thereby preventing any potential conflicts from arising between devices in the first and second predetermined geographic areas.


As described in greater detail below, the systems and/or methods described herein, the WMDDI protocol can be run on top of a high-speed wireless MAC without interfering with the wireless MAC itself, which is a significant drawback to the wireless USB system described above. Compartmentalization of the WMDDI from the wireless MAC greatly improves the efficiency and operation of the host and client communications, while reducing the overall cost of the systems described herein. Other features described herein include a service discovery function, a dynamic association/dissociation function, a mutual authentication and key exchange function, a link status function as well as various specific functionalities to preserve air link bandwidth. Other features and advantages of the presently claimed invention are described in detail below with reference to the following figures.





BRIEF DESCRIPTION OF DRAWINGS


FIG. 1 is a schematic block diagram of a system for avoiding and/or resolving conflicts in a WMDDI multicast environment in accordance with one aspect of the presently claimed invention.



FIG. 2 is a schematic block diagram of a system hierarchy in a WMDDI multicast environment in accordance with one aspect of the presently claimed invention.



FIG. 3 is a diagram of a system for avoiding and/or resolving conflicts in a WMDDI multicast environment in accordance with one aspect of the presently claimed invention.



FIG. 4 is a flowchart depicting a method for avoiding conflicts in a WMDDI multicast environment in accordance with one aspect of the presently claimed invention.



FIG. 5 is a flowchart depicting a method for avoiding and/or resolving conflicts in a WMDDI multicast environment in accordance with one aspect of the presently claimed invention.



FIG. 6 is a flowchart depicting a method for avoiding and/or resolving conflicts in a WMDDI multicast environment in accordance with one aspect of the presently claimed invention.



FIG. 7 is a flowchart depicting a method for avoiding and/or resolving conflicts in a WMDDI multicast environment in accordance with one aspect of the presently claimed invention.



FIG. 8 is a flowchart depicting a method for avoiding conflicts in a WMDDI multicast environment in accordance with one aspect of the presently claimed invention.





DETAILED DESCRIPTION

The presently claimed invention is described herein with reference to selected preferred features and aspects thereof with reference to the appended figures. It should be understood by those of skill in the art of communications that the foregoing descriptions are exemplary in nature only, and that the scope of the presently claimed invention is defined by the following claims.


As shown in FIG. 1, a system 10 for avoiding and/or resolving conflicts in a WMDDI multicast environment in accordance with one aspect of the presently claimed invention includes a host device 12 that is wirelessly connectable to a client device 20. Host device 12 can include a WMDDI sender module 14 and a wireless modem 16, each of which is connectable to a host controller 18 adapted to control at least the communications functions of host device 12, including at least those functions described in greater detail below with reference to FIGS. 2 through 8. Host controller 18 can include for example any suitable combination of hardware, firmware, or software that is adapted to control the communications functions of host device 12. Similarly, client device 12 can include a WMDDI receiver module 22 and a wireless modem 24, each of which is connectable to a client controller 26 adapted to control at least the communications functions of client device 20. Client controller 26 can also include, for example, any suitable combination of hardware, firmware, or software that is adapted to control the communications functions of client device 20, including at least those functions described in greater detail below with reference to FIGS. 2 through 8.


Each host device 12 and client device 20 can have a functional system hierarchy 30, one aspect of which is shown in FIG. 2. System hierarchy 30 can include for example a display/video/multimedia layer 32 that is layered on top of a WMDDI protocol layer 34. WMDDI protocol layer 34 is shown layered on top of a high-speed wireless MAC layer 36, which in turn can run on top of a high-speed wireless PHY layer 38. As described more fully herein, WMDDI protocol layer 34 can include a plurality of functions, including but not limited to a service discovery function, a dynamic association/dissociation function, a mutual authentication and key exchange function, a link status function as well as various specific functionalities to preserve air link bandwidth.


As shown in FIG. 3, in one preferred aspect of the presently claimed invention, system 10 is configured such that a first host H1 is adapted to broadcast a first multicast address to at least one client device C1 in a predetermined geographic area, i.e. within a signal range of first host H1. System 10 can be further configured so that a second host H2 broadcasts the first multicast address to at least one second client C2 in the same geographic area, and further such that first host H1 and second host H2 are configured to determine a priority when second host H2 receives multicast address packets transmitted by first host H1, thereby avoiding any potential multicast address conflicts. Depending upon the priority between first host H1 and second host H2, system 10 can be configured such that the least priority one of first host H1 or second host H2 changes to a second multicast address thereby resolving any existing and/or potential multicast address conflicts.


These and other aspects of the presently claimed invention help to alleviate conflict in a broader WMDDI system in which there are multiple hosts and multiple clients all within the same predetermined geographic area. For example, in a case with two hosts A and C and two clients B and D, it is possible in a typical WMDDI system for hosts A and C to have conflicts and/or non-secure communications depending upon the selected multicast addresses. If nodes A and B are in listening range of each other, and nodes B and C are in listening range of each other, and nodes C and D are in listening range of each other, then nodes A and D might possibly become linked if they share the same multicast address and there is no manner by which to determine proper priority and multicast address selection between the two hosts A and C. As such, aspects of the presently claimed invention include a two-hop transmission of a selected multicast address from the initiating host to a client (first hop), and from the client to at least a second host (second hop), so that the second host is aware of the selection of the multicast address and can, at the option of the second host, either reject the multicast address or accept the multicast address depending upon the priority of the devices (e.g., based on respective Media AccessControl addresses associated therewith). As described in more detail herein, the second host is adapted to avoid conflicts through the rejection or the multicast address and selection of a unique address or resolve existing conflicts by determining a priority address and maintaining its existing address or selecting a new address in response to the priority of the respective devices.


As shown in diagram 40 of FIG. 3, first host H1 intends to start a session with one or more clients and selects and broadcasts a PickedMulticastAddress (MA2). Simultaneously, second host H2 is starting its own session with second client C2 using a PickedMulticastAddress, MA1. If the first host H1 were to also select MA1 as its multicast address, then first host H1 might inadvertently start a session with second client C2. In order to avoid this situation, first host H1 broadcasts its MA2 message to at least first client C1 that is within the predetermined geographic area. In response, first client C1 hops the MA2 to at least second host H2. If MA2 is identical to MA1 on which second host H2 is in session with at least a second client C2, then if the address of second host H2 is greater than the address of first host H1, second host H2 responds to first client C1 with a RejectMulticastAddress (RMA) message, which in turn is hopped back to first host H1 so that first host H1 is aware that there is an existing broadcast with the selected address and that second host H2 has priority on that particular address, thus allowing first host H1 to select a different multicast address. Alternatively, if MA2 is distinct from MA1, then there is no conflict between first host H1 and second host H2 for the immediate sessions. Moreover, each of first host H1 and second host H2 are aware of the other's respective multicast address so each host will refrain from starting another session on the other's multicast address unless or until it is determined by both first host H1 and second host H2 that there is no conflict.


Returning to FIG. 1, host device 12 can be configured for operation as first host H1 and second host H2, and client device 20 can be configured for operation as first client C1 and second client C2. As noted above, each host device 12 and client device 20 can include a host controller 18 and a client controller 26, respectively, wherein each of the controllers are configured for operation and execution of the methodologies described herein. Controllers 18 and 26 may be implemented in hardware, firmware, software, and/or combinations thereof. In a hardware implementation, for example, a processing unit may be implemented within one or more application specific integrated circuits (ASICs), digital signal processors (DSPs), digital signal processing devices (DSPDs), programmable logic devices (PLDs), field programmable gate arrays (FPGAs), processors, micro-controllers, microprocessors, electronic devices, other devices units designed to perform the functions described herein, and/or combinations thereof.


For a firmware and/or software implementation of aspects of the presently claimed invention, the systems and/or methodologies may be implemented with modules (e.g., procedures, functions, and so on) that perform the functions described herein. Any machine-readable medium tangibly embodying instructions may be used in implementing the methodologies described herein.


For example, software codes may be stored in a memory, for example the memory associated with one of host device 12 or client device 20, and executed by respective controllers 18 and 26. Memory can be implemented within the processor or external to the processor. As used herein the term “memory” refers to any type of long term, short term, volatile, nonvolatile, or other memory and is not to be limited to any particular type of memory or number of memories, or type of media upon which memory is stored.


As shown in FIG. 4, in one aspect of the presently claimed invention, a method for selecting a multicast address to avoid conflicts in a digital communication system includes step S102, which recites broadcasting a first multicast address by a first host to at least one first client in a predetermined geographic area. In step S104, the method recites broadcasting the first multicast address by a second host to at least one second client in the predetermined geographic area; and in step S106 method recites determining a priority between the first host and the second host when the second host receives multicast packets transmitted by the first host. The method of this preferred aspect of the presently claimed invention further includes step S108, which recites changing to a second multicast address by a least priority host of the first host and the second host.


In one variation of the method of the aspect shown in FIG. 4, the method can further include the step of detecting the at least one second client being in the predetermined geographic area by the first host. The step of detecting the at least one second client can be executed according to the two-hop principle set forth with reference to FIG. 3. The method can further include the steps of receiving the first broadcast multicast address by the at least one second client from the first host, and rebroadcasting the received first multicast address on a first hop count to the second host. As noted above with reference to FIG. 3, the systems and methodologies described herein function to notify, streamline and prioritize communications within a WMDDI network by minimizing the potential for conflicting multicast addresses between two or more host devices.


Further details of the exemplary methodologies described herein are depicted in the flowchart of FIG. 5, which pertains primarily to methodologies suitable for a host device 12 functioning in a system 10 such as that shown in FIG. 1. In step S110, the host H1 is powered up and in step S112 the host H1 selects a multicast address G1. After detection of a new client in step S114, host H1 transmits its PickedMulticastAddress (PMA) message in the manner described above in step S116. Following transmission of the PMA, the host initiates a Multicast Conflict resolution timer in step S118 which functions to set an upper bound on a time for which the host H1 will wait to see if the multicast group address G1 is already in use by a priority host. In step S120, the method recites one of waiting for a RejectMulticastAddress packet or the expiration of the Multicast Conflict Resolution timer. In step S122, the method shown in FIG. 5 queries whether a RejectMulticastAddress (G1) has been received. If the answer is negative, then the method proceeds to step S128, in which it queries whether the Multicast Conflict Resolution timer has expired. If the Multicast Conflict Resolution timer has expired, then in step S130 the method recites maintaining the multicast group address G1 as the MAC address for the host's session. If the Multicast Conflict Resolution timer has not expired, then the method returns to step S120 described above.


Returning to step S122, if a RejectMulticastAddress (G1) has been received, then the method proceeds to step S124, which recites host H1 verifying that the originating host address (e.g., MAC address) H2 has priority over the address of host H1, i.e. address of itself. Upon verification, then the method proceeds to step S126, in which the method recites picking a different multicast address G2 that is not G1, after which the method returns to step S116 and transmits a new PickedMulticastAddress (G2) packet. The exemplary method shown in FIG. 5 functions to ensure the priority of hosts as well as the distinctness of the multicast addresses. As such, in a system 10 such as that described above, each host therein is performing the foregoing steps to ensure that proper priority is allocated and further that each multicast address is unique within the predetermined geographic region.



FIG. 6 illustrates a methodology appropriate for a recipient such as a host device 12 or client device 20 such as that shown in system 10 described with reference to FIG. 1. In step S140, the example method recites receiving a PickedMulticastAddress (G1), and in step S142, the example method queries whether the device is already a member of a different group having the same group address G1. If the answer is negative, then the method proceeds to step S160, described in more detail below. If the answer is affirmative, then the method proceeds to step S144, in which it queries whether the address (e.g., MAC address) of the host initiating the multicast group has priority over the existing host of the device.


As noted above, the methodologies of the presently claimed invention ascertain both the priority and the uniqueness of the multicast addresses. As such, if the answer to the priority query S144 is affirmative, then the example method queries whether the device is also the second host H2. If the answer is affirmative, then in step S150 the host H2 picks a different multicast address G2, which is different than G1, for its group and then initiates the procedure of sending a PickedMulticastAddress (G2) as set forth above in step S152. If the answer to query S146 is negative, then the device forwards the PickedMulticastAddress to the host H2. If the answer to the priority query S144 is negative, then H1 does not have priority over H2, and so in step S154 the example method queries whether the client device is also the second host H2. If the response is negative, then the example method proceeds to step S158, which recites forwarding the PickedMulticastAddress packet to the host H2. If the response to query S154 is affirmative, then the host H2 broadcasts a Reject Multicast Packet intended for host H1 by including the host's own unicast address of H2 in step S156.


As noted above, in order to prevent inadvertent association between hosts and clients that are not necessarily in the same geographic region, the methodologies of the presently claimed invention employ at least a two-hop communication process. Accordingly, in step S160, the example method recites incrementing the hop count on the PickedMulticastAddress packet to ensure that a predetermined number of hops is attained. For example, in step S162 the example method queries whether the hop count is less than two. If the response is affirmative, then the method proceeds to step S164 to increment the hop count on the PickedMulticastAddress packet and broadcast to the client device's next hop neighbors. On the other hand, if the hop count is two or more, then the example method proceeds to step S166 in which the PickedMulticastAddress packet is discarded as both the priority and uniqueness functions have been performed.



FIG. 7 illustrates another example method usable by a packet receiver such as a host or client device in a system of the type described herein. In step S180, the example method recites the step of receiving a PickedMulticastAddress (G1) packet. In step S182, the method queries whether the receiver is a member of a different group that already has the same group address G1. If the query of step S182 is answered in the negative, then the example method proceeds to step S196, which recites the step of forwarding the PickedMulticastAddress packet to the host H2. If the answer to the query of step S182 is affirmative, then the method proceeds to step S184, in which the method further queries whether the receiving device is a second host H2. If the answer to the query of step S184 is negative, then the method proceeds to step S194 in which the PickedMulticastAddress is forwarded to the host H2.


Alternatively, if the answer to the query of step S184 is affirmative, then the method proceeds to step S186 in which it queries whether the address (e.g., MAC address) of the host initiating the multicast group has priority over the address of the host H2, which is the host for the current group. If the response to the query of step S186 is negative, then in step S192 the host H2 broadcasts a RejectMulticastAddress packet destined for host H1, by including the host H2's address with a hop count equal to zero. If the response to the query of step S186 is affirmative, then in step S188 the host H2 selects an alternate multicast address G2 distinct from G1 for its own multicast group. Following selection of the new multicast address G2, the method directs the host H2 to initiate the procedure for sending PickedMulticastAddress (G2) in step S190.


As in the previous example methods, in order to prevent inadvertent association between hosts and clients that are not necessarily in the same geographic region, the methodologies of the presently claimed invention employ at least a two-hop communication process. Accordingly, in step S198, the example method recites incrementing the hop count on the PickedMulticastAddress packet to ensure that a predetermined number of hops is attained. For example, in step S200 the example method queries whether the hop count is less than two. If the response is affirmative, then the method proceeds to step S202 to increment the hop count on the PickedMulticastAddress packet and broadcast to the device's next hop neighbors. On the other hand, if the hop count is two or more, then the example method proceeds to step S204 in which the PickedMulticastAddress packet is discarded as both the priority and uniqueness functions have been performed.


Another example method usable by a packet receiver such as a host or client device in a system of the type described herein is shown in FIG. 8. In particular, the example methodology set forth in FIG. 8 is usable by a device that is a member of a multicast group G1 started by host H2 in which the device has either received multicast packets from a different host H1 or received a beacon, signal or packet indicating that host H1 has started a different group with the same address G1. This can happen if two distinct groups come into wireless contact with each other either because of mobility or due to changes in the wireless environment. The example method shown in FIG. 8 begins in step S210 in which the device detects a duplicate multicast group (G1). In step S212, the example method queries whether the receiving device is the host H2. If the response is negative, then in step S222 the example method recites generating a PickedMulticastAddress (G1) with a hop count of one on behalf of H1 and transmitting the same to host H2, thereby notifying host H2 of a possible conflict with group G1 address.


If the response to the query of step S212 is affirmative then the receiving device is also host H2. In that case, the example method further queries whether host H1 has priority over host H2 in step S214. If the response to the query of step S214 is affirmative, then the example method proceeds to step S216 in which the host H2 picks an alternate multicast address G2 that is distinct from G1 for its multicast group. In step S218, host H2 initiates the procedure for sending PickedMulticastAddress (G2) to its multicast group. If the response to the query of step S214 is negative, then host H2 sends or broadcasts a RejectMulticastAddressPacket to H1 by including the host H2's address, thereby ensuring that host H1 will pick a distinct multicast address for its group.


Those of skill in the art will readily appreciate that although various aspects and features of the presently claimed invention have been described with reference to a multicast address, the principles of the presently claimed invention are equally well-suited to other types of wireless addresses. For example, the systems and methods described herein can be applied to any node network having unique identifiers and a special node such as a host that collectively define a multicast group. By way of non-limiting example, aspects and features of the presently claimed invention can be employed in all types of wireless networks, including those supported by Internet Protocol (IP) addressing and the IEEE 802.11 series of networks, such as for example wireless personal area networks (WPAN), wireless local area networks (WLAN) including WiFi and Fixed Wireless Data networks, wireless metropolitan area networks (WiMAX) as well as both Global System for Mobile Communication (GSM) and Personal Communications Service (PCS) networks. Those of skill in the art will recognize that the various inventive aspects and features described herein can be readily applied to at least the aforementioned types of communications protocols and networks.


Unless specifically stated otherwise, as apparent from the preceding discussion, it is appreciated that throughout this specification discussions utilizing terms such as “processing,” “computing,” “calculating,” “selecting,” “forming,” “enabling,” “inhibiting,” “locating,” “terminating,” “identifying,” “initiating,” “detecting,” “obtaining,” “hosting,” “maintaining,” “representing,” “estimating,” “reducing,” “associating,” “receiving,” “transmitting,” “determining” and/or the like refer to the actions and/or processes that may be performed by a computing platform, such as a computer or a similar electronic computing device, that manipulates and/or transforms data represented as physical electronic and/or magnetic quantities and/or other physical quantities within the computing platform's processors, memories, registers, and/or other information storage, transmission, reception and/or display devices. Such actions and/or processes may be executed by a computing platform under the control of machine-readable instructions stored in a storage medium, for example. Such machine-readable instructions may comprise, for example, software or firmware stored in a storage medium included as part of a computing platform (e.g., included as part of a processing circuit or external to such a processing circuit). Further, unless specifically stated otherwise, process described herein, with reference to flow diagrams or otherwise, may also be executed and/or controlled, in whole or in part, by such a computing platform including for example the host device 12 and client device 20 described in detail above.


The preceding descriptions are related to selected aspects and preferred examples of the systems and methods of the presently claimed invention. It should be understood by those of skill in the art that these descriptions are exemplary in nature, and that the full scope and import of the presently claimed invention is defined with reference to the following claims.

Claims
  • 1. A method executed on hardware for selecting a multicast address to avoid conflicts in a digital communication system, the method comprising the steps of: wirelessly broadcasting a first multicast address selected by a first host to at least one first client in a predetermined geographic area;wirelessly broadcasting the first multicast address selected by a second host to at least one second client in the predetermined geographic area, each of the first host and the second host independently selecting the first multicast address;determining a priority between the first host and the second host when the second host receives the first multicast address rebroadcast by the first client; andchanging to a second multicast address by a least priority host of the first host and the second host.
  • 2. The method of claim 1 further comprising the steps of: detecting the at least one second client being in the predetermined geographic area by the first host;receiving the first broadcast multicast address by the at least one second client from the first host; andrebroadcasting the received first multicast address on a first hop count to the second host.
  • 3. The method of claim 2 further comprising a highest priority host from the first host and the second host transmitting a reject multicast address packet on a second hop count.
  • 4. The method of claim 3 further comprising the step of rebroadcasting the rejected multicast address by the at least one first client or the at least one second client.
  • 5. The method of claim 2 further comprising repeating steps for the second multicast address.
  • 6. The method of claim 1 further comprising the step of a highest priority host of the first host and the second host sending a reject multicast address to the least priority host.
  • 7. The method of claim 1 further comprising the step of transmitting a confirm new address by the at least one first client or at least one second client when the step of changing to the second multicast address is made.
  • 8. The method of claim 1 further comprising the step of repeating steps for the second multicast address.
  • 9. A hardware system for selecting a multicast address to avoid conflicts in a digital communication system comprising: means for wirelessly broadcasting a first multicast address selected by a first host to at least one first client in a predetermined geographic area;means for wirelessly broadcasting the first multicast address selected by a second host to at least one second client in the predetermined geographic area, each of the first host and the second host independently selecting the first multicast address;means for determining a priority between the first host and the second host when the second host receives the first multicast address rebroadcast by the first client; andmeans for changing to a second multicast address by a least priority host of the first host and the second host.
  • 10. The hardware system of claim 9 further comprising: means for detecting the at least one second client being in the predetermined geographic area by the first host;means for receiving the first broadcast multicast address by the at least one second client from the first host; andmeans for rebroadcasting the received first multicast address on a first hop count to the second host.
  • 11. The hardware system of claim 10 further comprising a means for transmitting a reject multicast address packet on a second hop count by a highest priority host from the first host and the second host.
  • 12. The hardware system of claim 11 further comprising a means for rebroadcasting the rejected multicast address by the at least one first client or the at least one second client.
  • 13. The hardware system of claim 9 further comprising a means for sending a reject multicast address to the least priority host by a highest priority host of the first host and the second host.
  • 14. The hardware system of claim 9 further comprising a means for transmitting a confirm new address by the at least one first client or at least one second client concurrently with the means for changing to the second multicast address.
  • 15. A non-transitory storage media comprising program instructions which are hardware computer-executable to implement a selection of a multicast address to avoid conflicts in a digital communication system, the storage media comprising: program instructions that cause a first multicast address to be selected and wirelessly broadcast by a first host to at least one first client in a predetermined geographic area;program instructions that cause the first multicast address to be selected and wirelessly broadcast by a second host to at least one second client in the predetermined geographic area, each of the first host and the second host independently selecting the first multicast address;program instructions that cause a priority to be determined between the first host and the second host when the second host receives the first multicast address rebroadcast by the first client; andprogram instructions that cause a change to a second multicast address by a least priority host of the first host and the second host.
  • 16. The non-transistory storage media of claim 15 further comprising: program instructions that cause a detection of the at least one second client being in the predetermined geographic area by the first host;program instructions that cause a receipt of the first broadcast multicast address by the at least one second client from the first host; andprogram instructions that cause a rebroadcast of the received first multicast address on a first hop count to the second host.
  • 17. The non-transistory storage media of claim 16 further comprising program instructions that cause a transmission of a reject multicast address packet on a second hop count by a highest priority host from the first host and the second host.
  • 18. The non-transistory storage media of claim 17 further comprising program instructions that cause a rebroadcast of the rejected multicast address by the at least one first client or the at least one second client.
  • 19. The non-transistory storage media of claim 15 further comprising program instructions that cause a highest priority host of the first host and the second host to send a reject multicast address to the least priority host.
  • 20. The non-transistory storage media of claim 15 further comprising program instructions that cause a transmission of a confirm new address by the at least one first client or at least one second client concurrently with the program instructions to change to the second multicast address.
  • 21. A method for preventing conflicts in a multicast address digital communication system, the method comprising the steps of: receiving a first multicast address selected and wirelessly broadcast by a first device in a first predetermined geographic area at a second device in a second predetermined geographic area, wherein the second predetermined geographic area is at least partially distinct from the first predetermined geographic area, the first and second predetermined geographic areas respectively defined by wireless signal ranges of the first and second devices;wirelessly rebroadcasting, in the second predetermined geographic area, the first multicast address by the second device; andwirelessly receiving the first multicast address by at least a wireless third device in the second predetermined geographic area, the wireless third device configured to independently select a second multicast address instead of the first multicast address as wirelessly received.
  • 22. The method of claim 21, wherein the first device is one of a client or a host.
  • 23. The method of claim 21, wherein the second device is one of a client or a host.
  • 24. The method of claim 21, wherein the third device is one of a client or a host.
  • 25. The method of claim 21, further comprising the step of: at the third device, determining whether the first multicast address and the second multicast address selected by the third device are identical.
  • 26. The method of claim 25, further comprising the step of: in response to the first multicast address and the second multicast address being identical, determining a priority between the first and second devices.
  • 27. The method of claim 26, further comprising the step of: in response to the first device having priority over the second device, selecting at the third device a third multicast address distinct from the second multicast address.
  • 28. The method of claim 26, further comprising the step of: in response to the second device having priority over the first device, selecting at the first device a third multicast address distinct from the first multicast address.
  • 29. A hardware system for preventing conflicts in a multicast address digital communication system, comprising: means for receiving a first multicast address selected and wirelessly broadcast by a first device in a first predetermined geographic area at a second device in a second predetermined geographic area, wherein the second predetermined geographic area is at least partially distinct from the first predetermined geographic area, the first and second predetermined geographic areas respectively defined by wireless signal ranges of the first and second devices;means for wirelessly rebroadcasting, in the second predetermined geographic area, the first multicast address by the second device; andmeans for wirelessly receiving the first multicast address by at least a wireless third device in the second predetermined geographic area, the wireless third device configured to independently select a second multicast address instead of the first multicast address as wirelessly received.
  • 30. The hardware system of claim 29, wherein the first device is one of a client or a host.
  • 31. The hardware system of claim 29, wherein the second device is one of a client or a host.
  • 32. The hardware system of claim 29, wherein the third device is one of a client or a host.
  • 33. The hardware system of claim 29, further comprising a means for determining whether the first multicast address and the second multicast address selected by the third device are identical at the third device.
  • 34. The hardware system of claim 33, further comprising a means for determining a priority between the first and second devices in response to the first multicast address and the second multicast address being identical.
  • 35. The hardware system of claim 34, further comprising a means for selecting at the third device a third multicast address distinct from the second multicast address in response to the first device having priority over the second device.
  • 36. The hardware system of claim 34, further comprising a means for selecting at the first device a third multicast address distinct from the first multicast address in response to the second device having priority over the first device.
  • 37. A non-transitory storage media comprising program instructions which are hardware computer-executable to implement a prevention of conflicts in a multicast address digital communication system, the storage media comprising: program instructions that cause a receipt of a first multicast address selected and wirelessly broadcast by a first device in a first predetermined geographic area at a second device in a second predetermined geographic area, wherein the second predetermined geographic area is at least partially distinct from the first predetermined geographic area, the first and second predetermined geographic areas respectively defined by wireless signal ranges of the first and second devices;program instructions that cause a wirelessly rebroadcast, in the second predetermined geographic area, of the first multicast address by the second device; andprogram instructions that cause a wireless receipt of the first multicast address by at least a wireless third device in the second predetermined geographic area, the wireless third device configured to independently select a second multicast address instead of the first multicast address as wirelessly received.
  • 38. The non-transistory storage media of claim 37, wherein the first device is one of a client or a host.
  • 39. The non-transistory storage media of claim 37, wherein the second device is one of a client or a host.
  • 40. The non-transistory storage media of claim 37, wherein the third device is one of a client or a host.
  • 41. The non-transistory storage media of claim 37, further comprising program instructions that cause a determination of whether the first multicast address and the second multicast address selected by the third device are identical at the third device.
  • 42. The non-transistory storage media of claim 41, further comprising program instructions that cause a determination of a priority between the first and second devices in response to the first multicast address and the second multicast address being identical.
  • 43. The non-transistory storage media of claim 42, further comprising program instructions that cause a selection at the third device of a third multicast address distinct from the second multicast address in response to the first device having priority over the second device.
  • 44. The non-transistory storage media of claim 42, further comprising program instructions that cause a selection at the first device of a third multicast address distinct from the first multicast address in response to the second device having priority over the first device.
US Referenced Citations (293)
Number Name Date Kind
4791554 Hirota et al. Dec 1988 A
5828370 Moeller et al. Oct 1998 A
5835723 Andrews et al. Nov 1998 A
5925137 Okanoue et al. Jul 1999 A
6014706 Cannon et al. Jan 2000 A
6049549 Ganz et al. Apr 2000 A
6195680 Goldszmidt et al. Feb 2001 B1
6252889 Patki et al. Jun 2001 B1
6266690 Shankarappa et al. Jul 2001 B1
6400720 Ovadia et al. Jun 2002 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
6963921 Yang et al. Nov 2005 B1
7035281 Spearman et al. Apr 2006 B1
7072984 Polonsky et al. Jul 2006 B1
7080151 Borella et al. Jul 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
7373415 Deshan et al. May 2008 B1
7376155 Ahn et al. May 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
7768536 Hyatt Aug 2010 B2
7835406 Oran et al. Nov 2010 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
8428048 Walker et al. Apr 2013 B2
8437347 Casaccia et al. May 2013 B2
8466870 Cohen et al. Jun 2013 B2
8517251 Cohen et al. Aug 2013 B2
8593996 Lee et al. Nov 2013 B2
8605048 Ye et al. Dec 2013 B2
8605584 Leung et al. Dec 2013 B2
8612619 Guo et al. Dec 2013 B2
8724696 Byford et al. May 2014 B2
8966131 Huang et al. Feb 2015 B2
20020007494 Hodge Jan 2002 A1
20020035621 Zintel et al. Mar 2002 A1
20020097718 Korus et al. Jul 2002 A1
20030031152 Gohda et al. Feb 2003 A1
20030064752 Adachi et al. Apr 2003 A1
20030110297 Tabatabai et al. Jun 2003 A1
20030142631 Silvester Jul 2003 A1
20030152098 Zhu Aug 2003 A1
20030167171 Calderone et al. Sep 2003 A1
20030225737 Mathews Dec 2003 A1
20040039934 Land et al. Feb 2004 A1
20040071169 Abe et al. Apr 2004 A1
20040083284 Ofek et al. Apr 2004 A1
20040103282 Meier et al. May 2004 A1
20040147264 Ogawa Jul 2004 A1
20040160967 Fujita et al. Aug 2004 A1
20040202249 Lo et al. Oct 2004 A1
20040214571 Hong Oct 2004 A1
20050021810 Umemura et al. Jan 2005 A1
20050044142 Garrec et al. Feb 2005 A1
20050058090 Chang et al. Mar 2005 A1
20050060750 Oka et al. Mar 2005 A1
20050085239 Cedervall Apr 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
20050149976 Lupoi et al. Jul 2005 A1
20050152330 Stephens et al. Jul 2005 A1
20050166241 Kim et al. Jul 2005 A1
20050175321 Aridome et al. Aug 2005 A1
20050176429 Lee et al. Aug 2005 A1
20050184993 Ludwin et al. Aug 2005 A1
20050198663 Chaney et al. Sep 2005 A1
20050219266 Koutani et al. Oct 2005 A1
20050266798 Moloney et al. Dec 2005 A1
20050267946 An et al. Dec 2005 A1
20060002320 Costa-Requena et al. Jan 2006 A1
20060002395 Araki et al. Jan 2006 A1
20060013182 Balasubramanian et al. Jan 2006 A1
20060028398 Willmore Feb 2006 A1
20060050640 Jin et al. Mar 2006 A1
20060053459 Simerly 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
20060103508 Sato May 2006 A1
20060133414 Luoma et al. Jun 2006 A1
20060136963 Oh et al. Jun 2006 A1
20060146009 Syrbe et al. Jul 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
20060203805 Karacali-Akyamac et al. Sep 2006 A1
20060206340 Silvera et al. Sep 2006 A1
20060209787 Okuda Sep 2006 A1
20060218298 Knapp et al. Sep 2006 A1
20060222246 Murai et al. Oct 2006 A1
20060223442 Stephens Oct 2006 A1
20060233191 Pirzada et al. Oct 2006 A1
20060236250 Gargi 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
20070043550 Tzruya 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
20070157283 Setlur et al. Jul 2007 A1
20070162945 Mills Jul 2007 A1
20070171910 Kumar Jul 2007 A1
20070182728 Fujimori Aug 2007 A1
20070211041 Lai et al. Sep 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
20070299778 Haveson 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
20080115183 Zato et al. May 2008 A1
20080129879 Shao et al. Jun 2008 A1
20080130612 Gorokhov et al. Jun 2008 A1
20080155057 Khedouri et al. Jun 2008 A1
20080198847 Yamagishi et al. Aug 2008 A1
20080198848 Yamagishi Aug 2008 A1
20080205394 Deshpande et al. Aug 2008 A1
20080211766 Westerman et al. Sep 2008 A1
20080231595 Krantz et al. Sep 2008 A1
20080232402 Higuchi et al. Sep 2008 A1
20080270532 Billmaier et al. Oct 2008 A1
20080273485 Tsigler et al. Nov 2008 A1
20080291863 Agren 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
20090010259 Sirotkin Jan 2009 A1
20090013081 Laroia et al. Jan 2009 A1
20090031035 Dharmaraju et al. Jan 2009 A1
20090070404 Mazzaferri Mar 2009 A1
20090083431 Balachandran et al. Mar 2009 A1
20090089453 Bohan et al. Apr 2009 A1
20090091656 Kitaru et al. Apr 2009 A1
20090094317 Venkitaraman Apr 2009 A1
20090102838 Bullard et al. Apr 2009 A1
20090109974 Shetty et al. Apr 2009 A1
20090133122 Koo et al. May 2009 A1
20090141180 Kondo et al. Jun 2009 A1
20090141692 Kasslin et al. Jun 2009 A1
20090147139 Watanabe et al. Jun 2009 A1
20090153737 Glen Jun 2009 A1
20090162029 Glen Jun 2009 A1
20090189860 Su et al. Jul 2009 A1
20090191926 Doyle Jul 2009 A1
20090201423 Sugiyama et al. Aug 2009 A1
20090252130 Sheth et al. Oct 2009 A1
20090288125 Morioka Nov 2009 A1
20090300676 Harter, Jr. et al. Dec 2009 A1
20090323562 Cho et al. Dec 2009 A1
20100027467 Wu et al. Feb 2010 A1
20100073334 Cohen et al. Mar 2010 A1
20100105334 Terry et al. Apr 2010 A1
20100118200 Gelman et al. May 2010 A1
20100123826 Sagi May 2010 A1
20100127847 Evans et al. 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
20100245296 Sip et al. Sep 2010 A1
20100257238 Jeon et al. Oct 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
20100293287 Kobayashi Nov 2010 A1
20100306344 Athas et al. Dec 2010 A1
20110019620 Wang Jan 2011 A1
20110037447 Mair Feb 2011 A1
20110051602 Matthews et al. Mar 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
20110164058 Lemay Jul 2011 A1
20110167176 Yew et al. Jul 2011 A1
20110167181 Minoo et al. Jul 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
20120038825 Kanonich Feb 2012 A1
20120044985 Tao et al. Feb 2012 A1
20120060100 Sherwood et al. Mar 2012 A1
20120084670 Momchilov Apr 2012 A1
20120099566 Laine et al. Apr 2012 A1
20120113113 Hong May 2012 A1
20120147799 Nagara et al. Jun 2012 A1
20120154386 Nagara et al. Jun 2012 A1
20120162537 Maddali et al. Jun 2012 A1
20120249575 Krolczyk et al. Oct 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
20130128948 Rabii et al. May 2013 A1
20130139210 Huang et al. May 2013 A1
20130174208 Lee et al. Jul 2013 A1
20130188632 Sheth et al. Jul 2013 A1
20130195119 Huang et al. Aug 2013 A1
20130215142 Park Aug 2013 A1
20130222301 Lee et al. Aug 2013 A1
20130227152 Lee et al. Aug 2013 A1
20130234913 Thangadorai et al. Sep 2013 A1
20130238702 Sheth et al. Sep 2013 A1
20130246565 Froelicher et al. Sep 2013 A1
20130246665 Lee et al. Sep 2013 A1
20130272628 Lee Oct 2013 A1
20130297936 Khosravi et al. Nov 2013 A1
20130304794 Verma et al. Nov 2013 A1
20140019653 Amchislavsky et al. Jan 2014 A1
20140022146 Thangadorai et al. Jan 2014 A1
20140096164 Bei et al. Apr 2014 A1
20140120829 Bhamidipati et al. May 2014 A1
20140210693 Bhamidipati et al. Jul 2014 A1
20140372620 Vedula et al. Dec 2014 A1
Foreign Referenced Citations (158)
Number Date Country
1437355 Aug 2003 CN
1561609 Jan 2005 CN
1592884 Mar 2005 CN
1596004 Mar 2005 CN
1656750 Aug 2005 CN
1662944 Aug 2005 CN
1774106 May 2006 CN
1832481 Sep 2006 CN
1893356 Jan 2007 CN
1983945 Jun 2007 CN
101002453 Jul 2007 CN
101018330 Aug 2007 CN
101083825 Dec 2007 CN
101247249 Aug 2008 CN
101247250 Aug 2008 CN
1206080 May 2002 EP
1233326 Aug 2002 EP
1235392 Aug 2002 EP
1325591 Jul 2003 EP
1333373 Aug 2003 EP
1385336 Jan 2004 EP
1423778 Jun 2004 EP
1507369 Feb 2005 EP
1517228 Mar 2005 EP
1550264 Jul 2005 EP
1653678 May 2006 EP
1944946 Jul 2008 EP
1959685 Aug 2008 EP
1959686 Aug 2008 EP
2012461 Jan 2009 EP
2037683 Mar 2009 EP
2190202 May 2010 EP
2383920 Jul 2003 GB
H06110424 Apr 1994 JP
H07104722 Apr 1995 JP
H07129364 May 1995 JP
H07240806 Sep 1995 JP
H08237628 Sep 1996 JP
H09325923 Dec 1997 JP
2000278320 Oct 2000 JP
2000354031 Dec 2000 JP
2001034250 Feb 2001 JP
2001282673 Oct 2001 JP
2001352533 Dec 2001 JP
2002064725 Feb 2002 JP
2002142210 May 2002 JP
2002165248 Jun 2002 JP
2002262341 Sep 2002 JP
2002330381 Nov 2002 JP
2003050761 Feb 2003 JP
2003102060 Apr 2003 JP
2003124991 Apr 2003 JP
2003143237 May 2003 JP
2003271279 Sep 2003 JP
2003304523 Oct 2003 JP
2004054783 Feb 2004 JP
2004505531 Feb 2004 JP
2004086550 Mar 2004 JP
2004120441 Apr 2004 JP
2004192140 Jul 2004 JP
2004199454 Jul 2004 JP
2004265329 Sep 2004 JP
2004274159 Sep 2004 JP
2004531916 Oct 2004 JP
2005049666 Feb 2005 JP
2005515714 May 2005 JP
2005142808 Jun 2005 JP
2005148450 Jun 2005 JP
2005204016 Jul 2005 JP
2006500860 Jan 2006 JP
2006060448 Mar 2006 JP
2006060589 Mar 2006 JP
2006060596 Mar 2006 JP
2006100885 Apr 2006 JP
2006514353 Apr 2006 JP
2006121562 May 2006 JP
2006155327 Jun 2006 JP
2006172423 Jun 2006 JP
2006197401 Jul 2006 JP
2006254328 Sep 2006 JP
2006285302 Oct 2006 JP
2007043685 Feb 2007 JP
2007082070 Mar 2007 JP
2007505580 Mar 2007 JP
2007088539 Apr 2007 JP
2007508783 Apr 2007 JP
2007206644 Aug 2007 JP
2007271908 Oct 2007 JP
2007274150 Oct 2007 JP
2007282219 Oct 2007 JP
2007316405 Dec 2007 JP
2008508600 Mar 2008 JP
2008079139 Apr 2008 JP
2008191929 Aug 2008 JP
2008293361 Dec 2008 JP
2008301249 Dec 2008 JP
2008547264 Dec 2008 JP
2009021698 Jan 2009 JP
2009502067 Jan 2009 JP
2009033348 Feb 2009 JP
2009071580 Apr 2009 JP
2009083896 Apr 2009 JP
2009147893 Jul 2009 JP
2009537051 Oct 2009 JP
2010033548 Feb 2010 JP
2010068537 Mar 2010 JP
2010098344 Apr 2010 JP
2010178147 Aug 2010 JP
2012044746 Mar 2012 JP
2012525773 Oct 2012 JP
2014507862 Mar 2014 JP
100398610 Sep 2003 KR
1020050007533 Jan 2005 KR
20060060717 Jun 2006 KR
20080065633 Jul 2008 KR
2207723 Jun 2003 RU
2005113275 Oct 2005 RU
2269873 Feb 2006 RU
496058 Jul 2002 TW
I234954 Jun 2005 TW
I239179 Sep 2005 TW
200618653 Jun 2006 TW
200838310 Sep 2008 TW
200943168 Oct 2009 TW
WO0184291 Nov 2001 WO
WO0210942 Feb 2002 WO
0223825 Mar 2002 WO
WO0249314 Jun 2002 WO
WO-03030451 Apr 2003 WO
03061240 Jul 2003 WO
WO-03104834 Dec 2003 WO
2004034646 Apr 2004 WO
WO-2004030351 Apr 2004 WO
WO-2004051962 Jun 2004 WO
2005107187 Nov 2005 WO
WO-2005109781 Nov 2005 WO
WO2005122509 Dec 2005 WO
WO-2006007352 Jan 2006 WO
WO-2006020304 Feb 2006 WO
WO2006135289 Dec 2006 WO
WO2007000757 Jan 2007 WO
WO-2007009876 Jan 2007 WO
2007013334 Feb 2007 WO
WO2007021269 Feb 2007 WO
WO-2007033049 Mar 2007 WO
2007098425 Aug 2007 WO
WO-2007133483 Nov 2007 WO
2007140342 Dec 2007 WO
2007140344 Dec 2007 WO
2008027724 Mar 2008 WO
2008087713 Jul 2008 WO
2009015322 Jan 2009 WO
2009040918 Apr 2009 WO
2010120878 Oct 2010 WO
2010126727 Nov 2010 WO
2011003089 Jan 2011 WO
WO-2011002141 Jan 2011 WO
2012096546 Jul 2012 WO
Non-Patent Literature Citations (37)
Entry
Dorot, V., et al., “An Explanatory Dictionary of Modern Computer Terms,” 2nd Edition, BHV-Petersburg Publishers, Saint Petersburg, 2001, ‘Program Product’ on p. 339.
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.
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.
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.
Miller B., et al., “Mapping salutation architecture APIs to Bluetooth service discovery layer,” Bluetooth White Paper, [Online} pp. 1-25, Jul. 1, 1999, XP002511956.
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.
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.
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.
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.
International Search Report and Written Opinion—PCT/US2010/040650—International Search Authority, European Patent Office,Nov. 16, 2010.
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.
Brandenburg, et al., AVTCore, RTCP for inter-destination media syncronization, Internet Draft, draft-ietf-avtcore-idms-092.txt, Oct. 31, 2011.
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.
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.
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.
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.
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.
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.
Wenger et al., “RTP Payload Format for H.264 Video,” Network Working Group, RFC 3984, Feb. 2005, 78 pp.
Co-pending U.S. Appl. No. 10/236,657, filed Sep. 6, 2002.
Video Electronics Standards Association (VESA) Mobile Display Digital Interface Standard (MDDI), Jul. 2004.
“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, U.S. Appl. No. 61/433,942, filed Jan 18, 2011.
Casner, S., et al., “Compressing IP/UDP/RTP Headers for Low-Speed Serial Links,” IETF Network Working Group, RFC 2508 (Feb. 1999).
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.
DDJ., “Research on Windows Programming with Visual C++, Final Issue, Overcoming WIN32 Hook Processing in MFC Programming”, Feb. 1996 issue (vol. 5,No. 2, No. 61 in all), Shoeisha Co., Ltd., Feb. 1, 1996, pp. 66-77.
International Preliminary Report on Patentability—PCT/US2013/020155, The International Bureau of Wipo—Geneva, Switzerland, Jul. 17, 2014.
Hayakawa A., “Operate multiple machines by remote control software”, VNCThing, Mac Power, Japan, ASCII Corporation, Jun. 1, 2003, vol. 14, No. 6, p. 86.
Kinoshita K., “The Software” Everyone knows, Read this and everything will be clear, Standard software with freedom., Mac Fan, Japan, Mainichi Communications Inc., Sep. 1, 2007, vol. 15, No. 9, pp. 212-219.
“Raster Graphics” Wikipedia. Wikimedia Foundation, Jan. 29, 2011, Web, Apr. 1, 2015. &It;http://en.wikipedia.org/w/index.php?title=Raster—graphics&oldid=41 0775304&gt.
Ryo Yamaichi, Good to Remember! “Wisdom” for Troubleshooting, 68th Windows Q & A Hotline, Windows Server World, Japan, IDG Japan, Inc., Oct. 1, 2009, vol. 14, No. 10, pp. 104-107.
Wikipedia entry for UPnP List of UPnP AV media servers and clients (captured Aug. 20, 2010), pp. 1-10, Retrieved from the Internet URL: web.archive.org/web/20100820133238/http://en.wikipedia.org/wiki/List—of—UPnP—AV—media—servers—and—clients &gt:, whole document.
Wikipedia entry of header (captured Aug. 30, 2010), 1 Page, Retrieved from the Internet URL: web.archive.org/web/20100830154156/http://en.wikipedia.org/wiki/Header—(computing) >, whole document.
Related Publications (1)
Number Date Country
20110002255 A1 Jan 2011 US