Routing for power line communication systems

• US 9,008,073 B1
• Filed: 12/07/2012
• Issued: 04/14/2015
• Est. Priority Date: 12/07/2012
• Status: Active Grant

• Current Assignee: Maxim Integrated Products, Inc. (Analog Devices, Inc.)
• Original Assignee: Maxim Integrated Products, Inc. (Analog Devices, Inc.)
• Inventors: Razazian, Kaveh, Niktash, Afshin, Garey, Kenneth E., Loginov, Victor
• Primary Examiner(s): Jaroenchonwanit, Bunjob
• Application Number:
  US13/708,008
• Time in Patent Office: 858 Days
• Field of Search: None
• US Class Current: 370/351
• CPC Class Codes: H04L 45/122 by minimising distances, e.g. by selecting a route with minimum of number of hops

Abstract

A power line communication (PLC) system includes a source node, a plurality of intermediate nodes and a destination node. Each of the source node, the plurality of intermediate nodes and the destination node comprise a PLC interface including a medium access control (MAC) module and a physical layer (PHY) module. A transformer is located between the source node and the destination node. Routing modules of the source node, one or more of the intermediate nodes, and the destination node establish a route from the source node to the destination node via one or more selected ones of the plurality of intermediate nodes. The route is selected using a route cost that is calculated based on link costs of a plurality of hops in the route from the source node to the destination node. The link costs are based on forward link costs and reverse link costs.

Claims

1. A power line communication (PLC) system, comprising:

a source node;

a plurality of intermediate nodes; and

a destination node,

wherein each of the source node, the plurality of intermediate nodes and the destination node comprise a PLC interface including;

a medium access control (MAC) module comprising a routing module; and

a physical layer (PHY) module in communication with the MAC module and comprising a transceiver configured to transmit and receive data over a power line,

wherein the routing modules of the source node, one or more of the intermediate nodes, and the destination node establish a route from the source node to the destination node via one or more selected ones of the plurality of intermediate nodes,

wherein the route is selected using a route cost that is calculated based on link costs of a plurality of hops in the route from the source node to the destination node,

wherein the link costs are based on forward link costs and reverse link costs,

wherein when the destination node receives a route request packet, including a route cost, from one of the intermediate nodes corresponding to a neighbor node of the destination node, the destination node waits a predetermined period to receive one or more additional route request packets,

wherein, after waiting the predetermined period, the destination node identifies a selected one of (i) the route request packet and (ii) the one or more additional route request packets having a lowest route cost, and

wherein the destination node transmits a unicast route reply packet to the source node identifying the selected route.

2. The PLC system of claim 1, wherein the route cost is further based on identifying weak links in the plurality of hops in the route from the source node to the destination node.

3. The PLC system of claim 2, wherein one of the weak links is determined based on a comparison of a reverse link quality of one of the hops to a predetermined reverse link quality.

4. The PLC system of claim 1, wherein the MAC module of one of the plurality of intermediate nodes calculates one of the forward link costs of one of the hops based on a forward link quality indicator and a forward modulation.

5. The PLC system of claim 1, wherein the MAC module of one of the plurality of intermediate nodes includes a routing table, a neighbor table and a route request table.

6. The PLC system of claim 5, wherein the routing module of the one of the plurality of intermediate nodes determines one of the reverse link costs of one of the hops based on a reverse link quality indicator and a reverse modulation.

7. The PLC system of claim 6, wherein the reverse link quality indicator and the reverse modulation are stored in the neighbor table of the one of the plurality of intermediate nodes when the one of the plurality of intermediate nodes associates with a neighbor node.

8. The PLC system of claim 5, wherein the source node sends a route request packet to neighbor nodes in the neighbor table of the MAC module of the source node to initiate a route to the destination node.

9. The PLC system of claim 1, wherein the routing module of the one of the plurality of intermediate nodes determines one of the reverse link costs by:

requesting a tone map from a node transmitting a route request packet received by the one of the plurality of intermediate nodes; and

calculating the reverse link cost based a tone map reply from the node transmitting the route request packet received by the one of the plurality of intermediate nodes.

10. The PLC system of claim 1, wherein one of the link costs is calculated by selecting a minimum value of a forward link cost and a reverse link cost for the one of the hops.

11. The PLC system of claim 1, wherein one of the link costs is calculated based on a function of a forward link cost and a reverse link cost.

12. The PLC system of claim 1, wherein the route cost is based on a sum of link costs of links from the source node to the destination node.

13. The PLC system of claim 1, wherein the transceiver operates in a frequency band from 1 kHz to 600 kHz.

14. The PLC system of claim 1, wherein the transceiver selectively utilizes normal encoding and repetitive encoding.

15. The PLC system of claim 1, wherein the transceiver interleaves transmit data in both frequency and time.

