WO2017034479A1

WO2017034479A1 - System and method for managing a network

Info

Publication number: WO2017034479A1
Application number: PCT/SG2016/050403
Authority: WO
Inventors: Weiyuan Xu; Chao Qian; Youlan SHI
Original assignee: Yan Singapore Pte. Ltd.
Priority date: 2015-08-21
Filing date: 2016-08-19
Publication date: 2017-03-02

Abstract

A system for adding a terminal node to a network comprising at least one network node arranged to receive and forward at least one request for propagation feedback, the at least one network node having an address identifier; a gateway arranged to receive the at least one request for propagation feedback and a route of the at least one request for propagation feedback; the terminal node having a random identifier; the terminal node operable to initiate the request for propagation feedback; wherein upon receipt of the propagation request feedback, the at least one network node appends the address identifier to the propagation request feedback and the terminal node appends the random identifier to the request for propagation feedback.

Description

SYSTEM AND METHOD FOR MANAGING A NETWORK

CROSS-REFERENCE TO RELATED APPLICATIONS

This application claims priority to the following application(s): CN201510517156.1 ; CN201510520450.8; CN201510519853.0; and CN201510517214.0, the entire contents of which are incorporated herein by reference.

FIELD OF THE INVENTION

The present invention relates to a system and method for managing a network. In particular, the system and method is suited but not limited for managing a low data rate wireless network.

BACKGROUND ART

The following discussion of the background to the invention is intended to facilitate an understanding of the present invention only. It should be appreciated that the discussion is not an acknowledgement or admission that any of the material referred to was published, known or part of the common general knowledge of the person skilled in the art in any jurisdiction as at the priority date of the invention.

Low data rate wireless network as facilitated by communication protocols such as ZigBee and Bluetooth is attracting increasing applications in different areas. However, due to limited transmission distance, a self-organized wireless network is commonly utilized to extend physical transmission distance and to increase area of coverage. In the conventional routing protocols (except STAR network), the completion of setting up the network is a pre-condition for data to be transmitted. In other words, a gateway will not be able to send data to a node that has not yet been added into the network. A terminal node, when it is not added to the network, or when its route is damaged, cannot send data to the backend server successfully.

Traditionally, routing is initiated by a network coordinator (e.g. a central server) or a gateway (such as a telecommunications, web portal, or computer gateway). Such an initiation does not afford the flexibility to add terminal nodes. Further there is no feedback mechanism in case any network routing routes are unavailable.

In addition to the above, there further exists a need to manage existing network more efficiently in view of the advent of computing and device technologies for "Intemet-of-Things".

Accordingly, there exists a need to mitigate the aforementioned drawbacks and improve network management as least in part.

SUMMARY OF THE INVENTION Throughout the document, unless the context requires otherwise, the word "comprise" or variations such as "comprises" or "comprising", will be understood to imply the inclusion of a stated integer or group of integers but not the exclusion of any other integer or group of integers. Furthermore, throughout the specification, unless the context requires otherwise, the word "include" or variations such as "includes" or "including", will be understood to imply the inclusion of a stated integer or group of integers but not the exclusion of any other integer or group of integers. The Applicant is motivated to move away from the conventional paradigm of a centralized network control. In particular, as nodes forming network(s) increase in computational and connectivity capabilities, setting up of a network, determining functional routing routes, and expansion of network to include new nodes may be carried out in a partially or wholly decentralized 5 manner. Accordingly, aspects of the invention seek to provide technical solutions wherein network nodes are empowered to function as centralized server or gateway.

In accordance with an aspect of the invention there is a system for adding a 10 terminal node to a network comprising at least one network node arranged to receive and forward at least one request for propagation feedback, the at least one network node having an address identifier; a gateway arranged to receive the at least one request for propagation feedback and a route of the at least one request for propagation feedback; the terminal node having a random i s identifier; the terminal node operable to initiate the request for propagation feedback; wherein upon receipt of the propagation request feedback, the at least one network node appends the address identifier to the propagation request feedback and the terminal node appends the random identifier to the request for propagation feedback.

20

In some embodiments, the random identifier of the terminal node is a unique identifier.

In some embodiments, upon receipt of the at least one request for 25 propagation feedback, the at least one network node checks the random identifier to determine whether the at least one request for propagation has been sent to the at least one network node before.

In some embodiments, upon determination that the at least one request for so propagation has been sent to the at least one network node before, the at least one network node does not forward the at least one request for propagation toward the gateway.

In some embodiments, upon determination that the at least one request for 35 propagation has not been sent to the at least one network node before, the at least one network node forward the at least one request for propagation toward the gateway.

