WIRELESS MASTER-SLAVE DISTRIBUTED COMMUNICATIONS NETWORK

• US 20130107770A1
• Filed: 12/14/2012
• Published: 05/02/2013
• Est. Priority Date: 05/17/2001
• Status: Active Grant

• Current Assignee: Signify Holding B.V. (Signify N.V.)
• Original Assignee: Koninklijke Philips Electronics N.V. (Koninklijke Philips N.V.)
• Inventors: Marsden, Ian A., Marshall, Paul R.
• Granted Patent: US 9,320,080 B2
• Time in Patent Office: Days
• US Class Current: 370/310
• CPC Class Codes: H04W 8/26 Network addressing or numbering for mobility support
• CPC Class Codes: H04W 84/20 Master-slave selection or change arrangements
• CPC Class Codes: H04W 88/04 adapted for relaying to or from another terminal or user

Abstract

A master-slave distributed communications network includes a master node, a plurality of slave nodes. Each slave node is configured to store an address of the next node for a message to be routed on an uplink to the master node, and when sending a data packet to the master node it appends the pre-stored address and forwards the data packet to the next node thus lengthening the data packet, as the data packet is progressed from the slave nodes to the master node. For a downlink message, the master node using a pre-stored routing table includes in the data packet the addresses of all the slave nodes on the selected route. As the data packet is progressed from slave node to slave node, the address of each slave node which has forwarded the data packet is deleted thus shortening the overall length of the data packet.

Claims

1. A master-slave distributed communications network comprising:

a master node; and

a plurality of slave nodes, the master node and the slave nodes being operatively interconnected,

wherein each slave node has a memory configured to store as uplink routing information only an address of a next node in a route of a message to the master node, and

wherein each slave node is configured to read-out the address of the next node from the memory, add the address of the next node in a destination field of an uplink data packet of the message, and forward the uplink data packet to the next node.

11. The network of claim 1, wherein each slave node is configured to delete its address which is present in a downlink data packet originating from the master node and received by the slave station and transmit the downlink data packet to a next slave node based on an address of the next slave node included in the downlink data packet.

2. A method of operating a master-slave distributed network comprising a master node and a plurality of slave nodes, the master node and the slave nodes being operatively interconnected, the method comprising the acts of:

storing in a memory of each slave node as uplink routing information only an address of a next node in a route of a uplink data packet to the master node;

reading-out the address of the next node from the memory by a slave node wishing to send the data packet to the master node;

adding the address of the next node into a destination field of the data packet of the message, and

transmitting the uplink data packet to the next node.

3. The method of claim 2, further comprising the acts of:

the master node adding the addresses of all the slave nodes on a route to a final destination slave node in a further downlink data packet to be transmitted; and

transmitting the further downlink data packet by the master node.

4. The method of claim 2, further comprising the acts of:

receiving the further downlink data packet by a slave node;

removing by the slave node its own address from the data packet to form an altered downlink data packet; and

transmitting the altered downlink data packet.

5. The method of claim 2, further comprising the acts of:

a new slave node transmitting an invitation message requesting routing information from in-range slave nodes;

receiving by the new slave node routing information;

determining by the new slave node which of in-range slave nodes is a preferred next node in an uplink route from the new slave node to the master node; and

storing an address of the preferred next node in the memory of the new slave node.

6. The method of a claim 2, further comprising the acts of:

after an alteration in the network, re-examining by slave nodes their uplink routes to the master node; and

in response to one slave node finding that its uplink, route does not comply with predetermined routing criteria, the one slave node setting-up a new uplink route by determining which of in-range nodes is a preferred next node in an uplink route from the slave node to the master node and storing the address of the preferred next node in the memory of the one slave node.

7. The method of claim 2, further comprising the acts of:

a new slave node transmitting a “

request route to master”

message with a number of hops set to a predetermined minimum value; and

in response to not receiving a reply, repeating transmission of the “

request route to master”

message with the number of hops increased in value.

12. The method of claim 3, further comprising the acts of:

receiving the further downlink data packet by an intermediate slave node, the further downlink data packet including an address of the intermediate slave node and addresses of remaining slave nodes in a route to the final destination slave node including an address of a next node in the route to the final destination slave node;

deleting by the intermediate slave node an address of the intermediate slave node which is present in a downlink data packet originating from the master node to form a modified downlink data packet; and