16. The PLC system of claim 1, wherein a selected forward route established from the source node to the destination node through a first set of the plurality of intermediate nodes is different than a selected reverse route established from the destination to the source node through a second set of the plurality of intermediate nodes wherein the first set is different than the second set.

17. The PLC system of claim 1, wherein:

when a receiving node receives a route request packet from a sending node and the receiving node does not have reverse channel information for the sending node, the receiving node sends a route request packet to the sending node; and

the sending node, in response to the route request packet, sends a route request acknowledgement packet to the receiving node including at least one of a reverse link quality indicator and modulation information.

18. The PLC system of claim 1, further comprising a coordinator node, wherein:

a first node associates with the coordinator node using a first route with a first route cost; and

when a second node attempts to initiate an association with the coordinator node through the first node using a beacon and the association fails, the first node increases the first route cost to the coordinator node to a higher route cost.

19. The PLC system of claim 18, wherein:

the higher route cost indicates that the first node does not presently have a sustainable communication link to the coordinator node; and

the second node uses the higher route cost to avoid selecting the first node when subsequently attempting to initiate an association with the coordinator node.

20. A method for operating a power line communication (PLC) system, comprising:

establishing a route from a source node to a destination node via one or more selected ones of a plurality of intermediate nodes, wherein each of the source node, the plurality of intermediate nodes, and the destination node comprises a PLC interface for transmitting and receiving data over a power line;

selecting the route using a route cost that is calculated based on link costs of a plurality of hops in the route from the source node to the destination node, wherein the link costs are based on forward link costs and reverse link costs;

wherein when the destination node receives a route request packet, including a route cost, from one of the intermediate nodes corresponding to a neighbor node of the destination node, the destination node waits a predetermined period to receive one or more additional route request packets;

after waiting the predetermined period, identifying a selected one of (i) the route request packet and (ii) the one or more additional route request packets having a lowest route cost; and

transmitting a route reply packet from the destination node to the source node identifying the selected route.

21. The method of claim 20, further comprising identifying weak links in the plurality of hops in the route from the source node to the destination node, wherein the route cost is further based on the weak links.

22. The method of claim 21, wherein determining one of the weak links based on a comparison of a reverse link quality of one of the hops to a predetermined reverse link quality.

23. The method of claim 21, further comprising calculating one of the forward link costs of one of the hops based on a forward link quality indicator and a forward modulation.

24. The method of claim 21, wherein one of the plurality of intermediate nodes includes a routing table, a neighbor table and a route request table.

25. The method of claim 24, further comprising, at the one of the plurality of intermediate nodes, determining one of the reverse link costs of one of the hops based on a reverse link quality indicator and a reverse modulation.

26. The method of claim 25, wherein the reverse link quality indicator and the reverse modulation are stored in the neighbor table of the one of the plurality of intermediate nodes when the one of the plurality of intermediate nodes associates with a neighbor node.

27. The method of claim 20, wherein the one of the plurality of intermediate nodes determines one of the reverse link costs by:

requesting a tone map from a node transmitting a route request packet received by the one of the plurality of intermediate nodes; and

calculating the reverse link cost based a tone map reply from the node transmitting the route request packet received by the one of the plurality of intermediate nodes.

28. The method of claim 20, further comprising calculating one of the link costs by selecting a minimum value of a forward link cost and a reverse link cost for the one of the hops.

29. The method of claim 20, further comprising calculating one of the link costs based on a function of a forward link cost and a reverse link cost.

30. The method of claim 24, further comprising broadcasting or forwarding a route request packet from the source node to neighbor nodes in the neighbor table of the source node to initiate a route to the destination node.

31. The method of claim 20, wherein the route cost is based on a sum of link costs of links from the source node to the destination node.

32. The method of claim 20, further comprising transmitting and receiving data in a frequency band from 1 kHz to 600 kHz.

33. The method of claim 20, further comprising selectively using normal encoding and repetitive encoding.

34. The method of claim 20, further comprising selectively interleaving transmitted data in both frequency and time.

35. The method of claim 20, further comprising selecting a forward route established from the source node to the destination node through a first set of the plurality of intermediate nodes that is different than a reverse route established from the destination to the source node through a second set of the plurality of intermediate nodes, wherein the first set is different than the second set.

36. The method of claim 20, further comprising:

when a receiving node receives a route request packet from a sending node and the receiving node does not have reverse channel information for the sending node, sending a unicast or broadcast route request packet from the receiving node to the sending node; and

in response to the route request packet, sending a route request acknowledgement packet from the sending node to the receiving node including at least one of a reverse link quality indicator and modulation information.

37. The method of claim 20, further comprising:

associating a first node with a coordinator node using a first route with a first route cost; and

when a second node attempts to initiate an association with the coordinator node using a beacon through the first node and the association fails, increasing the first route cost to a higher route cost.