In some embodiments, upon receipt of the at least one request for propagation, the gateway records the random identifier of the terminal node and the route of the at least one request for propagation feedback.

In some embodiments, the gateway sends the route of the at least one request for propagation feedback to the terminal node.

In some embodiments, the terminal node records the route upon receipt.

In some embodiments, the network is a low power wireless network.

In some embodiments, the at least one network node is configured to evaluate the signal strength of an adjacent network node after receiving the request for propagation feedback.

In some embodiments, the value of the signal strength is appended to the request for propagation feedback.

In some embodiments, the gateway operates to select the route with the shortest distance based on a shortest path algorithm.

In accordance with another aspect of the invention there is a method for adding a terminal node to a network comprising the steps of a. generating a random identifier; b. appending the random identifier to a request for propagation feedback; c. forwarding the request for propagation feedback to at least one network node; and d. appending an address identifier of the at least one network node to the request for propagation feedback; wherein steps c to d are repeated until the request for propagation feedback is forwarded to a gateway. In some embodiments, the random identifier of the terminal node is a unique identifier.

In some embodiments, the method further includes the step of checking the random identifier to determine whether the at least one request for propagation has been sent to the at least one network node before.

In some embodiments, upon determination that the at least one request for propagation has been sent to the at least one network node before, the at least one network node does not forward the at least one request for propagation toward the gateway.

In some embodiments, upon determination that the at least one request for propagation has not been sent to the at least one network node before, the at least one network node forward the at least one request for propagation toward the gateway.

In some embodiments, the method further includes the step of sending the route of the at least one request for propagation feedback to the terminal node by the gateway. In some embodiments, the terminal node records the route upon receipt.

In some embodiments, the network is a low power wireless network.

In some embodiments, the at least one network node is configured to evaluate the signal strength of an adjacent network node after receiving the request for propagation feedback. In some embodiments, the value of the signal strength is appended to the request for propagation feedback.

In accordance with another aspect of the invention there is a system for managing a network comprising a plurality of network nodes, the system comprising a network manager for assigning identifiers to the plurality of network nodes; the network manager further operates select a first network node from the plurality of network nodes; the first node comprises a wireless communication means to detect other nodes within the plurality of nodes and determine whether each of the detected other nodes can directly establish a connection with the first node; wherein a detected other node that established connection with the first node is selected as a second node if there exists at least one detected node that cannot establish a connection with the first node; and the second node operates to determine whether each of the other nodes can directly establish a connection with the second node.

In some embodiments, each network node comprises maintains a forwarding node table, and the network node operates to broadcast a command package to each of the node in the forwarding node table.

In some embodiments, the at least one of the network nodes operates to send a request to establish communication with another network node, wherein the request to establish communication comprises a pre-set signal strength threshold R.

In some embodiments, the at least one of the network nodes starts a countdown timer after the request to establish communication is sent. In some embodiments, upon receipt of the request to establish communication, the another network node determines the actual signal strength received and compares the actual signal strength with the pre-set signal strength parameter R.

In some embodiments, the at least one network node of the plurality of network node is configured to maintain a first counter for number of data packets sent and a second counter for the number of data packets received.

BRIEF DESCRIPTION OF THE DRAWINGS

The present invention will now be described, by way of example only, with reference to the accompanying drawings, in which:

Fig. 1 shows a system block diagram of an embodiment of the invention to add a terminal node to an existing network;

Fig. 2 shows a flow chart of another embodiment of the invention to add a terminal node to an existing network;

Fig. 3 shows a flow chart depicting a method for establishing connections between nodes within a low data rate wireless network;

Fig. 4 shows a flow chart depicting a method for evaluating signal strength in a low data rate wireless network;

Fig. 5 shows a flow chart depicting a method for propagating or broadcasting data packets or information within a low data rate wireless network; and

Fig. 6 shows a flow chart depicting a method for setting up a low data rate wireless network.

Other arrangements of the invention are possible and, consequently, the accompanying drawing is not to be understood as superseding the generality of the preceding description of the invention. EMBODIMENTS OF THE INVENTION

Particular embodiments of the present invention will now be described with reference to the accompanying drawings. The terminology used herein is for the purpose of describing particular embodiments only and is not intended to limit the scope of the present invention. Additionally, unless defined otherwise, all technical and scientific terms used herein have the same meanings as commonly understood by one of ordinary skill in the art to which this invention belongs.

Throughout the description, the term 'network node' or 'node' may include network elements such as routers, computer servers, computer devices, mobile communication devices etc. that is capable of being in data communication with other network elements for sending, forwarding and receiving data, in particular operating in the context of a low data rate communication network.

