Method for initializing a wireless, packet-hopping network

• US 5,737,318 A
• Filed: 12/27/1995
• Issued: 04/07/1998
• Est. Priority Date: 12/27/1995
• Status: Expired due to Term

• Current Assignee: Philips Electronics North America Corporation (Koninklijke Philips N.V.)
• Original Assignee: Philips Electronics North America Corporation (Koninklijke Philips N.V.)
• Inventors: Melnik, George A.
• Primary Examiner(s): Olms, Douglas W.
• Assistant Examiner(s): PHILLIPS, MATTHEW
• Application Number:
  US08/579,650
• Time in Patent Office: 832 Days
• Field of Search: 370/254, 370/255, 370/256, 370/910, 370/913, 395/200.02, 395/200.1
• US Class Current: 370/254
• CPC Class Codes: H04L 12/2803 Home automation networks
• CPC Class Codes: H04L 12/2807 Exchanging configuration information on appliance services in a home automation network arrangements for maintenance or administration involving network analysis for automatically determining the actual topology of a network H04L41/12; hardware or software tools for network management using graphical user interfaces H04L41/22; address allocation H04L61/50
• CPC Class Codes: H04L 12/282 based on user interaction within the home receiver circuitry for displaying additional information being controlled by a remote control apparatus H04N21/42204
• CPC Class Codes: H04L 12/2821 Avoiding conflicts related to the use of home appliances cryptographic protocols H04L9/00; protocols for network security H04L63/00
• CPC Class Codes: H04L 2012/2841 Wireless
• CPC Class Codes: H04L 45/02 Topology update or discovery
• CPC Class Codes: H04W 40/02 Communication route or path selection, e.g. power-based or shortest path routing
• CPC Class Codes: H04W 40/246 Connectivity information discovery
• CPC Class Codes: H04W 48/08 Access restriction or access information delivery, e.g. discovery data delivery signalling during connection H04W76/00
• CPC Class Codes: H04W 84/18 Self-organising networks, e.g. ad-hoc networks or sensor networks

Abstract

A method for automatically initializing a wireless, packet-hopping network, such as a building system control network which is used to control the operation of a building system, such as a lighting, security, and/or HVAC system. In accordance with this initialization method, each node in the network first determines its entire connectivity, i.e., its connectivity to every other node in the network within a prescribed range thereof, and then routes this connectivity information to the building computer. This connectivity information is transmitted in a packet or set of packets that are routed to the building computer, thus minimizing the volume of traffic that the building computer and the nodes nearest thereto must handle, and thus, significantly reducing the probability of collisions of the connectivity information packets. This connectivity information is transmitted using a "software handshaking" technique to ensure that all of the connectivity information is received by the building computer. According to this software handshaking scheme, a packet which includes a byte having a special command value informs the building computer as to how many packets of connectivity information for that particular node remain to be received before all of the connectivity information for that node has been transferred to the building computer.

Claims

1. A method for initializing a wireless network which includes a central node and a plurality of individual nodes, comprising the steps of:

issuing an initialization request to each individual node; and

,

wherein, in response to said initialization request, each individual node performs a self-initialization routine which includes the steps of determining its entire connectivity wherein all nodes in communication with said individual node are identified, compiling corresponding nodal connectivity information, and then, after compiling said nodal connectivity information, transmitting said nodal connectivity information to the central node.

2. The method as set forth in claim 1, further comprising the step of formulating routing tables based on said nodal connectivity information, wherein packets of data can be transferred from an origin node to a destination node by hopping said packets from node-to-node along a route determined on the basis of said routing tables.

3. The method as set forth in claim 2, wherein routes to uninitialized nodes are selected from said nodal connectivity information received from previously initialized nodes, whereby said routing tables are being formulated and tested simultaneously with the network initialization process, thereby resulting in a tested, functional network upon completion of the network initialization process.

4. The method as set forth in claim 1, wherein each individual node, during its self-initialization routine, performs the step of determining its entire connectivity by determining its connectivity to every other node within a prescribed range therefrom.

5. The method as set forth in claim 4, wherein the central node performs the step of issuing an initialization request by transmitting an initialization packet to each individual node.

6. The method as set forth in claim 1, wherein each individual node performs the step of determining its connectivity during its self-initialization routine by:

transmitting a series of beacon initialization packets requesting a response from all nodes which receive one or more of said beacon initialization packets, wherein each receiving node transmits a response beacon initialization packet which contains its address;

extracting the address of said receiving node from each response beacon initialization packet received from the other nodes and keeping a record of these receiving node addresses; and

,

counting the number of response beacon initialization packets received from each said receiving node.