38. The method of claim 27, wherein:

the higher route cost indicates that the first node does not presently have a sustainable communication link to the coordinator node; and

the second node uses the higher route cost to avoid selecting the first node when subsequently attempting to initiate an association with the coordinator node.

39. A power line communication (PLC) comprising:

a source node;

a plurality of intermediate nodes; and

a destination node,

wherein each of the source node, the plurality of intermediate nodes and the destination node comprise a PLC interface including;

a medium access control (MAC) module comprising a routing module; and

a physical layer (PHY) module in communication with the MAC module and comprising a transceiver configured to transmit and receive data over a power line,

wherein the routing modules of the source node, one or more of the intermediate nodes, and the destination node establish a route from the source node to the destination node via one or more selected ones of the plurality of intermediate nodes,

wherein the route is selected using a route cost that is calculated based on link costs of a plurality of hops in the route from the source node to the destination node,

wherein the link costs are based on forward link costs and reverse link costs,

wherein when one of the intermediate nodes receives a route request packet, the intermediate node updates the route cost and a weak links field of the route request packet,

wherein the route request packet includes an identification field identifying a source node,

wherein when the intermediate node determines that a prior route request packet including the identification field identifying the same source node as the route request packet, the intermediate node compares the route cost and the weak links field of the route request packet with a route cost and a weak links field of the prior route request packet,

wherein the intermediate node selects the route request packet in response to the route cost and the weak links field being less than the route cost and the weak links field of the prior route request packet by a predetermined amount and rebroadcasts or forwards the route request packet to neighbor nodes, and

wherein the intermediate node discards the route request packet in response to the route cost and the weak links field being not less than the route cost and the weak links field of the prior route request packet by the predetermined amount.

40. A power line communication (PLC) comprising:

a source node;

a plurality of intermediate nodes; and

a destination node,

wherein each of the source node, the plurality of intermediate nodes, and the destination node comprise a PLC interface including;

a medium access control (MAC) module comprising a routing module; and

a physical layer (PHY) module in communication with the MAC module and comprising a transceiver configured to transmit and receive data over a power line,

wherein the routing modules of the source node, one or more of the intermediate nodes, and the destination node establish a route from the source node to the destination node via one or more selected ones of the plurality of intermediate nodes,

wherein the route is selected using a route cost that is calculated based on link costs of a plurality of hops in the route from the source node to the destination node, and

wherein the link costs are based on forward link costs and reverse link costs,

wherein when turned on, the PLC interface transmits a beacon to initiate a first one of N association attempts with a PLC network, wherein N is an integer greater than 0, wherein in response to the first one of the N association attempts failing, the MAC module waits a first random delay period before initiating a second one of the N association attempts, wherein in response to the second one of the association attempts failing, the MAC module waits a second random delay period before initiating others of the N association attempts, and wherein each random delay period associated with a successive one of the N association attempts is longer than a preceding one of the N association attempts.

41. A method for operating a power line communication (PLC) system, comprising:

establishing a route from a source node to a destination node via one or more selected ones of a plurality of intermediate nodes, wherein each of the source node, the plurality of intermediate nodes, and the destination node comprises a PLC interface for transmitting and receiving data over a power line;

selecting the route using a route cost that is calculated based on link costs of a plurality of hops in the route from the source node to the destination node, wherein the link costs are based on forward link costs and reverse link costs;

updating the route cost and a weak links field of a route request packet when one of the plurality of intermediate nodes receives a route request packet, wherein the route request packet includes an identification field identifying a source node;

determining whether the one of the plurality of intermediate nodes stored a prior route request packet including the identification field identifying the same source node as the route request packet;

comparing the route cost and the weak links field of the route request packet with a route cost and a weak links field of the prior route request packet;

using the route request packet in response to the route cost and the weak links field being less than the route cost and the weak links field of the prior route request packet by a predetermined amount and sending the route request packet to neighbor nodes; and

discarding the route request packet in response to the route cost and the weak links field being not less than the route cost and the weak links field of the prior route request packet by the predetermined amount.

42. A method for operating a power line communication (PLC) system, comprising:

in response to a PLC interface turning on;

establishing a route from a source node to a destination node via one or more selected ones of a plurality of intermediate nodes;

selecting the route using a route cost that is calculated based on link costs of a plurality of hops in the route from the source node to the destination node, wherein the link costs are based on forward link costs and reverse link costs;

transmitting a beacon to initiate a first one of N association attempts with a PLC network;

in response to the first one of the N association attempts failing, waiting a first random delay period before initiating a second one of the N association attempts; and

in response to the second one of the association attempts failing, waiting a second random delay period before initiating others of the N association attempts,

wherein each random delay period associated with a successive one of the N association attempts is longer than a preceding one of the N association attempts.