Throughout the description, the term 'gateway' may include any network elements for the interfacing with other networks, the other network using a similar or different communication protocol(s). Such gateway may be equipped with devices to provide system interoperability between different networks. In some embodiments, the gateway may be a network node and the network node may contain devices such as protocol translators, impedance matching devices, rate converters, fault isolators, or signal translators as necessary to provide system interoperability.

Further, the term 'low data rate wireless network' and 'low power wireless network' may refer to the same type of network and is used interchangeably. In accordance with an embodiment of the invention with reference to Fig. 1 , there is a system for managing a communication network. The system 10 comprises a plurality of network nodes 12, each arranged to receive and/or forward data packets to and from a gateway 14. The data packets may include broadcast information, electronic content, electronic signals etc. The system 10 may be a low power propagation network. When a terminal node 16, which has not joined the network wishes to be added into the communication network or when the route of the terminal node has been damaged, the system 10 provides a mechanism or method for adding a terminal node and request for propagation feedback as illustrated in Fig. 2.

Fig. 2 illustrates a propagation feedback method for low data rate wireless network, comprising the following steps: When the terminal node 16 which is not yet included in a network needs to upload data to one or more nodes in the network, the terminal node 16 will generate an identifier (hereinafter referred to Random ID)- Step S202. The Random ID may be a unique identifier of a certain alphanumeric length. The Random ID may be generated by a predetermined algorithm. The Random ID may also be generated based on a time information or include a portion of the time within the Random ID. In some embodiments, the generated Random ID is different from the Random ID of all other existing nodes in the network.

Once the Random ID is generated, the terminal node then sends the Propagation Feedback request and triggers a propagation feedback mechanism as described in the subsequent steps S204 to S2 0.

Any of the plurality of nodes 12 located nearby/adjacent the terminal node 16, upon receiving the propagation feedback request, will add their own node addresses into the Propagation Feedback request and send the updated propagation feedback request out (step S204). In this way the propagation feedback request at least comprises:

a. the address of the adjacent node 12;

b. the random ID of the terminal node 16; and

c. the actual data, information or content associated with the propagation feedback request. If the propagation feedback request has been forwarded to a plurality of nodes 12, the propagation feedback request would comprises the respective addresses of the plurality of nodes 12.

Any particular node 12, after receiving the propagation feedback request, will check the Random ID of the terminal node 16 against a table or database maintained by the particular node 12 (step S206). The table or database may be a node forwarding table. If it is determined that the terminal node 16 has not sent the propagation feedback request to the particular node 12 before, the particular node 12 will execute step S204 until the gateway 14 of the network receives the propagation feedback request. If the Random ID has been sent by the ordinary node before, the particular node 12 will not forward the Propagation Feedback request.

The Gateway 14, after receiving the propagation feedback request, will record the Random ID in the propagation feedback request and the route (based on the addresses of different nodes 12 and the Random ID of the newly added terminal node 16). The gateway 14 will also send the route information to the respective terminal node 16 (step S208).

The terminal node 16 records and traces the route after receiving it. Subsequent data uploading from the terminal node 16 to the network will follow the same route (step S210).

If the route becomes non-functioning, the propagation feedback method repeats step S202 to step S210.

In some embodiments, whether a route is functioning or not is determined in operation. For example, if a node 12 is required or scheduled to send information to the gateway 14 at a predetermined time interval (e.g. every one hour), and the gateway 14 does not receive information from the particular node for more than a slated time after the time interval, for example three hours, the node 12 is deemed to be non-functioning.

Another non-limiting example to determine whether a route is functioning or non-functioning may be based on whether a particular node 12 is able to establish connection with another node 12 and/or the terminal node 16. In the context of using a wireless communication protocol such as Bluetooth™, such connection may be established via 'pairing'. With reference to Fig. 3, a pairing method for low data rate wireless network is illustrated. Such a pairing method may be applied to solve pairing technical problems related to Internet of Things (IoT) applications using low power wireless network, which include difficulty and complex steps to take to establish connection through pairing. The method provided in this invention enables easy pairing, easy operation and it is suitable for ordinary users of IoT applications using low power wireless network. Furthermore, the method as illustrated ensures accurate and secure pairing.

