Supporting packet query-response transactions at lower layer

• US 10,491,512 B2
• Filed: 05/20/2015
• Issued: 11/26/2019
• Est. Priority Date: 05/20/2015
• Status: Active Grant

• Current Assignee: Qualcomm, Inc.
• Original Assignee: Qualcomm, Inc.
• Inventors: Yu, Yu-Ting, Park, Vincent Douglas, Wu, Zhibin
• Primary Examiner(s): Young, Steve R
• Application Number:
  US14/718,047
• Publication Number:
  US 20160344619A1
• Time in Patent Office: 1,651 Days
• Field of Search: None
• CPC Class Codes: H04L 2101/622 Layer-2 addresses, e.g. medium access control [MAC] addresses
• CPC Class Codes: H04L 45/245 Link aggregation, e.g. trunking
• CPC Class Codes: H04L 45/26 Route discovery packet
• CPC Class Codes: H04L 45/74 Address processing for routing
• CPC Class Codes: H04L 47/12 Avoiding congestion; Recovering from congestion
• CPC Class Codes: H04L 69/22 Parsing or analysis of headers
• CPC Class Codes: H04L 69/321 Interlayer communication protocols or service data unit [SDU] definitions; Interfaces between layers
• CPC Class Codes: H04W 74/08 Non-scheduled access, e.g. ALOHA hybrid access H04W74/02

Abstract

In an aspect of the disclosure, a method, a computer program product, and an apparatus are provided. The apparatus may be a first node. The first node receives a packet from a second node. The first node determines that the received packet is a query packet, the query packet including information indicating at least a transaction identifier. The first node determines a transaction type based on the information included in the query packet. The first node determines whether to transmit a response packet based on at least one of the transaction type or a transaction identifier at at least one of a PHY layer, a MAC layer, or a link layer. The first node transmits a response packet to the second node in response to determining to transmit the response.

Claims

1. A method of communication at a first node, comprising:

receiving a packet from a second node including type information indicating whether the received packet is a query packet or a response, and including a transaction identifier uniquely identifying an ongoing query-response transaction within a local neighborhood of the first and the second nodes;

determining that the received packet is a query packet based on a value set in a type field;

determining a transaction type of the ongoing query-response transaction based on the value set in the type field;

determining, based on the transaction type, that the query packet requests a response from any M nodes of a set of N targeted nodes wherein N is greater than or equal to M, and wherein the N targeted nodes include the first node;

determining whether to transmit or suppress a response packet based on the transaction type and the transaction identifier;

determining to suppress the response packet in response to determining that M response packets have been transmitted with the same transaction identifier by at least one other node of the N targeted nodes prior to the expiration of a wait timer in response to the query packet; and

transmitting the response packet to the second node in response to determining that M response packets have not yet been transmitted with the same transaction identifier by at least one other node prior to the expiration of the wait timer in response to the query packet, the response packet including the transaction identifier, wherein the size of a resource for the response packet transmitted by the first node is based on M.

2. The method of claim 1, wherein the determination whether to transmit the response packet is performed at at least one of a physical (PHY) layer, a media access control (MAC) layer, or a link layer.

3. The method of claim 1, wherein the query packet further includes an address of the first node and wherein the first node determines to transmit the response packet when the transaction type indicates the query packet requests a response from the node associated with the address.

4. The method of claim 1, wherein the query packet further includes an address associated with the N targeted nodes.

5. The method of claim 1, wherein M=N and the query packet requests a response from each of the N targeted nodes.

6. A method of communication at a first node, comprising:

receiving, at at least one of a physical (PHY) layer, a media access control (MAC) layer, or a link layer of the first node, a transaction type and data associated with the transaction type from an upper layer of the first node;

obtaining a transaction identifier for the data;

constructing, at the one of the PHY layer, the MAC layer, or the link layer, a query packet to include the transaction type, the data, a packet type, and the transaction identifier, wherein the packet type indicates that the query packet is a query, wherein the transaction type indicates that the query packet requests a response from any M nodes of a set of N targeted nodes wherein N is greater than or equal to M;

