US20090327443A1 - Method and System for Aggregating Messages - Google Patents

Method and System for Aggregating Messages Download PDF

Info

Publication number
US20090327443A1
US20090327443A1 US12146887 US14688708A US2009327443A1 US 20090327443 A1 US20090327443 A1 US 20090327443A1 US 12146887 US12146887 US 12146887 US 14688708 A US14688708 A US 14688708A US 2009327443 A1 US2009327443 A1 US 2009327443A1
Authority
US
Grant status
Application
Patent type
Prior art keywords
client
group
client nodes
node
client node
Prior art date
Legal status (The legal status 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 status listed.)
Pending
Application number
US12146887
Inventor
Hemanth Balaji Pawar
Shilpa Kowdley Srinivas
Anoop Goyal
Bhagwan Khanka
Duane Anthony Tomka
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Sprint Spectrum LP
Original Assignee
Sprint Spectrum LP
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

Links

Images

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00Arrangements for detecting or preventing errors in the information received
    • H04L1/12Arrangements for detecting or preventing errors in the information received by using return channel
    • H04L1/16Arrangements for detecting or preventing errors in the information received by using return channel in which the return channel carries supervisory signals, e.g. repetition request signals
    • H04L1/1607Details of the supervisory signal
    • H04L1/1628List acknowledgements, i.e. the acknowledgement message consisting of a list of identifiers, e.g. of sequence numbers
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00Arrangements for detecting or preventing errors in the information received
    • H04L1/12Arrangements for detecting or preventing errors in the information received by using return channel
    • H04L1/16Arrangements for detecting or preventing errors in the information received by using return channel in which the return channel carries supervisory signals, e.g. repetition request signals
    • H04L1/1607Details of the supervisory signal
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00Arrangements for detecting or preventing errors in the information received
    • H04L1/12Arrangements for detecting or preventing errors in the information received by using return channel
    • H04L1/16Arrangements for detecting or preventing errors in the information received by using return channel in which the return channel carries supervisory signals, e.g. repetition request signals
    • H04L1/1607Details of the supervisory signal
    • H04L1/1692Physical properties of the supervisory signal, e.g. acknowledgement by energy bursts
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00Arrangements for detecting or preventing errors in the information received
    • H04L1/12Arrangements for detecting or preventing errors in the information received by using return channel
    • H04L1/16Arrangements for detecting or preventing errors in the information received by using return channel in which the return channel carries supervisory signals, e.g. repetition request signals
    • H04L1/18Automatic repetition systems, e.g. van Duuren system ; ARQ protocols
    • H04L1/1812Hybrid protocols
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L61/00Network arrangements or network protocols for addressing or naming
    • H04L61/60Details
    • H04L61/6018Address types
    • H04L61/6022Layer 2 addresses, e.g. medium access control [MAC] addresses
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00Arrangements for detecting or preventing errors in the information received
    • H04L2001/0092Error control systems characterised by the topology of the transmission link
    • H04L2001/0093Point-to-multipoint
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATIONS NETWORKS
    • H04W84/00Network topologies
    • H04W84/02Hierarchically pre-organised networks, e.g. paging networks, cellular networks, WLAN [Wireless Local Area Network] or WLL [Wireless Local Loop]
    • H04W84/04Large scale networks; Deep hierarchical networks
    • H04W84/042Public Land Mobile systems, e.g. cellular systems

Abstract

Methods and systems are disclosed that support the aggregation of acknowledgement messages and control messages. Advantageously, acknowledgement and negative acknowledgement indications for multiple client nodes are combined into a single aggregated message which is broadcast or multicast to the multiple client nodes. Based on unique identifiers assigned to each client node, client nodes are grouped such that the aggregated acknowledgement messages can be efficiently encoded to conserve both network capacity when they are transmitted, as well as processing capacity when they are parsed by the client nodes. If code division multiple access (CDMA) technology is used, the aggregated acknowledgment message can be transmitted without CDMA spreading to effectively broadcast or multicast it to multiple client nodes. A similar technique can be employed for the efficient broadcast or multicast of aggregated control messages.