Referring to Fig. 3, the method step commence with step S302 where an arbitrary node A sends a pairing search command (functionally a request to establish connection) to establish connection with another arbitrary node B. The pairing search command may be a data packet which comprises a preset parameter R. After the pairing search command is sent, node A then enters into a 'Search Waiting Mode' and start a countdown timer (node A countdown timer) of a predetermined time parameter T. The pre-set parameter R is a predetermined threshold of signal strength. Predetermined time parameter T can be set according to application/situational requirements. In some embodiments, a limit for T is not set. In other embodiments, T can be set at 100 milliseconds (ms). Setting T at 100ms achieves a compromise between wait time and exit from the wait mode, thereby preventing node A from staying in the search waiting mode perpetually without exiting, i.e. being configured to wait for a pre-set period of time "T" and to exit if no response is received within 100ms so that node A is able to return to normal operation. The arbitrary node B receives the pairing search command in step S304 and a corresponding actual signal strength r corresponding to the pairing search command. Once received, node B will execute step S306. If node B does not receive the pairing search command, node B does nothing.

In step S306, node B retrieves the parameter R from the pairing search command and compares the value with the actual signal strength r. If r is greater or equal to R (i.e. r>=R), node B responds to the pairing search command and enters into a pairing waiting mode. Node B then starts a predetermined count down timer, e.g. a 10-seconds count down timer. If however the signal strength r is smaller than the pre-set parameter R (i.e. r<R), Node B does nothing.

In step S308, upon sending the response by node B, if node A receives the response from node B before the node A countdown completes the countdown of T, node A exits the search waiting mode, stops the node A countdown timer, sends out a pairing request command, and executes step S310. If node A does not receive response from node B before the node A countdown timer complete the countdown of T, node A exits the Search Waiting Mode and aborts the pairing operation.

In step S310, if node B receives the pairing request command from node A before the node B countdown timer completes the countdown of 10 seconds (or any other predetermined countdown time), node B accepts the pairing request command, completes the pairing operation and executes Step S314. If node B does not receive the pairing request command before the Node B countdown timer complete the countdown of 10 seconds, node B executes step S312.

In step S312, node B exits the Pairing Waiting Mode, and returns to normal operation. In step S314, the pairing operation completes and connection between node A and node B is established. Node A and Node B is able to carry out point to point communication upon completion of the pairing operation.

Hence based on the embodiment of Fig. 3, nodes may be deemed nonfunctional if an initiating node cannot establish connections with other nodes due to time-out in waiting or responding.

The terminal node 16 which has not yet been added to the network pursuant to steps S202 to S206, and therefore does not know the route for uploading. Ordinary nodes 12 are those network nodes that have already been added into the network, and will be converted into forwarding nodes temporarily during the course of propagation feedback to assist the terminal nodes by forwarding data. The Gateway 14 is mainly responsible for receiving feedback data.

This aforementioned method uses propagation feedback method to feed data back to the gateway 14. Even when the gateway 14 has not initiated routing of the terminal node 16 into the network, the terminal node 16 is able to initiate routing and add itself into the network. Data which need to be uploaded is associated with a Random ID of the terminal node 16 and the transmission link/route is an open loop, thus ensuring no broadcasting storm will happen.

In some embodiments, in addition to step S204 above, the particular ordinary node 12 will evaluate the signal strength of the propagation feedback request after receiving Propagation Feedback request. If the value of the signal strength is higher than a p re-determined threshold, the value of the signal strength will be added to the Propagation Feedback request.

An example of how the signal strength of the propagation feedback request is evaluated is made with reference to Fig. 4.

Referring to Fig. 4, the method of evaluating signal strength of a node 12

1 j commences with step S402 where a signal strength threshold R and a threshold N for a count of two-way communications for a signal-sending node is pre-determined. These parameters may be logged or maintained in a database or table within the node 12.

Further, in step S404, two variables n (i.e., a number of signals sent) and m (i.e., a number of signals received) is reset to 0 in the signal sending node. If first created, the two variables n and m may be initialized to a value of 0. These two variables may function as counters and are referred to as first and second counters for illustrative purpose.

In step S406, the signal-sending node sends a command to a signal-receiving node requesting the signal-receiving node to respond. Corresponding, the value of counter n increases by 1 , the signal-sending node then waits for response from signal receiving node.

In step S407, the signal-receiving node, after receiving the command from the signal-sending node, obtains the strength of the signal (hereinafter referred to as r1 ) received and compares the value of r1 and R in step S408. The signal receiving node will respond to the signal sending node if r1 is equal to or greater than R (r1 >=R). The signal receiving node will not respond if r1 is less than R (r1 < R) or the signal receiving node does not receive the command.

In step S410, the signal sending node, after receiving the response from the signal receiving node, obtains the strength of the signal received (r2) (step S412) and compares the value of r2 with R (step S414). If r2 is equal to or greater than R (i.e. r2>=R), the value of m is increased by 1 (step S416) and the process goes to step S418. Otherwise goes to step S418 directly without increasing the value of m.

