Limiting rate of MAC address change in wireless modem

Patent metadata

Field	Value
Publication number	US-9654441-B2
Application number	US-201114238339-A
Country	US
Kind code	B2
Filing date	Aug 12, 2011
Priority date	Aug 12, 2011
Publication date	May 16, 2017
Grant date	May 16, 2017

Abstract

A method includes receiving a command to change a medium access control (MAC) address associated with a wireless local area network (WLAN) apparatus; and changing the medium access control address, without restarting a wireless modem of the apparatus, only if a restriction on an allowed rate of medium access control address changes is not violated. An apparatus that operates in accordance with the method is also described.

First claim

What is claimed is:

1. A method, comprising:
in a mobile communication device that comprises a wireless local area network apparatus and a host data processor, receiving a command to change a medium access control address associated with the wireless local area network apparatus; and
changing the medium access control address, without restarting a wireless local area network modem of the wireless local area network apparatus, only if a restriction on an allowed rate of medium access control address changes is not violated;
where the wireless local area network apparatus is comprised of a wireless local area network solution and the wireless local area network modem and,
where the command is generated by and received from the host data processor; and
where the command comprises a new medium access control address that is generated by the host data processor.

2. The method of claim 1 , where the allowed rate is an allowed mean rate.

3. The method as in claim 1 , where the restriction is implemented by executing a leaky bucket algorithm that adds a token at a rate set by a predetermined allowed mean time A between medium access control address changes and that extracts a token each time that the medium access control address is changed, and where an address change criterion is that there is at least one token available to be extracted.

4. The method of claim 1 , where the restriction is implemented by executing a simple moving average algorithm that stores the times of the last w medium access control address changes: X(k), X(k−1), X(k−w+1), where t is a current time at which the medium access control address change command is received and A is an allowed mean time between medium access control address changes, rejecting the medium access control address change command if (t−X(k−w+1))/w<A otherwise an address change criterion is deemed to be satisfied and changing the medium access control address, shifting the sequence X(k), X(k−1), , . . . , X(k−w+1), deleting the last item X(k−w+1) from the sequence, and setting X(k) to t.

5. The method of claim 1 , where the restriction is implemented by executing an exponential moving average algorithm to estimate the mean time M between medium access control address changes, where t is a current time at which the medium access control address change command is received and A is an allowed mean time between medium access control address changes, denoting by X the time in seconds of the last medium access control address change and by y a temporary variable, initializing M and X to values where M>X, computing a temporary estimate of M by: y=(1−α)M+α(t−X), where a weight αε(0, 1), rejecting the medium access control address change command if y<A otherwise an address change criterion is deemed to be satisfied and changing the medium access control address and setting X=t, M=y.

6. The method as in claim 1 , further comprising locking the medium access control address from being changed A seconds prior to a predetermined medium access control address change time, where A is a predetermined allowed mean time between medium access control address changes.

7. The method as in claim 1 , further comprising locking the medium access control address from being changed when some number of messages have been sent from the apparatus that is less than a message counter rollover number, where the message counter rolling over automatically triggers a medium access control address change.

8. The method as in claim 1 , where in response to receiving the command the wireless local area network apparatus sends a response to the host data processor to indicate one of a success or a failure to change the medium access control address to the new medium access control address.

9. The method as in claim 8 , where for a case that the response indicates a failure, the response further comprises a value of the allowed rate of medium access control address changes.

10. The method as in claim 9 , where the value of the allowed rate of medium access control address changes is equal to about one per second or greater.

11. An apparatus, comprising:
at least one data processor; and
at least one memory including computer program code, where the memory and computer program code are configured to, with the at least one processor, cause the apparatus to,
receive a command to change a medium access control address associated with a wireless local area network apparatus; and
change the medium access control address, without restarting a wireless local area network modem of the apparatus, only if a restriction on an allowed rate of medium access control address changes is not violated;
where the apparatus is embodied as a mobile communication device that comprises the wireless local area network apparatus and a host data processor,
where the wireless local area network apparatus is comprised of a wireless local area network solution and the wireless local area network modem, where the command is generated by and received from the host data processor, and
where the command comprises a new medium access control address that is generated by the host data processor.

12. The apparatus as in claim 11 , where the allowed rate is an allowed mean rate.

13. The apparatus as in claim 11 , where said at least one data processor in conjunction with the computer program code is configured to implement the restriction by executing a leaky bucket algorithm that adds a token at a rate set by a predetermined allowed mean time A between medium access control address changes and that extracts a token each time that the medium access control address is changed, and where an address change criterion is that there is at least one token available to be extracted.

14. The apparatus as in claim 11 , where said at least one data processor in conjunction with the computer program code is configured to implement the restriction by executing a simple moving average algorithm that stores the times of the last w medium access control address changes: X(k), X(k−1), . . . , X(k−w+1), where t is a current time at which the medium access control address change command is received and A is an allowed mean time between medium access control address changes, rejecting the medium access control address change command if (t−X(k−w+1))/w<A otherwise an address change criterion is deemed to be satisfied and changing the medium access control address, shifting the sequence X(k), X(k−1), , . . . , X(k−w+1), deleting the last item X(k−w+1) from the sequence, and setting X(k) to t.

15. The apparatus as in claim 11 , where said at least one data processor in conjunction with the computer program code is configured to implement the restriction by executing an exponential moving average algorithm to estimate the mean time M between medium access control address changes, where t is a current time at which the medium access control address change command is received and A is an allowed mean time between medium access control address changes, denoting by X the time in seconds of the last medium access control address change and by y a temporary variable, initializing M and X to values where M>X, computing a temporary estimate of M by: y=(1−α) M+α(t−X), where a weight αε(0, 1), rejecting the medium access control address change command if y<A otherwise an address change criterion is deemed to be satisfied and changing the medium access control address and setting X=t, M=y.

16. The apparatus as in claim 11 , where said at least one data processor in conjunction with the computer program code is further configured to send the host processor an indication of whethe

Assignees

• Ginzboorg Philip
• Niemi Valtteri
• Leppanen Kari
• Nokia Technologies Oy

Inventors

• Ginzboorg Philip
• Niemi Valtteri
• Leppanen Kari

Classifications

• H04W84/12

  WLAN [Wireless Local Area Networks] · CPC title

• H04W8/26

  Network addressing or numbering for mobility support · CPC title

• H04L61/20 Primary

  Electricity · mapped topic

• H04W24/02 Primary

  Arrangements for optimising operational condition · CPC title

• H04L61/2092

  Electricity · mapped topic