WO2001071981A2 - Extensions multimedias pour reseaux locaux sans fil - Google Patents

Extensions multimedias pour reseaux locaux sans fil Download PDF

Info

Publication number
WO2001071981A2
WO2001071981A2 PCT/US2001/001656 US0101656W WO0171981A2 WO 2001071981 A2 WO2001071981 A2 WO 2001071981A2 US 0101656 W US0101656 W US 0101656W WO 0171981 A2 WO0171981 A2 WO 0171981A2
Authority
WO
WIPO (PCT)
Prior art keywords
network
multimedia
network component
channel
frame
Prior art date
Application number
PCT/US2001/001656
Other languages
English (en)
Other versions
WO2001071981A3 (fr
Inventor
Rajugopal R. Gubbi
Gregory H. Parks
Original Assignee
Sharewave, Inc.
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Priority claimed from US09/614,833 external-priority patent/US6865609B1/en
Application filed by Sharewave, Inc. filed Critical Sharewave, Inc.
Priority to AU2001230966A priority Critical patent/AU2001230966A1/en
Publication of WO2001071981A2 publication Critical patent/WO2001071981A2/fr
Publication of WO2001071981A3 publication Critical patent/WO2001071981A3/fr

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/10—Flow control; Congestion control
    • H04L47/24—Traffic characterised by specific attributes, e.g. priority or QoS
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H04L1/12—Arrangements for detecting or preventing errors in the information received by using return channel
    • H04L1/16—Arrangements for detecting or preventing errors in the information received by using return channel in which the return channel carries supervisory signals, e.g. repetition request signals
    • H04L1/18—Automatic repetition systems, e.g. Van Duuren systems
    • H04L1/1829—Arrangements specially adapted for the receiver end
    • H04L1/1854—Scheduling and prioritising arrangements
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L65/00—Network arrangements, protocols or services for supporting real-time applications in data packet communication
    • H04L65/80—Responding to QoS
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00—Network arrangements or protocols for supporting network services or applications
    • H04L67/01—Protocols
    • H04L67/10—Protocols in which an application is distributed across nodes in the network
    • H04L67/104—Peer-to-peer [P2P] networks
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L69/00—Network arrangements, protocols or services independent of the application payload and not provided for in the other groups of this subclass
    • H04L69/24—Negotiation of communication capabilities
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W72/00—Local resource management
    • H04W72/20—Control channels or signalling for resource management
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H04L1/0001—Systems modifying transmission characteristics according to link quality, e.g. power backoff
    • H04L1/0009—Systems modifying transmission characteristics according to link quality, e.g. power backoff by adapting the channel coding
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H04L1/12—Arrangements for detecting or preventing errors in the information received by using return channel
    • H04L1/16—Arrangements for detecting or preventing errors in the information received by using return channel in which the return channel carries supervisory signals, e.g. repetition request signals
    • H04L1/18—Automatic repetition systems, e.g. Van Duuren systems
    • H04L1/1809—Selective-repeat protocols
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W28/00—Network traffic management; Network resource management
    • H04W28/16—Central resource management; Negotiation of resources or communication parameters, e.g. negotiating bandwidth or QoS [Quality of Service]
    • H04W28/18—Negotiating wireless communication parameters
    • H04W28/20—Negotiating bandwidth
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W28/00—Network traffic management; Network resource management
    • H04W28/16—Central resource management; Negotiation of resources or communication parameters, e.g. negotiating bandwidth or QoS [Quality of Service]
    • H04W28/24—Negotiating SLA [Service Level Agreement]; Negotiating QoS [Quality of Service]
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W48/00—Access restriction; Network selection; Access point selection
    • H04W48/08—Access restriction or access information delivery, e.g. discovery data delivery
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W80/00—Wireless network protocols or protocol adaptations to wireless operation
    • H04W80/02—Data link layer protocols
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W84/00—Network topologies
    • H04W84/02—Hierarchically pre-organised networks, e.g. paging networks, cellular networks, WLAN [Wireless Local Area Network] or WLL [Wireless Local Loop]
    • H04W84/10—Small scale networks; Flat hierarchical networks
    • H04W84/12—WLAN [Wireless Local Area Networks]

Definitions

  • the present invention relates generally to a scheme for communications within a computer network and, in particular, to a scheme for accommodating multimedia withm a wireless computer network such as a wireless local area network (LAN).
  • LAN wireless local area network
  • Modern computer networks allow for inter-communication between a number of nodes such as personal computers, workstations, peripheral units and the like.
  • Network links transport information between these nodes, which may sometimes be separated by large distances.
  • most computer networks have relied on wired links to transport this information.
  • wireless links are used, they have typically been components of a very large network, such as a wide area network, which may employ satellite communication links to interconnect network nodes separated by very large distances.
  • the transmission protocols used across the wireless links have generally been established by the service entities carrying the data being transmitted, for example, telephone companies and other service providers.
  • analog wireless communication links Although easier to install than conventional wired communication links, analog wireless communication links suffer from a number of disadvantages For example, degraded signals may be expected on such links because of multipath interference. Furthermore, interference from existing appliances, such as televisions, cellular telephones, wireless telephones and the like may be experienced Thus, analog wireless communication links offer less than optimum performance for a home environment
  • a subnet 10 includes a server 12.
  • the term "subnet” is used to desc ⁇ be a cluster of network components that includes a server and several clients associated therewith (e.g., coupled through the wireless communication link)
  • a subnet may also refer to a network that includes a client and one or more subchents associated therewith
  • a "client” is a network node linked to the server through the wireless communication link Examples of clients include audio/video equipment such as televisions, stereo components, personal computers, satellite television receivers, cable television distribution nodes, and other household appliances
  • Server 12 may be a separate computer that controls the communication link, however, in other cases server 12 may be embodied as an add-on card or other component attached to a host computer (e g , a personal computer) 13.
  • Server 12 has an associated radio 14, which is used to couple server 12 wirelessly to the other nodes of subnet 10 I he wireless link generally supports both high and low bandwidth data channels and a command channel
  • a channel is defined as the combination of a transmission frequency (more properly a transmission frequency band) and a pseudorandom (PN) code used in a spread spectrum communication scheme.
  • PN pseudorandom
  • a shadow client 18 is defined as a client which receives the same data input as its associated client 16 (either from server 12 or another client 16), but which exchanges commands with server 12 independently of its associated client 16.
  • Each client 16 has an associated radio 14, which is used to communicate with server 12, and some clients 16 may have associated subchents 20.
  • Subclients 20 may include keyboards, joysticks, remote control devices, multidimensional input devices, cursor control devices, display units and/or other input and/or output devices associated with a particular client 16.
  • a client 16 and its associated subclients 20 may communicate with one another via communication links 21, which may be wireless (e.g., infra-red, ultrasonic, spread spectrum, etc.) communication links.
  • Each subnet 10 is arranged in a hierarchical fashion with va ⁇ ous levels of the hierarchy corresponding to levels at which mtra-network component communication occurs.
  • the server 12 and or its associated host 13
  • the clients 16 communicate with their va ⁇ ous subclients 20 using, for example, wired communication links or wireless communication links such as infrared links.
  • a communication protocol based on a slotted link structure with dynamic slot assignment is employed.
  • Such a structure supports point-to-po t connections within subnet 10 and slot sizes may be re-negotiated within a session.
  • a data link layer that supports the wireless communication can accommodate data packet handling, time management for packet transmission and slot synchronization, error correction coding (ECC), channel parameter measurement and channel switching.
  • ECC error correction coding
  • a higher level transport layer provides all necessary connection related services, policing for bandwidth utilization, low bandwidth data handling, data bioadcast and, optionally, data encryption
  • the transport layer also allocates bandwidth to each client 16, continuously polices any under or over utilization of that bandwidth, and also accommodates any bandwidth renegotiations, as may be required whenever a new client
  • the slotted link structure of the wireless communication protocol for the transmission of real time, multimedia data (e g., as frames) within a subnet 10 is shown in Figure 2
  • forward (F) and backward or reverse (B) slots of fixed (but negotiable) time duration are provided within each frame transmission period
  • Du ⁇ ng forward time slots F server 12 may transmit video and/or audio data and/or commands to clients 16, which are placed in a listening mode.
  • each transmission slot (forward or reverse) is made up of one or more radio data frames 40 of va ⁇ able length
  • each radio data frame 40 is comp ⁇ sed of server/client data packets 42, which may be of va ⁇ able length
  • Each radio data frame 40 is made up of one server/client data packet 42 and its associated error correction coding (ECC) bits.
  • ECC error correction coding
  • the ECC bits may be used to simplify the detection of the beginning and ending of data packets at the receive side.
  • Va ⁇ able length framing is preferred over constant length framing in order to allow smaller frame lengths during severe channel conditions and vice-versa. This adds to channel robustness and bandwidth savings.
  • va ⁇ able length frames may be used, however, the ECC block lengths are preferably fixed. Hence, whenever the data packet length is less than the ECC block length, the ECC block may be truncated (e g., using conventional virtual zero techniques). Similar procedures may be adopted for the last block ol ECC bits when the data packet is larger.
  • each radio data frame 40 includes a preamble 44, which is used to synchronize pseudo-random (PN) generators of the transmitter and the receiver
  • Link ID 46 is a field of fixed length (e.g., 16 bits long for one embodiment), and is unique to the link, thus identifying a particular subnet 10
  • Data from the server 12/cl ⁇ ent 16 is of variable length as indicated by a length field 48
  • Cyclic redundancy check (CRC) bits 50 may be used for error detection/correction in the conventional fashion.
  • each frame 52 is divided into a forward slot F, a backward slot B, a quiet slot Q and a number of radio turn around slots T.
  • Slot F is meant for server 12-to-cl ⁇ ents 16 communication
  • Slot B is time shared among a number of mini-slots B j, B2, etc . which are assigned by server 12 to the individual clients 16 for their respective transmissions to the server 12.
  • Losy data i.e., data that may be encoded/decoded using lossy techniques or that can tolerate the loss of some packets du ⁇ ng transmission/ reception
  • lossless data I e., data that is encoded/decoded using lossless techniques or that cannot tolerate the loss of any packets du ⁇ ng transmission/reception
  • Low bandwidth data and or command (Cmd.) packets Slot Q is left quiet so that a new client may insert a request packet when the new client seeks to login to the subnet 10.
  • Slots T appear between any change from transmit to receive and vice-versa, and are meant to accommodate individual radios' turn around time (I e., the time when a half-duplex radio 14 switches from transmit to receive operation or vice- versa).
  • the time duration of each of these slots and mini-slots may be dynamically altered through renegotiations between the server 12 and the clients 16 so as to achieve the best possible bandwidth utilization for the channel.
  • each directional slot i.e., F and B
  • each directional slot i.e., F and B
  • Forward and backward bandwidth allocation depends on the data handled by the clients 16. If a client 16 is a video consumer, for example a television, then a large forward bandwidth is allocated for that client. Similarly if a client 16 is a video generator, for example a video camcorder, then a large reverse bandwidth is allocated to that particular client.
  • the server 12 maintains a dynamic table (e.g., in memory at server 12 or host 13), which includes forward and backward bandwidth requirements of all online clients 16. This information may be used when determining whether a new connection may be granted to a new client. For example, if a new client 16 requires more than the available bandwidth in either direction, server 12 may reject the connection request.
  • the bandwidth requirement (or allocation) information may also be used in deciding how many radio packets a particular client 16 needs to wait before starting to transmit its packets to the server 12. Additionally, whenever the channel conditions change, it is possible to increase/reduce the number of ECC bits to cope with the new channel conditions. Hence, depending on whether the information rate at the source is altered, it may require a dynamic change to the forward and backward bandwidth allocation.
  • the present scheme is offered as a supplement to the scheme proposed in the standards document 802.11 for wireless local area networks promulgated by the Institute of Electrical and Electronic Engineers (EEEE) and provides multimedia extensions for high rate applications.
  • Some of the main extensions proposed are the following:
  • the MAC header is extended to include the components for multimedia support.
  • the network topology extensions include tighter definition of the PC, peer-peer connections during CFP, alternate PC and proxy PC.
  • the Quality of Service (QoS) related extensions include the simplifying the operation du ⁇ ng CFP, support of streams, stream priority, synchronization of TDM transmissions by devices during CFP, dynamic bandwidth management, channel protection using e ⁇ or control coding and negotiable retransmission parameters. By dynamically negotiating for the priority, bandwidth and the retransmission parameters for each stream separately, the latency control is achieved.
  • There are also proposed extensions to the operation of DCF-only stations in order to better their inter-operation with multimedia capable devices.
  • access of computer network components to a network's communication medium as specified by a medium access control (MAC) protocol is controlled to facilitate the communication of MM data between the network components.
  • the MM control field may be a frame position subfield and/or a subfield to indicate the number of bytes padded with zeroes in the cu ⁇ ent frame.
  • MM control field may be 24 bits long and be made up of several subfields.
  • the MM control field is the last MAC header field transmitted before transmitting a frame body
  • Such communications may be via a wireless medium and may involve the use of radio frequency communication via frequency hopping spread spectrum (e.g., direct sequence spread spectrum) schemes.
  • frequency hopping spread spectrum e.g., direct sequence spread spectrum
  • a multimedia capability indicator may be included in a management frame.
  • the MAC protocol may define a capability field within a management frame, the capability field including information regarding the network component multimedia capabilities.
  • a set of parameters included in the initial communications between two network components may indicate whether the channel of communications is shared and or the type of network component including proxy coordinator and master coordinator.
  • the multimedia command frame may include multiple commands and acknowledgements transmitted from one network component to other network components. Indeed, one network component may group two or more multimedia commands intended for a second network component in a command sub-block.
  • the multimedia command frame may also include a destination address and a command sub-block length.
  • FC frame control field
  • the FC field may consist of the first 16 bits of the MAC header transmitted by the network component.
  • the interface may be regarded as an implementation of a medium access control (MAC) protocol wherein multimedia data communication extensions, including a multimedia control field, are available for communicating multimedia data to or from other network components.
  • MAC medium access control
  • Examples of such an interface include a network interface card (NIC), a means for accessing a wireless medium, e.g., via radio frequency communications using frequency hopping spread spectrum techniques such as direct sequence spread spectrum techniques, or via infrared communications
  • NIC network interface card
  • a further embodiment provides a system communicatively coupled to other systems in a computer network
  • This system may include a network interface that implements a medium access control (MAC) protocol to control access to the network's medium, the MAC protocol defining a MAC header that comprises multimedia (MM) data communication extensions, including a MM control field, the MM data communication extensions available for communicating multimedia data to or from other netwoi k components 01 systems communicatively coupled to the network
  • MAC medium access control
  • Another embodiment includes a machine-readable medium (e g , a memory or other stoiage medium) that provides instructions, which when executed by a machine, cause said machine to communicate in a computer network by accessing the communication medium in accordance to a medium access control (MAC) protocol that describes a MAC header comp ⁇ sing multimedia (MM) extensions, including a MM control field
  • MAC medium access control
  • MM multimedia
  • a multimedia capable computer network component includes means for supporting DCF based contention pe ⁇ od communications; means for communicating with non multimedia capable network components only du ⁇ ng the contention pe ⁇ od; and means for establishing connections and negotiating bandwidth in the contention pe ⁇ od using DCF mechanisms
  • any or all of the following features may be included in the network component: means for recognizing and using as time reference a beacon from a point coordinator network component; means for pe ⁇ odically providing its bandwidth requirements to the point coordinator network component, means for establishing multimedia data stream connections with other multimedia capable network components, means for supporting error correction and retransmission mechanisms; means for continuously measu ⁇ ng channel status and pe ⁇ odically providing said measurements to the point coordinator network component, means for communicating without receiving a polling signal from the point coordinator network component, means foi optionally measure and report collisions during non-contention free pe ⁇ ods; and/or means for communicating to two
  • any or all of the following may be included, means for monitoring bandwidth utilization by the network components du ⁇ ng contention free periods; means for renegotiating bandwidth requirements with other network components to optimize bandwidth utilization; means for dynamically changing the communication channel used by all the network components associated to said point coordinator; means for negotiating with point coordinator network components associated with other sets of network components such that two or more sets of network components can communicate withm the same channel, means for monito ⁇ ng the contention pe ⁇ od of communications and assu ⁇ ng that there is available bandwidth for at least one data frame plus acknowledgement in said contention pe ⁇ od.
  • such a network component may be used as an alternate point coordinator, for example according to a voting scheme among other such multimedia capable network components.
  • Figure 1 illustrates a general overview of a wireless computer network.
  • Figure 2 illustrates a slotted link structure for communications with the wireless network of Figure 1 ,
  • Figure 3 illustrates a (a) proposed multimedia frame format and (b) multimedia control field desc ⁇ ption in accordance with an embodiment of the present invention
  • Figure 4 illustrates a structure of the multimedia commands and sub-commands in an MM-command frame in accordance with an embodiment of the present invention
  • Figure 5 illustrates a PC parameter set in beacon frame and probe response frame body in accordance with an embodiment of the present invention.
  • Figure 6 illustrates the operation of a proxy point coordinator (PPC) within the contention free period (CFP) of a point coordinator (PC) in accordance with an embodiment of the present invention;
  • PPC proxy point coordinator
  • FIG. 7 illustrates transmissions of each MMSs in a superframe in accordance with an embodiment of the present invention
  • Figure 8 illustrates a proposed data stream hierarchy in accordance with an embodiment of the present invention
  • Figure 9 illustrates proposed piio ⁇ ty services for multimedia streams in accordance with an embodiment of the present invention.
  • Figure 10 illustrates transmissions of each MMSs in a superframe in accordance with an embodiment of the present invention
  • FIG 11 illustrates transmissions of each BSS in an overlapping sentence ⁇ o accordance with an embodiment of the present invention
  • Figure 12 illustrates overlapping BSSs sha ⁇ ng the same channel in an example of two channel PHY medium in accordance with an embodiment of the present invention.
  • Figure 13 illustrates the operation of a proxy-coordinator in accordance with an embodiment of the present invention.
  • An 802.11 -compliant wireless LAN provides good support for device connection, device authentication and to date the relevant specifications defining operations of such environments have concentrated mainly on transportation of asynchronous data over the wireless channel. These features of 802.11 WLANs are sufficient for enterp ⁇ se network applications.
  • the scheme desc ⁇ bed in the above-cited co-pending application (hereinafter referred to as the "Whitecap” scheme) is designed from ground up for transportation of multimedia data streams with all the multimedia services required from the WLAN Recent efforts in 802.11 and
  • Whitecap architectures (developed by the assignee of the present application) are leading to higher bit rates and better products in the market Many different manufacturers are able to produce many consumer electronic devices and provide the advantage of flexibility of a wireless solution at home Nevertheless the incompatibilities among these wireless LANs have limited the acceptance of wireless networks in the home market. With the growth of home market, it is vital for WLANs to have extensions to support multimedia data streams, such as CD quality audio and video, to succeed in the home market. Hence a smart merger of these two architectures would greatly benefit the end user and would be a welcome in the market. Keeping this in mind, this present scheme merges the mechanisms of Whitecap into the currently defined point coordinator function of 802.1 1 WLANs.
  • the proposed extensions to the point coordinator function (PCF) can be broadly catego ⁇ zed into two groups; network topology support and Quality of Service (QoS) for multimedia data. Additionally this application presents a set of basic of services that can support the future developments in the field.
  • va ⁇ ous sections in this document are briefed here.
  • the first two sections in this proposal are meant to introduce the reader to the topic of multimedia support in 802.11 WLANs and provide cla ⁇ fications on thoughts of using the point coordinator function (PCF) to support multimedia data transfers.
  • Section 2 is devoted to viewing PCF as the multimedia support feature and desc ⁇ bing the issues involved in doing so.
  • section 3 defines a set of required new terminology.
  • Section 5 presents the proposed extensions to enhance the PCF to provide multimedia services Backwards compatibility to ensure interoperability with existing devices is an important part of any proposal Accordingly, this application takes such factors into consideration and maintains backwards compatibility in communications between MMS and DCF-only stations. Further, section 6 proposes a several enhancements for future DCF-only stations that further improve the efficiency of those stations while keeping them compatible with the present 802.1 1 WLAN definition of such stations.
  • PCF contention free pe ⁇ ods
  • PCF does not guarantee the availability of the beacon pe ⁇ od itself as a DCF- only station can manage to occupy the channel and delay the beacon arbitra ⁇ ly. These delays can be as large as the maximum size of the data frame that is supported in the 802.11 standard. Additionally, the point coordinator (PC) uses a DEFS plus a random back-off delay to start a CFP when the initial beacon is delayed because of defe ⁇ al due to a busy medium. This further complicates the problem of providing a pe ⁇ odic opportunity for MMSs for their data transmission.
  • PCF is an AP-centric data transfer method and it does not provide peer-to- peer data transfers du ⁇ ng the CFP.
  • this kind of star topology adds unacceptable latencies and unnecessa ⁇ ly adds to the burden on network efficiency, as the AP has to behave like data repeater between the two stations wishing to exchange data du ⁇ ng the CFP
  • QoS quality of service
  • PC Point coordinator with multimedia capability. Du ⁇ ng installation a device, preferably non-mobile, is designated as the PC. All other PC-capable devices are designated as APCs. • Alternate point coordinator (APC) An MMS that is capable of becoming a PC.
  • APC Alternate point coordinator
  • Proxy point coordinator An MMS capable of becoming a PC, but currently providing tunnel service between an MMS and an already operating PC
  • Superframe A superframe is defined as the pe ⁇ odically occur ⁇ ng frame starting from the beacon transmission of PC and containing transmissions of all MMSs within the cu ⁇ ent BSS, followed by the transmissions by all the overlapping BSSs that aie sharing the same PHY channel.
  • BSS-SED BSS-SID is the session ID of the BSS. This is applicable when multiple overlapping BSSs are sha ⁇ ng the same channel.
  • MC- Master coordinator An MC is the PC with the BSS-SED equal to zero This PC provides the beacon that marks the beginning of the superframe and also provides the management resources for bandwidth shanng among the overlapping BSSs that are currently sha ⁇ ng the same PHY channel.
  • Proxy coordinator is an MMS or PC, providing a tunnel service between the operating MC and a new incoming PC to share the same channel du ⁇ ng the CFP.
  • the proposed multimedia extensions require a multimedia control (MM-control) field in the frame header.
  • the data frame header is enhanced to contain the multimedia control field as shown in Figure 3
  • the multimedia control field may be 3 bytes (24 bits) long and is positioned at the end of the currently defined MAC header as an extension
  • All the other fields are used in the same manner as currently defined in the 802.11 specification for the data frame
  • the frame body the multimedia command frame also assumes a new structure as desc ⁇ bed in section 4.3
  • the frame control field format is consistent with the currently defined format with the use of cun-ently reserved frame type and subtype values for multimedia data transfers as shown in Table 1.
  • the reserved frame type ' 1 1 ' is used for multimedia extensions and subtypes of 0000-0110 are used to represent various multimedia data types.
  • the change channel frame and its acknowledgement (Ack) frames are kept as subtypes in the control field. This is meant to help, in the future, in adopting the channel change mechanism for DCF-only stations, with approp ⁇ ate MAC level changes as discussed in section 6.
  • the Pad bytes sub-field indicates how many bytes are padded in the current fiame to make the entire frame DWORD (4 bytes) aligned. This sub-field helps in easing the hardware implementation of the MACs by letting the hardware handle DWORD aligned frames instead of byte-aligned frames.
  • the MAC hardware is expected to fill this sub-field and pad bytes at the end of the frame after the FCS field.
  • the correct length of the frame is determined after deleting or igno ⁇ ng the padded bytes.
  • the BSS session ED is a four-bit identifier and is dynamically assigned to the group of stations associated with a PC, including the PC itself This sub-field is used when overlapping PCs need to operate in the same physical channel. This sub-field allows up to 15 overlapping PCs to share the bandwidth in the same channel as described in section 5.2.5.3. An all ONE value of BSS-S D is reserved for the purpose of initial negotiations.
  • the stream index is used in conjunction with MAC addi esses and the MM-frame subtype to uniquely identify a data stream.
  • a device can generate or consume up to 255 streams of the same packet type. Usage of this field is discussed in section 5.2.2.
  • the stream frame number is used to synchronize any two streams o ⁇ gmatmg from a device. Details on the use of this field are desc ⁇ bed in section 5.2.2.
  • a multimedia frame with a subtype of "command” is a frame of multiple commands and acknowledgements as shown in Figure 4.
  • Va ⁇ ous commands intended for a device are collected together as command sub-blocks. Multiple numbers of these sub-blocks along with the destination address and the sub-block length are combined together to form the multimedia command frame.
  • Va ⁇ ous commands relating to the service extensions proposed in section 5 can be defined.
  • the frame subtype network feature update is used to transport the feature update packets to programmable MACs on an MMS from any other MMS that has access to updated codes or parameters
  • the subtypes of voice, audio, video, real-time data and data are used to transport the actual multimedia data within a BSS
  • These frame subtypes signify the characteristics ot the incoming traffic at the destination MMS
  • the distinction of real-time data and data, asynchronous by default, is required to allow tor different latency requuements ot the two data types at both the source device and the destination device.
  • the capability information in the management frames needs to contain the MM capability, the PPC and an indication on overlapping BSS sharing the channel Hence, bit 5 in the capability information field may be used as an "MM capable" bit.
  • an STA sets this but to T in its association/re-association frame it is meant that it is an MMS and is currently lequesting PC association.
  • an AP sets this bit, it means it has the capability of a PC If an MMS does not want CFP operation, it can simply set this bit to zero and act like a basic STA using the DCF mechanisms.
  • the interpretation of the current channel field in the DS parameter set is revised under the present scheme to indicate the next channel number. This change is useful to enable dynamic channel changes.
  • the beacon and the probe response frames are should contain another element called "PC parameter set".
  • the element ID for PC parameter set may be 7.
  • the order of this element in a beacon frame may be 11 and in a probe response frame may be 10.
  • This parameter set indicates the parameters with which the current PC is operating and its structure is shown in Figure 5.
  • This element may have 3 valid bits (B0-B2). Note that this extension assumes that all the current STAs are able to drop those and only those elements that are not currently defined in the 802.1 1 standard and use the rest of the beacon frame and probe response frames.
  • Bit 2 is used to indicate whether the cu ⁇ ent PC is an MC when multiple BSSs are sharing the same channel.
  • a new reason code is required when a PC disassociates an MMS when the MMS does not adhere to the negotiated association agreements such as the duration of transmission duration as desc ⁇ bed in section 5.2.5.2.
  • a PC may use reason code 10, currently reserved, as a code for "Disassociation as the MMS does not adhere to the association agreements.”
  • This section desc ⁇ bes the enhancements to the WLAN topology that are useful in supporting multimedia data transfers.
  • MMS is a multimedia capable STA.
  • An MMS should, • Support DCF-based contention pe ⁇ od operations for backwards compatibility.
  • This application proposes removing the polling mechanism from the PCF as currently defined in the 802.11 specification for the reason that it unnecessa ⁇ ly contributes to bandwidth overhead. Additionally the removal of the polling mechanism from the PC saves processing overhead at the PC.
  • An MMS can optionally measure and report collisions during a non- CFP so that q PC can optimize CFP versus non-CFP communications.
  • a PC is also an MMS • Mandatory single PC for multimedia networks: in the present scheme that there is one and only one PC per network. Du ⁇ ng the network installation, the user should be able to select a device as a designated PC or, by default, the very first PC in the network may become the designated PC. Whenever there are no PCs. a capable MMS should be able to become a PC when a request for CFP operation is detected. When there are more than one PC capable STAs, then they should be required to vote among themselves and choose one among them to be the PC, depending on the available network resources on the PCs.
  • beacons provide the time reference to the MMSs for their transmissions.
  • the PC is required to negotiate and/or allocate the transmission slot duration within a CFP for each MMS.
  • the policies employed in the bandwidth request/negotiate/allocate are described in section 5.2.5.1.
  • the PC is required to monitor the bandwidth utilization by the MMSs du ⁇ ng a CFP and renegotiate the bandwidth, if required, so as to optimize the network utilization.
  • Dynamic channel change The PC is required to measure the channel losses, receive the feedback on channel status from the individual MMSs and assess the channel conditions. If the current channel conditions are severe, the PC is required to momentarily pause the CFP operation and search for a better channel. Once a better channel is found, the PC is required to inform all the associated STAs in the current channel and move the network operations to the new channel. The same mechanism, but in a slightly different manner, may be used when the current channel is occupied and a new PC wishes to establish a CFP. The new PC should check other channels for a free channel before starting negotiations to share bandwidth with the currently operating PC du ⁇ ng a CFP.
  • a PC should always monitor the contention pe ⁇ od and makes sure there is at least one data frame plus acknowledgement duration left free in the contention pe ⁇ od. This requirement is same as is currently defined in the 802.11 specifications.
  • APC alternate point coordinator
  • APCs in a network are periodically updated with a table of currently operating MMSs and their operating parameters If an APC is away/off and associates itself du ⁇ ng an ongoing session, it either waits for the PC to provide an update or it can voluntarily request the same information If there aie multiple APCs volunteering to take over the responsibility of the PC then these APCs should vote for the responsibility This may be implemented by broadcasting a list of the available resources at each of these volunteering APCs The APC with the maximum resources should then win the negotiation This process can take multiple iterations of negotiations depending on the type of APCs and number of APCs present If theie is more than one device with equal resources at the final negotiauon stage, then the device with the largest MAC address may be selected as the new PC
  • a list of resources that may be used in this negotiation scheme is set forth in Table 2 and arranged in order of p ⁇ o ⁇ ty Further, the MM-command should also contain the field to indicate whether the device was designated as the PC du ⁇ ng its installation The compa ⁇ son is performed from top to bottom (of the listed parameters) and the decision is made whenever a better resource compa ⁇ son is found. If there are multiple devices designated as PCs du ⁇ ng installation, then similar negotiations among these devices may be had and the device with greater number of resources should win the negotiation The other devices that are not devices designated as PC du ⁇ ng installation leave the negotiation once such a device enters the fray. Three strig ⁇ os in which ad MMS replaced a current PC are discussed in the following sections
  • an APC detects the PC as absent.
  • the APC tries to establish a connection with the PC by searching tor it in all the channels and then instructs the rest of the APCs that it is taking over the responsibility of the PC. If there are multiple APCs volunteering for this responsibility then there will be voting among them as desc ⁇ bed above.
  • the originally designated PC detects an APC operating as PC.
  • the o ⁇ ginal PC can instruct the cu ⁇ ently operating APC to hand over the PC responsibilities, if such a change is required. Otherwise, the designated PC can associate itself as an MMS with the cu ⁇ ently operating APC until there is a need for such a change.
  • PPC Proxy point coordinator
  • a proxy point coordinator is an MMS acting as a proxy PC between the actual PC and another MMS requesting connection with the PC.
  • the option of becoming a PPC is an option to an MMS.
  • a PPC comes into action when it recognizes the request from an MMS is going unanswered by the operating PC, for example because the MMS suffers from being a hidden node from the point of view of the PC.
  • an MMS recognizes the request calls from another MMS are going unanswered by the cu ⁇ ently operating PC, then it volunteers to be a PPC. If it is not already associated with the operating PC, it so associates itself and obtains permission to be the PPC for the desired MMS.
  • the PPC forms a tunnel between the operating PC and the desired MMS by repeating the frames from either STA to the other.
  • the PPC also sends a beacon for use by the desired MMS. This beacon will have all the information from the beacon of the operating PC with the CF parameters approp ⁇ ately adjusted to simulate a CFP within an existing CFP as shown in Figure 6.
  • the beacons from a PC and PPCs can be clearly identified by examining the CF parameters contained in the beacons.
  • the CF parameters in a beacon from a PPC indicate a CFP contained within the duration indicated by the CF parameters in a beacon from the PC.
  • this extension avoids the bandwidth overhead of an AP having to repeat data for the actual destination station.
  • the basic definitions of a contention pe ⁇ od and CFP do not change in the present scheme (i.e., from those used in the 802.11 specification). However, to simplify the operation, preserve precious bandwidth and achieve the required TDM operation the present scheme eliminates the poll+data+ack nature of transmissions during a CFP. All MMSs are required to send only the MM-frames du ⁇ ng their allocated time pe ⁇ od within each CFP periodically. Hence, the following features are required from the MMS/PC during a CFP. • An MMS/PC need not send or expect MAC-level acknowledgements to any frame received du ⁇ ng the CFP as this can disrupt the TDM operation of the network du ⁇ ng the CFP
  • An MMS/PC can send MM frames to another MMS/PC du ⁇ ng contention pe ⁇ ods expecting the MAC level acknowledgements starting within SEFS, similar to the acknowledgements currently defined in the 802.1 1 specification for control, data and management frames
  • the PC should indicate the next channel it intends to use in the channel field. This can be used by any overlapping BSSs to occupy the current channel after the cu ⁇ ent BSS moves over to the new channel.
  • the PC should send the beacon with the approp ⁇ ate beacon interval.
  • the TBTT is set such that the actual beacon is sent out after a delay of (2 : "DEFS+RTS+CTS+ 3 ' SIFS+MaxData+Ack) from the start of the CFP (as defined in the 802.1 1 specification)
  • MMSs should know the actual start time of beacon transmissions and hence can make use of this penod before the beacon, if available, for connection establishment purposes.
  • the PC monitors the channel and recognizes the frames from STAs with the duration field set to exceed the NAV beyond the actual transmission of the beacon by the PC. If such a frame is detected du ⁇ ng the CFP before the beacon, then the PC sends out a short dummy frame du ⁇ ng the pe ⁇ od of acknowledgement to that frame This corrupts the acknowledgement frame and hence forces the STA to back off This mechanism along with the above- proposed delay, guarantees the availability of channel time for a CFP at the pe ⁇ od that the PC indicates in the beacon as the beacon interval.
  • Data streams are defined as logical connections over an existing association between an MMS and a PC.
  • the concept of streams o ⁇ ginates from the fact that Quality of Service (QoS) is important in providing a best possible transport service while optimally using the available network resources.
  • QoS Quality of Service
  • the concept of streams helps clearly distinguish the data requi ⁇ ng different services, like bandwidth and latency, du ⁇ ng the transportation at both the source and destination devices
  • Each MMS can originate a set of data streams and can consume another set of data streams. For every data stream generation/consumption, an MMS needs permission from the PC and therefore negotiates the network bandwidth tor the same.
  • Each MMS can dynamically connect and disconnect any stream and can re-negotiate the parameters for an existing stream. The PC permits these activities depending on the available resources.
  • the hierarchy co ⁇ esponding to the data streams is as shown in Figure 8. Any two data streams on the network can be distinctly identified based on Source MMS address, Destination MMS address, MM frame subtype and stream index, which are transmitted with each packet. This means that any two types of streams onginating from the same device can have the same stream index. Each stream needs to be connected when needed and disconnected when not needed by the source or destination dev ⁇ ce(s). Two exceptions to this are the basic command channel that is granted to each MMS du ⁇ ng the association process and the data frames that have all zero stream indexes.
  • Each stream can be negotiated with different QoS requirements.
  • QoS with a default set of parameters is provided to the streams based on their subtype.
  • the source MMS needs to collect retransmission requests from the entire set of destination MMSs for that stream and decide which frames need retransmission.
  • the PC maintains the QoS and list of destination MMSs, termed a user list, for each data stream and exchanges this information with the destination MMSs of that data stream.
  • the PC updates the user list for that data stream. If and when a device decides to stop using a data stream, it so informs the PC of its intention and the PC removes that device from the user list maintained for the corresponding data stream.
  • the PC disconnects the stream.
  • any change is made to the user list of a data stream, including disconnection, all the current users of that data stream are informed of the change.
  • any network there are always some data packets that need not be related to any of the streams Examples of this are an ARP packet from an IP/IPX based network and onetime management packets. Stream indices of zero are reserved for such asynchronous data frames that do not need any consistent QoS parameters. Hence there are no connection/disconnection or QoS negotiations for streams with all zero stream indexes.
  • Any device can use this all zero ID and send non-stream based data.
  • Such streams are given the lowest p ⁇ ority (refer to section 5.2.3) in the network and retransmission parameters are set so as to provide very high numbers of retransmissions.
  • Stream synchronization is defined as the process of resto ⁇ ng temporal relationships between various streams or elements that compose the multimedia information.
  • the sequence control field in the header is used per stream in MM data frames unlike across all data types in the cu ⁇ ent 802.11 specification definition.
  • the existing definition does no! change for the non-MM frames du ⁇ ng the contention pe ⁇ od.
  • the stream synchronization is not provided to streams with stream indexes of zero, which are non- stream data.
  • Stream synchronization is best explained with an example.
  • a video and an audio siteam to be synchronized At the source MMS, all the video data within a picture-frame are marked with a number equal to the index of the frame number modulo the total number of picture-frames that can be represented in the stream frame number field.
  • this indication is noted for time stamping the audio stream.
  • the audio stream is time stamped as and when an audio data block is generated (or arrives at the MMS). These time stamps are utilized in determining the stream frame number for that audio data block du ⁇ ng the transportation.
  • the stream frame number is assigned to each of the frames depending on the index of the picture-frame during which the data for that packet was generated.
  • the receiving device compares the stream frame numbers on the two streams it needs to synchronize. There should be sufficient buffering provided by the hardware based on the synchronization window that is requested for these streams. If a frame is lost within this window, a retransmission is requested and the data is delivered only after resynchronization at the receiving device. On the other hand, if the synchronization time window has elapsed and the frames are not yet correctly received, the retransmission request is aborted and the data is delivered with information on the missing frames.
  • the data-consuming agent can provide indications such as UNDERFLOW,
  • NORMAL and OVERFLOW for each of the streams. This information is transported over to the MMS that is generating the stream and is delivered to the data-generating agent so that the data rate of that stream is appropriately altered.
  • a priority service is applied to different data streams.
  • the priority of an entire stream is negotiated once for each stream during stream connection establishment. This priority is an indication of the range of latency and quality of delivery at the receiver side. As the priority is decided over a stream, each frame need not carry any priority bits in the header, thus saving network bandwidth.
  • Isochronous streams are guaranteed the required bandwidth and a maximum limit on the latency.
  • the MAC layer abort any retransmission attempts and deliver the frames whenever the latency exceeds the negotiated time limit. The delivery of such frames should be carried out with appropriate information to the destination and source agents informing them of the aborted retransmissions.
  • any remaining bandwidth, after allocation to all the isochronous streams, may be allocated to other priority streams in the order of their priority.
  • the frames may be differentiated by priority level, and should be buffered and queued to ensure that the frames of a specific data stream are never transmitted out of order.
  • the packets are then transmitted out of the buffers according to a priority-based arbitration mechanism. Data that is not transmitted in a specified superframe is delayed using a random (e.g., round robin) early detection mechanism, starting with the lowest priority traffic first.
  • the exact algorithm used in providing the priority service is not critical to the present invention. 5.2.4 SYNCHRONIZATION DURING CFP
  • Time synchronization between the PC and the MMSs during a CFP is important for TDM access of the channel. In the present scheme, this is made easy through the exchange of association agreements and other commands between the PC and MMSs.
  • the parameters used to achieve the synchronization are the superframe size, the wait time for each MMS, transmission slot (duration) for each MMS and the address of the preceding MMS.
  • This arrangement results in dynamically adjustable time slots for all the MMSs/PC during the CFP. This is also termed Dynamic Time Division Multiplexed Access (DTDMA).
  • DTDMA Dynamic Time Division Multiplexed Access
  • the dynamically adjustable slots and the related parameters of synchronization are desc ⁇ bed and illustrated in Table 3 and Figure 10.
  • a Superframe has the duration between two beacon transmissions indicating the start of a CFP from the PC. This parameter is determined based on the number of associated MMSs and their bandwidth/latency requirements. Wait time is the duration for which an MMS has to wait after receiving the beacon from its associated PC, before it can start transmitting. Transmission slot is the allocated transmission duration (bandwidth) for each MMS in a CFP. All of these parameters may be passed in TU and TU is 1024usec as currently defined in the 802.11 specification.
  • the PC provides each MMS with these parameters.
  • the MMSs honor this agreement by waiting in receive mode and starting transmission at the ⁇ ght time. While waiting, if an MMS detects an end of transmission indication from the preceding device, then it immediately starts its transmission. However, under no circumstances is an MMS allowed to extend its transmissions beyond its wait time plus the transmission slot duration.
  • the extra bandwidth, if any, detected by the cu ⁇ ent MMS can be used to send its queued up data. For example, if a client is supposed to wait for 20msec and it detects the last packet of preceding client within 15msec, then it can make use of the extra 5msec.
  • the end of transmission by the previous MMS is detected as any combination of three different ways: first, the preceding client may send a NULL MM-command packet. Second, the preceding MMS may send a frame with its frame position value set to '1 1 '. This value means the cu ⁇ ent frame is the last frame from that MMS. Third, clear channel (CCA) detection may be used after one or more frames from the preceding MMS. The other values of frame position in frames from the proceeding MMS can also be used to predict the end of transmission of that MMS.
  • CCA clear channel
  • the PC dynamically sets the superframe size and such decisions are made known to all the associated MMSs before the change.
  • the superframe size is determined based on the number of MMSs currently associated with the PC and the bandwidth/latency requirements of the isochronous streams.
  • the actual algo ⁇ thm used to decide the superframe size is not critical to the present invention.
  • an MMS requesting lower latency on an ongoing isochronous stream may be permitted to transmit in more than one discontinuous slots.
  • the association agreements specify the number of slots and parameters (as desc ⁇ bed above) for all the slots. This mechanism is useful in cases such as transporting a VOIP (voice over IP) stream to one MMS along with a DVD-video stream to another MMS in the same superframe.
  • the PC depending upon the latency requested, decides the number of discontinuous slots to be used per frame. 5.2 4 3 Synchronization when multiple BSSs sharing the same channel
  • the operation of multiple BSSs sha ⁇ ng the same channel is desc ⁇ bed in section 5.2.5.3.
  • This section desc ⁇ bes the synchronization parameters and their usage (see generally Figure 11)
  • the synchronization parameters required and their use are very similar to those desc ⁇ bed above. They are: the superframe size, the wait time for each PC/BSS, the transmission slot (duration) for each BSS, the address of the PC of preceding BSS and the corresponding BSS-SED.
  • the wait time at the PC-level for beacon transmission is strictly enforced to avoid any confusion in the network
  • These wait times are always measured from the initial synchronization beacon from the master-coordinator This forms a two-stage wait time, where each PC waits for certain length of time from the beacon of master coordinator and the MMSs within the current BSS wait for a pre- negotiated length of time from the beacon of their associated PC
  • Dynamic bandwidth management involves dynamic bandwidth negotiation between MMSs and the PC, a bandwidth requirement versus bandwidth allocation strategy at the PC and negotiations by multiple PCs to share the same PHY channel.
  • Every MMS in the network can dynamically negotiate the required bandwidth with the PC for transmissions du ⁇ ng a CFP.
  • an MMS can request a change in its allocated bandwidth at any time du ⁇ ng its connection. Use of this feature is best explained using an example.
  • an MMS may request a large bandwidth, which subsequently gets allocated. Later, intentional pauses in the video playback may result in the source MMS requesting a reduced bandwidth. Any extra bandwidth freed up by the new request can be utilized to transport other streams from the same MMS or streams from another MMS.
  • the PC keeps track of all bandwidth allocations. If an MMS requests more bandwidth than is cu ⁇ ently available, then the MMS is allocated only the available bandwidth. The MMS may decide to use the allocated bandwidth (e g , for a non-isochronous stream). On the other hand, if the bandwidth was requested for an isochronous stream, then the bandwidth allocation is rejected and the stream is not connected.
  • Each MMS should pe ⁇ odically collect the required bandwidth for each of its streams and divide the total bandwidth into four groups per the priority of the streams (isochronous, high, medium and low). This categorized bandwidth requirement may be transmitted to the PC pe ⁇ odically.
  • requests from all the MMSs are collected and analyzed against the available bandwidth. If the already allocated bandwidth is same as the available bandwidth any new requests are rejected. If there is some excess bandwidth available, all the new requests for isochronous bandwidth are allocated first. Then the high, medium and low priority requests are visited, in that order.
  • the PC maintains a table listing the available bandwidth, allocated bandwidth for each stream p ⁇ o ⁇ ty at every MMS and the requested bandwidth for each stream priority at every MMS as shown in Table 4.
  • the requirements of the PC are treated the same as any other device. If there is an isochronous request and there is no available bandwidth, then the PC has the option of renegotiating bandwidth with an MMS having the largest bandwidth allocated to the lowest p ⁇ ority that is currently entertained, other than the isochronous priority
  • the actual algorithm employed to allocate the bandwidth dynamically is not critical to the present invention
  • the PC is required to monitor the transmissions du ⁇ ng the CFP by all MMSs and take action if they do not conform to the agreed upon transmission duiation If an MMS is consistently under utilizing its allocated bandwidth, especially any isochronous bandwidth, the PC can renegotiate that extia bandwidth and allocate it to a needy MMS. Transmissions by an MMS beyond the agreed upon end of transmission time are st ⁇ ctly prohibited during the CFP If the PC observes such behavior, it can disassociate the offending device. For this purpose, a new reason code is made part of the present scheme for the disassociation of an MMS by the PC as desc ⁇ bed above in section 4.7
  • BSSs A, B, C and D are physically located in one plane and BSS E is located in another plane Logically, BSSs B, C and D share channel- land BSSs A and E share channel-2 BSS B comes up first and assumes an all zero BSS-SED in channel 1 with 10% bandwidth utilization. BSS A comes up next and assumes an all zero BSS-SED in channel 2 with 80% bandwidth utilization. Now, when BSS D comes up it determines that both channels are busy.
  • Channel-1 is recognized as having the lowest bandwidth utilization and so BSS D requests 30% of the bandwidth in channel-1.
  • BSS B and D thereafter share Channel-1 with 107c and 30%> bandwidth usage respectively.
  • BSS C When BSS C comes up, it detects both channels being busy and recognizes that channel-1 has the lowest bandwidth utilization. Therefore, BSS C requests 40% of the bandwidth in Channel-1, and BSS B, C and D share Channel-1 with 10%, 40% and 30% bandwidth usage respectively.
  • BSS E When BSS E comes up it recognizes that both channels are busy and that Channel-1 and Channel-2 have approximately the same bandwidth utilization. However, Channel-2 is determined to have the fewest number of BSSs operating, so BSS C requests 40% of the bandwidth in Channel-2 and BSS A and E share Channel-2 with 60% and 40% bandwidth usage respectively.
  • the PCs of all the other overlapping and non-operational BSSs search for a free channel. If there is a free channel available, all the PCs of the other overlapping BSSs move over to the new channel. If there is no other channel that is available, the PCs choose a channel that cu ⁇ ently has low bandwidth utilization. This is based on the observed length of a CFP. This calls for the PCs to periodically assess the bandwidth utilization and find a free channel or a channel with low bandwidth utilization.
  • the PC When an MMS from any BSS associates with the co ⁇ esponding PC and requests contention free service, the PC establishes a CFP and can allocate the bandwidth up to the maximum limit of the CFP in a channel. In this condition, the PC assigns itself the all zero BSS session ED (BSS-SED).
  • the PC with the all zero BSS-SED is termed the master coordinator (MC), as this PC coordinates all the future bandwidth negotiations among the BSSs. If all the MMSs disconnect before any other BSS tries to use the same channel, the PC shuts off its own transmissions and parks itself in a relatively free channel.
  • the following sections desc ⁇ be the scenario of multiple BSSs trying to use the same channel while there is already another BSS operating on the same channel. 5.2.5.5 More BSSs Coming up in the Same Channel
  • the new PC looks for a channel with the shortest CFP operation and/or fewer number of BSSs sha ⁇ ng that channel. If a totally free channel is found, the new BSS starts operating in that channel.
  • the co ⁇ esponding PC would assign itself an all zero BSS-SED and assume the responsibility of the master coordinator in that channel.
  • the new PC sends PC-level MM-commands to the MC requesting bandwidth for its operation.
  • the MC should allocate the next available BSS-SID to the new BSS and accommodate its request up to 50% of the CFP for the new BSS's operation.
  • all BSSs are treated the same and are entitled to an equal share of the total bandwidth.
  • the bandwidth available to each BSS is limited to the total bandwidth in the channel equally divided among all the BSSs. For example, when three overlapping BSSs operate in the same channel, they should each be guaranteed up to one third of the total bandwidth.
  • the remaining bandwidth may be shared among all the other operating BSSs in the same channel.
  • the master coordinator is responsible for issuing BSS-SIDs to the new BSS.
  • the new PCs may use an all one BSS-SED.
  • the BBSS-SED, source address and the destination addresses are used to clearly distinguish the frames from/to multiple numbers of new PCs negotiating for the CFP with MC.
  • the MC is responsible for keeping track of all the bandwidth negotiations and communicating same to all the cu ⁇ ent bandwidth-sha ⁇ ng PCs pe ⁇ odically. This information may be maintained in a separate table designated for this purpose. Such a table may include all the currently operating BSSs with their BSS-SED, BSS ID, the bandwidth requested and the bandwidth allocated.
  • the master coordinator conducts a le-negotiation with all the operating BSSs so as to provide a fair share in the bandwidth to the new incoming BSS. All the PCs, especially those that have been allocated less than an equal share of the total available bandwidth, periodically check the other channels for low bandwidth utilization This is done after informing the master coordinator that such a check is being made so that the originally negotiated bandwidth is retained while the cu ⁇ ent PC is checking other channels An exception to this rule is when the master coordinator is in the presence of at least one other PC sharing the channel bandwidth. The master coordinator is prevented from being tempora ⁇ ly absent from the cu ⁇ ent channel so that the BSS-level synchronization is always maintained.
  • the time duration between two channel checks is suggested to be random to avoid multiple BSSs changing channels at the same time Whenever a BSS that is sha ⁇ ng bandwidth in a channel finds another channel with better bandwidth characte ⁇ stics, it informs the master coordinator before changing channels so that its cu ⁇ ent bandwidth is freed up. Additionally, the channel check is performed only when a new MMS in a BSS is coming online and hence the
  • BSS needs more bandwidth. This avoids unnecessary channel checks and channel changes even when all the BSSs can operate within the available bandwidth in any one channel.
  • a master coordinator Whenever a master coordinator decides to close its operation, it instructs the PC with the next lowest BSS-SED to take over the responsibilities of master coordinator. Along with such an instruction, the entire BSS-SED table is passed to the new master coordinator in a broadcast packet. The new master coordinator starts using the all zero BSS-SED and instructs its clients to do the same. Du ⁇ ng this hand over, requests from new BSSs are not entertained.
  • This section desc ⁇ bes the operation of overlapping BSSs when the PCs cannot receive transmissions from each other while at least one of the operating MMSs can receive from both PCs.
  • the MMS that can receive transmissions from both the PCs assumes the responsibility of a proxy- coordinator and coordinates the negotiations between the two PCs.
  • BSS B comes up first and starts using an all zero BSS-SED.
  • BSS D comes up next and lequests bandwidth sha ⁇ ng with B.
  • BSS C comes up next and requests bandwidth sha ⁇ ng with B and D. Then BSS A comes up.
  • BSS D detects both A and B and reports to B that A is operating in the same channel.
  • B assigns D as a proxy coordinator and sends a response to the request of D for bandwidth sharing.
  • D acts as tunnel between B and A.
  • A receives an invitation from B to join the already gioup existing group of B.
  • C and D A is assigned a BSS-SID and the synchronization parameters with respect to D's transmission of a beacon.
  • C detects request from E and reports to C that E is operating in the same channel.
  • C tunnels the information to B and B assigns C tl as a proxy coordinator and sends a request to C seeking permission for such operations.
  • C agrees to the request and provides the permission.
  • C and C ⁇ l together form a tunnel between B and E.
  • E is assigned a BSS-SID and the synchronization parameters with respect to C tI 's transmission of first packet.
  • the incoming new PC detects frames from a group of BSSs and it sends its request to the master coordinator for admission into the group. If the master coordinator does not respond, the new PC continues to send the same request, implying a request for proxy-master service.
  • the associated PC may choose one of them randomly.
  • an immobile device is always preferred over a mobile device for the reason that the mobile device may move out of the overlapping physical region.
  • the MMS with the capability of becoming a PC is preferred over others and the responsibility of the current PC is handed over to the chosen MMS to simplify the network operations
  • the MC can accept an offer from only one of them. Once the MC accepts an offer, the voluntee ⁇ ng MMS/PC is allowed to repeat only the MM-command frames between the
  • the MC allocates a BSS-SID, it is supplied to the volunteering MMS so that the tunnel service is reserved between the MC and the negotiated PC. If the MMS needs to be disassociated, it informs both the
  • the disconnected PC starts sending request frames using an all one BSS-SED and starts the negotiations again.
  • the number of BSSs connected to a group of BSSs through proxy coordinators should be limited. This number may be computed based on the number of overlapping BSSs and the number of different channels available. For example, in a cubic problem of four overlapping BSSs in a plane, overall there are 12 overlapping BSSs. With at least two different channels being available, six overlapping BSSs will be active in each channel. That is, four BSSs in the same plane as the master coordinator and one BSS in each of the other two planes. Hence, the number of BSSs connected by proxy coordinators can be two, though four may be safer. If a BSS cannot get its channel bandwidth share because of the need for a proxy coordinator, then it should try the next best channel available.
  • MC broadcasts the existence of such a situation to all the BSSs and sends the negotiation command to MC y through C
  • the group with the lowest number of BSSs or the group with the lowest bandwidth utilization dissolves the cu ⁇ ent group and joins the other group. This means the BSSs joining the new group will be assigned new BSS-
  • ECC error correction coding
  • CRC cyclic redundancy check
  • the present scheme allows for the use of a (255, k) Reed-Solomon coder over GF(2 ⁇ ).
  • the information rate, 'k' can be negotiated depending on the RF channel conditions and requirements according to the characte ⁇ stics of the data stream.
  • Each data frame (including the header) is split into blocks of k symbols (each symbol is a byte long) and ECC is earned out to form 255-byte blocks.
  • the last ECC block in the frame can contain less than 'k' information symbols.
  • Interleaving is useful if implemented with a large interleaving depth. This may affect the flow of latency sensitive streams Hence interleaving may be left to the layers above the MAC where it can be earned out at the stream level to improve the performance of unidirectional streams.
  • stream level retransmissions based on a Selective Auto Repeat reQuest (ARQ) mechanism du ⁇ ng a CFP may be used.
  • the retransmission requirements of streams vary depending on their type, bandwidth requirements and latency requirements. For example, file transfers based on TCP/IP streams may not need retransmissions at the MAC layer at all, while streams generated by devices without TCP/IP support might need complete retransmission support.
  • Du ⁇ ng the connection establishment penod the receiving device should be able to negotiate the different parameters involved in the selective ARQ, like retransmission window size, timeouts, etc., that suit the bandwidth and latency requirements of that stream. All retransmission requests are sent back to the source MMS in the MM frame subtype command in the next available superframe.
  • Channel changing may occur in two situations. First, channel changing may occur du ⁇ ng the association of an MMS, if the MMS and the PC are in different channels. Second, channel changing may occur du ⁇ ng the operation of a BSS when the current channel of operation has only low throughput to offer, either due to too many BSSs sharing the channel or due to high interference. The following paragraphs desc ⁇ be these two situations and explain the process of changing the channel of operation.
  • the PC of a BSS should always try to operate in a relatively free channel unless all the devices are in the DCF-only mode of operation. This is true even when the BSS does not have any MMSs
  • an MMS wakes up and needs an association, it searches all the possible channels for a PC by sending its request and timing out in each channel before changing over to the next channel. This assures that an MMS always finds the PC even if they are in different channels to start with.
  • the PC When the PC recognizes the association request from an MMS, it authenticates the MMS and at the same time starts negotiations with the BSS-group. if any, which is cu ⁇ ently operating in the channel. Once the PC obtains the duration for its own CFP, it sends the beacon in the channel at its TBTT. The MMS requests the bandwidth, obtains a connection with another MMS and starts using the channel. If the MMS that needs to be connected is in another channel, it is the responsibility of the PC to instruct the first MMS to remain quiet and search the other channels for the second MMS. The PC therefore sends requests in each channel addressed to the second MMS, requesting that this MMS move to the original channel of operation and establish a connection.
  • the second situation requiring channel selection occurs when the PC or one of the MMSs experiences serious channel impairments despite higher degree of ECC.
  • Each MMS and PC in the BSS measures the channel status in terms of packet error rates and packet loss rates that they are experiencing.
  • the MMSs send the measured channel status to the PC periodically.
  • the PC may decide to change channels and move the network operations to a better channel.
  • the mechanism used to determine whether or not to change channels is not critical to the present invention.
  • the PC After the PC decides to leave a cu ⁇ ent channel, it searches for another free channel. Thus, all the MMSs are instructed to remain quiet for a while through a broadcast message and the PC snoops other channels for operation of BSSs or for the stray energy measured in terms of CCA mechanisms. As all the MMSs are required to remain quiet due to the absence of a beacon from the associated PC, there will be a momentary pause in the network operations during this process.
  • the PC switches back to the original channel, broadcasts a change channel message to all the MMSs and expects acknowledgements back from each individual MMSs.
  • Each MMS changes channel only after it sends its acknowledgement more than once to the change channel command from the PC. If an MMS does not respond, the PC performs a predefined number of attempts to reach it and then decides that the MMS is unreachable. Similarly the MMS can decide that the PC is unreachable after waiting for a predefined length of time and start searching for the PC in other channels.
  • the PC changes channels after all the MMSs have responded or after the time out condition. Once in the new channel, the MMS wait for the beacon from the PC to start communications.
  • the PC broadcasts the change channel message, with the indication of the destination channel as the cu ⁇ ent channel, to announce its presence in the new channel and expects acknowledgement from each MMS. If an MMS does not respond within a predefined number of attempts, the PC decides that the MMS is disconnected.
  • the PC After identifying all the MMSs the PC starts regular network operations. If a BSS is currently sharing bandwidth with other BSSs, the PC of the BSS that is changing channels should inform the MC before moving the network operations over to a new channel.
  • the PC After deciding to change the channel, if a free channel is not found, the PC simply returns to the original channel and broadcasts a change channel message with the current channel as the destination channel. After this broadcast it starts normal operations by sending out beacons and expecting the MMSs to communicate as before.
  • a network protocol should inherently provide the basic support required for future upgrades.
  • the present scheme uses two extensions for that reason. They are the network feature update and the reservation of protocol version bits for dynamic negotiation of the protocol header and fields in the header. These extensions are discussed in detail in the following sections.
  • the proposed MM frame subtype for network feature updates allows the MMSs to obtain the most recent protocol/firmware/software from any other MMS that has access to such information via connections like Internet.
  • the PC is required to check the version of the MMS during the association and request another MMS (or itself) to update the current MMS.
  • the actual algorithm used for verification and the version numbers supplied during association is not critical to the present invention.
  • a MMS can update a maximum of 255 devices at any given time. 5 3 2 PROTOCOL VERSION VALUE OF ' 1 1 '
  • the present scheme resei ves the ' 1 1 ' value of the protocol version bits in the frame control field
  • the value 1 1 of the protocol version bits can be used for dynamic negotiation of the frame headei content and size in the following manner
  • All MMSs in the network maintain two lists
  • the first list contains all the supported fields in the frame header, their default positions and their default lengths in bits. This list can be updated in the future for more fields in the frame header
  • the second list is a subset of the first list containing only those fields supported in the current session, the actual position and length of these fields
  • the MMSs that needs a change in the format can use the basic header format, as currently defined, to associate and request the change using appropnate MM commands
  • the protocol version bits should be set to '11' and this format should be made known to all the related MMS. If an MMS cannot accept the new format it should still be able to communicate with the new device using the currently defined frame header format. This way, a BSS can have a combination of old and new generation devices but still keep the devices communicating with each other. The newer generation devices can have new services offered when they communicate with the same generation devices. Since these negotiations are connection o ⁇ ented, an MMS can negotiate a different header format with each MMS that it is currently connected to Nevertheless, if there is a change m the frame header format, it is applicable to all the frames communicated between the two involved MMSs. All the multicast and broadcast frames should make use of the cu ⁇ ently defined format. All the control frames defining basic services like association, re-association and disassociation should make use of the cu ⁇ ently defined format.
  • DS stations should also refrain from transmitting a frame if there is not enough time for the entire frame plus the expected acknowledgement packet, if any, before the start of the next CFP
  • FH stations should make use of the CFP in the beacon sent by the PC Additionally, if the
  • STAs continue to use this parameter even when a few beacons are lost due to channel co ⁇ uption. a better CFP operation can be achieved.
  • a timeout of one second or so may be used by the STAs to revert back to the contention-only operation (no CFP) from the time they receive a beacon from the PC announcing CFP operation.
  • Dynamic channel changes should be supported by the MAC protocol itself and not rely on an application above that layer. Therefore, one control frame subtype should be reserved for this purpose and one for the corresponding acknowledgement.
  • the actual mechanism of deciding whether or not to change channels need not necessa ⁇ ly be defined Additional control subtypes for channel statistics reports, and acknowledgement, between DCF-only devices and an AP should also be provided so that the STAs can report the measured channel status back to the AP to assist in the decision of whether a channel change is necessary.

Abstract

La présente invention concerne un plan pour des réseaux locaux sans fil, qui fournit des extensions multimédias pour des applications à haut débit. Certaines des extensions fournies sont les suivantes : l"en-tête de commande d"accès au support (MAC) est étendue afin de comprendre les composants pour un support multimédia. Les extensions de topologie de réseau comprennent une définition plus étroite du PC, des connexions entre homologues lors du CFP, PC alternatif et PC proxy. Les extensions relatives à la qualité de service (QoS) comprennent la simplification de fonctionnement lors du CFP, le support de flux, la priorité de flux, la synchronisation de transmissions à multiplexage temporel (TDM) au moyen de dispositifs lors du CFP, la gestion de largeur de bande dynamique, la protection de voie par utilisation de codage de commande d"erreur et de paramètres de retransmission négociables. La négociation dynamique de la priorité, de la largeur de bande et des paramètres de retransmission pour chaque flux, de manière séparée, permet la commande du temps d"attente. La présente invention concerne également des extensions qui sont proposées pour le fonctionnement de stations uniquement DCF, afin d"améliorer leur interfonctionnement avec des dispositifs multimédias.
PCT/US2001/001656 2000-03-23 2001-01-17 Extensions multimedias pour reseaux locaux sans fil WO2001071981A2 (fr)

Priority Applications (1)

Application Number Priority Date Filing Date Title
AU2001230966A AU2001230966A1 (en) 2000-03-23 2001-01-17 Multimedia extensions for wireless local area networks

Applications Claiming Priority (4)

Application Number Priority Date Filing Date Title
US19163600P 2000-03-23 2000-03-23
US60/191,636 2000-03-23
US09/614,833 US6865609B1 (en) 1999-08-17 2000-07-12 Multimedia extensions for wireless local area network
US09/614,833 2000-07-12

Publications (2)

Publication Number Publication Date
WO2001071981A2 true WO2001071981A2 (fr) 2001-09-27
WO2001071981A3 WO2001071981A3 (fr) 2002-08-22

Family

ID=26887242

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/US2001/001656 WO2001071981A2 (fr) 2000-03-23 2001-01-17 Extensions multimedias pour reseaux locaux sans fil

Country Status (2)

Country Link
AU (1) AU2001230966A1 (fr)
WO (1) WO2001071981A2 (fr)

Cited By (16)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP1302048A2 (fr) * 2000-07-13 2003-04-16 Sharewave, Inc. Qualite d'extensions de service pour applications multimedia dans un reseau d'ordinateurs sans fil
EP1484867A3 (fr) * 2003-06-03 2005-03-02 Samsung Electronics Co., Ltd. Allocation des temps de canal dans un réseau sans fil
WO2006137705A1 (fr) * 2005-06-22 2006-12-28 Electronics And Telecommunications Research Institute Appareil et methode pour negocier la qualite de service
WO2007055898A1 (fr) * 2005-11-03 2007-05-18 Interdigital Technology Corporation Procede et appareil d'echange de messages par l'intermediaire d'un systeme de distribution sans fil entre des groupes fonctionnant sur des frequences differentes
WO2008035863A1 (fr) * 2006-09-22 2008-03-27 Samsung Electronics Co, . Ltd. Procédé et appareil de synchronisation d'applications de terminaux dans un réseau de communication
US7366126B2 (en) 2002-11-08 2008-04-29 Sharp Laboratories Of America, Inc. Modified-beacon, bandwidth-access control in wireless network communication system
US7423966B2 (en) 2002-11-07 2008-09-09 Sharp Laboratories Of America, Inc. Prioritized communication bandwidth-sharing management for plural-station wireless communication system
US7426180B2 (en) 2002-11-08 2008-09-16 Sharp Laboratories Of America, Inc. Rapid build transmission-limit method and structure for BSS stations in wireless communication network
US7450610B2 (en) 2003-06-03 2008-11-11 Samsung Electronics Co., Ltd. Apparatus and method for allocating channel time to applications in wireless PAN
US7542452B2 (en) 2004-04-09 2009-06-02 Sharp Laboratories Of America, Inc. Systems and methods for implementing an enhanced multi-channel direct link protocol between stations in a wireless LAN environment
CN101527926A (zh) * 2003-05-14 2009-09-09 美商内数位科技公司 一种被配置为请求和接收测量的无线发射/接收单元
EP2115951A2 (fr) * 2007-01-17 2009-11-11 Sierra Wireless, Inc. Interface de programmation d'application de qualité de service sur la base d'une interface de connexion
CN101218783B (zh) * 2005-06-22 2010-09-15 韩国电子通信研究院 用于协商服务质量的装置和方法
US9210719B2 (en) 2003-11-19 2015-12-08 Koninklijke Philips N.V. Method for access to a medium by a multi-channel device
AU2016319274B2 (en) * 2015-09-11 2019-07-04 Sony Corporation Wireless communication device, wireless communication method and wireless communication system
US11252229B2 (en) * 2013-12-20 2022-02-15 Samsung Electronics Co., Ltd Connection method for smart home device and apparatus thereof

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5519640A (en) * 1994-01-26 1996-05-21 Hughes Aircraft Company Multimedia frame relay codec
WO1997008838A2 (fr) * 1995-08-14 1997-03-06 Ericsson Inc. Procede et equipement permettant de modifier un en-tete normalise de couche de protocole inter-reseaux
GB2331600A (en) * 1997-11-21 1999-05-26 Ibm Customization of Web pages based on requester type
US6031832A (en) * 1996-11-27 2000-02-29 Telefonaktiebolaget L M Ericsson (Publ) Method and apparatus for improving performance of a packet communications system

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5519640A (en) * 1994-01-26 1996-05-21 Hughes Aircraft Company Multimedia frame relay codec
WO1997008838A2 (fr) * 1995-08-14 1997-03-06 Ericsson Inc. Procede et equipement permettant de modifier un en-tete normalise de couche de protocole inter-reseaux
US6031832A (en) * 1996-11-27 2000-02-29 Telefonaktiebolaget L M Ericsson (Publ) Method and apparatus for improving performance of a packet communications system
GB2331600A (en) * 1997-11-21 1999-05-26 Ibm Customization of Web pages based on requester type

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
GUBBI R: "Isochronous services in home multimedia networks" COMMUNICATIONS, COMPUTERS AND SIGNAL PROCESSING, 1999 IEEE PACIFIC RIM CONFERENCE ON VICTORIA, BC, CANADA 22-24 AUG. 1999, PISCATAWAY, NJ, USA,IEEE, US, 22 August 1999 (1999-08-22), pages 534-539, XP010356692 ISBN: 0-7803-5582-2 *
GUBBI R: "Multimedia streams and quality of service in the next generation wireless home networks" MOBILE MULTIMEDIA COMMUNICATIONS, 1999. (MOMUC '99). 1999 IEEE INTERNATIONAL WORKSHOP ON SAN DIEGO, CA, USA 15-17 NOV. 1999, PISCATAWAY, NJ, USA,IEEE, US, 15 November 1999 (1999-11-15), pages 232-235, XP010370706 ISBN: 0-7803-5904-6 *

Cited By (29)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP1302048A2 (fr) * 2000-07-13 2003-04-16 Sharewave, Inc. Qualite d'extensions de service pour applications multimedia dans un reseau d'ordinateurs sans fil
US7423966B2 (en) 2002-11-07 2008-09-09 Sharp Laboratories Of America, Inc. Prioritized communication bandwidth-sharing management for plural-station wireless communication system
US7366126B2 (en) 2002-11-08 2008-04-29 Sharp Laboratories Of America, Inc. Modified-beacon, bandwidth-access control in wireless network communication system
US7426180B2 (en) 2002-11-08 2008-09-16 Sharp Laboratories Of America, Inc. Rapid build transmission-limit method and structure for BSS stations in wireless communication network
US9332451B2 (en) 2003-05-14 2016-05-03 Intel Corporation Method and apparatus of requesting a beacon report
US9961577B2 (en) 2003-05-14 2018-05-01 Intel Corporation Method and apparatus of communicating a beacon report
CN101527926B (zh) * 2003-05-14 2020-07-17 英特尔公司 一种被配置为请求和接收测量的无线发射/接收单元
US9668157B2 (en) 2003-05-14 2017-05-30 Intel Corporation Method and apparatus of communicating a beacon report
US8265051B2 (en) 2003-05-14 2012-09-11 Interdigital Technology Corporation Method and apparatus for network management using periodic measurements of indicators
CN101527923B (zh) * 2003-05-14 2011-09-14 美商内数位科技公司 一种在接入点中使用的方法
US7710930B2 (en) 2003-05-14 2010-05-04 Interdigital Technology Corporation Method and apparatus for network management using periodic measurements of indicators
CN101527926A (zh) * 2003-05-14 2009-09-09 美商内数位科技公司 一种被配置为请求和接收测量的无线发射/接收单元
US7450610B2 (en) 2003-06-03 2008-11-11 Samsung Electronics Co., Ltd. Apparatus and method for allocating channel time to applications in wireless PAN
EP1484867A3 (fr) * 2003-06-03 2005-03-02 Samsung Electronics Co., Ltd. Allocation des temps de canal dans un réseau sans fil
US10015818B2 (en) 2003-11-19 2018-07-03 Koninklijke Philips N.V. Method for access to a medium by a multi-channel device
US9210719B2 (en) 2003-11-19 2015-12-08 Koninklijke Philips N.V. Method for access to a medium by a multi-channel device
US7542452B2 (en) 2004-04-09 2009-06-02 Sharp Laboratories Of America, Inc. Systems and methods for implementing an enhanced multi-channel direct link protocol between stations in a wireless LAN environment
CN101218783B (zh) * 2005-06-22 2010-09-15 韩国电子通信研究院 用于协商服务质量的装置和方法
WO2006137705A1 (fr) * 2005-06-22 2006-12-28 Electronics And Telecommunications Research Institute Appareil et methode pour negocier la qualite de service
JP2009515475A (ja) * 2005-11-03 2009-04-09 インターデイジタル テクノロジー コーポレーション 異なる周波数で動作するグループ間でワイヤレス配布システムを介してメッセージを交換する方法および機器
EP2365724A1 (fr) * 2005-11-03 2011-09-14 Interdigital Technology Corporation Procédé et appareil d'échange de messages via un système de distribution sans fil entre des groupes fonctionnant à différentes fréquences
WO2007055898A1 (fr) * 2005-11-03 2007-05-18 Interdigital Technology Corporation Procede et appareil d'echange de messages par l'intermediaire d'un systeme de distribution sans fil entre des groupes fonctionnant sur des frequences differentes
US8155157B2 (en) 2006-09-22 2012-04-10 Samsung Electronics Co., Ltd. Method and apparatus for synchronizing applications of terminals in communication network
WO2008035863A1 (fr) * 2006-09-22 2008-03-27 Samsung Electronics Co, . Ltd. Procédé et appareil de synchronisation d'applications de terminaux dans un réseau de communication
EP2115951A4 (fr) * 2007-01-17 2013-04-03 Sierra Wireless Inc Interface de programmation d'application de qualité de service sur la base d'une interface de connexion
EP2115951A2 (fr) * 2007-01-17 2009-11-11 Sierra Wireless, Inc. Interface de programmation d'application de qualité de service sur la base d'une interface de connexion
US11252229B2 (en) * 2013-12-20 2022-02-15 Samsung Electronics Co., Ltd Connection method for smart home device and apparatus thereof
US11706294B2 (en) 2013-12-20 2023-07-18 Samsung Electronics Co., Ltd Connection method for smart home device and apparatus thereof
AU2016319274B2 (en) * 2015-09-11 2019-07-04 Sony Corporation Wireless communication device, wireless communication method and wireless communication system

Also Published As

Publication number Publication date
WO2001071981A3 (fr) 2002-08-22
AU2001230966A1 (en) 2001-10-03

Similar Documents

Publication Publication Date Title
US6865609B1 (en) Multimedia extensions for wireless local area network
US6934752B1 (en) Quality of service extensions for multimedia applications in wireless computer networks
US6754176B1 (en) Scheme for managing overlapping wireless computer networks
US7251231B2 (en) Method and apparatus for controlling communication within a computer network
US7093015B2 (en) Method and apparatus for accessing a wireless computer network communication channel by accessing quiet intervals in network frames
US7009960B2 (en) Medium access control protocol for high rate wireless personal area network
US8031666B2 (en) Method for transmitting a data packet and a method of allocating a channel in a wireless network
US20030231621A1 (en) Dynamic communication channel switching for computer networks
US20060153117A1 (en) Method and apparatus for bandwidth provisioning in a wlan
JP2010022025A (ja) 過負荷状況下でのデータ通信システム内の通信リソースの効率的な使用のための方法および装置
WO2001071981A2 (fr) Extensions multimedias pour reseaux locaux sans fil
US20030069988A1 (en) In-band signaling
WO2008008918A2 (fr) Procédé et appareil pour une synchronisation temporelle de paramètres
WO2002006986A2 (fr) Qualite d'extensions de service pour applications multimedia dans un reseau d'ordinateurs sans fil
KR100666127B1 (ko) Ｗｐａｎ에서 동적 응답 정책을 이용한 데이터 프레임전송방법
JP4591068B2 (ja) 無線通信システム、無線通信装置及び無線通信方法、並びにコンピュータ・プログラム
KR101456483B1 (ko) 데이터를 송수신하는 방법
WO2002005492A1 (fr) Flux multimedia et qualite de services dans des reseaux familiaux sans fil
Sharma Analysis of 802.11 b MAC: A QoS, fairness, and performance perspective
CA2379844A1 (fr) Structure de synchronisation de creneaux temporels de reseau pour canal de communication de reseau informatique
JP2008533797A (ja) 周期的なチャネル時間割り当てを使用するステップを提供する通信品質
JP5263735B2 (ja) 条件最適化のための物理層ヘッダを有する無線通信システム
Shamy Analysis and enhancement of wireless LANs in noisy channels
WO2000016521A1 (fr) Architecture hierarchisee de reseau informatique

Legal Events

Date Code Title Description
AK Designated states

Kind code of ref document: A2

Designated state(s): AE AG AL AM AT AU AZ BA BB BG BR BY BZ CA CH CN CR CU CZ DE DK DM DZ EE ES FI GB GD GE GH GM HR HU ID IL IN IS JP KE KG KP KR KZ LC LK LR LS LT LU LV MA MD MG MK MN MW MX MZ NO NZ PL PT RO RU SD SE SG SI SK SL TJ TM TR TT TZ UA UG UZ VN YU ZA ZW

AL Designated countries for regional patents

Kind code of ref document: A2

Designated state(s): GH GM KE LS MW MZ SD SL SZ TZ UG ZW AM AZ BY KG KZ MD RU TJ TM AT BE CH CY DE DK ES FI FR GB GR IE IT LU MC NL PT SE TR BF BJ CF CG CI CM GA GN GW ML MR NE SN TD TG

DFPE Request for preliminary examination filed prior to expiration of 19th month from priority date (pct application filed before 20040101)
121 Ep: the epo has been informed by wipo that ep was designated in this application
AK Designated states

Kind code of ref document: A3

Designated state(s): AE AG AL AM AT AU AZ BA BB BG BR BY BZ CA CH CN CR CU CZ DE DK DM DZ EE ES FI GB GD GE GH GM HR HU ID IL IN IS JP KE KG KP KR KZ LC LK LR LS LT LU LV MA MD MG MK MN MW MX MZ NO NZ PL PT RO RU SD SE SG SI SK SL TJ TM TR TT TZ UA UG UZ VN YU ZA ZW

AL Designated countries for regional patents

Kind code of ref document: A3

Designated state(s): GH GM KE LS MW MZ SD SL SZ TZ UG ZW AM AZ BY KG KZ MD RU TJ TM AT BE CH CY DE DK ES FI FR GB GR IE IT LU MC NL PT SE TR BF BJ CF CG CI CM GA GN GW ML MR NE SN TD TG

122 Ep: pct application non-entry in european phase
NENP Non-entry into the national phase

Ref country code: JP