In step S418, the value of n is compared with the value of N. If n is less than N, steps S404 to S418 are repeated. Otherwise go to step S420. In step S420, a communication success rate (P) and an average signal strength (Ar) is calculated according to the formula P=m/N, wherein Ar is the median value of the r1 obtained from successful communications.

In some embodiments of the invention, the calculation of the communication success rate P and the average signal strength Ar is performed by the signal sending node.

In other embodiments of the invention, the calculation of the communication success rate P and the average signal strength Ar is performed by the signal receiving node.

The method for evaluating signal quality may include the step of a 'wait-out', which includes the step of setting a predetermined time (t) that a signal sending node will wait before the response is received; the signal sending node will wait for the response until t has lapsed, the process goes to step S418 directly if t has lapsed.

In some embodiments wherein the calculation of the communication success rate P and the average signal strength Ar is performed by the signal sending node, the communication success rate (P) and the average signal strength (Ar) may be sent by the signal sending node to the signal receiving node (step S422) so that the signal sending node and the signal receiving node can share the communication success rate (P) and the average signal strength (Ar).

In some embodiments after step S204, if the value of the signal strength of the propagation feedback request is higher than a threshold value, the value of the signal strength will be added into the request for propagation feedback.This will be useful for further evaluation of signal strength and for determination of the most suitable propagation feedback route In an example, suppose a node A is trying to identify whether node B can be its lower level node, node A can apply the method in this example. Node A communicates with node B 1000 times, obtain the signal quality evaluation result between node A and node B. When evaluated signal quality results are used as basis to setup the wireless network, the communication success rate between different level of nodes and the stability of the network are ensured. This kind of frequent communication is only required when setting up the network. Once the network has been setup, these communications are no longer required and the network is considered as having been stabilized. In operation, one shall try to avoid carrying out signal quality evaluation when the network is in operation in order to reduce the risk of network traffic congestion.

In some embodiments, pursuant to step S208, the routes corresponding to a Random ID will be evaluated and only the shortest route will be recorded and sent to the respective terminal node. The selection of the shortest route may be based on shortest path algorithm as known to a skilled person.

In some embodiments, the step S204 may further comprise the step of checking a signal strength of the propagation feedback request wherein an ordinary node 12 or terminal node 16 will evaluate the signal strength after receiving the request for propagation feedback.

In some embodiments, the step S208 further comprises evaluating the distances of the routes available, wherein the gateway 14 operates to select the route with the shortest distance based on a shortest path algorithm for example, and sends the route to the terminal node.

Compared with existing technologies, there are the following advantages and benefits of the propagation feedback mechanism: The terminals in the present invention adopt a propagation feedback mechanism, thus the terminal nodes 16 are able to initiate routing and add themselves into a network and carry out the propagation feedback, even when the terminal nodes were originally not part of the network.

In some embodiments, once the terminal node 16 joins the network, information (which includes data packets, header information, multimedia content information etc.) may be passed between nodes within the network based on a propagation broadcasting method for low data rate wireless network. The method comprises four general steps including the creation of one or more forwarding node table (routing table); selecting a broadcasting node packages information and broadcasting the broadcast information/command to nearby nodes; receiving by a nearby node the broadcast information/command, wherein upon receiving the broadcast information/command, the nearby node will check whether itself is in the forwarding node table. If a particular node is not entered in the forwarding node table, the particular node will only analyse and execute the broadcast command without forwarding the command package; if the particular node has been entered in the forwarding node table, the node will not only execute the command package but also re-package the command and broadcast the repackaged command package to nearby nodes that has not received the command package.

In some embodiments, the command package may be in the format comprising an alphanumeric string representative of a transmission route; an identifier of the next node to send the command package to; an identifier representing the type of command; and the content of the command. The format may be supplemented by the necessary syntax or delimiter.

Once a node receives the command package, the repackaging may involve the node removing its node address/identifier from the command package.

When all the forwarding nodes in the forwarding node table has broadcasted the command package, the broadcasting will stop. With reference to Fig. 5 where multiple forwarding node tables are created, the method comprises step S502 which establish or create a plurality of forwarding node tables. A particular node table is then selected for the broadcast of a command package (step S504). The selected node table is then checked to see if it comprises one or more non-functioning forwarding node (step S506). If all the nodes within the selected node table are functioning, a broadcasting node is chosen from the selected node table to send the broadcast command package (step S508). If however there is one or more non-functioning forwarding node, another forwarding node table is selected (step S510 and repeat S506).