Description

    BACKGROUND
  • In a communication system, an access node may comprise a device or set of devices that serve as a gateway that client nodes may use for exchange of information with a network. This information may take the form of voice, data, or some other media. The client nodes may be wireline or wireless components.
  • In some types of communication systems, an access node explicitly acknowledges each packet of information that the access node receives from a client node. For example, if the access node receives ten voice packets from a client node, the access node may transmit ten acknowledgement messages, one for each voice packet, to the client node. These voice packets may include a representation of a voice signal, error detection coding, error correction coding, and possibly other information. By processing information in acknowledgment messages, the client node is able to determine if one or more of the voice packets it transmitted were not received by the access node. In response to such a determination, the client node may retransmit one or more voice packets to the access node.
  • There are at least two ways that a packet can be “lost” between a client node and the access node. The packet may be truly lost if it never arrives at the access node. Alternatively, the packet may arrive at the access node, but when the access node checks error detection coding in the packet, it finds that the packet has been corrupted. In this case, the access node may discard the packet, so the packet is effectively lost.
  • Such an acknowledgment-based transmission scheme is typically referred to as automatic repeat request (ARQ). For example, in one variation of ARQ referred to as stop-and-wait, a client node transmits a packet to an access node, then waits to receive an acknowledgement from the access node before transmitting another packet. If the client node does not receive an acknowledgement within a pre-determined time period or if the client node receives a negative acknowledgement, the client node may retransmit the packet.
  • Hybrid ARQ is a variation that can be applied to any type of ARQ. Using hybrid ARQ, a client node may divide a packet into multiple sub-packets, and transmit each sub-packet individually. These sub-packets may include redundant information for purposes of forward error correction. Thus, if the access node checks the error detection code of a sub-packet and finds that the sub-packet has been corrupted, the access node may be able to rebuild the correct packet from the redundant information. Nonetheless, some sub-packets may not include redundant information. For example, a given sub-packet may include only information and error detection codes, while subsequent sub-packets may include redundant information relating to the information in the given packet. Communication systems with lossy channels, such as wireless networks, may benefit from hybrid ARQ.
  • It is common for an access node to serve multiple client nodes, perhaps tens or hundreds of client nodes. Additionally, is it common for certain types of networks to support broadcast or multicast channels that can be used to transmit a packet such that the packet can be received by multiple destinations. Thus, it is possible for some access nodes to combine multiple acknowledgement messages destined for multiple clients into a single aggregated acknowledgement message (AAM). The access node then transmits this AAM to some or all of the client nodes using a broadcast or multicast channel. A client node that receives an AAM may parse the message to find the acknowledgement data pertaining to itself. The client node may discard acknowledgment data in the AAM that pertains to other client nodes.
  • By combining individual acknowledgment messages into a single AAM, network capacity is conserved, as the overhead associated with transmitting a large number of acknowledgment messages is eliminated. This technique is especially beneficial to an access node that is receiving packets from a potentially large number of client nodes.
  • OVERVIEW
  • Disclosed herein are methods and systems for improving aggregated acknowledgement schemes using ARQ-based or ARQ-like protocols. While these methods and systems are directed to high-speed wireless networks, they are applicable to any type of network that supports aggregating acknowledgements.
  • For purposes of simplicity, the terms “packet” and “sub-packet” will be used somewhat interchangeably. While the specific embodiment of hybrid ARQ divides packets into sub-packets and then transmits and acknowledges these individual sub-packets, the methods and systems described herein are not limited to operating on sub-packets, and may operate at the level of packets instead.
  • In order to improve the efficiency of encoding and processing AAMs, client nodes may be divided into groups based on an identifier assigned to each client that is unique for all client nodes served by a given access node or radio access network. The unique identifiers of clients within a group may be sequentially ordered and contiguous with respect to one another. When an access node receives a packet from each client in any given group during a predetermined time period, the access node may respond to all of the clients of the group with an AAM that contains acknowledgement data for each client in the group. If the access node does not receive a packet from all of the clients in the group within the predetermined time period, the access node may instead acknowledge each received packet individually.
  • The AAM may be encoded efficiently so that it requires very few bits of overhead to indicate the group and/or the associated client nodes to which it pertains. Furthermore, the acknowledgement data may be organized according to the ordering of the unique identifiers of the client nodes in the group so that each client node may efficiently find its respective acknowledgement data in an AAM. Advantageously, in CDMA networks, the acknowledgement data may be transmitted without CDMA spreading, thus effectively broadcasting or multicasting the AAM to a plurality of client nodes using only a single message.
  • An AAM may also contain control bits transmitted from an access node to a group of client nodes. Alternatively, control bits for multiple client nodes can be combined into a separate aggregated control message (ACM) and either broadcast or multicast to all client nodes in the group independently from the AAM. In cases where each of the client nodes in a given group are to be transmitted distinct control bits, these bits may represented as a series of control bits in an ACM. In cases where all of the client nodes in a given group are to be transmitted identical control bits, these bits may represented as a single set of control bits in an ACM.
  • These and other aspects and advantages will become apparent to those of ordinary skill in the art by reading the following detailed description, with reference where appropriate to the accompanying drawings. Further, it should be understood that the foregoing overview is merely exemplary and is not intended to limit the scope of the invention as claimed.
  • BRIEF DESCRIPTION OF THE DRAWINGS
  • FIG. 1 is a block diagram of a communication network in accordance with an exemplary embodiment;
  • FIG. 2A is an illustration of communication signal encoding;
  • FIG. 2B is an illustration of communication signal decoding;
  • FIG. 3 is a message flow depicting an exemplary embodiment of hybrid ARQ;
  • FIG. 4 is a signal flow schematic illustrating a method for transmitting acknowledgements on a CDMA medium access control channel;
  • FIG. 5 is a flow chart depicting a method in accordance with an exemplary embodiment;
  • FIG. 6 is a flow chart depicting a method in accordance with an exemplary embodiment;
  • FIG. 7A is an illustration of a bitwise encoding of information in accordance with an exemplary embodiment;
  • FIG. 7B is an illustration of a bitwise encoding of information in accordance with an exemplary embodiment;
  • FIG. 7C is an illustration of a bitwise encoding of information in accordance with an exemplary embodiment;
  • FIG. 8 is an illustration of a message format in accordance with an exemplary embodiment; and
  • FIG. 9 is a signal flow schematic illustrating a method for transmitting aggregated acknowledgements on a CDMA medium access control channel.
  • DESCRIPTION
  • While the methods and systems described herein are potentially applicable to any network that supports broadcasting or multicasting of acknowledgement messages, the following descriptions are directed to wireless networks for purposes of example and illustration.
  • 1. Client Nodes in Wireless Communication Networks
  • FIG. 1 is a simplified block diagram of an exemplary communication network 100, in which exemplary embodiments may be employed. Network 100 includes base transceiver stations (BTSs) 112, 114, 116 that can communicate with client nodes 106, 108, 110 via a plurality of wireless coverage areas. Client nodes 106, 108, 110 could be wireless telephones, wireless personal digital assistants, wirelessly equipped laptop computers, wireless routers, or other types of mobile or fixed wireless devices.
  • BTSs 112, 114, 116 radiate to define the wireless coverage areas. Each wireless coverage area may provide air interface access to client nodes 106, 108, 110 and any other client nodes served by the wireless coverage area. A single BTS 112, 114, 116 may define one or more wireless coverage areas. The air interface may include forward links from a BTS to client nodes 106, 108, 110 and reverse links from client nodes 106, 108, 110 to a BTS. Client nodes 106, 108, 110 exchange signaling, voice, data, video, or other media with the BTS through the forward and reverse links. In this regard, client nodes 106, 108, 110 may use the wireless coverage areas defined by BTSs 112, 114, 116 to communicate with one or more endpoints, e.g., other client nodes, e-mail servers, world wide web servers, gaming servers, media servers, media gateways, or location-based services, via a packet-switched network (e.g., the Internet 124 or private IP network 126), and/or a circuit-switched network, such as the public switched telephone network (PSTN) 128. For example, BTSs 112, 114, 116 may be communicatively coupled to a base station controller (BSC) 120. BSC 120 may, in turn, be communicatively coupled to packet-switched networks 124, 126 via a packet data serving node (PDSN) 118. Alternatively or additionally, BSC 120 may be communicatively coupled to PSTN 128 via a mobile switching center (MSC) 122.
  • Although FIG. 1 shows only three BTSs 112, 114, 116, network 100 may include fewer or more than three BTSs. These BTSs may be communicatively coupled to BSC 120 or to other network elements that are communicatively coupled to packet-switched networks 124, 126 and/or PSTN 128. Furthermore, client nodes 106, 108, 110 may be able to transfer ongoing communication sessions from one BTS to another in a handoff process. Network 100 may also include multiple BSCs 120, PDSNs 118, and MSCs 122. The combination of network elements including BTSs 112, 114, 116, BSC 120, PDSN 118, and MSC 122 may be collectively referred to as a radio access network (RAN). However, a RAN may also be defined to comprise more or fewer elements. For example, a RAN may comprise a single BTS and a single BSC. Furthermore, these elements may be combined with one another; for example, a BTS and a BSC may be physically co-located or may be components of the same physical element.
  • Regardless of the composition of the RAN, at least one entity within the RAN serves as an access node by acknowledging packets and/or sub-packets transmitted by the client nodes in the RAN's coverage area. The acknowledging entity may be a BTS 112, 114, 116, a BSC 120, or some other device.
  • The entity or entities of the RAN preferably include at least one processor, data storage, and program instructions stored in the data storage and executable by the processor to carry RAN functions described herein. Similarly, a client node preferably includes at least one processor, data storage, and program instructions stored in the data storage and executable by the processor to carry out client node functions described herein. Furthermore, the client nodes and the RAN may operate in accordance to various types of wireless protocols, such as Code Division Multiple Access (CDMA), Worldwide Interoperability for Microwave Access (WIMAX), Universal Mobile Telecommunications System (UMTS), or other protocols now known or later developed.
  • 2. CDMA Encoding and Decoding
  • CDMA wireless networks are exemplary types of communication systems in which the methods and systems herein can be implemented. Commercially deployed cellular CDMA systems are generally based on communication standards developed by the Third Generation Partnership Project 2 (3GPP2). 3GPP2 has supported the evolution and advancement of CDMA voice and data systems from low-speed systems to advanced integrated voice and data systems. One of the most recent commercially available CDMA systems is Evolution Data Only, Revision A (EVDO Rev. A), wherein a combination of CDMA and time division multiple access (TMDA) technologies can be employed to provide capacity on the order of megabits per second to client nodes. While the discussion herein is directed to EVDO Rev. A CDMA systems, the methods and procedures introduced may be applied to older or newer CDMA systems.
  • In a CDMA network, multiple communication channels can utilize the same carrier frequency without interference. Each channel is assigned a unique code from a set of mathematically orthogonal codes. Each code is a series of bits that has a very small or negligible cross-correlation with all other codes in the set. A code is applied to messages transmitted on the channel at a “chip rate” of some multiple of the messages' bit rate. For example a CDMA system with a chip rate of four means that four code bits will be applied to each bit of a message. A message is transmitted on a CDMA channel by multiplying repeating patterns of a channel's code with the message. Thus, the message is “spread” according to the code and the system's chip rate. Messages on all channels are additively combined and then transmitted simultaneously on the same carrier frequency.
  • FIG. 2A illustrates processes of transmitting messages according to CDMA. These processes 200, 210, 220, 230 operate at the bit level and may require that each binary zero (0) is transformed into a value of one (1), and each binary one (1) is transformed into a value of negative one (−1) for purposes of manipulation. The processes in FIG. 2A assume a chip rate of four, but other chip rates may be used.
  • In process 200, a message M1 is depicted as three bits long for simplicity of illustration. In practice, a message transmitted using CDMA is typically much longer than three bits and represents information, such as voice or data, being transmitted to or received from a client node. Modified message M1′ is created by spreading message M1 according to the chip rate of four. In other words, modified message M1′ represents each bit of message M1 being replaced by four bits of the same value. Orthogonal code W1 is a repeating four bit sequence. Modified message M1′ is multiplied bitwise with code W1 to create spread code C1. Similar procedures are illustrated in process 210 for a message M2 and an orthogonal code W2, and in process 220 for a message M3 and an orthogonal code W3. It can readily be demonstrated that orthogonal codes W1, W2, and W3 are in fact orthogonal with one another, as the bitwise cross-correlation of any two of these codes is zero. In process 230, the three resulting spread codes, C1, C2, and C3, are added bitwise to create a signal S. Signal S is then transformed into a bit stream and modulated onto a carrier frequency for transmission to the intended receivers of messages M1, M2, and M3.
  • A receiver may decode a message from a particular CDMA channel by multiplying the received signal with the channel's code, then adding the resulting bits in each chip period. FIG. 2B illustrates processes of decoding messages according to CDMA. First, a modulated representation of signal S is received and demodulated. In process 240, signal S is then multiplied bitwise with orthogonal code W1. In turn, the resulting values in each four-symbol chip period are then added, thus forming modified signal S1. Finally, each symbol in modified signal S1 is compared to a threshold value in order to recreate the original message. In this system, if the symbol is of a value less than zero, it is assigned a −1, and if the symbol is of a value greater than zero, it is assigned a 1. Thus, the originally transmitted message, M1, is decoded. Similar procedures are illustrated in processes 250 and 260 to decode messages M2 and M3, respectively. While not shown in FIG. 2B, each negative one (−1) in message M1 may be transformed into a one (1) and each one (1) in message M1 may be transformed into a zero (0) to form a bit stream.
  • 3. Hybrid ARQ in CDMA
  • In CDMA networks, voice or data packets transmitted on a reverse link traffic channel typically include error correcting codes. These codes insert redundant information into a voice or data bit stream so that the access node has a higher probability of being able to properly decode the packet. Popular types of error correcting codes include Reed-Solomon codes and turbo codes, and CDMA systems may use these or other types of error correcting codes.
  • Typically, a client node will apply an error correcting code to a voice or data packet, then divide the packet into a number of sub-packets. Preferably, the client node transmits each sub-packet independently to the access node according to ARQ procedures.
  • Due to the fact that redundant information is encoded in each sub-packet, it is possible that the access node may be able to decode the entire transmitted packet before it receives all of the sub-packets for that packet. For example, assuming that the number of sub-packets per packet is four, a client node may divide a packet into sub-packets 1 through 4 and then may transmit them according to ARQ procedures. After receiving each sub-packet, the access node will attempt to decode the entire original packet. It may be possible for the access node to do so after it receives sub-packets 1 and 2. In this case, the access node will instruct the client node to not transmit sub-packets 3 and 4, thus avoiding unnecessary utilization of network capacity. Such a benefit may be referred to as early termination gain.
  • Hybrid ARQ in CDMA networks facilitate this process. An access node uses three bits transmitted in the forward direction to indicate whether early termination gain can be applied to a packet. The H-ARQ bit (not to be confused with the overall process of hybrid ARQ) is used to acknowledge (ACK) or negatively acknowledge (NACK) the first three sub-packets of a packet. The L-ARQ bit is used to ACK or NACK the fourth sub-packet of a packet. The P-ARQ bit is used to ACK or NACK the full packet.
  • FIG. 3 provides examples of hybrid ARQ procedures in CDMA. Client node 304 transmits two series of sub-packets to access node 306. Each series represents the transmission of several sub-packets that comprise a packet. The first series 300 serves as an example of sub-packet transmission without early termination gain, while the second series 302 serves as an example of sub-packet transmission with early termination gain. For purposes of simplicity, NACKs transmitted by access node 306 in response to sub-packets transmitted by client node 304 are not shown.
  • In first series 300, client node 304 transmits the first sub-packet, SP1(1) 310. Access node 306 responds with a H-ARQ ACK 315 to indicate that SP1(1) 310 was successfully received. Similarly, client node 304 transmits SP1(2) 320 and access node 306 responds with an H-ARQ ACK 325, and client node 304 transmits SP1(3) 330 and again, access node 306 responds with an H-ARQ ACK 335. Client node 304 transmits SP1(4) 340 and access node 306 responds with an L-ARQ ACK 345 to indicate that SP1(4) 340 is the final sub-packet of the packet. After transmitting L-ARQ ACK 345, the access node reassembles the four sub-packets into a packet. This process is successful, so access node 306 transmits a P-ARQ ACK 347 to indicate that access node 306 has successfully received the entire packet.
  • In second series 302, client node 304 transmits the first sub-packet, SP2(1) 350. Access node 306 responds with an H-ARQ ACK 355 to indicate that SP(1) 350 was successfully received. However, after client node 304 transmits the second sub-packet, SP2(2) 360, access node 306 responds with an H-ARQ ACK 365, followed by a P-ARQ ACK 370. The P-ARQ ACK 370 indicates to client node 304 that access node 306 was able to decode the packet based on a combination of SP2(1) 350 and SP2(2) 360 and that client node 304 does not need to transmit any further sub-packets.
  • In both first series 300 and second series 302, access node 306 may transmit ACKs and NACKs at predetermined offsets from when client node 304 transmits the associated sub-packet. Thus, client node 304 can use these offsets to match ACKs and NACKs to the sub-packets these ACKs and NACKs are intended to acknowledge or negatively acknowledge, respectively.
  • While the example in FIG. 3 illustrates the use of four sub-packets per packet, another number of sub-packets per packet could be used as well. Similarly, while FIG. 3 illustrates the use of the H-ARQ, L-ARQ, and P-ARQ bits to facilitate early termination gain, a different number of bits, configuration of bits, or sequence or types of messages could achieve the same goals.
  • 4. CDMA MAC Channels
  • In many CDMA systems, the orthogonal codes used in the forward direction are Walsh codes, while the orthogonal codes used in the reverse direction are pseudo noise (PN) codes. Client nodes are each assigned a unique medium access control identifier (MAC_ID), corresponding to their assigned Walsh code. In EVDO Rev. A, MAC_IDs comprise an integer between 0 and 127, with MAC_IDs 6-63 and 72-127 being available to be assigned to client nodes. A MAC_ID may serve as a dynamically assigned address for the client node. Thus, there typically is a unique mapping in each of the forward and reverse directions between an orthogonal code, a MAC_ID, and a client node. However some orthogonal codes and/or MAC_IDs may be shared by more than one client node.
  • CDMA standards allow a base station to be deployed to support multiple sectors. For example, instead of using an omni-directional, 360-degree antenna, a base station can use three antennae, each transmitting and receiving signals over sectors of 120 degrees. Each sector may support a number of traffic channels and a number of signaling channels. The traffic channels may support bearer traffic and the signaling channels may facilitate functions including paging, handoffs, power control, and synchronization.
  • One of the forward direction signaling channels in EVDO Rev. A is the MAC channel. Each client node is assigned a MAC channel and a MAC_ID associated with this channel. The MAC channel supports hybrid ARQ signaling, and further comprises the reverse power control (RPC) sub-channel and the data rate control lock (DRCLock) sub-channel. The RPC sub-channel may be used to control the power that the client node uses to transmit in the reverse direction. The DRCLock sub-channel may be used to indicate the quality of the reverse link DRC channel.
  • FIG. 4 depicts a method 400 for transmitting acknowledgment messages on a CDMA MAC channel. In particular, FIG. 4 provides a representation of how RPC, DRCLock and ARQ bits are multiplexed and encoded on a CDMA MAC channel in the forward direction to a particular target client node. An RPC bit stream serves as input to a signal point mapping function 410, while an H-ARQ/L-ARQ bit stream serves as input to signal point mapping function 420, a P-ARQ bit stream serves as input to signal point mapping function 450, and a DRCLock bit stream, after being passed through bit repetition function 460, serves as input to signal point mapping function 465. The purpose of signal point mapping functions 410, 420, 450, and 465 is to transform a binary bit stream into a format in accordance with CDMA encoding by converting zeros (0) into ones (1) and converting ones (1) into negative ones (−1).
  • After the bit streams are converted in signal point mapping functions 410, 420, 450, and 465, they are passed through channel gain functions 415, 425, 455, and 470, respectively. Outputs from channel gain functions 415 and 425 are combined by time-division multiplexor 430, then sent to CDMA spreader 435, where the bitstream is spread using the Walsh code associated with the target client node's MAC_ID. Similarly, outputs from channel gain functions 455 and 470 are combined by time-division multiplexor 475, then sent to CDMA spreader 480, where the bitstream is spread using the Walsh code associated with the target client node's MAC_ID. The CDMA spreaders, 435 and 480, use 128-bit Walsh codes in order to support the 128 possible MAC_IDs in EVDO Rev. A. The 128 bits of output from the two CDMA spreading functions, 435 and 480 are combined in a Walsh chip level summer 485 and the resulting 256-bit output is modulated onto the in-phase (I) and quadrature-phase (Q) components of the carrier frequency.
  • 5. Aggregating ARQ Messages
  • While the methods and systems described above work reasonably well when a relatively small number of client nodes are served by an access node, as the number of client nodes per access node increases, the CDMA MAC channel hybrid ARQ scheme becomes less efficient. For example, suppose that 56 client nodes are transmitting packets on their respective reverse traffic channels. For each sub-packet of each packet from each client node, the access node has to transmit at least one hybrid ARQ ACK or NACK message. Under the scheme described above, each hybrid ARQ message requires 256 bits. Thus, if each client node transmits a sub-packet at approximately the same time, the access node must transmit 14,336 bits of hybrid ARQ information across 56 different ARQ messages. However, hybrid ARQ information can be more efficiently encoded.
  • Instead of transmitting individual ARQ messages to each client node, the access node may aggregate the ARQ information for some number of client nodes into a single, common ARQ message that is then broadcast or multicast to these clients. An additional goal is to be able to format the aggregated acknowledgement message (AAM) in such a way that it uses a small number of bits in an arrangement that is simple to decode. As a result, network capacity is conserved while client nodes may spend relatively few CPU cycles processing each AAM. Note that while the AAM is referred to as an aggregated acknowledgement message, it may contain indications of negative acknowledgements as well.
  • FIG. 5 is a flow chart depicting a method 500 for aggregating acknowledgement messages. At step 510 a communication system maintains a division of client nodes into groups based on unique identifiers that are assigned to these client nodes. This division is preferably maintained in the access node, but may be maintained in other devices such as a database, server, or adjunct node that is coupled to the access node. In a wireless communication network the division may be maintained in any of the infrastructure components in FIG. 1, such as a BTS 112, 114, 116, a BSC 120, an MSC 122 or a PDSN 118. Client nodes may either be explicitly notified of their group by an access node, or the group assignment may be implicit and the client nodes may be able to determine their group assignment from an AAM. For an example of bit encodings that an access node may use to implicitly indicate a group in an AAM, see FIGS. 7A, 7B, and 8.
  • The unique identifiers assigned to the client nodes are preferably CDMA MAC_IDs, but other types of unique identifiers may also be used. Preferably the unique identifiers are sequentially numbered and client nodes are assigned to groups based on the numbering of their unique identifiers. For example, as noted above, EVDO Rev. A client nodes may have MAC_IDs assigned from the ranges 6-63 and 72-127. These MAC_IDs may be dynamically assigned when a client node becomes associated with an access node, or may be assigned by some other means. The MAC_IDs can also serve as unique client node identifiers and as the basis for dividing the client nodes into groups. One such division can be based on assigning client nodes with contiguously-numbered MAC_IDs to groups of a particular size; for instance, an access node may be configured to assign 5 client nodes to a group. Thus, the access node may assign the client nodes with MAC_IDs 6-10 into a first group, the client nodes with MAC_IDs 11-15 into a second group, and so on.
  • At step 512, an access node detects that it has received, within a given time period, a packet from each of the client nodes in a given group. These packets may be sub-packets transmitted according to EVDO Rev. A hybrid ARQ procedures, or may be transmitted or formatted according to other procedures. At step 514, the access node transmits a single AAM that contains acknowledgement data associated with all of the client nodes in the group. This transmission may be broadcast to all client nodes or multicast to just the client nodes in the group. Preferably, the AAM includes (1) a preamble indicating that the AAM contains aggregated acknowledgements, (2) a group identifier indicating the group of client nodes to which the acknowledgements relate, and (3) a series of acknowledgements, each acknowledging a sub-packet transmitted by one of the client nodes within the given group. The group identifier is preferably a compact representation of a group of client nodes rather than a list of the unique client node identifiers of each client node in the group. The series of acknowledgements is preferably organized according to the sequential numbering of the client nodes' MAC_IDs.
  • At step 516, a client node receives the AAM and the client node uses its unique identifier to locate its respective acknowledgement data within the AAM. Preferably, the client node (1) parses the preamble to determine that the message contains aggregated acknowledgements, (2) parses the group identifier and determines that the AAM is directed to the group that the client node was assigned to, and (3) uses its MAC_ID to determine which bits in the AAM contains the client node's acknowledgment data.
  • FIG. 6 is a flow chart of another method 600 for aggregating acknowledgement messages. At step 610 each client node of a plurality of client nodes is assigned a unique identifier. The unique identifiers assigned to the client nodes are preferably CDMA MAC_IDs, but other types of unique identifiers may also be used. Preferably the unique identifiers are sequentially numbered. At step 612 each client node is placed in a group based on its unique identifier. For example, as noted above, EVDO Rev. A client nodes may have MAC_IDs assigned from the ranges 6-63 and 72-127.
  • At step 614, a plurality of packets from at least two client nodes assigned to a given group are received within a given time period. These packets may be sub-packets transmitted according to EVDO Rev. A hybrid ARQ procedures, or the packets may be transmitted or formatted according to other procedures. At step 616, a determination is made as to whether packets were received from all of the client nodes assigned to the given group. If this is not the case, then, at step 618, individual acknowledgement messages are transmitted to each client node from which a packet was received. If this is the case, then at step 620 a single AAM is transmitted to all client nodes assigned to the given group. This transmission may be broadcast to all client nodes or multicast to just the client nodes in the given group. As described above, the AAM preferably includes (1) a preamble indicating that the AAM contains aggregated acknowledgements, (2) a group identifier indicating the given group of client nodes to which the acknowledgements relate, and (3) a series of acknowledgements, each acknowledging a packet transmitted by one of the client nodes within the given group.
  • 6. Client Node Groupings for AAM and ACM Encoding and Transmission
  • In accordance with method 500 and method 600, it may be advantageous to group client nodes based on a sequential ordering of their unique identifiers. Doing so allows AAMs to be efficiently encoded by access nodes and efficiently decoded by client nodes. By encoding AAMs using relatively few bits to indicate the group of client nodes that the AAMs are directed to and the acknowledgment data for these client nodes, the AAMs will be relatively simple for client nodes to parse. Thus, client node CPU utilization may be reduced. Furthermore, if a client node is a battery-powered wireless device, reducing the number of bits that the client node needs to receive and process may extend the client node's battery life.
  • Exemplary embodiments of AAM encodings are presented in FIGS. 7A, 7B, 7C and 8. These embodiments encode a group identifier as sequences of bits that denote the group size and the group number, respectively. These embodiments further encode the acknowledgements and negative acknowledgments directed to each client node in a compact fashion, using only two bits. Additionally, the acknowledgements and negative acknowledgments are arranged in the sequential order of the client nodes' MAC_IDs, so that each client node can quickly determine which bits in the AAM contain the client node's respective acknowledgement data.
  • FIG. 7A depicts a set of exemplary mappings 700 of group size bit encodings 710 to group sizes 720. Thus, for instance, a group size bit encoding 710 of 001 indicates a group size of 10 client nodes, while a group size bit encoding 710 of 011 indicates a group size of 20 client nodes. Furthermore, FIG. 7B depicts a set of exemplary mappings 750 of MAC_ID index bit encodings 760 for a group size of 10 to start and stop MAC_IDs 770. Each MAC_ID index bit encoding 760 is associated with a start MAC_ID. The group size, as indicated in the group size bit encoding 710, determines a stop MAC_ID. The start and stop MAC_IDs represent a contiguous range of MAC_ID values that are used to group client nodes. Thus, for instance, a MAC_ID index bit encoding 760 of 0000 combined with a group size bit encoding 710 of 001 represents MAC_IDs 127 through 118, inclusive. Similarly, a MAC_ID index bit encoding 760 of 0001 combined with a group size bit encoding 710 of 001 represents MAC_IDs 117 through 108, inclusive. In these embodiments the start MAC_ID is higher than the stop MAC_ID, but alternate embodiments may comprise the start MAC_ID being lower than the stop MAC_ID. Furthermore, the number of MAC_IDs and the exact values of the MAC_IDs may be different from the values presented in FIG. 7B. When the number of MAC_IDs available for client nodes is not divisible by the group size, at least one group of MAC_IDs may have fewer or more MAC_IDs than the other groups of MAC_IDs.
  • FIG. 7C depicts a set of exemplary mappings 780 of ARQ bit encodings 785 to ARQ messages 790. Thus, for instance, an ARQ bit encoding 785 of 00 indicates a NACK message while an ARQ bit encoding 785 of 10 indicates an L-ARQ ACK message. These encodings use only two bits, making them more efficient than representing an H-ARQ, L-ARQ and P-ARQ as three separate bits.
  • The mapping data depicted in FIGS. 7A, 7B, and 7C is preferably stored in an access node. This mapping data may be statically arranged, or it may be dynamic such that it varies according to network configuration, network conditions or other factors. The mapping data may also be statically or dynamically stored in the client node, or the client node may not store any mapping data and instead parse each AAM to determine if the AAM contains acknowledgement data for the client node.
  • FIG. 8 depicts an exemplary binary AAM format 830 comprising an AAM preamble 840, group size bit encoding 850, MAC_ID index bit encoding 860, a series of ARQ bit encodings 870, and padding 880. AAM preamble 840 may comprise a sequence of bits that distinctly identifies the message as an AAM. Group size bit encoding 850 may comprise a series of bits encoding the size of the groups of client nodes. For example, group size bit encoding 850 could use the bit encodings from mapping 700. MAC_ID index bit encoding 860 may comprise a series of bits encoding the MAC_ID range of client nodes in a group. For example, MAC_ID index bit encoding 860 could use the bit encodings from mapping 750. ARQ bit encodings 870 may comprise one or more representations of ARQ data. Preferably ARQ bit encodings 870 are arranged to represent an ARQ message for each client node that is assigned a MAC_ID from the range defined by group size bit encoding 850 and MAC_ID index bit encoding 860. Additionally, it is advantageous for these ARQ messages to be arranged sequentially according to the MAC_IDs of the client nodes. Furthermore each ARQ message may comprise a series of bits encoding an ARQ message according to mapping 780. Thus, the first two bits of ARQ bit encodings 870 may represent an ARQ message transmitted to a first client node, the next two bits of ARQ bit encodings 870 may represent an ARQ message transmitted to the next client node in the sequential order of the client node's MAC_IDs, and so on. Finally, padding 880 may comprise a number of bits required to pad the length of an given AAM to a certain number of bits, for example 128 bits.
  • FIG. 9 depicts a method 900 for transmitting an AAM on a CDMA MAC channel. In particular, FIG. 9 provides a representation of how the RPC and DRCLock bits are multiplexed and encoded on a CDMA MAC channel in the forward direction to a particular target client node, while the AAM bits are transmitted to all client nodes in a group.
  • In FIG. 9, an RPC bit stream serves as input to a signal point mapping function 910, while a DRCLock bit stream, after being passed through bit repetition function 920, serves as input to signal point mapping function 925. The purpose of signal point mapping functions 910 and 925 is to transform a binary bit stream into a format in accordance with CDMA encoding by converting zeros (0) into ones (1) and converting ones (1) into negative ones (−1).
  • After the bit streams are converted in signal point mapping functions 910 and 925, they are passed through channel gain functions 915 and 930, respectively. Outputs from channel gain functions 915 and 930 are combined by time-division multiplexor 935, then transmitted to a CDMA spreader 940, where the signal is spread using the Walsh code associated with the target client node's MAC_ID. CDMA spreader 940 uses 128-bit Walsh codes in order to support the 128 possible MAC_IDs in EVDO Rev. A. The 128 bits of output from CDMA spreader 940 are modulated onto either the in-phase (I) or the quadrature-phase (Q) components of the carrier frequency. Preferably, the 128 bits of output are modulated onto the I component of the carrier frequency if the target client node's MAC_ID is even, and modulated onto the Q component of the carrier frequency if the target client node's MAC_ID is odd.
  • An AAM bit stream, preferably arranged according to AAM format 830 and comprising 128 bits, serves as input into ARQ channel gain function 945. The 128-bit output from ARQ channel gain function 945 is modulated onto either the I or Q components of the carrier frequency without being spread according to CDMA procedures. Preferably, the 128-bit output is modulated onto either the I or Q component of the carrier frequency based on which of these phase components is not being used by the output of CDMA spreader 940.
  • As described earlier, if each of 56 client nodes transmit a sub-packet at approximately the same time, the access node must transmit 14,336 bits of hybrid ARQ information on a MAC channel, across 56 different ARQ messages. Assume that, using method 900 to transmit AAM messages formatted according to AAM format 830, all 56 client nodes are assigned to the same group and all 56 client nodes transmit sub-packets at approximately the same time. Then, the 128-bit output of CDMA spreader 940 is transmitted on a MAC channel to each respective client node, but the 128-bit AAM message is transmitted on a MAC channel just once, and is preferably received by all 56 client nodes. Thus, the total number of bits required for transmitting acknowledgements is reduced to 7,296 bits through use of the AAM scheme introduced herein. However, significant reductions in the number of bits required for transmitting acknowledgements to client nodes can be achieved even if the client node group size is smaller than 56.
  • An AAM may also contain control bits transmitted from an access node to a group of client nodes. For example, the CDMA RPC bits and DRCLock bits for each client node in a given group of can be represented as a series of bits in binary AAM format 830. The control bits may appear before, after, or interleaved with ARQ bit encodings 870. Regardless of their exact position in an AAM, in an ACM that contains control bits, the control bits are preferably ordered according to the numbering of the client nodes' MAC_IDs. Thus, when receiving an AAM containing control bits, a client node will know where within the AAM to find its control bits.
  • Alternatively, control bits for multiple client nodes can be combined into a separate aggregated control message (ACM) and either broadcast or multicast to all client nodes in the group independently from the AAM. Similar to the methods and encodings described in FIGS. 7A, 7B, 7C, 8, and 9, control bits can be aggregated into an ACM and transmitted to a group of client nodes without spreading the ACM signals with a CDMA Walsh code. An ACM may include control bits that are distinct for each client node in a given group, or control bits that are identical for all client nodes in a given group.
  • In cases where each of the client nodes in a given group are to be transmitted distinct control bits, these bits may represented as a series of control bits in an ACM. For example, the CDMA RPC bits and DRCLock bits for each client node in a given group of can be represented as a series of bits in a format analogous to binary AAM format 830. In an ACM that contains control bits, the control bits are preferably ordered according to the numbering of the client nodes' MAC_IDs. Thus, when receiving an ACM containing control bits, a client node will know where within the ACM to find its control bits.
  • In cases where all of the client nodes in a given group are to be transmitted identical control bits, these bits may represented as a single set of control bits in an ACM. All client nodes that receive such an ACM will preferably retrieve the same control bits from the ACM.
  • Furthermore, the AAM and ACM techniques described herein can operate independently of, or in conjunction with, one another. In other words, for a given group of client nodes, an access node may transmit (1) an AAM, (2) an ACM, (3) both an AAM and an ACM, or (4) neither an AAM nor an ACM.
  • Exemplary embodiments have been described above. Those skilled in the art will understand, however, that changes and modifications may be made to these embodiments without departing from the true scope and spirit of the invention, which is defined by the claims.