7. The method as set forth in claim 6, wherein said self-initialization routine for each individual node is completed after a prescribed number of beacon initialization packets have been transmitted.

8. The method as set forth in claim 6, wherein said self-initialization routine for each individual node is completed after a prescribed number of beacon initialization packets have been transmitted without receiving a response from any node which has not previously responded.

9. The method as set forth in claim 6, wherein routes to uninitialized nodes are selected from said nodal connectivity information received from previously initialized nodes.

10. The method as set forth in claim 6, wherein each node which receives a beacon initialization packet from an other one of said nodes waits for a random delay period and then senses the status of a communication channel between that node and said other one of said nodes prior to making an attempt to transmit said response beacon initialization packet in response to said beacon initialization packet, in accordance with a carrier sense multiple access protocol.

11. The method as set forth in claim 10, wherein, in accordance with said carrier sense multiple access protocol, each said node which receives a beacon initialization packet from an other one of said nodes, if it senses that said communication channel is busy, waits for another random delay period, and then again senses the status of said communication channel, prior to making another attempt to transmit a response beacon initialization packet.

12. The method as set forth in claim 11, wherein each individual node, during its self-initialization routine, waits for a random delay period and then senses the status of said communication channel, prior to making an attempt to transmit a beacon initialization packet, in accordance with said carrier sense multiple access protocol.

13. The method as set forth in claim 12, wherein each individual node, during its self-initialization routine, if it senses that said communication channel is busy, waits for a full beacon cycle, and then again senses the status of said communication channel, prior to making another attempt to transmit a beacon initialization packet.

14. The method as set forth in claim 1, wherein each individual node performs the step of transmitting its nodal connectivity information during its self-initialization routine by transmitting a set of initialization response packets to the central node, each of said initialization response packets including a prescribed byte having a value which is indicative of the remaining number of initialization response packets in that set.

15. The method as set forth in claim 14, wherein the step of issuing an initialization request is performed by the central node transmitting a first initialization packet, and then transmitting additional initialization packets to each individual node on the basis of the number of initialization response packets remaining in the set of initialization response packets for that node as determined on the basis of the value of said prescribed byte in previously received initialization response packets from that node, until all of said initialization response packets from each node have been received.

16. The method as set forth in claim 15, wherein the central node polls any specific node from which it has not received a first initialization response packet during a prescribed period of time, by transmitting a further initialization packet to request that specific node to re-transmit its set of initialization response packets.

17. The method as set forth in claim 1, further comprising the step of performing a handshaking routine to ensure that all of said nodal connectivity information compiled by each of said nodes is received by the central node.

18. The method as set forth in claim 1, wherein the step of issuing an initialization request is performed by the central node transmitting a sequence of initialization packets to respective ones of the nodes.

19. The method as set forth in claim 1, wherein the step of issuing an initialization request is performed by the central node transmitting a plurality of initialization packets to respective ones of the nodes simultaneously.

20. The method as set forth in claim 1, wherein the central node comprises a building computer and the wireless network comprises a building system control network.

21. A wireless network, comprising:

a central node which includes an RF transceiver and digital signal processing circuitry programmed to execute a network initialization routine;

a plurality of individual nodes each of which includes an RF transceiver and digital signal processing circuitry programmed to execute a self-initialization routine;

wherein said central node initiates said network initialization routine by issuing an initialization request to each of said individual nodes;

wherein each of said individual nodes executes its self-initialization routine by determining its connectivity to every other individual node within a prescribed range therefrom wherein all nodes in communication with said individual node which are within the prescribed range are identified, compiling corresponding nodal connectivity information, and then, after compiling said nodal connectivity information, transmitting said nodal connectivity information to said central node.

22. The wireless network as set forth in claim 21, wherein said central node and individual nodes are programmed to execute a handshaking routine which ensures that all of said nodal connectivity information compiled by each of said individual nodes is received by said central node.

23. The wireless network as set forth in claim 21, wherein said central node comprises a building computer and the wireless network comprises a building system control network.

24. The wireless network as set forth in claim 23, wherein said building system control network comprises an intelligent lighting control system.

25. The wireless network as set forth in claim 21, wherein each individual node determines its connectivity when executing its self-initialization routine by means of:

transmitting a series of beacon initialization packets requesting a response from all nodes which receive one or more of said beacon initialization packets, wherein each receiving node transmits a response beacon initialization packet which contains its address;

extracting the address of said receiving node from each response beacon initialization packet received from the other nodes and keeping a record of these receiving node addresses; and

,

counting the number of response beacon initialization packets received from each said receiving node.