transmitting the modified downlink data packet by the intermediate slave node to a next slave node based on the address of the next slave node included in the modified downlink data packet.

42. The method of claim 2, wherein

when a source slave node transmits an uplink data packet for routing through zero or more intermediate slave nodes to a master node, the uplink data packet contains:

a destination field containing a single destination address of the next node in the route, and a history field to record the addresses of nodes in the route, and

at each intermediate node in the route, when the intermediate node receives the uplink data packet, the intermediate node deletes its own address from the destination field and substitutes the address of a pre-stored preferred next node as the single destination address in the destination field, and copies its own address to the history field.

8. A slave station for use as a slave node in a master-slave distributed communications network including a master node and a plurality of slave nodes, the slave station comprising:

transceiving means for communicating with at least one of;

the master node and one of the plurality of slave nodes;

first memory means for storing the address of the slave station;

second memory means for storing as routing information only an address of the next node in an uplink route to the master node; and

processing means coupled to the transceiving means and the first and second memory means for adding the address of the said next node to a destination field of an uplink data packet to be routed to the master node.

9. The slave station of claim 8, wherein the processing means is configured to delete the address of the slave station which is present in the destination field of a downlink data packet originating from the master node and received by the slave station.

41. The slave station of claim 8, wherein the slave station is configured to process data packets as a final destination node when the address of the slave station is the only address contained in the routing information of the data packet.

10. A master station for use in a master-slave distributed communications network including the master station and a plurality of slave stations, the master station comprising:

transceiving means for communicating with at least one of the plurality of slave stations,

memory means for storing routing data, and

processing means for compiling routing information from the stored routing data and for adding the compiled routing information to a data packet, the routing information comprising an address of a final destination slave station and an address of each intermediate slave station through which the data packet will be passed, wherein each intermediate slave station is configured to delete its address which is present in the routing information and transmit the data packet to a next intermediate slave node in a route to the final destination slave station based on the routing information.

13. A master-slave distributed communications network comprising:

a master node; and

a plurality of slave nodes, the master node and the slave nodes being operatively interconnected,

wherein each slave node comprises;

a transceiver configured to receive a downlink data packet from the master node including an address of the slave node; and

a processor configured to delete the address of the slave node present in the downlink data packet thus forming a modified downlink data packet, and

wherein the transceiver is further configured to transmit the modified downlink data packet to a further slave node.

14. A method of operating a master-slave distributed network comprising a master node and a plurality of slave nodes, the master node and the slave nodes being operatively interconnected, the method comprising the acts of:

receiving by an intermediate slave node a downlink data packet in a route to a final destination slave node;

removing by the intermediate slave node its own address from the downlink data packet to form an altered downlink data packet; and

transmitting the altered downlink data packet in a route to the to the final destination slave node.

43. The method of claim 14, wherein:

when a master node transmits a downlink data packet for routing through zero or more intermediate slave nodes to the final destination slave node, the downlink data packet includes;

a destination field containing a single destination address of the next node in the route, and a routing field containing zero or more node addresses defining the route subsequent to the next node in the route, and when the master node initially transmits the data packet, the destination field contains the next node in the route after the master node and the routing field initially contains the addresses of the final destination slave node and all the intermediate slave nodes in the route, except the next node in the route after the master node is not included in the initial routing field, and

at each intermediate slave node in the route, when the intermediate slave node receives the downlink data packet, the intermediate node deletes its own address from the destination field and substitutes the address of the next node from the routing field as the single destination address of the destination field, and also deletes the address of the next node in the route from the routing field.

15. A slave station for use as a slave node in a master-slave distributed communications network including a master node and a plurality of slave nodes, the slave station comprising:

a transceiver configured to receive an downlink data packet routed from the master node, the downlink data packet including an address of the slave station; and

a processor configured to delete the address of the slave station present in the data packet thus forming a modified downlink data packet; and

wherein the transceiver is further configured to transmit the modified downlink data packet to a further slave station depending on a next address included in the downlink data packet.

16. A master station for use in a master-slave distributed communications network including the master station and a plurality of slave stations, the master station comprising:

a transceiver configured to communicate with the plurality of slave stations;

a memory configured to store routing data; and