Claims (24)

  1. 1. A method for aggregated acknowledgement of received packets in a communication system, wherein the communication system includes an access node and a plurality of client nodes, wherein each client node is distinguished by a client node identifier that is unique within the plurality of client nodes, the method comprising:
    maintaining a division of the plurality of client nodes into groups based on each client node's unique identifier;
    receiving at the access node a packet from each of the client nodes in a given group, wherein all of the packets from the client nodes in the given group are received within a given time period; and
    responsive to the access node receiving the packets from the client nodes in the given group, the access node transmitting an aggregated acknowledgement message (AAM) to all client nodes in the given group, wherein the AAM contains acknowledgement data for each packet received from the client nodes in the group.
  2. 2. The method of claim 1, wherein the AAM comprises:
    a preamble indicating that the AAM contains aggregated acknowledgements;
    a group identifier indicating the given group of client nodes to which the acknowledgements relate; and
    a series of acknowledgements, each acknowledging a packet from one of the client nodes within the given group.
  3. 3. The method of claim 2, wherein the client nodes in the given group are distinguished by unique client node identifiers that are sequentially numbered.
  4. 4. The method of claim 3, wherein the series of acknowledgements is ordered according to the sequentially numbered unique client node identifiers of the client nodes in the given group, whereby each client node can determine its respective acknowledgement based upon its unique client node identifier.
  5. 5. The method of claim 3, further comprising:
    a client node in the given group receiving the AAM; and
    the client node in the given group locating the client node's respective acknowledgement based upon the client node's unique client node identifier.
  6. 6. The method of claim 3, wherein the unique client node identifiers are medium access control identifiers (MAC_IDs).
  7. 7. The method of claim 6, wherein the group identifiers of each group of client nodes are numbered sequentially based on the MAC_IDs of the client nodes within each group, and the AAM designates a group by indicating the group identifier of the group.
  8. 8. The method of claim 1, wherein the communication system is a wireless network, the client nodes are wireless communication devices, and the access node is a component of a radio access network.
  9. 9. The method of claim 8, wherein the communication system operates in accordance with Code Division Multiple Access (CDMA), wherein the AAM is transmitted in within a phase of a modulation cycle, and wherein the AAM is directed to more than one client node by not performing CDMA spreading procedures on the AAM.
  10. 10. The method of claim 9, wherein the unique client node identifiers are MAC_IDs, and wherein the AAM further contains a series of control bits, including CDMA reverse power control (RPC) bits and CDMA data request channel lock (DRCLock) bits, wherein the series of control bits is ordered according to the MAC_IDs of the client nodes in the given group, whereby each client node can determine its respective control bits based upon the client node's MAC_ID.
  11. 11. The method of claim 1, wherein the client nodes transmit packets in accordance with a hybrid automatic repeat request protocol and the access node transmits acknowledgement messages in accordance with a hybrid automatic repeat request protocol.
  12. 12. A communication system supporting aggregated acknowledgement of received packets, the system comprising:
    a plurality of client nodes, wherein each client node is distinguished by a client node identifier that is unique within the plurality of client nodes, and wherein each client node is assigned to a group based on its unique client node identifier;
    an access node, storing data representing the assignment of the client nodes to the groups, capable of executing the steps of:
    receiving a packet from each client node in a given group;
    determining that all of the packets received from the client nodes were received within a given time period; and
    responsively, transmitting an aggregated acknowledgement message (AAM), wherein the AAM contains acknowledgement data for each packet received from the client nodes within the given time period.
  13. 13. The communication system of claim 12, wherein the AAM comprises:
    a preamble indicating that the AAM contains aggregated acknowledgements;
    a group identifier indicating the given group of client nodes to which the acknowledgements relate; and
    a series of acknowledgements, each acknowledging a packet from one of the client nodes within the given group.
  14. 14. The communication system of claim 13, wherein the client nodes in the given group are distinguished by unique client node identifiers that are sequentially numbered, and wherein the series of acknowledgements is ordered according to the sequentially numbered unique client node identifiers of the client nodes in the given group, whereby each client node can determine its respective acknowledgement based upon its unique client node identifier.
  15. 15. The communication system of claim 14, wherein the unique client node identifiers are medium access control identifiers (MAC_IDs), and wherein the groups of client nodes are numbered sequentially based on the MAC_IDs of the client nodes within each group, and the AAM designates a group by indicating the number of the group.
  16. 16. The communication system of claim 12, wherein the communication system operates in accordance with Code Division Multiple Access (CDMA), wherein the AAM is transmitted in within a phase of a modulation cycle, and wherein the AAM is directed to more than one client node by not performing CDMA spreading procedures on the AAM.
  17. 17. An method for supporting aggregated acknowledgement of received packets at an access node of a communication system, the method comprising:
    assigning each client node of a plurality of client nodes a client node identifier that is unique within the plurality of client nodes;
    placing each client node of the plurality of client nodes into a group based on its unique client node identifier;
    receiving a plurality of packets from at least two of the plurality of client nodes within a given time period;
    determining, for a given group of client nodes, if packets were received from all of the client nodes in the given group;
    if packets were received from all of the client nodes in the given group, then transmitting an aggregated acknowledgement message (AAM) to the client nodes in the given group, wherein the AAM contains acknowledgement data relating to the packets transmitted by each of the client nodes in the given group; and
    if packets were not received from all of the client nodes in the given group, then transmitting individual acknowledgement messages to each client node in the given group from which a packet was received.
  18. 18. The method of claim 17, wherein the AAM comprises:
    a preamble indicating that the AAM contains aggregated acknowledgements;
    an group identifier indicating the given group of client nodes to which the acknowledgements relate; and
    a series of acknowledgements, each acknowledging a packet from one of the client nodes within the given group.
  19. 19. The method of claim 18, wherein the client nodes in the given group are distinguished by unique client node identifiers that are sequentially numbered, and wherein the series of acknowledgements is ordered according to the sequentially numbered unique client node identifiers of the client nodes in the given group, whereby each client node can determine its respective acknowledgement based upon its unique client node identifier.
  20. 20. The method of claim 19, wherein the unique client node identifiers are medium access control identifiers (MAC_IDs), and wherein the groups of client nodes are numbered sequentially based on the MAC_IDs of the client nodes within each group, and the AAM designates a group by indicating the group identifier of the group.
  21. 21. The method of claim 17, wherein the communication system operates in accordance with Code Division Multiple Access (CDMA), wherein the AAM is transmitted in within a phase of a modulation cycle, and wherein the AAM is directed to more than one client node by not performing CDMA spreading procedures on the AAM.
  22. 22. A method for supporting transmission of an aggregated control message (ACM) from an access node of a communication system, the method comprising:
    assigning each client node of a plurality of client nodes a client node identifier that is unique within the plurality of client nodes;
    placing each client node of the plurality of client nodes into a group based on its unique client node identifier, wherein the client nodes in each group are distinguished by unique client node identifiers that are sequentially numbered;
    determining, for a given group of client nodes, if the access node is to transmit a single ACM to the clients in a given group;
    if the determination is that the access node is to transmit a single ACM to the clients in the given group, then transmitting an ACM to the client nodes in the given group, wherein the ACM contains control bits for the client nodes in the given group; and
    if the determination is that the access node is not to transmit identical control information to each client node in the given group, then transmitting individual control messages to each client node in the given group.
  23. 23. The method of claim 22, wherein (i) the unique client node identifiers are medium access control identifiers (MAC_IDs), (ii) the groups of client nodes are numbered sequentially based on the MAC_IDs of the client nodes within each group, and the ACM designates a given group by indicating the group identifier of the given group, (iii) the communication system operates in accordance with Code Division Multiple Access (CDMA), wherein the ACM is transmitted in within a phase of a modulation cycle, and (iv) the ACM is directed to more than one client node by not performing CDMA spreading procedures on the ACM, and wherein the ACM comprises:
    a preamble indicating that the ACM contains aggregated control bits, wherein the control bits are distinct for each client node in the given group;
    a group identifier indicating the given group of client nodes to which the control bits relate; and
    a series of control bits, including CDMA reverse power control (RPC) bits and CDMA data request channel lock (DRCLock) bits, wherein the series of control bits is ordered according to the sequentially numbered MAC_IDs of the client nodes in the given group, whereby each client node can determine its respective control bits based upon the client node's MAC_ID.
  24. 24. The method of claim 22, wherein (i) the unique client node identifiers are medium access control identifiers (MAC_IDs), (ii) the groups of client nodes are numbered sequentially based on the MAC_IDs of the client nodes within each group, and the ACM designates a given group by indicating the group identifier of the given group, (iii) the communication system operates in accordance with Code Division Multiple Access (CDMA), wherein the ACM is transmitted in within a phase of a modulation cycle, and (iv) the ACM is directed to more than one client node by not performing CDMA spreading procedures on the ACM, the method further comprising:
    determining that the control information consists of the same set of bits for each client node in the given group, and responsively generating an ACM that includes:
    a preamble indicating that the ACM contains aggregated control bits, wherein the control bits are the same for all client nodes in the given group;
    a group identifier indicating the given group of client nodes to which the control bits relate; and
    a single set of control bits, including CDMA reverse power control (RPC) bits and CDMA data request channel lock (DRCLock) bits.
