WO1998027747A2 - Medium access control (mac) protocol for wireless atm - Google Patents

Medium access control (mac) protocol for wireless atm Download PDF

Info

Publication number
WO1998027747A2
WO1998027747A2 PCT/IB1997/001557 IB9701557W WO9827747A2 WO 1998027747 A2 WO1998027747 A2 WO 1998027747A2 IB 9701557 W IB9701557 W IB 9701557W WO 9827747 A2 WO9827747 A2 WO 9827747A2
Authority
WO
WIPO (PCT)
Prior art keywords
allocation
node
packets
time
nodes
Prior art date
Application number
PCT/IB1997/001557
Other languages
French (fr)
Other versions
WO1998027747A3 (en
Inventor
Samir N. Hulyalkar
Chiu Ngo
Yonggang Du
Original Assignee
Koninklijke Philips Electronics N.V.
Philips Norden Ab
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
Application filed by Koninklijke Philips Electronics N.V., Philips Norden Ab filed Critical Koninklijke Philips Electronics N.V.
Priority to JP52749298A priority Critical patent/JP3881385B2/en
Priority to EP97913408A priority patent/EP0890267A2/en
Publication of WO1998027747A2 publication Critical patent/WO1998027747A2/en
Publication of WO1998027747A3 publication Critical patent/WO1998027747A3/en

Links

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04QSELECTING
    • H04Q11/00Selecting arrangements for multiplex systems
    • H04Q11/04Selecting arrangements for multiplex systems for time-division multiplexing
    • H04Q11/0428Integrated services digital network, i.e. systems for transmission of different types of digitised signals, e.g. speech, data, telecentral, television signals
    • H04Q11/0478Provisions for broadband connections
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00Data switching networks
    • H04L12/28Data switching networks characterised by path configuration, e.g. LAN [Local Area Networks] or WAN [Wide Area Networks]
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W72/00Local resource management
    • H04W72/04Wireless resource allocation
    • H04W72/044Wireless resource allocation based on the type of the allocated resource
    • H04W72/0446Resources in time domain, e.g. slots or frames
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00Data switching networks
    • H04L12/54Store-and-forward switching systems 
    • H04L12/56Packet switching systems
    • H04L12/5601Transfer mode dependent, e.g. ATM
    • H04L2012/5603Access techniques
    • H04L2012/5604Medium of transmission, e.g. fibre, cable, radio
    • H04L2012/5607Radio
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00Data switching networks
    • H04L12/54Store-and-forward switching systems 
    • H04L12/56Packet switching systems
    • H04L12/5601Transfer mode dependent, e.g. ATM
    • H04L2012/5678Traffic aspects, e.g. arbitration, load balancing, smoothing, buffer management
    • H04L2012/5679Arbitration or scheduling
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W28/00Network traffic management; Network resource management
    • H04W28/02Traffic management, e.g. flow control or congestion control
    • H04W28/10Flow control between communication endpoints
    • H04W28/14Flow control between communication endpoints using intermediate storage
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W52/00Power management, e.g. TPC [Transmission Power Control], power saving or power classes
    • H04W52/02Power saving arrangements
    • H04W52/0209Power saving arrangements in terminal devices
    • H04W52/0212Power saving arrangements in terminal devices managed by the network, e.g. network or access point is master and terminal is slave
    • H04W52/0216Power saving arrangements in terminal devices managed by the network, e.g. network or access point is master and terminal is slave using a pre-established activity schedule, e.g. traffic indication frame
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W72/00Local resource management
    • H04W72/20Control channels or signalling for resource management
    • H04W72/21Control channels or signalling for resource management in the uplink direction of a wireless link, i.e. towards the network
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W72/00Local resource management
    • H04W72/20Control channels or signalling for resource management
    • H04W72/23Control channels or signalling for resource management in the downlink direction of a wireless link, i.e. towards a terminal
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W74/00Wireless channel access, e.g. scheduled or random access
    • H04W74/04Scheduled or contention-free access
    • YGENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y02TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02DCLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
    • Y02D30/00Reducing energy consumption in communication networks
    • Y02D30/70Reducing energy consumption in communication networks in wireless communication networks

Definitions

  • This invention generally relates to communication networks and protocols, with particular relevance to wireless networks, or other networks requiring minimal turnaround time. It specifically addresses a control protocol for wireless ATM, although the features presented can be applied to alternative protocols as well.
  • communication networks are formed by interconnecting devices by wire or cable, and having each device conform to a protocol for sending messages along these wires and cables.
  • a portion of such a network may be implemented as a wireless connection, employing radio or infrared frequency signals between nodes.
  • Such wireless connections are point-to-point, having a single communications device at each end, each tuned to each other at a frequency different from other devices in the same geographic area.
  • a wireless network is formed without physical connections among the devices, employing, for example, radio frequency signals.
  • Each device on the network is tuned to the same frequency, and each device conforms to a protocol for sending messages at this common frequency.
  • the protocol may allow communication among all the devices in the network or the protocol may constrain each device to only communicate with a master device.
  • Wireless networks offer a significant logistical advantage over wired networks, by obviating the need to run wires or cables to each device.
  • LANs Local Area Networks
  • a central base station may provide wireless services, including voice, video, and data, to all the communications devices in one's home, or a wireless base station may provide for the communication among all the portable computers in an office, or all the computers on a campus.
  • the techniques and protocols employed in these wireless networks must not be significantly inferior to their wired network equivalents, and they must be able to provide compatibility with existing networks, particularly in terms of compatible service and management criteria.
  • wireless network associated with a wireless network is the likelihood of the presence of portable, battery powered, devices. Although some wireless devices, such as desktop computers, televisions, and home theatre systems will be powered by AC line supplies, a number of wireless devices, such as telephones, cameras, and laptop computers will be powered by batteries. In providing for a wireless network protocol, consideration must be given to an architecture which allows for power conservation as well. Such considerations are rarely given to wired networks.
  • ATM Asynchronous Transfer Mode
  • QoS quality of service
  • ATM is well suited for multiplexing video, audio, and data in the same medium, by proper choice of the parameters required for each.
  • Audio data for example, does not require the packet-error reliability reburied of data services, but cannot tolerate excessive delay.
  • Video data can in general suffer more delay than audio, but is intolerant to delay jitter.
  • ATM adopted an end-to-end error detection approach, premised on the assumption that the error rate associated with the communications medium, such as wired fiber-optics, was minimal. Only the terminal equipment monitors for errors; if an error is detected, a retransmission request is sent to the originating transmitter. ATM also blocks any services for which it cannot guarantee the required QoS. These characteristics, and other facets of ATM, are very effective for multimedia communication on a wired network, but are the very factors which are contrary to existing wireless network characteristics.
  • LAN wireless local area network
  • QoS quality of service
  • delays will increase exponentially in an overloaded network, as each transmitter contends for access.
  • Most wireless networks operate using some form of collision detection and receipt acknowledgement protocol. For example, each transmitter will listen for a quiet period, then transmit a packet. If another transmitter does not transmit at the same time, the receiver will receive the packet and acknowledge the receipt to the transmitter.
  • Wireless networks are characterized, in general, as having higher error rates, unpredictable delays, and requiring intermediate error detection and correction. Thus, typical wireless networks are inherently unsuitable for ATM traffic.
  • MAC Medium Access Control
  • DSA+ + Dynamic Slot Assignment
  • MBS Mobile Broadband System
  • the invention describes a method for controlling the access to the communications medium within a wireless network protocol, consistent with an underlying ATM network structure and protocol.
  • the access control in accordance with this invention comprises the following features:
  • the optimized Control Data Frame minimizes the turnaround time associated with transmissions in a wireless network by consolidating the control and downlink information, and optimizing the control and uplink information transmissions from each transmitter.
  • this structure also provides a deterministic nature to the communication patterns, allowing the terminal devices to perform other functions during inactive periods, or, in the case of battery powered devices, allowing them to conserve power during these inactive periods.
  • Control Data Frame Associated with the Control Data Frame is the use of a Superslot architecture to allow the piggybacking of uplink control information onto a uplink data transmission to optimize the communications from each wireless device to a central, or base, system.
  • This structure allows for minimal overhead, particularly the overhead required for synchronizing packets from each transmitter.
  • the generalized slot allocation policy supports the ATM QoS concept of a nominal bandwidth allocation for each device, and, in conjunction with the Buffer Overflow Control policy, allows for the reallocation of bandwidth for bursts of packets, consistent with the goals of ATM. Additionally, any remaining excess bandwidth is efficiently allocated among devices to optimize overall performance and QoS factors.
  • each device on the wireless network negotiates a nominal level of service, with an understanding that, at times, the device will require more service, and at other times, less.
  • the ATM server in this negotiation, promises to provide the capability to support the nominal load as well as the bursts of heavier load.
  • the Buffer Overflow Control in accordance with this invention, performs two functions related to this basic ATM concept. It prioritizes transmissions to avoid buffer overflow during burst periods, and at the same time, as necessary, enforces the ATM QoS concepts by penalizing those devices which fail to conform to these concepts.
  • the Beacon based implementation for the management of the MAC services is optimized to reduce the synchronization time required among devices, as well as to allow inactive devices to regain access to the network as required.
  • a short beacon signalling period is interspersed at relatively long, but regular, intervals in the data flow.
  • Within this beacon will be the timing and control signals to provide the higher level synchronization and management of the wireless network.
  • FIG. 1 shows a network of wireless devices.
  • FIG. 2 shows a Layered Protocol model for ATM wired and wireless communication.
  • FIG. 3 shows the structure of the Control Data Frame.
  • FIG. 4 shows a flowchart for slot allocation.
  • FIG. 5 shows a flowchart for laxity queue processing.
  • FIG. 6 shows a Beacon Signalling method.
  • Figure 1 shows a wireless network, comprised of wireless terminals, WT, base stations, BS, and hybrid stations called mobile nodes, MN.
  • WT wireless terminals
  • base stations base stations
  • BS base stations
  • hybrid stations called mobile nodes
  • MN mobile nodes
  • Figures la and lb show a wireless network with a centralized, or base station, architecture.
  • Figures lc and Id show a wireless network with a distributed, or ad hoc, architecture.
  • the base stations BS are connected to a switching center SC in a tree topology. Packets from the Wired ATM Network 101 travel through the gateway G, and are directed to the appropriate base station BS by the switching center SC.
  • the base station BS transmits and receives packets to and from the appropriate wireless terminal WT as will be discussed subsequently.
  • the base stations BS are connected in a ring topology.
  • a packet is passed from base station to base station, until arrives at its destination base station.
  • the destination base station removes the packet from the ring and transmits it to the appropriate wireless terminal.
  • each wireless device MN can operate as a base station as well, such that its transmission can be received by all other wireless devices on the network.
  • a forwarding node topology wherein node 120 is unable to communicate directly with node 122, but node 121 is provided with the capability of forwarding packets from 120 to 122.
  • this invention will provide for effective and efficient communication.
  • the base station topology of figure la will be assumed, but the implementation of the features of this invention to the other topologies would be evident to one skilled in the art.
  • FIG. 2 shows the layered protocol model for the integration of wired and wireless ATM via the Base Station.
  • a wired ATM device 210 such as cable TV transmitter.
  • a wireless ATM device 230 such as a portable television. Interconnecting these devices is the wired medium 201, and the wireless medium 202; the transformation from wired to wireless media is accomplished at the base station 220.
  • This base station 220 would be, for example, a transmitter which is centrally located in one's home, which is wired to the ATM provided services from, for example, a cable TV provider.
  • the wire-specific attributes of the communications path are contained in the Wired PHY (Physical) layer 221 and the Wired MAC layer 222.
  • These protocol layers transform the physical signals on the wire medium into ATM conforming data packets at the ATM level 223 which are independent of the physical media employed.
  • the wireless-specific attributes of the communications path are contained in the Wireless MAC layer 224 and the Wireless PHY layer 225. These layers convert the ATM conforming packets into physical signals which can be transmitted over the wireless medium 202.
  • Similar Wireless MAC 234 and Wireless PHY 235 layers are contained in the Wireless terminal 230 for converting these physical signals into ATM conforming data packets at 233.
  • the capabilities of the wireless MAC 234 and PHY 235 layers in the wireless terminal 230 may be significantly less than those provided for in the base station 220, but the primary function they perform, of converting physical signals to and from ATM conforming signals, is identical.
  • the Control Data Frame (CDF) structure for communicating between the base station and the wireless terminals is shown in figure 3.
  • the Control Data Frame contains both Control and Data.
  • the CDF is structured to minimize turnaround time, and to provide a deterministic timing for transmissions in this otherwise random process.
  • the base station will allocate the available data slots to the individual wireless terminals. It informs all the wireless terminals of this allocation in the Base Station Signalling period 310 of figure 3.
  • the base station conveys this allocation by informing each wireless terminal when to start receiving packets, how many packets to receive, when to transmit packets, and how many packets to transmit. In so doing, each wireless terminal can subsequently allocate its non-communicating time to other tasks, or, in the case of battery powered equipment, can set a timer to interrupt at the appropriate time, and enter an inactive state in the interim.
  • the CDF may be of variable length
  • each wireless terminal will also know when the next CDF will occur, by knowing when the last packet in the present CDF will be transmitted.
  • the signalling period 310 may contain an explicit notification of when the next CDF will occur. In this signalling period 310, the base station will also include operations and maintenance messages, as well as sequencing information for currently inactive wireless terminals, as will be discussed with reference to period 340.
  • each transmitter will be required to transmit a synchronization pattern to allow the intended receiver (s) to establish a common timing base.
  • the base station will transmit its synchronization pattern at the start of signalling period 310.
  • the base station will immediately follow the signalling period 310 with the transmission of all of its down-link packets during Downlink data period 320. Because all the wireless terminals will have synchronized to the base station to receive the signalling information, each wireless terminal which has been scheduled to receive packets from the base station need merely maintain this synchronization until its scheduled reception time.
  • battery powered terminals might not be able to enter a totally inactive state, because in so doing they may lose synchronization.
  • the order in which terminal packets are transmitted from the base station may be made to be dependent upon whether a particular terminal is power limited or not. In this way, packets to battery powered terminals will be transmitted from the base station first, thereby allowing these terminals to go to enter an inactive state sooner.
  • resynchronization patterns could be transmitted with each set of packets to be sent to each transmitter.
  • the downlink data period 320 comprises the transmission of all scheduled data packets from the base station to the wireless terminals. In accordance with this invention, each wireless terminal will receive all of its scheduled data packets as one sequential set.
  • any required resynchronization can be accomplished within the first data packet, and all subsequent data packets can contain a full payload of data, thereby increasing the overall packet information transfer efficiency. And, as stated previously, this scheduled transmission of a set of sequential packets allows the wireless terminals to allocate their non communicating time efficiently.
  • the uplink data period 330 comprises the transmission of all scheduled data packets from the wireless terminals to the base station.
  • each terminal will transmit its allocated number of packets sequentially, beginning at its allocated time.
  • the first transmission slot of each terminal will be a SuperSlot, which allows for the transmission of a data packet as well as a control packet appended to this data packet.
  • the control information which is transmitted from each wireless terminal comprises the information the base station requires to manage the network and allocate the bandwidth. It will contain the number of packets which the wireless terminal has remaining to transmit, and, in accordance with another aspect of this invention, their priority, as will be subsequently discussed. It may also contain operations and maintenance information as well, as would be typical of traditional network control protocols.
  • the Alert period 340 is utilized for currently inactive terminals to request active status. Depending upon the protocol established, this may take on a number of forms. If the need for immediate attention is not imperative, a polling technique may be employed. For example, in the signalling period 310, the host station could announce a terminal identifier, from among a list of currently inactive terminals. Subsequent CDF periods 310 would contain other identified terminal from this list, in a round-robin fashion. If the identified terminal needs active status, it will transmit a signal in period 340. In the preferred embodiment, this signal would be minimal, to reduce the allocated time for such polling. If the signal is present, the base station will allocate one or more uplink slots to this terminal in the next CDF.
  • the identified terminal would subsequently transmit any additional control information in its allocated superslot.
  • the protocol could be established such that upon receiving an alert signal, the identified terminal will receive its nominal bandwidth at the next CDF.
  • the identified terminal may only receive one slot allocation, and the appropriate bandwidth would be assigned dependent upon the specified number of packets to be transmitted, as contained in the appended control information in the aforementioned superslot from this terminal.
  • excess bandwidth may be allocated, in the second, excess delay may be incurred.
  • a full superslot time could be allocated during the Alert period 340 to allow the transmission of a packet and the appropriate uplink control information.
  • the Alert period 340 may be structured differently to allow a more timely response, or a better utilization of bandwidth, as would be apparent to one skilled in the art. For example, if a particular terminal was particularly sensitive to such delays, the polling sequence might be modified to poll that terminal more frequently than others. Or, a non-polling approach may be employed. For example, a contention scheme could be utilized within this period. The base station will have identified when this alert period 340 will occur, during signalling period 310.
  • Any terminal needing to signal an alert request would merely transmit an identifier during this period, and the base station would allocate one or more slots for this terminal in the next CDF, as detailed above. If a collision occurs, and the identifier is not received, the absence of an allocation in the next CDF will notify the requesting terminal that another alert request should be generated in the next alert period 340. Combinations of polling and contention based processes for requesting service may also be employed, as would be evident to one skilled in the art.
  • each active wireless terminal will notify the base station of the number of packets remaining after the current CDF transmission to be transmitted to the base station. If this number is zero, the terminal identifier is placed on the inactive terminal list. If the number is not zero, the base station should allocate slots for this terminal in the next CDF. The base station must also allocate slots for packets received which need to be transmitted to the terminals, as well as slots for transmissions from all the other active terminals. Consistent with the above discussed premise of ATM, it is likely that at certain times of peak activity, there will be insufficient bandwidth, i.e. an insufficient number of slots within a CDF to accomodate the number of packets which need to be transmitted.
  • the size of the CDF is variable, and as such could be stretched to accomodate the transmission of all the current packets, the size of the CDF should be constrained.
  • the size of the CDF should be constrained so as to assure that terminals are serviced frequently enough to avoid excessive delay, particularly terminals which are conforming to the negotiated bandwidth allocation in return for an assurance of at least nominal service.
  • the CDF period would be limited to not more than one millisecond; with present technology, this allows for about 50-100 ATM data packets to be transmitted within each CDF. These 50-100 data packets would be nominally allocated to the wireless terminals during the previously mentioned negotiation phase, as each connection is made within the network.
  • the negotiation is unsuccessful, for example if the base station does not have sufficient bandwidth currently available to satisfy the minimal functional requirement for the terminal, the connection is not made.
  • voice communication typically requires a minimum of 3KHz bandwidth; if the base station doesn't currently have 3KHz available, a busy signal might be returned.
  • Such negotiation scenarios are well known to those versed in the art, and are not pertinent to this invention except in that, as previously stated, each connected terminal is guaranteed a QoS which is dependent upon an agreed upon nominal bandwidth. This nominal bandwidth is specified in terms of the number of packets which, on average, will be communicated to and from the terminal in each maximum CDF period.
  • the base station will allocate slots within each CDF to guarantee the nominal bandwidth and will reallocate unused slots to those terminals requiring additional slots in a prioritized manner.
  • the prioritization consistent with the premises of ATM, will endeavor to minimize the risk of data loss because of buffer overflow, particularly for well behaved terminals, and will endeavor to provide for an equitable assignment of any unused allocations.
  • the base station will manage the allocation of slots without direct regard for the flow direction. In so doing, unused downlink bandwidth may be allocated as required for uplink transmissions, and, correspondingly, unused uplink bandwidth may be allocated for downlink transmissions.
  • the base station's downlink traffic is performed by treating the base station's downlink transmitter as merely another active terminal having traffic to send.
  • the term node will be used hereafter to encompass both the wireless terminals and the base station, with regard to uplink and downlink slot allocation.
  • FIG. 4 shows a flowchart for the slot allocation policy in accordance with this invention. As shown at 405, this allocation policy need only be invoked when the total packets requested to be communicated in this CDF is greater than the number of slots available in the CDF. If the number of packets to be communicated is less than the number of slots available, all packets will be scheduled to be communicated, at 410.
  • a laxity factor could be utilized to determine a fair distribution of the remaining slots to the nodes.
  • Such a laxity factor orders packets by their relative need to be transmitted promptly.
  • a high laxity factor indicates a relative insensitivity to delay; a low laxity factor indicates little tolerance for delays. Allocation in accordance with this laxity factor, low laxity packets allocated first, results in optimal throughput and overall fairness. But, as noted, such an allocation assumes no consequence other than delay in this allocation.
  • loss of data may occur if the node has an insufficient buffer to accomodate the accumulation of data while waiting for its allocation.
  • a file transfer would be relatively insensitive to delay, but at each node which causes the delay, there must be sufficient memory to hold the packets which continue to arrive during this delay period.
  • both delay and the risk of data loss must be considered in the allocation process.
  • a portion of the remaining slots are allocated to minimize the risk of loss of packets due to buffer overflow, in block 430, and the remaining portion are allocated to maximize throughput while ensuring fairness in block 460.
  • the size of the portion allocated to minimize the risk of data loss in 430 will be a function of the specific network architecture and composition. This proportion can be fixed, for example, half the allocation for buffer overflow protection, half for maximizing throughput. Or, it can initially fixed, then modified by the base station or some other controller in dependence upon an assessment of the likelihood of buffer overflows based on actual performance thus far.
  • Block 430 is further detailed in figure 4b.
  • a buffer overflow factor, bof(i) is calculated as the ratio of the amount of available buffer, to the nominal allocation, at 433.
  • the available buffer is the size of the node's buffer minus the number of remaining packets to be transmitted.
  • This overflow factor in effect, is a measure of the number of nominal allocations remaining in the buffer, or, equivalently, the number of CDFs remaining before the buffer overflows, if the node's buffer is being filled at the nominal rate. As such, a smaller bof(i) indicates a larger likelihood that a buffer overflow will occur.
  • This buffer overflow factor is further modified to favor those nodes which conform to the premises of ATM.
  • a premise of ATM is that nodes will contain sufficient buffers to accomodate a dynamic allocation of bandwidth.
  • the buffer overflow factor is a measure of how quickly buffer overflow will occur, gives higher priority to nodes with smaller buffers.
  • a second factor, the buffer size factor, bsf(i), is calculated in 434.
  • the buffer size factor is a modified ratio of each node's buffer size in comparison to the average buffer size in the network. If a buffer has a higher than average buffer size, the ratio is fixed to 1 , which will result in no modification to the buffer overflow factor. If the node has a below average buffer size, the ratio will be less than one, and this ratio will reduce the priority given to this below average node, as will be shown in 436.
  • Another premise of ATM is that the node will frequently request less than its nominal allocation, to counterbalance those times when it requests more.
  • a third factor, the behavior factor, beh(i), is calculated in 435. This factor is the percentage of times the node requested less allocation than its nominal. It is a measure of underutilization of a node's allocation. This ratio will affect the priority given to the node, in direct proportion to its degree of underutilization, at 436.
  • an overall priority factor, the buffer overflow management factor, BOMF(i), is calculated.
  • the priority is inversely proportional to the buffer overflow factor bof(i), and directly affected by the buffer size factor, bsf(i) and the behavior factor, beh(i).
  • This factor is used in 442 to allocate bandwidth to each node to avoid buffer overflow while giving preference to nodes which conform to the premises of ATM.
  • the sum of BOMF factors is accumulated.
  • the portion of the Overflow Allocation amount, OA, allocated to each of these node is computed in the loop formed by 441-443.
  • Each node is given an allocation in direct proportion to its computed BOMF factor, relative to the total of all the computed BOMF factors, at 442, up to its requested amount.
  • This allocation for each node is returned at 449, and will be added to that node's nominal allocation as previously discussed, and that node's laxity allocation as will be subsequently discussed.
  • the BOMF factor can be modified in a number of ways. For example, an upper threshold can be defined for all or each of the node's buffer overflow factor.
  • BOMF(i) can be constrained to be less than some maximum number, to prevent any one node from monopolizing the allocation as its buffer overflow factor approaches zero.
  • each node maintains a queue of packets, sorted by their laxity values.
  • Laxity is a measure of the delay which can be acceptably incurred for each packet.
  • a low laxity value indicates that the packet cannot afford to be delayed much longer; a high laxity factor indicates a relative tolerance for delay.
  • Each node communicates the number of packets in their queue within discrete ranges of laxity values. For example, if three ranges are defined as low, medium, and high, a node may inform the base station that it has 15 packets with low laxity, 18 packets with medium laxity, and 6 packets with high laxity.
  • This information is communicated to the base station during the terminal's superslot allocation, as part of the aforementioned uplink control information.
  • the number of packets which will be remaining at each node is updated, in laxity priority order. If the node used for the example above is allocated 12 slots during the nominal allocation, and 8 slots in the buffer overflow allocation, for a total of 20 slots. Within this allocation the node will send the 15 low laxity packets, and 5 of the medium laxity packets. The node will be left with no low laxity packets, 13 medium laxity and 6 high laxity packets.
  • any remaining unallocated slots are allocated, first, to low laxity packets, then to the medium, then to the high. Thus, if another node had any low laxity packets remaining, it would receive the allocation for all of its low laxity packets, up to the number of slots remaining to be allocated.
  • This process is detailed in figure 4c.
  • the loop formed by 461-464 allocates slots in priority order, at 463, until there are an insufficient number of slots available to allocate to all of the packets having this laxity level, at 462. If there are insufficient slots for allocation to all the packets of equal laxity level, the allocation at 466 will be distributed according to a round-robin allocation, for ease of computation and queue management, or according to a random allocation, for fairness.
  • the resultant allocations for each node is returned at 469.
  • the total allocation for each node (the sum of nominal + overflow + laxity allocations) will be communicated to the nodes at the beginning of the next CDF period, as previously discussed.
  • Figure 5 details the assignment and use of laxity factors at the individual nodes.
  • Each node will place packets received for subsequent transmission into a Laxity Queue.
  • a laxity factor is assigned when a connection is established.
  • This laxity factor is a relative measure, and is assigned in dependence upon the delay and loss sensitivity associated with the traffic which is to be communicated via this connection.
  • Delay insensitive channels are assigned a finite value as well, to prevent excessive delays. For example, a file transfer communications channel would assign a high laxity factor at each node in the connection.
  • a voice communications channel on the other hand, would assign a low laxity factor to each node. The exact assignment of values to this factor is not significant; the significant aspect is that the value be consistent and comparable.
  • the laxity factor is equal to the maximum delay, in time units, allowable at each node along a connection, such that the sum of these numbers would be the maximum end-to- end delay allowable for acceptable communications.
  • the specified laxity factor is assigned to each packet when it arrives. The insertion of the packet in the laxity queue will be in the order of the packet's assigned laxity factor. If multiple packets have the same laxity factor, they may be placed in further order by their sensitivity to data loss or other factors. For example, data packets would be placed ahead of voice packets with the same laxity factor.
  • the node receives its transmission allocation, T, from the base station at 510 in figure 5a.
  • T packets are removed from the laxity queue, lowest laxity first, and transferred to the transmit queue for transmission during this CDF period, at 520. If any packets remain, 525, their laxity factors are reduced by the elapsed time since the last CDF. The elapsed time is computed at 530, and the loop formed by 540- 542 performs the reduction for each packet in the laxity queue. Thus, the laxity factor for each packet is an indication of the time remaining before subsequent delays become problematic.
  • the wireless terminals For effective allocation at the base station, the wireless terminals must communicate the number of packets to be transmitted at each laxity level. Thereby, the base station can allocate more slots to nodes having packets with low laxity levels than to nodes having high laxity levels. This information will be transmitted to the base station via the control information which is appended to the first packet from each terminal, as discussed previously.
  • the laxity factor can span a large range, and transmitting the number of packets at each of possible values could be a very time and bandwidth consuming process. Therefore, in accordance with this invention, the priority factors are quantized into a much smaller range of values. This quantization can be linear, for example, as by dividing the priority factor range into Q equal parts.
  • the preferred embodiment comprises a non-linear segmentation of the priority factor range, in accordance with a logarithmic scale. In so doing, packets with low laxity values can be more finely distinguished in the allocation process than those with larger, and less immediately important, values.
  • Figure 5b shows the quantization in accordance with this invention.
  • NumPac is an array of values.
  • NumPac(q) contains a count of the number of packets at each one of Q possible laxity levels. Boxes 560 through 564 represent a loop which is executed for each packet in the laxity queue.
  • the quantized laxity level for each packet is determined by the calculations at 561 and 562, and the NumPac associated with this quantization level accumulates the number of packets with this resultant quantization level at 563.
  • the resultant accumulations in the NumPac array are returned, at 565, for subsequent communication to the base station via the control information in the terminal's superslot assignment, as discussed previously.
  • the base station performs a similar laxity level accumulation for its downlink packets, and the laxity allocation is performed, as noted above, without regard to whether the traffic is uplink or downlink related.
  • a beacon based synchronization and management capability is provided, as shown in figure 6.
  • time is allocated for a beacon communications period, 610.
  • the purpose of this signalling period is to separate long term management functions from the above described short term functions such as CDF slot allocation and signalling.
  • the beacon signal will contain, for example, a master synchronizing signal. All terminals on the network will use this synchronizing signal to coarsely adjust their local timing signals, perform filter equalizations, and other adjustment or maintenance tasks. Thereafter, at each CDF, the synchronization signalling need only contain the signalling required to perform finer adjustments. Dynamic filter parameters gathered during the beaconing period can, for example, be utilized directly to initialize such filters directly before the receipt of the CDF signal which provides for a finer adjustment.
  • the beacon period is also the period wherein the aforementioned connection establishment and QoS negotiations take place, as well as connection disestablishment and other relatively long term or infrequent events. Placing these activities within this slower frequency timing minimizes the impact of such activities on the QoS of established connections.
  • Connection establishment may, for example, require the communication of a thousand packets. If we force these communications to occur by the transfer of twenty packets at each beacon, and the beacons only occur at every tenth of a second, it will take five seconds to establish the connection. The impact on the network, however, utilizing this approach, will be significantly less than if the request for a thousand slots competed with the established connections at one CDF period, and the connection was made in less than a second by allocations taken away from the established connections. Limiting the effective bandwidth for connection establishment lengthens the time required to establish each connection, but results in greater performance once the connection is established.
  • maintaining a separate scheme for connecting and disconnecting terminals also provides for efficiencies in the previously described CDF structure and operation, particularly with regard to the Alert period 340. Absent this beacon signalling, the CDF structure and protocol must accommodate alert signalling from any potential wireless terminal. Such a broad task may be infeasible to accommodate in the polling scenarios discussed previously. By segregating the connection establishment from the routine CDF management, the list of inactive terminals used for polling can be minimized to be only those currently connected terminals which are also currently inactive.
  • the periodic beacon signalling also allows for more efficient power conservation.
  • a currently unconnected wireless telephone could monitor a beacon period, knowing that connections are only established during such periods. If it was not addressed in the beacon, it could set its clock to interrupt itself just before the next scheduled beacon period, and enter an inactive state in the interim.
  • the beacon period occur at very regular intervals.
  • CDFs are of variable length
  • a CDF can be easily partitioned to avoid excessively long gaps, as shown at 631-633. Without partitioning, the gap 632 would extend from the beginning of CDF period 631 to the beginning of beacon period 611. Provided that such a gap is sufficiently long for the base station to transmit its control signalling information (310 in figure 3), the base station can schedule the time of allocated transmissions to avoid the beacon period.
  • a portion of the CDF will be transmitted at 631 , a smaller gap 632 will be realized, and the remainder of the CDF will be scheduled by the base to occur at 633.
  • some variance may be permitted in the regularity of the beacon, and it could occur immediately following a CDF, or portion of CDF, thereby eliminating all unused gaps in time.

Abstract

A protocol, method, and apparatus for managing network communications are disclosed which are particularly well suited for ATM communications across a wireless medium. Contiguous time slots within a frame are allocated to each node having traffic to send. Each node is assured a nominal bandwidth, and excess bandwidth is distributed by demand. The allocation of excess bandwidth can be dependent upon the size of the buffer at each node, as well as the time-criticality of each message. Nodes communicate their requests for allocation by appending such control information to the first of their transmitted packets. The allocation, of each node's transmit and receive time slots, is transmitted to all the nodes at the beginning of each frame. Thereafter, each node need not participate on the network until their allocated time periods, thereby allowing portable devices to enter inactive states to conserve power. The network is operated in a connection mode; connections are established in a relatively non-interfering manner by the use of periodically occuring beacons. Inactive, unconnected, nodes need only monitor the network during these beacon periods, further allowing for power conservation.

Description

Medium Access Control (MAC) Protocol for Wireless ATM
Background of the invention
1. Field of the Invention
This invention generally relates to communication networks and protocols, with particular relevance to wireless networks, or other networks requiring minimal turnaround time. It specifically addresses a control protocol for wireless ATM, although the features presented can be applied to alternative protocols as well.
2. Discussion of the Related Art
Currently, communication networks are formed by interconnecting devices by wire or cable, and having each device conform to a protocol for sending messages along these wires and cables. In some instances, a portion of such a network may be implemented as a wireless connection, employing radio or infrared frequency signals between nodes. Such wireless connections are point-to-point, having a single communications device at each end, each tuned to each other at a frequency different from other devices in the same geographic area. A wireless network, on the other hand, is formed without physical connections among the devices, employing, for example, radio frequency signals. Each device on the network is tuned to the same frequency, and each device conforms to a protocol for sending messages at this common frequency. The protocol may allow communication among all the devices in the network or the protocol may constrain each device to only communicate with a master device. Wireless networks offer a significant logistical advantage over wired networks, by obviating the need to run wires or cables to each device.
With increased availability of multimedia technologies, and the increased demand for information access, the market potential for residence or business based Local Area Networks (LANs) is growing. The ease of installation and expansion of a wireless network is certain to create a large demand for wireless LANs. For example, a central base station may provide wireless services, including voice, video, and data, to all the communications devices in one's home, or a wireless base station may provide for the communication among all the portable computers in an office, or all the computers on a campus. To be successful, however, the techniques and protocols employed in these wireless networks must not be significantly inferior to their wired network equivalents, and they must be able to provide compatibility with existing networks, particularly in terms of compatible service and management criteria. During the past decades, protocols have been developed for effectively and efficiently managing the transfer of information within networks of communicating equipment. An underlying premise in the development of these network protocols has been that of a wired network infrastructure. In a wireless network, the assumptions upon which the wired network protocols were developed may no longer be valid. Although most of the existing protocols are functionally extensible to wireless networks, their effectiveness and efficiency may be adversely affected by the lack of a direct connection among devices.
Additionally, associated with a wireless network is the likelihood of the presence of portable, battery powered, devices. Although some wireless devices, such as desktop computers, televisions, and home theatre systems will be powered by AC line supplies, a number of wireless devices, such as telephones, cameras, and laptop computers will be powered by batteries. In providing for a wireless network protocol, consideration must be given to an architecture which allows for power conservation as well. Such considerations are rarely given to wired networks.
A common protocol employed for data communications in a wired network is Asynchronous Transfer Mode (ATM). ATM has been developed to deal with high speed data with different data rates, different quality of service (QoS) requirements (for example, data reliability, delay considerations, etc.), and different connection or connectionless paradigms for multimedia communications. ATM is well suited for multiplexing video, audio, and data in the same medium, by proper choice of the parameters required for each. Audio data, for example, does not require the packet-error reliability reburied of data services, but cannot tolerate excessive delay. Video data can in general suffer more delay than audio, but is intolerant to delay jitter. These delay and packet-error rate considerations are best supported by a connection oriented service, wherein the parameters are negotiated and established at the commencement of each connection. For optimum performance, ATM adopted an end-to-end error detection approach, premised on the assumption that the error rate associated with the communications medium, such as wired fiber-optics, was minimal. Only the terminal equipment monitors for errors; if an error is detected, a retransmission request is sent to the originating transmitter. ATM also blocks any services for which it cannot guarantee the required QoS. These characteristics, and other facets of ATM, are very effective for multimedia communication on a wired network, but are the very factors which are contrary to existing wireless network characteristics.
Existing efforts of building a wireless local area network (LAN) are focussed on emerging standards, such as IEEE 802.11 in the United States, and HIPERLAN in Europe. These standards do not take into consideration the ATM based quality of service (QoS) requirements for real time and data traffic, particularly in the area of delay. In a typical wireless network, delays will increase exponentially in an overloaded network, as each transmitter contends for access. Most wireless networks operate using some form of collision detection and receipt acknowledgement protocol. For example, each transmitter will listen for a quiet period, then transmit a packet. If another transmitter does not transmit at the same time, the receiver will receive the packet and acknowledge the receipt to the transmitter. If another transmitter transmits simultaneously, however, a collision occurs, the intended receiver(s) receive garbled messages, and no acknowledgement is sent. Upon the non-receipt of an acknowledgement, each transmitter will again attempt to transmit, hopefully not simultaneously. Wireless networks are characterized, in general, as having higher error rates, unpredictable delays, and requiring intermediate error detection and correction. Thus, typical wireless networks are inherently unsuitable for ATM traffic.
Clearly, an important issue in designing a wireless ATM is that the control protocol which specifies the method of access among multiple users to the same medium, the Medium Access Control (MAC) protocol, must satisfy the basic requirements of ATM, particularly in the area of delay considerations. One such protocol is the Dynamic Slot Assignment (DSA+ +) protocol designed for use within a European project, Mobile Broadband System (MBS). This protocol was premised, however, on the assumption that the uplink and downlink communication paths, to and from a base station, were each effected on different frequencies. This reduced the turnaround time for control and acknowledgements, but required all stations to accommodate transmission and reception on two discrete and non interfering frequencies.
Thus, it is seen that the transformation of a wired network protocol, such as ATM, to a wireless network protocol typically requires additional time, or frequency, or both. It is the purpose of this invention to minimize the time required to communicate information within a network, without requiring additional frequency allocation, while supporting the QoS concepts of ATM. Although the invention presented is particularly applicable to wireless ATM networks, the principles embodied are equally applicable to minimize the time required to transfer information on other wired or wireless networks as well.
Summary of the invention
Essentially, the invention describes a method for controlling the access to the communications medium within a wireless network protocol, consistent with an underlying ATM network structure and protocol.
The access control in accordance with this invention comprises the following features:
- an optimized Control Data Frame (CDF) structure to minimize turnaround time;
- a Superslot data structure for Uplink signalling;
- a generalized Slot Allocation Policy at the MAC level which integrates the allocation uplink and downlink slots;
- a Buffer Overflow Control Policy at the MAC level; and,
- a Beacon-based implementation for MAC management services.
The optimized Control Data Frame (CDF) minimizes the turnaround time associated with transmissions in a wireless network by consolidating the control and downlink information, and optimizing the control and uplink information transmissions from each transmitter. In addition to minimizing the turnaround time, this structure also provides a deterministic nature to the communication patterns, allowing the terminal devices to perform other functions during inactive periods, or, in the case of battery powered devices, allowing them to conserve power during these inactive periods.
Associated with the Control Data Frame is the use of a Superslot architecture to allow the piggybacking of uplink control information onto a uplink data transmission to optimize the communications from each wireless device to a central, or base, system. This structure allows for minimal overhead, particularly the overhead required for synchronizing packets from each transmitter.
The generalized slot allocation policy supports the ATM QoS concept of a nominal bandwidth allocation for each device, and, in conjunction with the Buffer Overflow Control policy, allows for the reallocation of bandwidth for bursts of packets, consistent with the goals of ATM. Additionally, any remaining excess bandwidth is efficiently allocated among devices to optimize overall performance and QoS factors.
Consistent with the concepts of ATM QoS, each device on the wireless network negotiates a nominal level of service, with an understanding that, at times, the device will require more service, and at other times, less. The ATM server, in this negotiation, promises to provide the capability to support the nominal load as well as the bursts of heavier load. The Buffer Overflow Control, in accordance with this invention, performs two functions related to this basic ATM concept. It prioritizes transmissions to avoid buffer overflow during burst periods, and at the same time, as necessary, enforces the ATM QoS concepts by penalizing those devices which fail to conform to these concepts.
The Beacon based implementation for the management of the MAC services is optimized to reduce the synchronization time required among devices, as well as to allow inactive devices to regain access to the network as required. In accordance with this invention, a short beacon signalling period is interspersed at relatively long, but regular, intervals in the data flow. Within this beacon will be the timing and control signals to provide the higher level synchronization and management of the wireless network. By providing this higher level synchronization and control, the synchronization and control overhead within each packet can be minimized, thereby improving the overall efficiency of the network.
Brief description of the drawings
FIG. 1 shows a network of wireless devices. FIG. 2 shows a Layered Protocol model for ATM wired and wireless communication.
FIG. 3 shows the structure of the Control Data Frame. FIG. 4 shows a flowchart for slot allocation. FIG. 5 shows a flowchart for laxity queue processing. FIG. 6 shows a Beacon Signalling method.
Detailed description of the preferred embodiments of the invention
Figure 1 shows a wireless network, comprised of wireless terminals, WT, base stations, BS, and hybrid stations called mobile nodes, MN. For completeness, also shown is the connection of the wireless network to a wired ATM network 101 through a gateway, G. Figures la and lb show a wireless network with a centralized, or base station, architecture. Figures lc and Id show a wireless network with a distributed, or ad hoc, architecture. In figure la, the base stations BS are connected to a switching center SC in a tree topology. Packets from the Wired ATM Network 101 travel through the gateway G, and are directed to the appropriate base station BS by the switching center SC. The base station BS transmits and receives packets to and from the appropriate wireless terminal WT as will be discussed subsequently. In figure lb, the base stations BS are connected in a ring topology. A packet is passed from base station to base station, until arrives at its destination base station. The destination base station removes the packet from the ring and transmits it to the appropriate wireless terminal. In figure lc, each wireless device MN can operate as a base station as well, such that its transmission can be received by all other wireless devices on the network. In figure Id is shown a forwarding node topology, wherein node 120 is unable to communicate directly with node 122, but node 121 is provided with the capability of forwarding packets from 120 to 122. Within each of these topologies, this invention will provide for effective and efficient communication. For ease of understanding, the base station topology of figure la will be assumed, but the implementation of the features of this invention to the other topologies would be evident to one skilled in the art.
Figure 2 shows the layered protocol model for the integration of wired and wireless ATM via the Base Station. At one end of the communications path is a wired ATM device 210, such as cable TV transmitter. At the other end of the communications path is a wireless ATM device 230, such as a portable television. Interconnecting these devices is the wired medium 201, and the wireless medium 202; the transformation from wired to wireless media is accomplished at the base station 220. This base station 220 would be, for example, a transmitter which is centrally located in one's home, which is wired to the ATM provided services from, for example, a cable TV provider. The wire-specific attributes of the communications path are contained in the Wired PHY (Physical) layer 221 and the Wired MAC layer 222. These protocol layers transform the physical signals on the wire medium into ATM conforming data packets at the ATM level 223 which are independent of the physical media employed. The wireless-specific attributes of the communications path are contained in the Wireless MAC layer 224 and the Wireless PHY layer 225. These layers convert the ATM conforming packets into physical signals which can be transmitted over the wireless medium 202. Similar Wireless MAC 234 and Wireless PHY 235 layers are contained in the Wireless terminal 230 for converting these physical signals into ATM conforming data packets at 233. The capabilities of the wireless MAC 234 and PHY 235 layers in the wireless terminal 230 may be significantly less than those provided for in the base station 220, but the primary function they perform, of converting physical signals to and from ATM conforming signals, is identical.
The Control Data Frame (CDF) structure for communicating between the base station and the wireless terminals is shown in figure 3. The Control Data Frame, as its name implies contains both Control and Data. In accordance with this invention, the CDF is structured to minimize turnaround time, and to provide a deterministic timing for transmissions in this otherwise random process. Conventionally, in a wireless network, when an node has a packet, or set of packets, to transmit, it transmits each packet whenever a quiet period is detected. As noted previously, this results in unpredictable delays and delay jitter. In accordance with this invention, the base station will allocate the available data slots to the individual wireless terminals. It informs all the wireless terminals of this allocation in the Base Station Signalling period 310 of figure 3. The base station conveys this allocation by informing each wireless terminal when to start receiving packets, how many packets to receive, when to transmit packets, and how many packets to transmit. In so doing, each wireless terminal can subsequently allocate its non-communicating time to other tasks, or, in the case of battery powered equipment, can set a timer to interrupt at the appropriate time, and enter an inactive state in the interim. Although the CDF may be of variable length, each wireless terminal will also know when the next CDF will occur, by knowing when the last packet in the present CDF will be transmitted. Alternatively, to avoid continuous transmissions of very short CDFs, in the event of no packets to communicate, the signalling period 310 may contain an explicit notification of when the next CDF will occur. In this signalling period 310, the base station will also include operations and maintenance messages, as well as sequencing information for currently inactive wireless terminals, as will be discussed with reference to period 340.
Consistent with traditional wireless communication, each transmitter will be required to transmit a synchronization pattern to allow the intended receiver (s) to establish a common timing base. The base station will transmit its synchronization pattern at the start of signalling period 310. To avoid having to establish this synchronization with each wireless terminal's receiver independently, as packets are sent to each terminal, the base station will immediately follow the signalling period 310 with the transmission of all of its down-link packets during Downlink data period 320. Because all the wireless terminals will have synchronized to the base station to receive the signalling information, each wireless terminal which has been scheduled to receive packets from the base station need merely maintain this synchronization until its scheduled reception time. Note that, in this preferred embodiment, battery powered terminals might not be able to enter a totally inactive state, because in so doing they may lose synchronization. Thus, consistent with this invention, the order in which terminal packets are transmitted from the base station may be made to be dependent upon whether a particular terminal is power limited or not. In this way, packets to battery powered terminals will be transmitted from the base station first, thereby allowing these terminals to go to enter an inactive state sooner. Alternatively, resynchronization patterns could be transmitted with each set of packets to be sent to each transmitter. The downlink data period 320 comprises the transmission of all scheduled data packets from the base station to the wireless terminals. In accordance with this invention, each wireless terminal will receive all of its scheduled data packets as one sequential set. In so doing, any required resynchronization can be accomplished within the first data packet, and all subsequent data packets can contain a full payload of data, thereby increasing the overall packet information transfer efficiency. And, as stated previously, this scheduled transmission of a set of sequential packets allows the wireless terminals to allocate their non communicating time efficiently.
The uplink data period 330 comprises the transmission of all scheduled data packets from the wireless terminals to the base station. As with the transmission from the base station, each terminal will transmit its allocated number of packets sequentially, beginning at its allocated time. Different from the base station's transmissions, however, in accordance with this invention, the first transmission slot of each terminal will be a SuperSlot, which allows for the transmission of a data packet as well as a control packet appended to this data packet. By allocating this longer initial time slot, rather than inserting the control information into a data packet, allows for greater efficiencies. If the control information were contained in a data packet, either an entire packet would need be allocated for control, or the original packets would need to be modified to contain this information. Because the first packet from each transmitter is easily identified, having been scheduled by the base station as previously discussed, it is a significantly simpler matter to extract the appended control information, rather than decoding one or more data packets to extract the embedded information. The control information which is transmitted from each wireless terminal comprises the information the base station requires to manage the network and allocate the bandwidth. It will contain the number of packets which the wireless terminal has remaining to transmit, and, in accordance with another aspect of this invention, their priority, as will be subsequently discussed. It may also contain operations and maintenance information as well, as would be typical of traditional network control protocols.
The Alert period 340 is utilized for currently inactive terminals to request active status. Depending upon the protocol established, this may take on a number of forms. If the need for immediate attention is not imperative, a polling technique may be employed. For example, in the signalling period 310, the host station could announce a terminal identifier, from among a list of currently inactive terminals. Subsequent CDF periods 310 would contain other identified terminal from this list, in a round-robin fashion. If the identified terminal needs active status, it will transmit a signal in period 340. In the preferred embodiment, this signal would be minimal, to reduce the allocated time for such polling. If the signal is present, the base station will allocate one or more uplink slots to this terminal in the next CDF. The identified terminal would subsequently transmit any additional control information in its allocated superslot. Depending upon the performance factors desired, the protocol could be established such that upon receiving an alert signal, the identified terminal will receive its nominal bandwidth at the next CDF. Alternatively, the identified terminal may only receive one slot allocation, and the appropriate bandwidth would be assigned dependent upon the specified number of packets to be transmitted, as contained in the appended control information in the aforementioned superslot from this terminal. In the first scenario, excess bandwidth may be allocated, in the second, excess delay may be incurred. Also alternatively, a full superslot time could be allocated during the Alert period 340 to allow the transmission of a packet and the appropriate uplink control information.
In the alert polling scenario, a network which contains many inactive terminals may exhibit an excessive delay between the time a terminal has a packet to send and the time it is identified in the polling process. In accordance with this invention, the Alert period 340 may be structured differently to allow a more timely response, or a better utilization of bandwidth, as would be apparent to one skilled in the art. For example, if a particular terminal was particularly sensitive to such delays, the polling sequence might be modified to poll that terminal more frequently than others. Or, a non-polling approach may be employed. For example, a contention scheme could be utilized within this period. The base station will have identified when this alert period 340 will occur, during signalling period 310. Any terminal needing to signal an alert request would merely transmit an identifier during this period, and the base station would allocate one or more slots for this terminal in the next CDF, as detailed above. If a collision occurs, and the identifier is not received, the absence of an allocation in the next CDF will notify the requesting terminal that another alert request should be generated in the next alert period 340. Combinations of polling and contention based processes for requesting service may also be employed, as would be evident to one skilled in the art.
As discussed, each active wireless terminal will notify the base station of the number of packets remaining after the current CDF transmission to be transmitted to the base station. If this number is zero, the terminal identifier is placed on the inactive terminal list. If the number is not zero, the base station should allocate slots for this terminal in the next CDF. The base station must also allocate slots for packets received which need to be transmitted to the terminals, as well as slots for transmissions from all the other active terminals. Consistent with the above discussed premise of ATM, it is likely that at certain times of peak activity, there will be insufficient bandwidth, i.e. an insufficient number of slots within a CDF to accomodate the number of packets which need to be transmitted. Although the size of the CDF is variable, and as such could be stretched to accomodate the transmission of all the current packets, the size of the CDF should be constrained. The size of the CDF should be constrained so as to assure that terminals are serviced frequently enough to avoid excessive delay, particularly terminals which are conforming to the negotiated bandwidth allocation in return for an assurance of at least nominal service. In the preferred embodiment, the CDF period would be limited to not more than one millisecond; with present technology, this allows for about 50-100 ATM data packets to be transmitted within each CDF. These 50-100 data packets would be nominally allocated to the wireless terminals during the previously mentioned negotiation phase, as each connection is made within the network. If the negotiation is unsuccessful, for example if the base station does not have sufficient bandwidth currently available to satisfy the minimal functional requirement for the terminal, the connection is not made. For example, voice communication typically requires a minimum of 3KHz bandwidth; if the base station doesn't currently have 3KHz available, a busy signal might be returned. Such negotiation scenarios are well known to those versed in the art, and are not pertinent to this invention except in that, as previously stated, each connected terminal is guaranteed a QoS which is dependent upon an agreed upon nominal bandwidth. This nominal bandwidth is specified in terms of the number of packets which, on average, will be communicated to and from the terminal in each maximum CDF period. Thus, if the maximum CDF period is one millisecond, a bandwidth requirement of 15 kilo-packets per second would equate to the allocation of a nominal 15 packets per CDF. Consistent with the ATM premise, however, the terminal which has been allocated this 15 kilo-packet per second bandwidth may, for short periods of time, require significantly more bandwidth, and thus more than its allocated 15 packets per CDF.
In accordance with this invention, the base station will allocate slots within each CDF to guarantee the nominal bandwidth and will reallocate unused slots to those terminals requiring additional slots in a prioritized manner. The prioritization, consistent with the premises of ATM, will endeavor to minimize the risk of data loss because of buffer overflow, particularly for well behaved terminals, and will endeavor to provide for an equitable assignment of any unused allocations. Because the CDF will contain both the uplink and downlink messages, the base station will manage the allocation of slots without direct regard for the flow direction. In so doing, unused downlink bandwidth may be allocated as required for uplink transmissions, and, correspondingly, unused uplink bandwidth may be allocated for downlink transmissions. In this and subsequent discussions, no distinction is made between the base station's downlink traffic and the wireless terminal's uplink traffic. The slot allocation is performed by treating the base station's downlink transmitter as merely another active terminal having traffic to send. For clarity, the term node will be used hereafter to encompass both the wireless terminals and the base station, with regard to uplink and downlink slot allocation.
Figure 4 shows a flowchart for the slot allocation policy in accordance with this invention. As shown at 405, this allocation policy need only be invoked when the total packets requested to be communicated in this CDF is greater than the number of slots available in the CDF. If the number of packets to be communicated is less than the number of slots available, all packets will be scheduled to be communicated, at 410.
If more packets are desired to be communicated than slots are available within a CDF, a determination must be made as to which packets will be scheduled in this CDF, and which will be postponed to a subsequent CDF. This postponement can result in a loss of data, for example, if a node's buffer overflows, or in excessive delay. To minimize the mean delay through the network, and satisfy the QoS criteria, all nodes are given at least their nominal bandwidth allocation, if required, at 420. As stated above, the base station will only establish a connection to a terminal if it has the nominal number of slots available for that terminal in light of all the other established connections and their nominal allocations. Thus, the allocation in block 420 is guaranteed to result in each node receiving its nominal allocation, as required.
If, after allocating up to the nominal bandwidth to each active node, there are slots remaining, these slots should be allocated among the nodes with remaining data to be sent. If all nodes had infinite buffers, a laxity factor could be utilized to determine a fair distribution of the remaining slots to the nodes. Such a laxity factor, as will be subsequently discussed, orders packets by their relative need to be transmitted promptly. A high laxity factor indicates a relative insensitivity to delay; a low laxity factor indicates little tolerance for delays. Allocation in accordance with this laxity factor, low laxity packets allocated first, results in optimal throughput and overall fairness. But, as noted, such an allocation assumes no consequence other than delay in this allocation. In reality, loss of data may occur if the node has an insufficient buffer to accomodate the accumulation of data while waiting for its allocation. For example, a file transfer would be relatively insensitive to delay, but at each node which causes the delay, there must be sufficient memory to hold the packets which continue to arrive during this delay period. Thus, in practice, both delay and the risk of data loss must be considered in the allocation process.
In accordance with this invention, a portion of the remaining slots are allocated to minimize the risk of loss of packets due to buffer overflow, in block 430, and the remaining portion are allocated to maximize throughput while ensuring fairness in block 460. The size of the portion allocated to minimize the risk of data loss in 430 will be a function of the specific network architecture and composition. This proportion can be fixed, for example, half the allocation for buffer overflow protection, half for maximizing throughput. Or, it can initially fixed, then modified by the base station or some other controller in dependence upon an assessment of the likelihood of buffer overflows based on actual performance thus far.
Block 430 is further detailed in figure 4b. For each node having a non-zero remainder of packets to transmit, a buffer overflow factor, bof(i), is calculated as the ratio of the amount of available buffer, to the nominal allocation, at 433. The available buffer is the size of the node's buffer minus the number of remaining packets to be transmitted. This overflow factor, in effect, is a measure of the number of nominal allocations remaining in the buffer, or, equivalently, the number of CDFs remaining before the buffer overflows, if the node's buffer is being filled at the nominal rate. As such, a smaller bof(i) indicates a larger likelihood that a buffer overflow will occur.
This buffer overflow factor is further modified to favor those nodes which conform to the premises of ATM. A premise of ATM is that nodes will contain sufficient buffers to accomodate a dynamic allocation of bandwidth. The buffer overflow factor, however, being a measure of how quickly buffer overflow will occur, gives higher priority to nodes with smaller buffers. A second factor, the buffer size factor, bsf(i), is calculated in 434. The buffer size factor is a modified ratio of each node's buffer size in comparison to the average buffer size in the network. If a buffer has a higher than average buffer size, the ratio is fixed to 1 , which will result in no modification to the buffer overflow factor. If the node has a below average buffer size, the ratio will be less than one, and this ratio will reduce the priority given to this below average node, as will be shown in 436.
Another premise of ATM is that the node will frequently request less than its nominal allocation, to counterbalance those times when it requests more. A third factor, the behavior factor, beh(i), is calculated in 435. This factor is the percentage of times the node requested less allocation than its nominal. It is a measure of underutilization of a node's allocation. This ratio will affect the priority given to the node, in direct proportion to its degree of underutilization, at 436.
In 436, an overall priority factor, the buffer overflow management factor, BOMF(i), is calculated. As noted above, the priority is inversely proportional to the buffer overflow factor bof(i), and directly affected by the buffer size factor, bsf(i) and the behavior factor, beh(i). The larger the resultant BOMF(i), the higher the priority which should be given to this node. This factor is used in 442 to allocate bandwidth to each node to avoid buffer overflow while giving preference to nodes which conform to the premises of ATM. At 437, the sum of BOMF factors is accumulated. After computing the BOMF for each node having remaining unallocated request, shown by the loop formed by 432-438, the portion of the Overflow Allocation amount, OA, allocated to each of these node is computed in the loop formed by 441-443. Each node is given an allocation in direct proportion to its computed BOMF factor, relative to the total of all the computed BOMF factors, at 442, up to its requested amount. This allocation for each node is returned at 449, and will be added to that node's nominal allocation as previously discussed, and that node's laxity allocation as will be subsequently discussed. Consistent with this invention, the BOMF factor can be modified in a number of ways. For example, an upper threshold can be defined for all or each of the node's buffer overflow factor. If the node's buffer overflow factor exceeds this threshold, its BOMF could be set to zero, thereby preventing any overflow allocation for nodes which show little risk of overflow. Similarly, BOMF(i) can be constrained to be less than some maximum number, to prevent any one node from monopolizing the allocation as its buffer overflow factor approaches zero.
All remaining unallocated slots are assigned in accordance with a laxity factor priority in 460. As will be subsequently discussed, each node maintains a queue of packets, sorted by their laxity values. Laxity is a measure of the delay which can be acceptably incurred for each packet. A low laxity value indicates that the packet cannot afford to be delayed much longer; a high laxity factor indicates a relative tolerance for delay. Each node communicates the number of packets in their queue within discrete ranges of laxity values. For example, if three ranges are defined as low, medium, and high, a node may inform the base station that it has 15 packets with low laxity, 18 packets with medium laxity, and 6 packets with high laxity. This information is communicated to the base station during the terminal's superslot allocation, as part of the aforementioned uplink control information. As slots are allocated to each node, during the nominal allocation or the buffer overflow allocation discussed above, the number of packets which will be remaining at each node is updated, in laxity priority order. If the node used for the example above is allocated 12 slots during the nominal allocation, and 8 slots in the buffer overflow allocation, for a total of 20 slots. Within this allocation the node will send the 15 low laxity packets, and 5 of the medium laxity packets. The node will be left with no low laxity packets, 13 medium laxity and 6 high laxity packets. Any remaining unallocated slots are allocated, first, to low laxity packets, then to the medium, then to the high. Thus, if another node had any low laxity packets remaining, it would receive the allocation for all of its low laxity packets, up to the number of slots remaining to be allocated. This process is detailed in figure 4c. The loop formed by 461-464 allocates slots in priority order, at 463, until there are an insufficient number of slots available to allocate to all of the packets having this laxity level, at 462. If there are insufficient slots for allocation to all the packets of equal laxity level, the allocation at 466 will be distributed according to a round-robin allocation, for ease of computation and queue management, or according to a random allocation, for fairness. The resultant allocations for each node is returned at 469. The total allocation for each node (the sum of nominal + overflow + laxity allocations) will be communicated to the nodes at the beginning of the next CDF period, as previously discussed.
Figure 5 details the assignment and use of laxity factors at the individual nodes. Each node will place packets received for subsequent transmission into a Laxity Queue. At each node, a laxity factor is assigned when a connection is established. This laxity factor is a relative measure, and is assigned in dependence upon the delay and loss sensitivity associated with the traffic which is to be communicated via this connection. Delay insensitive channels are assigned a finite value as well, to prevent excessive delays. For example, a file transfer communications channel would assign a high laxity factor at each node in the connection. A voice communications channel, on the other hand, would assign a low laxity factor to each node. The exact assignment of values to this factor is not significant; the significant aspect is that the value be consistent and comparable. In the preferred embodiment, the laxity factor is equal to the maximum delay, in time units, allowable at each node along a connection, such that the sum of these numbers would be the maximum end-to- end delay allowable for acceptable communications. At each node, the specified laxity factor is assigned to each packet when it arrives. The insertion of the packet in the laxity queue will be in the order of the packet's assigned laxity factor. If multiple packets have the same laxity factor, they may be placed in further order by their sensitivity to data loss or other factors. For example, data packets would be placed ahead of voice packets with the same laxity factor. At each CDF period, the node receives its transmission allocation, T, from the base station at 510 in figure 5a. T packets are removed from the laxity queue, lowest laxity first, and transferred to the transmit queue for transmission during this CDF period, at 520. If any packets remain, 525, their laxity factors are reduced by the elapsed time since the last CDF. The elapsed time is computed at 530, and the loop formed by 540- 542 performs the reduction for each packet in the laxity queue. Thus, the laxity factor for each packet is an indication of the time remaining before subsequent delays become problematic.
For effective allocation at the base station, the wireless terminals must communicate the number of packets to be transmitted at each laxity level. Thereby, the base station can allocate more slots to nodes having packets with low laxity levels than to nodes having high laxity levels. This information will be transmitted to the base station via the control information which is appended to the first packet from each terminal, as discussed previously. However, the laxity factor can span a large range, and transmitting the number of packets at each of possible values could be a very time and bandwidth consuming process. Therefore, in accordance with this invention, the priority factors are quantized into a much smaller range of values. This quantization can be linear, for example, as by dividing the priority factor range into Q equal parts. The total number of packets contained in each of these Q segments of the priority scale would then be transmitted to the base station. In accordance with this invention, the preferred embodiment comprises a non-linear segmentation of the priority factor range, in accordance with a logarithmic scale. In so doing, packets with low laxity values can be more finely distinguished in the allocation process than those with larger, and less immediately important, values.
Figure 5b shows the quantization in accordance with this invention. NumPac is an array of values. NumPac(q) contains a count of the number of packets at each one of Q possible laxity levels. Boxes 560 through 564 represent a loop which is executed for each packet in the laxity queue. The quantized laxity level for each packet is determined by the calculations at 561 and 562, and the NumPac associated with this quantization level accumulates the number of packets with this resultant quantization level at 563. After this computation for all the packets in the laxity queue, the resultant accumulations in the NumPac array are returned, at 565, for subsequent communication to the base station via the control information in the terminal's superslot assignment, as discussed previously. The base station performs a similar laxity level accumulation for its downlink packets, and the laxity allocation is performed, as noted above, without regard to whether the traffic is uplink or downlink related.
To further optimize the efficiency of a wireless network in accordance with this invention, a beacon based synchronization and management capability is provided, as shown in figure 6. Periodically, at intervals much longer than the nominal CDF period, time is allocated for a beacon communications period, 610. The purpose of this signalling period is to separate long term management functions from the above described short term functions such as CDF slot allocation and signalling. The beacon signal will contain, for example, a master synchronizing signal. All terminals on the network will use this synchronizing signal to coarsely adjust their local timing signals, perform filter equalizations, and other adjustment or maintenance tasks. Thereafter, at each CDF, the synchronization signalling need only contain the signalling required to perform finer adjustments. Dynamic filter parameters gathered during the beaconing period can, for example, be utilized directly to initialize such filters directly before the receipt of the CDF signal which provides for a finer adjustment.
The beacon period is also the period wherein the aforementioned connection establishment and QoS negotiations take place, as well as connection disestablishment and other relatively long term or infrequent events. Placing these activities within this slower frequency timing minimizes the impact of such activities on the QoS of established connections. Connection establishment may, for example, require the communication of a thousand packets. If we force these communications to occur by the transfer of twenty packets at each beacon, and the beacons only occur at every tenth of a second, it will take five seconds to establish the connection. The impact on the network, however, utilizing this approach, will be significantly less than if the request for a thousand slots competed with the established connections at one CDF period, and the connection was made in less than a second by allocations taken away from the established connections. Limiting the effective bandwidth for connection establishment lengthens the time required to establish each connection, but results in greater performance once the connection is established.
Additionally, maintaining a separate scheme for connecting and disconnecting terminals also provides for efficiencies in the previously described CDF structure and operation, particularly with regard to the Alert period 340. Absent this beacon signalling, the CDF structure and protocol must accommodate alert signalling from any potential wireless terminal. Such a broad task may be infeasible to accommodate in the polling scenarios discussed previously. By segregating the connection establishment from the routine CDF management, the list of inactive terminals used for polling can be minimized to be only those currently connected terminals which are also currently inactive.
The periodic beacon signalling also allows for more efficient power conservation. A currently unconnected wireless telephone, for example, could monitor a beacon period, knowing that connections are only established during such periods. If it was not addressed in the beacon, it could set its clock to interrupt itself just before the next scheduled beacon period, and enter an inactive state in the interim.
To achieve the advantages stated, it is preferred that the beacon period occur at very regular intervals. As such, in light of the fact that CDFs are of variable length, there may be gaps in the series of CDFs, as shown at 620. Because the base station allocates the specific time of transmission from each node, a CDF can be easily partitioned to avoid excessively long gaps, as shown at 631-633. Without partitioning, the gap 632 would extend from the beginning of CDF period 631 to the beginning of beacon period 611. Provided that such a gap is sufficiently long for the base station to transmit its control signalling information (310 in figure 3), the base station can schedule the time of allocated transmissions to avoid the beacon period. A portion of the CDF will be transmitted at 631 , a smaller gap 632 will be realized, and the remainder of the CDF will be scheduled by the base to occur at 633. Alternatively, some variance may be permitted in the regularity of the beacon, and it could occur immediately following a CDF, or portion of CDF, thereby eliminating all unused gaps in time. The foregoing merely illustrates the principles of the invention. It will thus be appreciated that those skilled in the art will be able to devise various arrangements which, although not explicitly described or shown herein, embody the principles of the invention and are thus within its spirit and scope.

Claims

Claims
1. Communication network comprising a plurality of nodes coupled to a central node, wherein an active node is one of said nodes having one or more packets to transmit, said active node being arranged for communicating a request for an allocation of time within a frame period from each active node, said central node being arranged for allocating a time of transmission and a duration of transmission within said frame period to each of said active nodes, in dependence upon said request for allocation, and for communicating said allocation of time and duration to each of said active nodes within said frame period, said active node being arranged for transmitting packets in accordance with said allocation of time and duration within said frame period.
2. Communication network according to claim 1 , wherein some or all of said communicating and transmitting is via a wireless communications medium.
3. Communication network according to claim 1 , wherein said allocation of the time and duration of transmission from each active node is determined based upon one or more allocation parameters associated with each of said active nodes.
4. Communication network according to claim 3, wherein associated with each of said active nodes is a nominal allocation, and wherein one of said allocation parameters is the nominal allocation associated with each of said active nodes.
5. Communication network according to claim 3, wherein each of said active nodes comprise a buffer for transmitting or receiving said packets, and one of said allocation parameters is the size of said buffer at each of said active nodes.
6. Communication network according to claim 3, wherein said packets are ATM packets, and one or more of said allocation parameters comprise one or more ATM Quality of Service parameters.
7. Communication network according to claim 1, wherein said allocating comprises the steps of determining a laxity level associated with each of said packets, allocating said time of transmission and said duration of transmission to each of said active nodes, in dependence upon said request for allocation, and in dependence upon said laxity levels.
8. Communication network according to claim 1 , wherein associated with each packet is a laxity level, and, said request for allocation from each active node comprises a count of the number of packets to be transmitted at each laxity level.
9. Communication network according to claim 1, wherein said communicating of the request for allocation from each node comprises the steps of appending said request to the first packet transmitted during the time allocated to the node in the current frame period, or if time was not allocated to the node in the current frame period, communicating an alert message after the last time allocated among all the nodes in the current frame period.
10. A communications device for communicating messages within a network comprising a plurality of nodes, said device comprising means for transmitting a request for an allocation of time for transmitting messages, means for receiving an allocated first time and first duration for receiving messages, means for receiving an allocated second time and second duration for transmitting messages, means for receiving messages at said first time for said first duration, means for transmitting messages at said second time for said second duration.
11. A method for communicating data packets within a network comprising a plurality of nodes, wherein an active node is one of said nodes having one or more packets to transmit, said method comprising the steps of communicating a request for an allocation of time within a frame period from each active node, allocating a time of transmission and a duration of transmission within said frame period to each of said active nodes, in dependence upon said request for allocation, communicating said allocation of time and duration to each of said active nodes within said frame period, and transmitting packets from each of said active nodes in accordance with said allocation of time and duration within said frame period.
PCT/IB1997/001557 1996-12-19 1997-12-11 Medium access control (mac) protocol for wireless atm WO1998027747A2 (en)

Priority Applications (2)

Application Number Priority Date Filing Date Title
JP52749298A JP3881385B2 (en) 1996-12-19 1997-12-11 Medium access control (MAC) protocol for wireless ATM
EP97913408A EP0890267A2 (en) 1996-12-19 1997-12-11 Medium access control (mac) protocol for wireless atm

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
US08/770,024 US6198728B1 (en) 1996-12-19 1996-12-19 Medium access control (MAC) protocol for wireless ATM
US08/770,024 1996-12-19

Publications (2)

Publication Number Publication Date
WO1998027747A2 true WO1998027747A2 (en) 1998-06-25
WO1998027747A3 WO1998027747A3 (en) 1998-08-20

Family

ID=25087237

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/IB1997/001557 WO1998027747A2 (en) 1996-12-19 1997-12-11 Medium access control (mac) protocol for wireless atm

Country Status (6)

Country Link
US (1) US6198728B1 (en)
EP (1) EP0890267A2 (en)
JP (1) JP3881385B2 (en)
KR (1) KR100633267B1 (en)
CN (1) CN1115826C (en)
WO (1) WO1998027747A2 (en)

Cited By (18)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP0917316A2 (en) * 1997-10-14 1999-05-19 Lucent Technologies Inc. Method for bandwidth sharing in a multiple access system for communications networks
WO2000001192A2 (en) * 1998-06-30 2000-01-06 Koninklijke Philips Electronics N.V. Call admission control system for wireless atm networks
WO2000016532A2 (en) * 1998-09-11 2000-03-23 Sharewave, Inc. Dynamic communication channel switching for computer networks
WO2000016521A1 (en) * 1998-09-11 2000-03-23 Sharewave, Inc. Hierarchical computer network architecture
WO2000016517A2 (en) * 1998-09-11 2000-03-23 Sharewave, Inc. Method and apparatus for accessing a computer network communication channel
WO2001001633A1 (en) * 1999-06-29 2001-01-04 Nokia Corporation Apparatus and method for selectably operating radio device in alternate operating mode
EP1067733A1 (en) * 1999-07-06 2001-01-10 Alcatel Scheme for packet allocation in a radiocommunication system
US7072344B2 (en) 2001-07-16 2006-07-04 International Business Machines Corporation Redistribution of excess bandwidth in networks for optimized performance of voice and data sessions: methods, systems and program products
JPWO2004100453A1 (en) * 2003-05-07 2006-07-13 ソニー株式会社 Wireless communication system, wireless communication apparatus, wireless communication method, and computer program
US7324544B1 (en) 1998-09-11 2008-01-29 Cirrus Logic, Inc. Network slot synchronization scheme for a computer network communication channel
US7570952B2 (en) * 2001-09-10 2009-08-04 Telefonaktiebolaget Lm Ericsson (Publ) Advance resource allocations for association state transitions for wireless LAN system
US7869378B2 (en) 2005-09-26 2011-01-11 Interdigital Technology Corporation Method and apparatus for sharing slot allocation schedule information amongst nodes of a wireless mesh network
US8031690B2 (en) 1999-09-10 2011-10-04 Pulse-Link, Inc. Ultra wide band communication network
US8649322B2 (en) 2004-08-12 2014-02-11 Interdigital Technology Corporation Method and system for controlling access to a wireless communication medium
US9935705B2 (en) 1999-08-03 2018-04-03 Wi-Lan Inc. Frame structure for an adaptive modulation wireless communication system
US10045356B2 (en) 2002-07-15 2018-08-07 Wi-Lan Inc. Apparatus, system and method for the transmission of data with different QOS attributes
US10117234B2 (en) 2000-11-15 2018-10-30 Wi-Lan, Inc. Framing for an adaptive modulation communication system
US10805131B2 (en) 2006-09-01 2020-10-13 Wi-Lan Inc. Pre-allocated random access identifiers

Families Citing this family (145)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6091717A (en) * 1997-05-05 2000-07-18 Nokia Mobile Phones Limited Method for scheduling packet data transmission
US6081536A (en) 1997-06-20 2000-06-27 Tantivy Communications, Inc. Dynamic bandwidth allocation to transmit a wireless protocol across a code division multiple access (CDMA) radio link
US6542481B2 (en) * 1998-06-01 2003-04-01 Tantivy Communications, Inc. Dynamic bandwidth allocation for multiple access communication using session queues
US6151332A (en) * 1997-06-20 2000-11-21 Tantivy Communications, Inc. Protocol conversion and bandwidth reduction technique providing multiple nB+D ISDN basic rate interface links over a wireless code division multiple access communication system
US6049549A (en) * 1997-08-14 2000-04-11 University Of Massachusetts Adaptive media control
DE19747398C2 (en) * 1997-10-27 2002-10-24 Ericsson Telefon Ab L M communication system
US6222832B1 (en) 1998-06-01 2001-04-24 Tantivy Communications, Inc. Fast Acquisition of traffic channels for a highly variable data rate reverse link of a CDMA wireless communication system
US7394791B2 (en) 1997-12-17 2008-07-01 Interdigital Technology Corporation Multi-detection of heartbeat to reduce error probability
US9525923B2 (en) 1997-12-17 2016-12-20 Intel Corporation Multi-detection of heartbeat to reduce error probability
US6415329B1 (en) * 1998-03-06 2002-07-02 Massachusetts Institute Of Technology Method and apparatus for improving efficiency of TCP/IP protocol over high delay-bandwidth network
US7123628B1 (en) * 1998-05-06 2006-10-17 Lg Electronics Inc. Communication system with improved medium access control sub-layer
JP3517214B2 (en) * 1998-06-13 2004-04-12 サムスン エレクトロニクス カンパニー リミテッド State synchronization method between base station and mobile station in code division multiple access mobile communication system
US6640248B1 (en) * 1998-07-10 2003-10-28 Malibu Networks, Inc. Application-aware, quality of service (QoS) sensitive, media access control (MAC) layer
US6680922B1 (en) 1998-07-10 2004-01-20 Malibu Networks, Inc. Method for the recognition and operation of virtual private networks (VPNs) over a wireless point to multi-point (PtMP) transmission system
US6452915B1 (en) 1998-07-10 2002-09-17 Malibu Networks, Inc. IP-flow classification in a wireless point to multi-point (PTMP) transmission system
US6862622B2 (en) * 1998-07-10 2005-03-01 Van Drebbel Mariner Llc Transmission control protocol/internet protocol (TCP/IP) packet-centric wireless point to multi-point (PTMP) transmission system architecture
KR100330241B1 (en) * 1998-08-26 2002-10-04 삼성전자 주식회사 Apparatus and method for communicating wireless packet voice data
MXPA01005187A (en) * 1998-11-24 2002-06-04 Niksun Inc Apparatus and method for collecting and analyzing communications data.
US6510150B1 (en) * 1998-12-21 2003-01-21 Koninklijke Philips Electronics N.V. Method of MAC synchronization in TDMA-based wireless networks
US6529519B1 (en) * 1998-12-22 2003-03-04 Koninklijke Philips Electronics N.V. Prioritized-buffer management for fixed sized packets in multimedia application
US20020188720A1 (en) * 1998-12-28 2002-12-12 William F. Terrell Method and apparatus for dynamically controlling the provision of differentiated services
US6501732B1 (en) * 1999-02-25 2002-12-31 3Com Corporation System and method for controlling data flow in a wireless network connection
US6760308B1 (en) * 1999-02-26 2004-07-06 Bitbytebit Information Services, Inc. Adaptive transmission in multi-access asynchronous channels
US6920151B1 (en) * 1999-03-19 2005-07-19 Avaya Technology Corp. Symbol-based control of terminal endpoints in a communication system
US20090219879A1 (en) 1999-05-21 2009-09-03 Wi-Lan, Inc. Method and apparatus for bandwidth request/grant protocols in a wireless communication system
US7006530B2 (en) * 2000-12-22 2006-02-28 Wi-Lan, Inc. Method and system for adaptively obtaining bandwidth allocation requests
US8462810B2 (en) 1999-05-21 2013-06-11 Wi-Lan, Inc. Method and system for adaptively obtaining bandwidth allocation requests
US6925068B1 (en) 1999-05-21 2005-08-02 Wi-Lan, Inc. Method and apparatus for allocating bandwidth in a wireless communication system
US7889052B2 (en) 2001-07-10 2011-02-15 Xatra Fund Mx, Llc Authorizing payment subsequent to RF transactions
US7837116B2 (en) 1999-09-07 2010-11-23 American Express Travel Related Services Company, Inc. Transaction card
US7239226B2 (en) 2001-07-10 2007-07-03 American Express Travel Related Services Company, Inc. System and method for payment using radio frequency identification in contact and contactless transactions
US6795865B1 (en) * 1999-10-08 2004-09-21 Microsoft Corporation Adaptively changing weights for fair scheduling in broadcast environments
US6940831B1 (en) * 1999-11-29 2005-09-06 Matsushita Electric Industrial Co., Ltd Wireless communications system
US7172112B2 (en) 2000-01-21 2007-02-06 American Express Travel Related Services Company, Inc. Public/private dual card system and method
US8429041B2 (en) 2003-05-09 2013-04-23 American Express Travel Related Services Company, Inc. Systems and methods for managing account information lifecycles
US8543423B2 (en) 2002-07-16 2013-09-24 American Express Travel Related Services Company, Inc. Method and apparatus for enrolling with multiple transaction environments
US7627531B2 (en) 2000-03-07 2009-12-01 American Express Travel Related Services Company, Inc. System for facilitating a transaction
US7042863B1 (en) 2000-03-13 2006-05-09 Broadcom Corporation Efficient time-division multiplexed addressing protocol
US6657987B1 (en) * 2000-03-24 2003-12-02 International Business Machines Corporation Scheduling methodology for connections with quality of service (QoS) constraints in a polling based media access control (MAC)
US7024469B1 (en) * 2000-08-28 2006-04-04 Avaya Technology Corp. Medium access control (MAC) protocol with seamless polling/contention modes
US6826152B1 (en) 2000-09-13 2004-11-30 Harris Corporation System and method of conserving bandwidth in the transmission of message packets
US6816458B1 (en) * 2000-09-13 2004-11-09 Harris Corporation System and method prioritizing message packets for transmission
US6826153B1 (en) * 2000-09-13 2004-11-30 Jeffrey Kroon System and method of increasing the message throughput in a radio network
US20020159418A1 (en) * 2000-11-02 2002-10-31 Sharp Laboratories Of America, Inc. Quality of service using wireless lan
US6711411B1 (en) * 2000-11-07 2004-03-23 Telefonaktiebolaget Lm Ericsson (Publ) Management of synchronization network
WO2002041586A2 (en) * 2000-11-17 2002-05-23 Koninklijke Philips Electronics N.V. Wireless system containing a first network and a second network
US8009667B1 (en) 2001-01-16 2011-08-30 Wi—LAN, Inc. Packing source data packets into transporting packets with fragmentation
US7031274B2 (en) * 2001-01-16 2006-04-18 At&T Corp. Method for enabling interoperability between data transmission systems conforming to IEEE 802.11 and HIPERLAN standards
US7024482B2 (en) * 2001-02-28 2006-04-04 Sharp Laboratories Of America, Inc. Pseudo-random dynamic scheduler for scheduling communication periods between electronic devices
US8069254B2 (en) 2001-02-28 2011-11-29 Sharp Laboratories Of America, Inc. Communication period management in a communication system
US7650314B1 (en) 2001-05-25 2010-01-19 American Express Travel Related Services Company, Inc. System and method for securing a recurrent billing transaction
US8284025B2 (en) 2001-07-10 2012-10-09 Xatra Fund Mx, Llc Method and system for auditory recognition biometrics on a FOB
US7503480B2 (en) 2001-07-10 2009-03-17 American Express Travel Related Services Company, Inc. Method and system for tracking user performance
US7493288B2 (en) 2001-07-10 2009-02-17 Xatra Fund Mx, Llc RF payment via a mobile device
US7119659B2 (en) 2001-07-10 2006-10-10 American Express Travel Related Services Company, Inc. Systems and methods for providing a RF transaction device for use in a private label transaction
US9454752B2 (en) 2001-07-10 2016-09-27 Chartoleaux Kg Limited Liability Company Reload protocol at a transaction processing entity
US8538863B1 (en) 2001-07-10 2013-09-17 American Express Travel Related Services Company, Inc. System and method for facilitating a transaction using a revolving use account associated with a primary account
US9024719B1 (en) 2001-07-10 2015-05-05 Xatra Fund Mx, Llc RF transaction system and method for storing user personal data
US8294552B2 (en) 2001-07-10 2012-10-23 Xatra Fund Mx, Llc Facial scan biometrics on a payment device
US8548927B2 (en) 2001-07-10 2013-10-01 Xatra Fund Mx, Llc Biometric registration for facilitating an RF transaction
US7668750B2 (en) 2001-07-10 2010-02-23 David S Bonalle Securing RF transactions using a transactions counter
US20040233037A1 (en) * 2001-07-10 2004-11-25 American Express Travel Related Services Company, Inc. Method and system for iris scan recognition biometrics on a fob
US7762457B2 (en) 2001-07-10 2010-07-27 American Express Travel Related Services Company, Inc. System and method for dynamic fob synchronization and personalization
US8635131B1 (en) 2001-07-10 2014-01-21 American Express Travel Related Services Company, Inc. System and method for managing a transaction protocol
US7925535B2 (en) 2001-07-10 2011-04-12 American Express Travel Related Services Company, Inc. System and method for securing RF transactions using a radio frequency identification device including a random number generator
US7996324B2 (en) 2001-07-10 2011-08-09 American Express Travel Related Services Company, Inc. Systems and methods for managing multiple accounts on a RF transaction device using secondary identification indicia
US7360689B2 (en) 2001-07-10 2008-04-22 American Express Travel Related Services Company, Inc. Method and system for proffering multiple biometrics for use with a FOB
US7249112B2 (en) 2002-07-09 2007-07-24 American Express Travel Related Services Company, Inc. System and method for assigning a funding source for a radio frequency identification device
US7805378B2 (en) 2001-07-10 2010-09-28 American Express Travel Related Servicex Company, Inc. System and method for encoding information in magnetic stripe format for use in radio frequency identification transactions
US8960535B2 (en) 2001-07-10 2015-02-24 Iii Holdings 1, Llc Method and system for resource management and evaluation
US8001054B1 (en) 2001-07-10 2011-08-16 American Express Travel Related Services Company, Inc. System and method for generating an unpredictable number using a seeded algorithm
US7303120B2 (en) 2001-07-10 2007-12-04 American Express Travel Related Services Company, Inc. System for biometric security using a FOB
US7827106B2 (en) 2001-07-10 2010-11-02 American Express Travel Related Services Company, Inc. System and method for manufacturing a punch-out RFID transaction device
US7705732B2 (en) 2001-07-10 2010-04-27 Fred Bishop Authenticating an RF transaction using a transaction counter
US9031880B2 (en) 2001-07-10 2015-05-12 Iii Holdings 1, Llc Systems and methods for non-traditional payment using biometric data
US7746215B1 (en) 2001-07-10 2010-06-29 Fred Bishop RF transactions using a wireless reader grid
US20040236699A1 (en) 2001-07-10 2004-11-25 American Express Travel Related Services Company, Inc. Method and system for hand geometry recognition biometrics on a fob
FI20011520A (en) * 2001-07-11 2003-01-12 Nokia Corp Procedure for managing connection resources
US20030065736A1 (en) * 2001-07-25 2003-04-03 Pathak Jogen K. System, method, and apparatus for preventing data packet overflow at plurality of nodes in wireless packet data services network
WO2003041315A1 (en) * 2001-11-07 2003-05-15 Cyneta Networks Inc. System, method, and apparatus for preventing data packet overflow at nodes in wireless packet data services network
US20030093526A1 (en) * 2001-11-13 2003-05-15 Koninklijke Philips Electronics N. V. Apparatus and method for providing quality of service signaling for wireless mac layer
US7366776B2 (en) * 2001-11-20 2008-04-29 Sharp Laboratories Of America, Inc. System and method for reestablishing a communication period in a rendezvous scheduled system
US6839541B2 (en) 2001-12-04 2005-01-04 Illinois Institute Of Technology Technique for establishing a virtual backbone in an ad hoc wireless network
US20050201342A1 (en) * 2002-03-27 2005-09-15 Randy Wilkinson Wireless access point network and management protocol
US6831921B2 (en) 2002-03-27 2004-12-14 James A. Higgins Wireless internet access system
US7167913B2 (en) * 2002-06-05 2007-01-23 Universal Electronics Inc. System and method for managing communication links
EP1529362A4 (en) * 2002-08-02 2008-06-11 Sharp Kk Controlling wlan bandwidth allocation
US7610050B2 (en) 2002-08-14 2009-10-27 Tadaaki Chigusa System for mobile broadband networking using dynamic quality of service provisioning
US7015809B1 (en) 2002-08-14 2006-03-21 Skipper Wireless Inc. Method and system for providing an active routing antenna
US6805287B2 (en) 2002-09-12 2004-10-19 American Express Travel Related Services Company, Inc. System and method for converting a stored value card to a credit card
GB2393370B (en) * 2002-10-02 2004-10-20 Artimi Ltd Communication methods & apparatus
EP1550175B1 (en) * 2002-10-02 2006-12-13 Artimi Ltd Communication methods and apparatus
AU2003284014A1 (en) * 2002-10-03 2004-04-23 Flarion Technologies, Inc. Method to convey uplink traffic information
CA2504862C (en) * 2002-11-08 2012-07-17 Koninklijke Philips Electronics N.V. Ieee 802.11e mac signaling to support qos
US7525989B2 (en) * 2002-12-16 2009-04-28 Intel Corporation System, method and device for time slot status messaging among SONET nodes
US7263105B2 (en) * 2002-12-18 2007-08-28 Intel Corporation WLAN device and method for interfacing between a MAC sublayer and a physical layer
TWI235566B (en) * 2002-12-23 2005-07-01 Inst Information Industry Quality of Services control structure for mobile communication subscriber and method thereof
EP2897424B1 (en) * 2003-02-03 2018-12-05 Sony Corporation Communication method and communication apparatus, as well as computer program
US7787437B2 (en) * 2003-02-03 2010-08-31 Sony Corporation Wireless communication system, apparatus, method and computer program product including timed beacon transmission control
EP1616407B1 (en) * 2003-04-09 2008-02-06 Philips Intellectual Property & Standards GmbH Network with subnets being connectable via bridge terminals
KR101318539B1 (en) * 2003-05-14 2013-10-16 인텔 코포레이션 Network management using periodic measurements of indicators
KR101017005B1 (en) * 2003-05-16 2011-02-23 소니 주식회사 Radio communication system, radio communication apparatus, radio communication method, and computer program
KR100584326B1 (en) * 2003-06-03 2006-05-26 삼성전자주식회사 Local communication system and method in a wireless communication system
EP1632045B1 (en) * 2003-06-06 2013-08-21 Meshnetworks, Inc. System and method to provide fairness and service differentiation in ad-hoc networks
CN100531078C (en) * 2003-06-25 2009-08-19 皇家飞利浦电子股份有限公司 A method of decentralized medium access control in a communications network
US20050007991A1 (en) * 2003-07-10 2005-01-13 Dat Ton Bandwidth allocation method and apparatus for fixed wireless networks
US6985697B2 (en) * 2003-09-22 2006-01-10 Nokia, Inc. Method and system for wirelessly managing the operation of a network appliance over a limited distance
US20050125563A1 (en) * 2003-12-09 2005-06-09 Douglas Chet R. Load balancing device communications
US7409715B2 (en) * 2003-12-10 2008-08-05 Alcatel Lucent Mechanism for detection of attacks based on impersonation in a wireless network
US7936676B2 (en) * 2003-12-19 2011-05-03 Lenovo (Singapore) Pte. Ltd. Autonomic load balancing in wireless local area networks
US20050271128A1 (en) * 2004-06-02 2005-12-08 Williams Jeffery D Distributed SCADA system for remote monitoring and control of access points utilizing an intelligent uninterruptible power supply system for a WISP network
US7318550B2 (en) 2004-07-01 2008-01-15 American Express Travel Related Services Company, Inc. Biometric safeguard method for use with a smartcard
CN101448301B (en) * 2004-08-31 2012-11-07 松下电器产业株式会社 Wireless communication method and wireless communication apparatus
DE102004042172A1 (en) * 2004-08-31 2006-03-09 Advanced Micro Devices, Inc., Sunnyvale Segmented on-chip memory and arbitration requesting devices
US7492736B2 (en) * 2004-10-29 2009-02-17 Texas Instruments Incorporated System and method for access and management of beacon periods in distributed wireless networks
KR101141649B1 (en) * 2004-11-09 2012-05-17 엘지전자 주식회사 method of transmitting and receiving control information for enhanced uplink data channel
JP4717452B2 (en) * 2005-01-31 2011-07-06 ルネサスエレクトロニクス株式会社 Data multiplexer
US7515544B2 (en) 2005-07-14 2009-04-07 Tadaaki Chigusa Method and system for providing location-based addressing
US20090168704A1 (en) * 2005-08-24 2009-07-02 Young Dae Lee Method of transmitting control information for scheduling
GB2434717B (en) * 2006-01-26 2008-04-30 Toshiba Res Europ Ltd Wireless communications apparatus
US8311048B2 (en) * 2008-05-09 2012-11-13 Roundbox, Inc. Datacasting system with intermittent listener capability
US20070223870A1 (en) * 2006-03-23 2007-09-27 Seagate Technology Llc Single board digital video system
CN1859043B (en) * 2006-03-27 2010-04-14 华为技术有限公司 Loading, detecting and monitoring method for optical associated channel signal and its realizing device
US9679602B2 (en) 2006-06-14 2017-06-13 Seagate Technology Llc Disc drive circuitry swap
US7778149B1 (en) 2006-07-27 2010-08-17 Tadaaki Chigusa Method and system to providing fast access channel
US8160096B1 (en) 2006-12-06 2012-04-17 Tadaaki Chigusa Method and system for reserving bandwidth in time-division multiplexed networks
US8072930B2 (en) * 2007-04-25 2011-12-06 Sony Corporation Communication unit, system and method for saving power therein
JP4989346B2 (en) * 2007-07-30 2012-08-01 キヤノン株式会社 COMMUNICATION SYSTEM, COMMUNICATION DEVICE, AND COMMUNICATION METHOD
US9305590B2 (en) 2007-10-16 2016-04-05 Seagate Technology Llc Prevent data storage device circuitry swap
CN101483810B (en) * 2008-01-07 2010-12-22 上海贝尔阿尔卡特股份有限公司 Multimedia service data sending and receiving method, base station apparatus and user equipment
US8670395B2 (en) * 2008-06-26 2014-03-11 Samsung Electronics Co., Ltd. System and method for priority driven contention scheme for supporting enhanced QoS in a wireless communication network
US8824495B2 (en) * 2008-07-02 2014-09-02 Samsung Electronics Co., Ltd. System and method for reservation of disjoint time intervals in wireless local area networks
US8681679B2 (en) * 2009-12-21 2014-03-25 Lg Electronics Inc. Transmitting system and method for transmitting digital broadcast signal
CN102859895B (en) 2010-04-19 2015-07-08 三星电子株式会社 Method and system for multi-user transmit opportunity for multi-user multiple-input-multiple-output wireless networks
US8953578B2 (en) 2010-06-23 2015-02-10 Samsung Electronics Co., Ltd. Method and system for contention avoidance in multi-user multiple-input-multiple-output wireless networks
US9232543B2 (en) 2010-07-07 2016-01-05 Samsung Electronics Co., Ltd. Method and system for communication in multi-user multiple-input-multiple-output wireless networks
US8917743B2 (en) 2010-10-06 2014-12-23 Samsung Electronics Co., Ltd. Method and system for enhanced contention avoidance in multi-user multiple-input-multiple-output wireless networks
US9647921B2 (en) 2012-08-07 2017-05-09 Qualcomm Incorporated Statistics and failure detection in a network on a chip (NoC) network
US9232502B2 (en) 2012-10-31 2016-01-05 Samsung Electronics Co., Ltd. Method and system for uplink multi-user multiple-input-multiple-output communication in wireless networks
US9419752B2 (en) 2013-03-15 2016-08-16 Samsung Electronics Co., Ltd. Transmission opportunity operation of uplink multi-user multiple-input-multiple-output communication in wireless networks
US9295074B2 (en) 2013-09-10 2016-03-22 Samsung Electronics Co., Ltd. Acknowledgement, error recovery and backoff operation of uplink multi-user multiple-input-multiple-output communication in wireless networks
US9648612B2 (en) * 2013-12-23 2017-05-09 At&T Intellectual Property I, L.P. Method, computer-readable storage device, and apparatus for allocating timeslots on channels in a wireless network
KR20170100317A (en) * 2016-02-25 2017-09-04 한국전자통신연구원 Method and node device for allocating resources in wireless sensor networks
KR101984296B1 (en) * 2017-10-20 2019-09-03 국방과학연구소 Variable length packet transmission apparatus and method
KR20230062132A (en) * 2021-10-29 2023-05-09 삼성전자주식회사 Server and electronic device for transmitting and receiving stream data and method for operating thereof

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO1994017606A1 (en) * 1993-01-29 1994-08-04 Digital Ocean, Inc. Medium access control protocol for wireless network
US5355374A (en) * 1992-05-08 1994-10-11 Scientific-Atlanta, Inc. Communication network with divisible auxilliary channel allocation
WO1996031077A1 (en) * 1995-03-31 1996-10-03 Telefonaktiebolaget Lm Ericsson (Publ) Method and arrangement in a radio communication system
WO1997015129A1 (en) * 1995-10-19 1997-04-24 Cabletron Systems, Inc. Method and apparatus for network access control with implicit ranging and dynamically assigned time slots
EP0773651A1 (en) * 1995-11-10 1997-05-14 Nec Corporation Radio packet communication system capable of avoiding transmission collision

Family Cites Families (12)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5012469A (en) * 1988-07-29 1991-04-30 Karamvir Sardana Adaptive hybrid multiple access protocols
US5121383A (en) * 1990-11-16 1992-06-09 Bell Communications Research, Inc. Duration limited statistical multiplexing in packet networks
US5276703A (en) * 1992-01-13 1994-01-04 Windata, Inc. Wireless local area network communications system
CA2104753C (en) * 1992-10-29 1999-02-16 Kotikalapudi Sriram Bandwidth allocation, transmission scheduling, and congestion avoidance in broadband atm networks
US5384777A (en) * 1993-04-19 1995-01-24 International Business Machines Corporation Adaptive medium access control scheme for wireless LAN
US5471461A (en) * 1993-04-28 1995-11-28 Allen-Bradley Company, Inc. Digital communication network with a moderator station election process
US5696903A (en) * 1993-05-11 1997-12-09 Norand Corporation Hierarchical communications system using microlink, data rate switching, frequency hopping and vehicular local area networking
US5471469A (en) * 1994-02-08 1995-11-28 Metricon, Inc. Method of resolving media contention in radio communication links
US5926482A (en) * 1994-05-05 1999-07-20 Sprint Communications Co. L.P. Telecommunications apparatus, system, and method with an enhanced signal transfer point
US5677909A (en) * 1994-05-11 1997-10-14 Spectrix Corporation Apparatus for exchanging data between a central station and a plurality of wireless remote stations on a time divided commnication channel
US5638371A (en) * 1995-06-27 1997-06-10 Nec Usa, Inc. Multiservices medium access control protocol for wireless ATM system
US5684791A (en) * 1995-11-07 1997-11-04 Nec Usa, Inc. Data link control protocols for wireless ATM access channels

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5355374A (en) * 1992-05-08 1994-10-11 Scientific-Atlanta, Inc. Communication network with divisible auxilliary channel allocation
WO1994017606A1 (en) * 1993-01-29 1994-08-04 Digital Ocean, Inc. Medium access control protocol for wireless network
WO1996031077A1 (en) * 1995-03-31 1996-10-03 Telefonaktiebolaget Lm Ericsson (Publ) Method and arrangement in a radio communication system
WO1997015129A1 (en) * 1995-10-19 1997-04-24 Cabletron Systems, Inc. Method and apparatus for network access control with implicit ranging and dynamically assigned time slots
EP0773651A1 (en) * 1995-11-10 1997-05-14 Nec Corporation Radio packet communication system capable of avoiding transmission collision

Cited By (34)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP0917316A3 (en) * 1997-10-14 2000-01-19 Lucent Technologies Inc. Method for bandwidth sharing in a multiple access system for communications networks
EP0917316A2 (en) * 1997-10-14 1999-05-19 Lucent Technologies Inc. Method for bandwidth sharing in a multiple access system for communications networks
US6327254B1 (en) 1997-10-14 2001-12-04 Lucent Technologies Inc. Method for bandwidth sharing in a multiple access system for communications networks
WO2000001192A3 (en) * 1998-06-30 2000-04-27 Koninkl Philips Electronics Nv Call admission control system for wireless atm networks
WO2000001192A2 (en) * 1998-06-30 2000-01-06 Koninklijke Philips Electronics N.V. Call admission control system for wireless atm networks
US7324544B1 (en) 1998-09-11 2008-01-29 Cirrus Logic, Inc. Network slot synchronization scheme for a computer network communication channel
WO2000016517A3 (en) * 1998-09-11 2000-09-14 Sharewave Inc Method and apparatus for accessing a computer network communication channel
WO2000016532A3 (en) * 1998-09-11 2000-09-21 Sharewave Inc Dynamic communication channel switching for computer networks
US7093015B2 (en) 1998-09-11 2006-08-15 Cirrus Logic, Inc. Method and apparatus for accessing a wireless computer network communication channel by accessing quiet intervals in network frames
WO2000016517A2 (en) * 1998-09-11 2000-03-23 Sharewave, Inc. Method and apparatus for accessing a computer network communication channel
WO2000016532A2 (en) * 1998-09-11 2000-03-23 Sharewave, Inc. Dynamic communication channel switching for computer networks
WO2000016521A1 (en) * 1998-09-11 2000-03-23 Sharewave, Inc. Hierarchical computer network architecture
US6477156B1 (en) 1999-06-29 2002-11-05 Nokia Corporation Apparatus, and associated method, for selectably operating radio device in alternate operating mode
WO2001001633A1 (en) * 1999-06-29 2001-01-04 Nokia Corporation Apparatus and method for selectably operating radio device in alternate operating mode
WO2001003376A2 (en) * 1999-07-06 2001-01-11 Alcatel Scheme for packet allocation in a radiocommunication system
WO2001003376A3 (en) * 1999-07-06 2001-06-28 Cit Alcatel Scheme for packet allocation in a radiocommunication system
EP1067733A1 (en) * 1999-07-06 2001-01-10 Alcatel Scheme for packet allocation in a radiocommunication system
US7457268B2 (en) 1999-07-06 2008-11-25 Alcatel Scheme for packet allocation in a radiocommunication system
US9935705B2 (en) 1999-08-03 2018-04-03 Wi-Lan Inc. Frame structure for an adaptive modulation wireless communication system
US8031690B2 (en) 1999-09-10 2011-10-04 Pulse-Link, Inc. Ultra wide band communication network
US10117234B2 (en) 2000-11-15 2018-10-30 Wi-Lan, Inc. Framing for an adaptive modulation communication system
US10873930B2 (en) 2000-11-15 2020-12-22 Wi-Lan Inc. Framing for an adaptive modulation communication system
US7072344B2 (en) 2001-07-16 2006-07-04 International Business Machines Corporation Redistribution of excess bandwidth in networks for optimized performance of voice and data sessions: methods, systems and program products
US7570952B2 (en) * 2001-09-10 2009-08-04 Telefonaktiebolaget Lm Ericsson (Publ) Advance resource allocations for association state transitions for wireless LAN system
US11229032B2 (en) 2002-07-15 2022-01-18 Wi-Lan Inc. Apparatus, system and method for the transmission of data with different QoS attributes
US10779288B2 (en) 2002-07-15 2020-09-15 Wi-Lan Inc. Apparatus, system and method for the transmission of data with different QoS attributes
US10045356B2 (en) 2002-07-15 2018-08-07 Wi-Lan Inc. Apparatus, system and method for the transmission of data with different QOS attributes
JPWO2004100453A1 (en) * 2003-05-07 2006-07-13 ソニー株式会社 Wireless communication system, wireless communication apparatus, wireless communication method, and computer program
JP4513743B2 (en) * 2003-05-07 2010-07-28 ソニー株式会社 Wireless communication system, wireless communication apparatus, wireless communication method, and computer program
US10447386B2 (en) 2004-08-12 2019-10-15 Interdigital Technology Corporation Method and system for controlling access to a wireless communication medium
US8649322B2 (en) 2004-08-12 2014-02-11 Interdigital Technology Corporation Method and system for controlling access to a wireless communication medium
US7869378B2 (en) 2005-09-26 2011-01-11 Interdigital Technology Corporation Method and apparatus for sharing slot allocation schedule information amongst nodes of a wireless mesh network
US10805131B2 (en) 2006-09-01 2020-10-13 Wi-Lan Inc. Pre-allocated random access identifiers
US10985956B2 (en) 2006-09-01 2021-04-20 Wi-Lan, Inc. Pre-allocated random access identifiers

Also Published As

Publication number Publication date
KR19990087162A (en) 1999-12-15
JP3881385B2 (en) 2007-02-14
WO1998027747A3 (en) 1998-08-20
CN1215519A (en) 1999-04-28
CN1115826C (en) 2003-07-23
US6198728B1 (en) 2001-03-06
KR100633267B1 (en) 2007-05-04
JP2000507790A (en) 2000-06-20
EP0890267A2 (en) 1999-01-13

Similar Documents

Publication Publication Date Title
US6198728B1 (en) Medium access control (MAC) protocol for wireless ATM
US9860753B2 (en) Method and apparatus for bandwidth request/grant protocols in a wireless communication system
US9648600B2 (en) Methods and systems for transmission of multiple modulated signals over wireless networks
US5461627A (en) Access protocol for a common channel wireless network
US6879579B1 (en) Medium access control protocol for data communications
EP1310062B1 (en) Method and apparatus for bandwidth request/grant protocols in a wireless communication system
EP0713347A2 (en) Method and apparatus enabling STM and packet mode access on a broadband communications network
US8180359B2 (en) Data transmission method, system, base station and subscriber station, a data processing unit, computer program product, computer program distribution medium and baseband module
KR20040071332A (en) System and method for handling long asynchronous data in an asynchronous time slot
US8031660B2 (en) Data transmission method, system, base station, subscriber station, data processing unit, computer program product, computer program distribution medium and baseband module
US20030214933A1 (en) System and method for single-point to fixed-multipoint data communication
EP1679841A2 (en) Method and apparatus for bandwidth request/grant protocols in a wireless communication system
MXPA98006650A (en) Medium access control (mac) protocol for wireless atm
Lu et al. A combined polling and random access protocol for integrated voice and data wireless networks
AU9146998A (en) Medium access control protocol for data communications

Legal Events

Date Code Title Description
WWE Wipo information: entry into national phase

Ref document number: 97193709.5

Country of ref document: CN

AK Designated states

Kind code of ref document: A2

Designated state(s): CN JP KR MX

AL Designated countries for regional patents

Kind code of ref document: A2

Designated state(s): AT BE CH DE DK ES FI FR GB GR IE IT LU MC NL PT SE

WWE Wipo information: entry into national phase

Ref document number: 1997913408

Country of ref document: EP

WWE Wipo information: entry into national phase

Ref document number: PA/a/1998/006650

Country of ref document: MX

WWE Wipo information: entry into national phase

Ref document number: 1019980706555

Country of ref document: KR

AK Designated states

Kind code of ref document: A3

Designated state(s): CN JP KR MX

AL Designated countries for regional patents

Kind code of ref document: A3

Designated state(s): AT BE CH DE DK ES FI FR GB GR IE IT LU MC NL PT SE

121 Ep: the epo has been informed by wipo that ep was designated in this application
WWP Wipo information: published in national office

Ref document number: 1997913408

Country of ref document: EP

WWP Wipo information: published in national office

Ref document number: 1019980706555

Country of ref document: KR

WWG Wipo information: grant in national office

Ref document number: 1019980706555

Country of ref document: KR

WWW Wipo information: withdrawn in national office

Ref document number: 1997913408

Country of ref document: EP