Methods and devices for addressing device to device communications

• US 9,826,395 B2
• Filed: 03/13/2015
• Issued: 11/21/2017
• Est. Priority Date: 03/21/2014
• Status: Active Grant

• Current Assignee: Telefonaktiebolaget LM Ericsson
• Original Assignee: Telefonaktiebolaget LM Ericsson
• Inventors: Wallentin, Pontus, Gunnarsson, Fredrik
• Primary Examiner(s): SEFCHECK, GREGORY B
• Application Number:
  US14/441,597
• Publication Number:
  US 20160050558A1
• Time in Patent Office: 984 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 2101/672 Short addresses
• CPC Class Codes: H04L 61/5038 for local use, e.g. in LAN or USB networks, or in a controller area network [CAN]
• CPC Class Codes: H04L 61/5069 for group communication, multicast communication or broadcast communication
• CPC Class Codes: H04W 8/005 Discovery of network devices, e.g. terminals
• CPC Class Codes: H04W 8/26 Network addressing or numbering for mobility support

Abstract

A method implemented in a first user equipment (UE) includes generating a first intermediate address. The method further includes transmitting a data packet using the first intermediate address by (i) applying a first address mechanism to a first part of the first intermediate address, and (ii) applying a second address mechanism to a second part of the first intermediate address.

Claims

1. A method implemented in a first user equipment (UE), the method comprising:

generating a first intermediate address from a first identifier by;

(i) applying a first function to a first part of the first identifier, and

(ii) applying a second function to (a) a second part of the first identifier and (b) the output of the first function applied to the first part of the first identifier,

wherein the first function is a hashing function, the second function is a scrambling function, the first intermediate address is the output of the second function, and a number of bits included in the first intermediate address is less than a number of bits included in the first identifier; and

transmitting a data packet using the first intermediate address by;

(i) applying a first address mechanism to a first part of the first intermediate address, and

(ii) applying a second address mechanism to a second part of the first intermediate address.

2. The method according to claim 1, wherein the first identifier is a Proximity-based services (ProSe) UE ID associated with the first UE.

3. The method according to claim 2, wherein the output of the hashing function reduces a number of bits included in the first part of the identifier associated with the first UE.

4. The method according to claim 1, wherein the first part of the identifier associated with the first UE is a network ID.

5. The method according to claim 1, wherein the first intermediate address is an intermediate source address.

6. The method according to claim 5, wherein the first address mechanism is a Layer 1 address mechanism that uses the first part of the intermediate source address as a Layer 1 source address, and the second address mechanism is a Layer 2 address mechanism that uses the second part of the intermediate source address as a Layer 2 source address.

7. The method according to claim 1, further comprising:

generating a second intermediate address; and

transmitting the data packet using the second intermediate address by;

(i) applying a third address mechanism to a first part of the first intermediate address, and

(ii) applying a fourth address mechanism to a second part of the first intermediate address.

8. The method according to claim 7, wherein generating the second intermediate address includes:

applying a first function to a first part of a second identifier, and

applying a second function to (i) a second part of the second identifier and (ii) the output of the first function applied to the first part of the second identifier,

wherein the second intermediate address is the output of the second function, and a number of bits included in the second intermediate address is less than a number of bits included in the second identifier.

9. The method according to claim 8, wherein the first function is a hashing function, and the second function is a scrambling function.

10. The method according to claim 9, wherein the second identifier is a Proximity-based services (ProSe) UE ID associated with a second UE to which the first UE transmits the data packet.

11. The method according to claim 9, wherein the second identifier is a Proximity-based services (ProSe) Group ID associated with a plurality of UEs to which the first UE transmits the data packet.

12. The method according to claim 7, wherein the second intermediate address is an intermediate destination address.

13. The method according to claim 7, wherein the first address mechanism is a Layer 1 address mechanism that uses the first part of the intermediate destination address as a Layer 1 destination address, and the fourth address mechanism is a Layer 2 address mechanism that uses the second part of the intermediate destination address as a Layer 2 destination address.

14. The method according to claim 1, wherein the first intermediate address is generated using a random number having a predetermined number of bits.

15. The method of claim 1, wherein the first function is not applied to the second part of the first identifier.

16. A first user equipment (UE), comprising:

a processor; and

a computer readable medium coupled to the processor, said computer readable medium containing instructions executable by the processor, whereby the first UE is operative to;

generate a first intermediate address from a first identifier by;

(i) applying a first function to a first part of a first identifier, and

(ii) applying a second function to (a) a second part of the first identifier and (b) the output of the first function applied to the first part of the first identifier,

wherein the first function is a hashing function, the second function is a scrambling function, the first intermediate address is the output of the second function, and a number of bits included in the first intermediate address is less than a number of bits included in the first identifier, and transmit a data packet using the first intermediate address by;

(i) applying a first address mechanism to a first part of the first intermediate address, and

(ii) applying a second address mechanism to a second part of the first intermediate address.

17. The first UE according to claim 16, wherein the first function is a hashing function, the second function is a scrambling function, and the first identifier is a Proximity-based services (ProSe) UE ID associated with the first UE.

18. The first UE according to claim 17, wherein the output of the hashing function reduces a number of bits included in the first part of the identifier associated with the first UE.

19. The first UE according to claim 16, wherein the first part of the identifier associated with the first UE is a network ID.

20. The first UE according to claim 16, wherein the first intermediate address is an intermediate source address.

21. The first UE according to claim 20, wherein the first address mechanism is a Layer 1 address mechanism that uses the first part of the intermediate source address as a Layer 1 source address, and the second address mechanism is a Layer 2 address mechanism that uses the second part of the intermediate source address as a Layer 2 source address.

22. The first UE according to claim 16, wherein the first UE is further operative to:

generate a second intermediate address; and

transmit the data packet using the second intermediate address by;

(i) applying a third address mechanism to a first part of the first intermediate address, and

(ii) applying a fourth address mechanism to a second part of the first intermediate address.

23. The first UE according to claim 22, wherein the first UE is further operative to generate the second intermediate address by:

applying a first function to a first part of a second identifier, and

applying a second function to (i) a second part of the second identifier and (ii) the output of the first function applied to the first part of the second identifier,

wherein the second intermediate address is the output of the second function, and a number of bits included in the second intermediate address is less than a number of bits included in the second identifier.

24. The first UE according to claim 23, wherein the first function is a hashing function, and the second function is a scrambling function.

25. The first UE according to claim 24, wherein the second identifier is a Proximity-based services (ProSe) UE ID associated with a second UE to which the first UE transmits the data packet.

26. The first UE according to claim 24, wherein the second identifier is a Proximity-based services (ProSe) Group ID associated with a plurality of UEs to which the first UE transmits the data packet.

27. The first UE according to claim 22, wherein the second intermediate address is an intermediate destination address.

28. The first UE according to claim 20, wherein the first address mechanism is a Layer 1 address mechanism that uses the first part of the intermediate destination address as a Layer 1 destination address, and the fourth address mechanism is a Layer 2 address mechanism that uses the second part of the intermediate destination address as a Layer 2 destination address.

29. The first UE according to claim 16, wherein the first intermediate address is generated using a random number having a predetermined number of bits.