a processor configured to compile routing information from the stored routing data and to add the compiled routing information to a downlink data packet, the routing information comprising an address of a final destination slave station and an address of each intermediate slave station through which the data packet will be passed in a route to the final destination slave station, wherein each intermediate slave station is configured to delete its address which is present in the routing information and transmit the downlink data packet to a next intermediate slave station in the route to the final destination slave station based on the routing information.

17. A distributed wireless communications network comprising:

a primary node functioning as a master node; and

a plurality of secondary nodes, and

wherein the primary node and the respective secondary nodes are operatively interconnected with at least a first of the secondary nodes being directly operatively interconnected with the primary node and at least a second of the secondary nodes being indirectly operatively interconnected with the primary node using the first node of the secondary nodes between the second of the secondary nodes and the primary node,

wherein the primary node has a primary memory configured to store routing data relating to the wireless communications network, and

wherein each of the secondary nodes has a memory configured to store as uplink routing information only an address of the next node in a route of an uplink data packet to the primary node, and a processor responsive to receiving an uplink data packet from a secondary node, configured to read-out the address of the next node from the secondary memory, and configured to replace its own address with the address of the next node in a destination field of the uplink data packet and forwarding the data packet to the next node.

18. The network of claim 17, wherein the node address of the secondary node receiving an uplink data packet is placed in a history field of the uplink data packet.

19. A method of operating a distributed wireless network comprising a primary node and a plurality of secondary nodes, wherein the primary node and the respective secondary nodes are operatively interconnected with at least one of the secondary nodes being directly operatively interconnected with the primary node and at least a second of the secondary nodes being indirectly operatively interconnected with the primary node using the first of the secondary nodes between the second of the secondary nodes and the primary node, and wherein the primary node stores routing data relating to the network, the method comprising the acts of:

each of the secondary nodes storing in a memory as uplink routing information only the address of the next node in a route of an uplink data packet to the primary node;

in response to receiving an uplink data packet from a secondary node, reading-out the address of the next node from the memory;

replacing its own node address with the address of the next node in a destination field of the uplink data packet; and

forwarding the uplink data packet to the said next node.

20. The method of claim 19, further comprising the act of, a secondary node in response to receiving an uplink data packet, deleting its own node address from the destination field and adding its own node address into a history field of the data packet.

21. The method of claim 19, further comprising the acts of:

supplying by the primary node a routing field initially containing node addresses of the secondary nodes used in the rout of a downlink data packet to a final destination node, except the next node in the route after the primary node is not included in the initial routing field; and

receiving by an intermediate secondary node a downlink data packet, removing its own address from the destination field, removing the node address of the next downlink node from the routing field, adding node address of the next downlink node to the destination field, and forwarding the altered data packet to the next following secondary node as stored in the routing field.

22. The method of claim 19, further comprising the act of:

transmitting by a new secondary node an invitation message requesting uplink routing information from in-range secondary nodes;

the new secondary node receiving routing information from the in-range secondary-nodes and determining which of the in-range secondary nodes is a preferred next node in the route of a data packet to the primary node;

storing the address of the preferred in-range secondary node depending on the determination.

23. A secondary node for use as a source/routing node in a distributed wireless communications network comprising a primary node functioning as a master node and a plurality of secondary-nodes, wherein the primary node and the respective secondary nodes are operatively interconnected with at least a first one of the secondary nodes being directly operatively interconnected with the primary node and at least a second one of the secondary nodes being indirectly operatively interconnected with the primary node using the first one of the secondary-nodes between the second of the secondary nodes and the primary node, the secondary node comprising:

a transceiver configured to communicate with at least one of;

the primary node, and at least one of the plurality of secondary nodes,

a memory configured to store as uplink routing information only an address of the next node in a route of a data packet to the primary node; and

a processor, responsive to receiving an uplink data packet from a secondary node, configured to read the address of the next node from the memory, copy the address of the next node into a destination field of the data packet, and forward the data packet to the next node.

24. The secondary node of claim 23, wherein the uplink data packet contains a history field containing addresses of all intermediate nodes that the packet has passed through on an uplink route to the master node, and the processor upon receiving an uplink data packet from a secondary node is configured to add the node address of the secondary node to the history field of the data packet.