transmitting the query packet; and

determining whether M response packets have been received by the first node, wherein the first node requests an allocation of resources on a channel for transmission of the response packets, and wherein a size of the resources is based on the number of M response packets.

7. The method of claim 6, wherein the transaction identifier is obtained at the PHY layer, the MAC layer, or the link layer.

8. The method of claim 6, further comprising receiving at least one response packet in response to the query packet from at least one second node, each of the at least one response packet including the transaction identifier.

9. The method of claim 6, wherein M=N and the query packet requests a response from each of the N targeted nodes.

10. A method of communication at a first node, comprising:

receiving a query packet from a second node, wherein the query packet includes;

an indication of a first transaction with which the query packet is associated,

an indication that M response packets associated with the first transaction is requested by the second node, M being an integer greater than 0,

an indication of a time period allocated for transmitting the M response packets to the second node on a channel, the time period indicating a time duration for which the channel is reserved for transmitting the M response packets to the second node, and

an indication of at least one of a channel assignment mechanism or a contention mechanism to be used to allocate at least M time slots within the indicated time period;

obtaining a first time slot from the at least M time slots allocated in the indicated time period for accessing a channel in accordance with the indicated at least one of contention mechanism or channel assignment mechanism;

determining to suppress the response packet in response to determining that M response packets have been transmitted with the same transaction identifier by at least one other node prior to the expiration of the time duration in response to the query packet; and

transmitting, at the first time slot, a first response packet of the M response packets associated with the first transaction to the second node on the channel, wherein the size of a resource for the response packet transmitted by the first node is based on M.

11. The method of claim 10, wherein each of the M response packets include a respective distinguisher ID that distinguishes from the distinguisher IDs of the rest of the M response packets.

12. The method of claim 10, wherein the channel assignment mechanism is a spreading mechanism that spreads allocation of the at least M time slots, wherein the first time slot is obtained in accordance with the spreading mechanism.

13. The method of claim 10, wherein the first time slot is obtained in accordance with the contention mechanism through which the first node contends for a time slot of the at least M time slots with other nodes, wherein the method further comprises:

detecting transmission of a second response packet of the M response packets associated with the first transaction to the second node from another node; and

determining a time slot of the at least M time slots subsequent to the transmission of the second response packet in order to obtain the first time slot.

14. The method of claim 10, wherein the first time slot is obtained at a physical (PHY) layer, a media access control (MAC) layer, or a link layer.

15. The method of claim 10, further comprising determining that the channel is available in the first time slot.

16. An apparatus for communication, the apparatus being a first node, comprising:

a memory; and

at least one processor coupled to the memory and configured to;

receive a packet from a second node including type information indicating whether the received packet is a query packet or a response, and including a transaction identifier uniquely identifying an ongoing query-response transaction within a local neighborhood of the first and the second nodes;

determine that the received packet is a query packet based on a value set in a type field;

determine a transaction type of the ongoing query-response transaction based on the value set in the type field;

determine, based on the transaction type, that the query packet requests a response from any M nodes of a set of N targeted nodes wherein N is greater than or equal to M, and wherein the N targeted nodes include the first node;

determine whether to transmit or suppress a response packet based on the transaction type and the transaction identifier;

determine to suppress the response packet in response to determining that M response packets have been transmitted with the same transaction identifier by at least one other node prior to the expiration of a wait timer in response to the query packet; and

transmit the response packet to the second node in response to determining that M response packets have not yet been transmitted with the same transaction identifier by at least one other node prior to the expiration of the wait timer in response to the query packet, the response packet including the transaction identifier, wherein the size of a resource for the response packet transmitted by the first node is based on M.

17. The apparatus of claim 16, wherein the query packet further includes an address of the first node and wherein the at least one processor is further configured to determine to transmit the response packet when the transaction type indicates the query packet requests a response from the node associated with the address.

18. The apparatus of claim 16, wherein the query packet further includes an address associated with the N targeted nodes.

19. The apparatus of claim 16, wherein M=N and the query packet requests a response from each of the N targeted nodes.