US12146887 2008-06-26 2008-06-26 Method and System for Aggregating Messages Pending US20090327443A1 (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
US12146887 US20090327443A1 (en) 2008-06-26 2008-06-26 Method and System for Aggregating Messages

Applications Claiming Priority (4)

Application Number Priority Date Filing Date Title
US12146887 US20090327443A1 (en) 2008-06-26 2008-06-26 Method and System for Aggregating Messages
PCT/US2009/045453 WO2009158106A3 (en) 2008-06-26 2009-05-28 Method and system for aggregating messages
CA 2728323 CA2728323C (en) 2008-06-26 2009-05-28 Method and system for aggregating messages
US15204552 US9948428B2 (en) 2008-06-26 2016-07-07 Method and system for aggregating messages

Related Child Applications (1)

Application Number Title Priority Date Filing Date
US15204552 Continuation US9948428B2 (en) 2008-06-26 2016-07-07 Method and system for aggregating messages

Publications (1)

Publication Number Publication Date
US20090327443A1 true true US20090327443A1 (en) 2009-12-31

Family

ID=41057367

Family Applications (2)

Application Number Title Priority Date Filing Date
US12146887 Pending US20090327443A1 (en) 2008-06-26 2008-06-26 Method and System for Aggregating Messages
US15204552 Active 2028-10-07 US9948428B2 (en) 2008-06-26 2016-07-07 Method and system for aggregating messages

Family Applications After (1)

Application Number Title Priority Date Filing Date
US15204552 Active 2028-10-07 US9948428B2 (en) 2008-06-26 2016-07-07 Method and system for aggregating messages

Country Status (3)

Country Link
US (2) US20090327443A1 (en)
CA (1) CA2728323C (en)
WO (1) WO2009158106A3 (en)

Cited By (13)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7978626B1 (en) * 2009-01-13 2011-07-12 Sprint Spectrum L.P. Method and system for adaptive hybrid automatic repeat request protocols based on network conditions
US20110194558A1 (en) * 2010-02-11 2011-08-11 Microsoft Corporation Reliable broadcast in a federation of nodes
US20110307694A1 (en) * 2010-06-10 2011-12-15 Ioannis Broustis Secure Registration of Group of Clients Using Single Registration Procedure
US8369337B1 (en) 2009-11-05 2013-02-05 Sprint Spectrum L.P. Methods and devices for assigning a wireless communication device to a wireless coverage area based on early termination gain
US20130235781A1 (en) * 2011-09-02 2013-09-12 Qualcomm Incorporated Systems and methods for acknowledging communications from a plurality of devices
US9071431B1 (en) * 2013-09-30 2015-06-30 Sprint Spectrum L.P. Dynamic provision of hybrid-ARQ repetition factor based on subscription service class
US20160134399A1 (en) * 2014-11-10 2016-05-12 Huawei Technologies Co., Ltd. System and Method for Low-Payload Acknowledgment
US9445344B1 (en) * 2014-07-22 2016-09-13 Sprint Spectrum L.P. Preferentially assigning data slots subject to bundled acknowledgments to devices that support carrier aggregation
US9473973B1 (en) 2014-05-19 2016-10-18 Sprint Spectrum L.P. Reducing transmission rates in data slots subject to bundled acknowledgments
US9531504B1 (en) 2014-03-27 2016-12-27 Sprint Spectrum L.P. Bundling acknowledgments based on signal quality
US9531505B1 (en) 2014-06-20 2016-12-27 Sprint Spectrum L.P. Determining an amount of hybrid ARQ transmissions based on a series of acknowledgments
US9609651B1 (en) 2015-01-08 2017-03-28 Sprint Spectrum L.P. Exchanging uplink and downlink carrier frequencies
US10021686B1 (en) 2015-10-19 2018-07-10 Sprint Spectrum L.P. Scheduling traffic based on acknowledgment bundling

Families Citing this family (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP2405624A1 (en) * 2010-07-09 2012-01-11 Thomson Licensing Method for operating a remote procedure call handler in a client and a server and computer system comprising the same.
US20130170430A1 (en) * 2011-12-28 2013-07-04 Qualcomm Incorporated Method and apparatus for acknowledgement including a group identifier

Citations (33)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US4766534A (en) * 1986-10-16 1988-08-23 American Telephone And Telegraph Company, At&T Bell Laboratories Parallel processing network and method
US5374952A (en) * 1993-06-03 1994-12-20 Target Technologies, Inc. Videoconferencing system
US6128283A (en) * 1997-12-03 2000-10-03 Nortel Networks Corporation Method and apparatus for data transmission using a positive group acknowledgement protocol
US20010012785A1 (en) * 1999-03-12 2001-08-09 Esteves Eduardo A.S. Methods and apparatus for power allocation on a reverse link power control channel of a communication system
US20020137500A1 (en) * 2001-03-22 2002-09-26 Brooking Michael A. Method and system for providing message services in a communication system
US20030037132A1 (en) * 2001-08-20 2003-02-20 Abdollahi Mahshid Ellie Controlling multiple nodes using SNMP
US20030041141A1 (en) * 2001-01-22 2003-02-27 Abdelaziz Mohamed M. Peer-to-peer presence detection
US6560458B1 (en) * 1998-06-03 2003-05-06 Nokia Corporation Method for identifying a call in a telecommunications system
US6647002B1 (en) * 1998-08-18 2003-11-11 Fujitsu Limited System and method for code division multiple access communication, and base station and terminal apparatus for same system
US20040047348A1 (en) * 2002-02-04 2004-03-11 O'neill Alan Methods and apparatus for aggregating MIP and AAA messages
US20040064693A1 (en) * 2002-09-26 2004-04-01 Pabla Kuldipsingh A. Distributed indexing of identity information in a peer-to-peer network
US20040088348A1 (en) * 2002-10-31 2004-05-06 Yeager William J. Managing distribution of content using mobile agents in peer-topeer networks
US20040179475A1 (en) * 2003-03-13 2004-09-16 Samsung Electronics Co., Ltd. Apparatus and method for transmitting packets in a communication system
US20040205105A1 (en) * 2003-04-11 2004-10-14 Telefonaktiebolaget Lm Ericsson Contention-based forwarding with integrated multi-user detection capability
US20040233918A1 (en) * 2003-04-11 2004-11-25 Telefonaktiebolaget Lm Ericsson Multi-user diversity forwarding
US20050058151A1 (en) * 2003-06-30 2005-03-17 Chihsiang Yeh Method of interference management for interference/collision avoidance and spatial reuse enhancement
US20050111452A1 (en) * 2003-11-25 2005-05-26 Cisco Technology, Inc., A California Corporation Reliable multicast communication
US20050165949A1 (en) * 2004-01-28 2005-07-28 Teague Edward H. Method and apparatus of using a single channel to provide acknowledgement and assignment messages
US6925132B2 (en) * 2001-12-14 2005-08-02 Electronics And Telecommunications Research Institute Method for detecting and correcting amplitude and phase imbalances between I and Q components in quadrature demodulator
US20050232231A1 (en) * 2003-05-16 2005-10-20 Masatake Miyabe Path setting method and communication apparatus in communication network performing communications through a plurality of layers
US7002993B1 (en) * 2000-08-18 2006-02-21 Juniper Networks, Inc. Method and apparatus providing media aggregation in a packet-switched network
US20060136614A1 (en) * 2004-07-30 2006-06-22 Nokia Corporation System and method for variable length aggregate acknowledgements in a shared resource network
US20060179356A1 (en) * 2005-02-09 2006-08-10 International Business Machines Corporation Method to use fabric initialization to test functionality of all inter-chip paths between processors in system
US7096494B1 (en) * 1998-05-05 2006-08-22 Chen Jay C Cryptographic system and method for electronic transactions
US20060252443A1 (en) * 2005-04-25 2006-11-09 Interdigital Technology Corporation Method and system for efficient addressing and power savings in wireless systems
US20070004347A1 (en) * 2005-06-29 2007-01-04 Lakshmipathi Sondur Wireless communication device and method for coordinated channel access with reduced latency in a wireless network
US20070106804A1 (en) * 2005-11-10 2007-05-10 Iona Technologies Inc. Method and system for using message stamps for efficient data exchange
US20070110095A1 (en) * 2005-11-15 2007-05-17 Attar Rashid A Method and system for decoding
US20070214400A1 (en) * 2006-03-09 2007-09-13 Motorola, Inc. Hybrid approach for data transmission using a combination of single-user and multi-user packets
US20070277074A1 (en) * 2003-12-29 2007-11-29 Kun-Min Yeo Sonar Collision Avoidance System
US20070282911A1 (en) * 2006-04-13 2007-12-06 Tekelec Methods, systems, and computer program products for providing internet protocol multimedia subsystem (IMS) registration services for non-IMS devices
US20070280107A1 (en) * 2004-07-23 2007-12-06 Reiner Ludwig Data Unit Sender Control Method
US20090016265A1 (en) * 2007-07-13 2009-01-15 Rintaro Katayama Radio communication system, mobile station, and radio base station

Family Cites Families (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7720903B1 (en) * 2000-08-31 2010-05-18 Intel Corporation Client messaging in multicast networks
WO2007035048A3 (en) 2005-09-21 2007-06-21 Seok Woo Lee A method of enabling a combined data rate control lock channel in a wireless communication system
US7788566B2 (en) 2006-01-18 2010-08-31 Alcatel-Lucent Usa Inc. System and method for dynamically adjusting hybrid ARQ transmissions

Patent Citations (33)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US4766534A (en) * 1986-10-16 1988-08-23 American Telephone And Telegraph Company, At&T Bell Laboratories Parallel processing network and method
US5374952A (en) * 1993-06-03 1994-12-20 Target Technologies, Inc. Videoconferencing system
US6128283A (en) * 1997-12-03 2000-10-03 Nortel Networks Corporation Method and apparatus for data transmission using a positive group acknowledgement protocol
US7096494B1 (en) * 1998-05-05 2006-08-22 Chen Jay C Cryptographic system and method for electronic transactions
US6560458B1 (en) * 1998-06-03 2003-05-06 Nokia Corporation Method for identifying a call in a telecommunications system
US6647002B1 (en) * 1998-08-18 2003-11-11 Fujitsu Limited System and method for code division multiple access communication, and base station and terminal apparatus for same system
US20010012785A1 (en) * 1999-03-12 2001-08-09 Esteves Eduardo A.S. Methods and apparatus for power allocation on a reverse link power control channel of a communication system
US7002993B1 (en) * 2000-08-18 2006-02-21 Juniper Networks, Inc. Method and apparatus providing media aggregation in a packet-switched network
US20030041141A1 (en) * 2001-01-22 2003-02-27 Abdelaziz Mohamed M. Peer-to-peer presence detection
US20020137500A1 (en) * 2001-03-22 2002-09-26 Brooking Michael A. Method and system for providing message services in a communication system
US20030037132A1 (en) * 2001-08-20 2003-02-20 Abdollahi Mahshid Ellie Controlling multiple nodes using SNMP
US6925132B2 (en) * 2001-12-14 2005-08-02 Electronics And Telecommunications Research Institute Method for detecting and correcting amplitude and phase imbalances between I and Q components in quadrature demodulator
US20040047348A1 (en) * 2002-02-04 2004-03-11 O'neill Alan Methods and apparatus for aggregating MIP and AAA messages
US20040064693A1 (en) * 2002-09-26 2004-04-01 Pabla Kuldipsingh A. Distributed indexing of identity information in a peer-to-peer network
US20040088348A1 (en) * 2002-10-31 2004-05-06 Yeager William J. Managing distribution of content using mobile agents in peer-topeer networks
US20040179475A1 (en) * 2003-03-13 2004-09-16 Samsung Electronics Co., Ltd. Apparatus and method for transmitting packets in a communication system
US20040233918A1 (en) * 2003-04-11 2004-11-25 Telefonaktiebolaget Lm Ericsson Multi-user diversity forwarding
US20040205105A1 (en) * 2003-04-11 2004-10-14 Telefonaktiebolaget Lm Ericsson Contention-based forwarding with integrated multi-user detection capability
US20050232231A1 (en) * 2003-05-16 2005-10-20 Masatake Miyabe Path setting method and communication apparatus in communication network performing communications through a plurality of layers
US20050058151A1 (en) * 2003-06-30 2005-03-17 Chihsiang Yeh Method of interference management for interference/collision avoidance and spatial reuse enhancement
US20050111452A1 (en) * 2003-11-25 2005-05-26 Cisco Technology, Inc., A California Corporation Reliable multicast communication
US20070277074A1 (en) * 2003-12-29 2007-11-29 Kun-Min Yeo Sonar Collision Avoidance System
US20050165949A1 (en) * 2004-01-28 2005-07-28 Teague Edward H. Method and apparatus of using a single channel to provide acknowledgement and assignment messages
US20070280107A1 (en) * 2004-07-23 2007-12-06 Reiner Ludwig Data Unit Sender Control Method
US20060136614A1 (en) * 2004-07-30 2006-06-22 Nokia Corporation System and method for variable length aggregate acknowledgements in a shared resource network
US20060179356A1 (en) * 2005-02-09 2006-08-10 International Business Machines Corporation Method to use fabric initialization to test functionality of all inter-chip paths between processors in system
US20060252443A1 (en) * 2005-04-25 2006-11-09 Interdigital Technology Corporation Method and system for efficient addressing and power savings in wireless systems
US20070004347A1 (en) * 2005-06-29 2007-01-04 Lakshmipathi Sondur Wireless communication device and method for coordinated channel access with reduced latency in a wireless network
US20070106804A1 (en) * 2005-11-10 2007-05-10 Iona Technologies Inc. Method and system for using message stamps for efficient data exchange
US20070110095A1 (en) * 2005-11-15 2007-05-17 Attar Rashid A Method and system for decoding
US20070214400A1 (en) * 2006-03-09 2007-09-13 Motorola, Inc. Hybrid approach for data transmission using a combination of single-user and multi-user packets
US20070282911A1 (en) * 2006-04-13 2007-12-06 Tekelec Methods, systems, and computer program products for providing internet protocol multimedia subsystem (IMS) registration services for non-IMS devices
US20090016265A1 (en) * 2007-07-13 2009-01-15 Rintaro Katayama Radio communication system, mobile station, and radio base station

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
The Design of Xpand: A Group Communication System for Wide Area Networks; Anker et al. 2000, The Hebrew University of Jerusalem, Institute of Computer Science *

Cited By (20)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7978626B1 (en) * 2009-01-13 2011-07-12 Sprint Spectrum L.P. Method and system for adaptive hybrid automatic repeat request protocols based on network conditions
US8369337B1 (en) 2009-11-05 2013-02-05 Sprint Spectrum L.P. Methods and devices for assigning a wireless communication device to a wireless coverage area based on early termination gain
US9001794B2 (en) 2009-11-05 2015-04-07 Sprint Spectrum L.P. Methods and devices for assigning a wireless communication device to a wireless coverage area based on early termination gain
US20110194558A1 (en) * 2010-02-11 2011-08-11 Microsoft Corporation Reliable broadcast in a federation of nodes
US9832104B2 (en) * 2010-02-11 2017-11-28 Microsoft Technology Licensing, Llc Reliable broadcast in a federation of nodes
US20110307694A1 (en) * 2010-06-10 2011-12-15 Ioannis Broustis Secure Registration of Group of Clients Using Single Registration Procedure
KR101497785B1 (en) * 2010-06-10 2015-03-02 알까뗄 루슨트 Secure registration of group of clients using single registration procedure
US9450928B2 (en) * 2010-06-10 2016-09-20 Gemalto Sa Secure registration of group of clients using single registration procedure
US20130235781A1 (en) * 2011-09-02 2013-09-12 Qualcomm Incorporated Systems and methods for acknowledging communications from a plurality of devices
US9100177B2 (en) * 2011-09-02 2015-08-04 Qualcomm Incorporated Systems and methods for acknowledging communications from a plurality of devices
US9578640B1 (en) 2013-09-30 2017-02-21 Sprint Spectrum L.P. Dynamic provision of hybrid-ARQ repetition factor based on subscription service class
US9071431B1 (en) * 2013-09-30 2015-06-30 Sprint Spectrum L.P. Dynamic provision of hybrid-ARQ repetition factor based on subscription service class
US9531504B1 (en) 2014-03-27 2016-12-27 Sprint Spectrum L.P. Bundling acknowledgments based on signal quality
US9473973B1 (en) 2014-05-19 2016-10-18 Sprint Spectrum L.P. Reducing transmission rates in data slots subject to bundled acknowledgments
US9531505B1 (en) 2014-06-20 2016-12-27 Sprint Spectrum L.P. Determining an amount of hybrid ARQ transmissions based on a series of acknowledgments
US9445344B1 (en) * 2014-07-22 2016-09-13 Sprint Spectrum L.P. Preferentially assigning data slots subject to bundled acknowledgments to devices that support carrier aggregation
US20160134399A1 (en) * 2014-11-10 2016-05-12 Huawei Technologies Co., Ltd. System and Method for Low-Payload Acknowledgment
US9906342B2 (en) * 2014-11-10 2018-02-27 Huawei Technologies Co., Ltd. System and method for low-payload acknowledgment
US9609651B1 (en) 2015-01-08 2017-03-28 Sprint Spectrum L.P. Exchanging uplink and downlink carrier frequencies
US10021686B1 (en) 2015-10-19 2018-07-10 Sprint Spectrum L.P. Scheduling traffic based on acknowledgment bundling

Also Published As

Publication number Publication date Type
US9948428B2 (en) 2018-04-17 grant
US20160359588A1 (en) 2016-12-08 application
WO2009158106A3 (en) 2010-03-18 application
CA2728323C (en) 2014-11-18 grant
CA2728323A1 (en) 2009-12-30 application
WO2009158106A2 (en) 2009-12-30 application

Similar Documents

Publication Publication Date Title
US20070211616A1 (en) Resource allocation for shared signaling channels
US20040009786A1 (en) Method and apparatus for reducing uplink and downlink transmission errors in a third generation cellular system
US20080049692A1 (en) Apparatus and Method For Resource Allocation and Data Transmission Using Heterogeneous Modulation Formats in a Wireless Packet Communication System
US20030153276A1 (en) Transport block set transmission using hybrid automatic repeat request
US20090185638A1 (en) Radio transmission device and radio transmission method
US20060251015A1 (en) System and method for dynamic allocation of ARQ feedback in a multi-carrier wireless network
US20090077444A1 (en) Method and apparatus for providing acknowledgement signaling to support an error control mechanism
US20080253326A1 (en) Synchronous adaptive harq
US20090245421A1 (en) Scrambling and modulation to constrain the constellation size of ack/nak transmission on the data channel
US20070259665A1 (en) Error detection and retransmission methods and devices for communication systems
US7260761B2 (en) Method and device for transferring data wherein a bit rate adaptation model is signaled between the transmitter and the receiver
US6954448B2 (en) Alternate channel for carrying selected message types
US20100131814A1 (en) Method for operation of synchronous HARQ in a wireless communication system
US20090252143A1 (en) Methods and apparatus for delayed block acknowledgement in a wireless local area network (wlan)
US20040228320A1 (en) Efficient automatic repeat request methods and apparatus
US7178089B1 (en) Two stage date packet processing scheme
US6658005B2 (en) Hybrid ARQ method for packet data transmission
US20050207345A1 (en) Hybrid ARQ schemes for a multi-carrier communications system
US20050122898A1 (en) HARQ method for guaranteeing QoS in a wireless communication system
US20040141525A1 (en) Power boosting in a wireless communication system
US20100115360A1 (en) Methods of transmitting data using a plurality of harq process channesl sequentially
US20110044223A1 (en) Mbms data transmission and receiving in packet based on cellular system
US20090313516A1 (en) Enhanced hybrid automatic repeat request for long term evolution
CN101689984A (en) Method for effectively transmitting control signal in wireless communication system
US20090323564A1 (en) Method for operation of synchronous harq in a wireless communication system

Legal Events

Date Code Title Description
AS Assignment

Owner name: SPRINT SPECTRUM, L.P., KANSAS

Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:PAWAR, HEMANTH BALAJI;SRINIVAS, SHILPA KOWDLEY;GOYAL, ANOOP;AND OTHERS;REEL/FRAME:021156/0785;SIGNING DATES FROM 20080618 TO 20080625