25. The secondary node of claim 23, wherein a downlink data packet comprises a routing field containing node addresses of the subsequent secondary nodes used on the downlink transmission, except a next following secondary node in the route after the secondary node, and wherein the processor is further configured, in response to receiving a downlink data packet, to remove the address of next following secondary node from the routing field to create an altered data packet and forward the altered data packet to the next following secondary node included in the routing field.

35. The station of claim 23, the uplink route selection node basing said uplink route selection at least in part on at least one of the criteria:

number of hops from node to node until the transmission reaches the master node, route power limitations, and route loading.

26. A method of operating a distributed radio communications network comprising a plurality of nodes operatively connected for communication, said plurality of nodes including a master node for receiving an uplink transmission, a slave node for sending the uplink transmission to the master node through at least one intermediate node, said method comprising the acts of:

said slave node selecting the uplink route for passage of the transmission to the master node substantially on the basis of a route reliability criterion.

27. The method of claim 26, said slave node selecting said uplink route for passage of the transmission to the master node on the basis of information received from said at least one intermediate node that is relevant to said route reliability criterion.

28. The method of claim 26, said slave node and each of the at least one intermediate nodes in the selected route, storing in respective memories, as necessary addressing information for passing the transmission to the master node, only the address of the next node in said selected uplink route to said master node.

29. The method of claim 26, said slave node basing said uplink route selection at least in part on at least one of the criteria:

number of hops from node to node until the transmission reaches the master node, route power limitations, and route loading.

30. The method of claim 26, said slave node comprising a new node to be added to said network.

31. The method of claim 26, said slave node comprising an existing node re-evaluating an established route.

32. A station for operating as a uplink route selection node in a distributed radio communications network including a plurality of nodes operatively connected for communication, said plurality of nodes including a master node for receiving an uplink transmission, a slave node for sending the uplink transmission to the master node through at least one intermediate node, the station comprising:

a transceiver for communicating with other nodes, said uplink route selection node being capable of operating as one of the slave or intermediate nodes, and a processor for selecting a next node of a plurality of nodes in a uplink route for passage of the transmission to the master node substantially on the basis of a route reliability criterion.

33. The station of claim 32, the uplink route selection node selecting said next node in the uplink route for passage of the transmission to the master node on the basis of received information that is relevant to said route reliability criterion.

34. The station of claim 32, the uplink route selection node having a memory for storing, as necessary addressing information for passing the transmission to the master node, only the address of the next uplink node in said selected route to said master node.

36. The station of claim 32, the uplink route selection node comprising a new node added to said network.

37. The station of claim 32, said uplink route selection node comprising an existing node for re-evaluating an established route.

38. The station of claim 32, said uplink route selection node having the capability, when operating as an intermediate node, of adding to routing information of a received uplink message the address of a next node on a route to the master node, and transmitting the altered message to the next node on the route.

39. The station of claim 32, said master node being configured to transmit downlink messages, said uplink route selection node having the capability, when operating as an intermediate node, of removing from routing information in a received downlink message, the address of the route selection node, and transmitting the altered message to the next node on the route.

40. The station of claim 39, where an origin of the received message is a master node.

44. The network of claim I, wherein each data, packet contains a destination field with space for a single destination address, and each data packet received by a node contains the address of the node in the destination field, and each intermediate slave node in a route is configured to delete its own address from the destination field of a received data packet and to substitute the address of the next node in the route into the destination field, and to transmit the data packet to the next node in the route.

45. A non-transitory computer readable medium having a program for interacting with a processor for performing a method of operating a master-slave distributed network comprising a master node and a plurality of slave nodes, the master node and the slave nodes being operatively interconnected, the method comprising the acts of:

storing in a memory of each slave node as uplink routing information only an address of a next node in a route of a uplink data packet to the master node;

reading-out the address of the next node from the memory by a slave node wishing to send the uplink data packet to the master node;

adding the address of the next node into a destination field of the data packet of the message, and

transmitting the uplink data packet to the next node.

46. A non-transitory computer readable medium having a program for interacting with a processor for performing a method of operating a master-slave distributed network comprising a master node and a plurality of slave nodes, the master node and the slave nodes being operatively interconnected, the method comprising the acts of:

receiving by an intermediate slave node a downlink data packet in a route to a final destination slave node;

removing by the intermediate slave node its own address from the downlink data packet to form an altered downlink data packet; and

transmitting the altered downlink data packet in a route to the to the final destination slave node.