Method for reducing traffic of bootstrap procedure in G3-PLC networks

1 . A method for reducing traffic of a bootstrap procedure in G3-PLC networks, the method comprising:

a network domain where there is a first relay node; and

a first external node and enabling a beacon request transmission trickle mechanism according to a network domain search request instruction;

wherein after the first relay node has received a first beacon request, and before a beacon transmission timer of the first relay node starts to count, the first relay node enables a beacon transmission trickle mechanism according to the first beacon request.

2 . The method according to claim 1 , wherein the beacon request transmission trickle mechanism comprises:

when the adaptation sub-layer in the first external node receives the network domain search request instruction from an upper layer, the first external node counts the number of second beacon requests broadcasted by a second external node around the first external node within a first predetermined time and set a first number to the counted number.

3 . The method according to claim 2 , wherein the beacon request transmission trickle mechanism comprises: the first external node receives the second beacon request broadcasted by the second external node; and a received signal strength of the second beacon request needs to be greater than a predetermined value, while a first counter in the first external node counts the number of the second beacon requests as the first number within the first predetermined time.

4 . The method according to claim 3 , wherein there is a response time which is carried in the network domain search request instruction of the first external node; and the first predetermined time is a first random value whose range is from 0 to the response time multiplied by K 1 , where K 1 ranges from 0.4 to 0.6.

5 . The method according to claim 4 , wherein when the first number is smaller than 1, the first external node transmits the first beacon request.

6 . The method according to claim 5 , wherein the beacon transmission trickle mechanism comprises: the first relay node receives a first beacon broadcasted by an neighboring second relay node in response to the first beacon request, a received signal strength of the first beacon needs to be greater than a predetermined value, and the second relay node and the first relay node must be in the same network domain; the route cost of the first beacon needs to be lower than the route cost of the beacon to be sent by the first relay node; and a second counter in the first relay node counts a number of the first beacons as a second number within a second predetermined time.

7 . The method according to claim 6 , wherein the range of the second predetermined time is from 0 to the response time corresponding to the network domain search request instruction of the first external node, and the second predetermined time is a second random value whose range is from 0 to the sum of the response time multiplied by (1−K 1 ) and the response time multiplied by K 2 , where K 2 is greater than or equal to 0, and smaller than 0.3.

8 . The method according to claim 7 , wherein when the second number is smaller than 5, the first relay node transmits a second beacon in response to the first beacon request.

9 . The method according to claim 6 , wherein the network domain address of the first beacon is the same as the network domain address of the beacon to be sent by the first relay node.