A nearby node which has received the broadcast command package checks whether it is within the forwarding node table (step S512). This may be achieved where the broadcast command package includes the forwarding node table. If the nearby node is deemed to be inside the forwarding node table, the nearby node analyses and executes the broadcast comment, repackages and forwards the broadcast command package to another nearby node (step S514). If the nearby node is not found within the forwarding node table, the nearby node merely analyses and executes the command package without repackaging and forwarding (step S516). The process ends where all the forwarding nodes within the forwarding node table have been executed and forwarded at least once (step S518).

In some embodiments, the gateway 14 or a node 12 may be utilized as a central control agent or device for achieving centralized control of the nodes in the area to be broadcasted. The central control device receives and processes information uploaded by the different nodes, decides and sends commands packages to the nodes. In some embodiments, when a node sends a broadcasting command package, the forwarding node table is included in the broadcasting command package so that all nodes have visibility of the forwarding node table. The forwarding node table may maintain multiple forwarding node entries according to the location of forwarding nodes in an area to be broadcasted to. The forwarding nodes are used to forward broadcasting commands/information. When classifying the forwarding nodes in the forwarding node table, the forwarding nodes should preferably be selected such that a broadcast command initiated by any node capable of broadcasting to other nodes in the vicinity is able to reach all nodes in the area or vicinity through the forwarding nodes in the forwarding table.

In some embodiments where a forwarding node table (routing table) is created or established, the forwarding node table maintains multiple forwarding node entries according to the location of forwarding nodes in an area to be broadcasted to. The forwarding nodes are used to forward broadcasting commands/information. When classifying the forwarding nodes in the forwarding node table, the forwarding nodes must be selected such that a broadcast command initiated by any node capable of broadcasting to other nodes in the vicinity is able to reach all nodes in the area or vicinity through the forwarding nodes in the forwarding table.

When selecting one or more forwarding nodes in the forwarding nodes table, any adjacent forwarding nodes should preferably be nodes within the range of direct point to point communication with each other. Some embodiments may include a plurality of the forwarding node tables. There must be at least one different forwarding node in any two of the plurality of the forwarding node tables.

It is to be appreciated that step S506 comprises checking whether there are any non-functioning forwarding nodes in the selected forwarding node table, if there is, another forwarding table will be selected and checked until a forwarding node table with all of its forwarding nodes functioning properly is identified. The process then goes to step S508. Otherwise, the process goes to step S508 directly. A way to check whether a forwarding node in the forwarding node table is functioning properly is to carry out a two-way communication with the respective forwarding node.

The embodiment includes a forwarding node table, and is able to broadcast information to an area with a minimum number of forwards, which accordingly saves the utilization time of channels and prevent channel congestion. The technical advantage of the present invention is achieved because only the dedicated forwarding nodes in the forwarding node table will re-broadcast the broadcasting commands; all other nodes will only receive, analyse and execute the broadcasting command without re-broadcasting/forwarding the same.

In some embodiments, before any nodes are added to a network to form the same, a self-setup method may be employed. The self-setup method is especially suited for a low data rate wireless network. It includes the following general steps of setting an identifier (ID) for nodes that are to be setup; choosing one node as an initiating node to initiate setting up the network; the initiating node searches for level 1 nodes, determined as 'premium' nodes based on success rate and stability of communication; identify whether all nodes may be used as level 1 nodes. If they are, the network setup process completes, otherwise the initiating node delegates immediate lower level nodes to search for the corresponding next lower level nodes. Once it has been checked that all nodes have established connection with the initiating node, then the network setup completes. Otherwise go back to delegating immediate lower level nodes to search for next lower level nodes again. Such an embodiment is utilized to prevent network traffic congestion from happening when setting up low data rate wireless network. It also reduces the risk of broadcast storm.

With reference to Fig. 6, an embodiment of the self-setup method is described as follows. The method commences with the step of setting or allocating an identifier to each node that are to be setup (step S602). A node is then selected or chosen to be an initiating node to initiate setting up the network (step S604). The identifier (ID) of all nodes that need to be setup and their empty routing tables may be stored a memory or database, as the case may be, to the initiating node. The initiating node then initiates communication with all nodes that need to be setup successively and searches for level 1 modes (step S606). A decision step S608 is taken to decide whether all nodes to be setup can be level 1 nodes, for example based on success rate and stability of communication. If it is determined that all the nodes that need to be setup are confirmed to be suitable as level 1 nodes, the respective nodes will be recorded in the routing table of the initiating node. The initiating node, at the same time, will send command to the respective nodes that the initiating node is the upper level node, any uploading will have to go through the initiating node. After the initiating node has communicated with all nodes that need to be setup and identified that all these nodes can be level 1 nodes, the setting up of the network completes (step S614).

If it is determined otherwise, the method goes to step S610, wherein the initiating node delegates one or more immediate lower level nodes to communicate with remaining nodes that need to be setup (the remaining nodes include all nodes except the initiating node and the already identified level 1 nodes) node by node. Depending on success rate and stability of communication with the level 1 nodes, nodes suitable for being used as the level 2 nodes for setting up the wireless network are identified. Level 1 nodes will then send information about level 2 nodes to the initiating node. The initiating node records the level 2 nodes into its routing table and sends command through the level 1 nodes to their respective level 2 nodes, informing a specific level 2 node that a specific level 1 node is the upper level node of this specific level 2 node. Any data uploading to the initiating node from this specific level 2 node has to be done through this specific level 1 node. Where there is a plurality of level 1 nodes, each capable of being an initiating node, the level 1 nodes will take turn, according to their node IDs, to communicate with the rest of the nodes that need to be setup. The rule may be based on an ascending or descending node ID for example. The 2nd (or the subsequent) level 1 node will only start communicating with the rest of the nodes that need to be setup after the 1st (or the previous) level 1 node has completed its communication with other nodes.

In step 612, the method performs a check to determine whether all nodes that need to be setup have established communication connection with the initiating node. If yes, then the network setup process completes (step S614); otherwise the process goes to step S610 and the lowest level nodes which have already been setup will continue searching for further lower level nodes. Step S610 and Step S612 are repeated until all nodes have established communication connection with the initiating node.

The steps to confirm the lower level nodes based on success rate and stability of communication may further include the following sub-steps:

Step a: a node (signal sending node), which is searching for lower level nodes, sends command in a successive manner to the nodes that need to be setup and have not yet established communication connection with the initiating node (signal-receiving node), and request for response from those signal-receiving nodes, wherein the signal-sending node will continuously send a command to a particular signal-receiving node N times. N is an integer that is equal or bigger than 5. N may be other arbitrary number.

Step b: the signal-receiving node, after receiving the command, analyses the command and sends response to the signal-sending node;

Step c: The count value of the signal receipt of the signal sending node will increase by 1 if the signal sending node receives response from the signal receiving node within a predetermined time frame.

Step d: after N times of sending command, a number of success communication (n) is obtained. Success rate (p) is defined as p=n/N. If p is equal or bigger than a pre-set success rate threshold (P), the signal receiving node is confirmed as a lower level node of the signal sending node, otherwise the signal receiving node is not considered a lower level node of the signal 5 sending node.

It may be appreciated that the above sub-steps are similar to the steps for determining signal strength. As an example, if the signal sending node sends commands to the signal receiving node continuously k times (3 <= k < N) io without receiving any response from the signal receiving node, it is then confirmed that the signal receiving node cannot be considered a lower level node of the signal sending node. The signal sending node then stops any communication with the signal receiving node. i s In some embodiments, N may be set to equal to 20 and the pre-set success rate threshold P is 90%.

It is to be appreciated that the described embodiments may be combined in various permutations to form further embodiments of systems and methods

20 for managing a network, in particular a low data rate wireless network or a low powered data network. For example, in various embodiment, the self-setup method as described with reference to Fig. 6 may be utilized to set up a network comprises a plurality of network nodes having different communication ability associated with each node; the method for establishing

25 connection as described with reference to Fig. 3 may be utilized for establishing connections (i.e. pairing) between network nodes; the method for evaluating signal strength as described in Fig. 4 may be utilized to evaluate a capability of a particular network node in sending and receiving information, and the forward propagation method described with reference to Fig. 5 may

30 be utilized to ensure that as many network nodes are functional within the network as possible. Together with the method for adding a terminal node to an existing network, various embodiments may either be combined to form various permutations to manage a network, or may work individually as enhancements to existing networks.

35

In the present invention, the routing is initiated by a terminal node. The 5 present invention therefore allows the terminal nodes to feedback to the gateway even when the route has been damaged, and hence improve usability and stability of the low data rate network.

The above is a description of embodiments of systems and methods for i o managing a network. It is envisioned that those skilled in the art can design alternative embodiments of this invention that falls within the scope of the invention. In particular, it is to be appreciated that features from various embodiment(s) may be combined to form one or more additional embodiments.

Claims

1 . A system for adding a terminal node to a network comprising

at least one network node arranged to receive and forward at least one request for propagation feedback, the at least one network node having an address identifier;

a gateway arranged to receive the at least one request for propagation feedback and a route of the at least one request for propagation feedback; the terminal node having a random identifier; the terminal node operable to initiate the request for propagation feedback;

wherein upon receipt of the propagation request feedback, the at least one network node appends the address identifier to the propagation request feedback and the terminal node appends the random identifier to the request for propagation feedback.

2. The system according to claim 1 , wherein the random identifier of the terminal node is a unique identifier.

3. The system according to claim 1 or 2, wherein upon receipt of the at least one request for propagation feedback, the at least one network node checks the random identifier to determine whether the at least one request for propagation has been sent to the at least one network node before.

4. The system according to claim 3, wherein upon determination that the at least one request for propagation has been sent to the at least one network node before, the at least one network node does not forward the at least one request for propagation toward the gateway.

5. The system according to claim 3 or 4, wherein upon determination that the at least one request for propagation has not been sent to the at least one network node before, the at least one network node forward the at least one request for propagation toward the gateway.

6. The system according to any one of the preceding claims, wherein upon receipt of the at least one request for propagation, the gateway records the random identifier of the terminal node and the route of the at least one request for propagation feedback.

7. The system according to claim 6, wherein the gateway sends the route of the at least one request for propagation feedback to the terminal node.

8. The system according to claim 7, wherein the terminal node records the route upon receipt.

9. The system according to any one of the preceding claims, wherein the network is a low power wireless network.

10. The system according to any of the preceding claims, wherein the at least one network node is configured to evaluate the signal strength of an adjacent network node after receiving the request for propagation feedback.

1 1 . The system according to claim 10, wherein the value of the signal strength is appended to the request for propagation feedback.

12. The system according to any of the preceding claims, wherein the gateway operates to select the route with the shortest distance based on a shortest path algorithm.

13. A method for adding a terminal node to a network comprising

a. generating a random identifier;

b. appending the random identifier to a request for propagation feedback;

c. forwarding the request for propagation feedback to at least one network node; and

d. appending an address identifier of the at least one network node to the request for propagation feedback;

wherein steps c to d are repeated until the request for propagation feedback is forwarded to a gateway.

14. The method according to claim 13, wherein the random identifier of the terminal node is a unique identifier.

15. The method according to claim 13 or 14, further including the step of checking the random identifier to determine whether the at least one request for propagation has been sent to the at least one network node before.

16. The method according to claim 15, wherein upon determination that the at least one request for propagation has been sent to the at least one network node before, the at least one network node does not forward the at least one request for propagation toward the gateway.

17. The method according to claim 5 or 16, wherein upon determination that the at least one request for propagation has not been sent to the at least one network node before, the at least one network node forward the at least one request for propagation toward the gateway.

18. The method according to any one of claims 13 to 17, wherein upon receipt of the at least one request for propagation, the gateway records the random identifier of the terminal node and the route of the at least one request for propagation feedback.

19. The method according to claim 18, further including the step of sending the route of the at least one request for propagation feedback to the terminal node by the gateway.

20. The method according to claim 19, wherein the terminal node records the route upon receipt.

21 . The method according to any one of claims 13 to 20, wherein the network is a low power wireless network.

22. The method according any of claims 13 to 21 , wherein the at least one network node is configured to evaluate the signal strength of an adjacent network node after receiving the request for propagation feedback.

23. The method according to claim 13, wherein the value of the signal strength is appended to the request for propagation feedback.

24. The method according to any of claims 13 to 23, wherein the gateway operates to select the route with the shortest distance based on a shortest path algorithm.

25. A system for managing a network comprising a plurality of network nodes, the system comprising

a network manager for assigning identifiers to the plurality of network nodes; the network manager further operates select a first network node from the plurality of network nodes;

the first node comprises a wireless communication means to detect other nodes within the plurality of nodes and determine whether each of the detected other nodes can directly establish a connection with the first node; wherein a detected other node that established connection with the first node is selected as a second node if there exists at least one detected node that cannot establish a connection with the first node; and the second node operates to determine whether each of the other nodes can directly establish a connection with the second node.

26. The system according to claim 25, wherein each network node comprises maintains a forwarding node table, and the network node operates to broadcast a command package to each of the node in the forwarding node table.

27. The system according to claim 25, wherein at least one of the network nodes operates to send a request to establish communication with an another network node, wherein the request to establish communication comprises a pre-set signal strength threshold R.

28. The system according to claim 27, wherein the at least one of the network nodes starts a countdown timer after the request to establish communication is sent.

29. The system according to claim 27 or 28, wherein upon receipt of the request to establish communication, the another network node determines the actual signal strength received and compares the actual signal strength with the pre-set signal strength parameter R.

30. The system according to claim 25, wherein at least one network node of the plurality of network node is configured to maintain a first counter for number of data packets sent and a second counter for the number of data packets received.