NETWORK ARCHITECTURE

• US 20110267981A1
• Filed: 05/06/2011
• Published: 11/03/2011
• Est. Priority Date: 02/16/2004
• Status: Abandoned Application

• Current Assignee: Christopher Michael Davies
• Original Assignee: Christopher Michael Davies
• Inventors: DAVIES, Christopher Michael
• Application Number:
  US13/102,169
• Publication Number:
  US 20110267981A1
• Time in Patent Office: Days
• US Class Current: 370/255
• CPC Class Codes: H04L 45/02 Topology update or discovery
• CPC Class Codes: H04L 45/121 by minimising delays
• CPC Class Codes: H04W 28/06 Optimizing the usage of the radio link, e.g. header compression, information sizing , discarding information system modifying transmission characteristic according to link quality by modifying frame length H04L1/0007; dynamic adaptation of the packet size for flow control or congestion control H04L47/365
• CPC Class Codes: H04W 28/10 Flow control between communication endpoints
• CPC Class Codes: H04W 28/14 using intermediate storage
• CPC Class Codes: H04W 40/04 based on wireless node resources
• CPC Class Codes: H04W 8/18 Processing of user or subscriber data, e.g. subscribed services, user preferences or user profiles; Transfer of user or subscriber data
• CPC Class Codes: H04W 8/26 Network addressing or numbering for mobility support
• CPC Class Codes: H04W 84/18 Self-organising networks, e.g. ad-hoc networks or sensor networks

Abstract

The present invention provides a network architecture. An embodiment includes a plurality of nodes interconnected by links. Each node can maintain knowledge of other nodes in a database. The database contains a list of other nodes in the network, and a ‘next-best-step’ for each of those other nodes, pointing to a neighbouring node that is the next best step to that other node. Where a particular node of the network is not in the list, then the next-best-step is assumed to be the next-best-step most commonly identified in the database. Such a network will form a “core” wherein any node in the network can find any other node in the network by first seeking out that other node at the core. Once the nodes locate each other via the core, a more optimum route forms in the network according to the most desirable path between those nodes.

Claims

1. A computer readable medium for storing a set of programming instructions for execution by, or on behalf of, a first node on a self-organizing network having a plurality of nodes and at least one link interconnecting each of said nodes, said instructions causing a computing apparatus to identify the route between a source node and a destination node, wherein said instructions further cause the computing apparatus to send route updates about said destination node on a relatively more frequent basis the closer that said first node is to the route between said source node and said destination node.

2. The computer readable medium as claimed in claim 1 wherein said instructions further cause the computing apparatus to identify the proximity of said first node to the identified route between said source node and said destination node.

3. The computer readable medium as claimed in claim 1 wherein said node on the identified route between a source node and destination node will set the importance value of said destination node to a predefined value.

4. The computer readable medium as claimed in claim 3 where the predefined value is the highest importance value possible.

5. A computer readable medium for storing a set of programming instructions for execution by, or on behalf of, a first node on a self-organizing network having a plurality of nodes and at least one link interconnecting each of said nodes, said instructions causing a computing apparatus to assign an importance value to updates that are to be sent over said network, wherein said instructions further cause the computing apparatus to communicate to other nodes that said first node wishes only to receive a predetermined number of updates with the highest importance values.

6. The computer readable medium as claimed in claim 5 wherein said importance value is determined by how close said first node is to a specified data path or specified structure in the network.

7. The computer readable medium as claimed in claim 5 wherein said instructions further cause the computing apparatus to assign a hop cost value to updates that are to be sent over said network.

8. The computer readable medium as claimed in claim 7 wherein said hop cost value for a particular destination node is determined by an accumulation of service characteristics on the route from said node to said destination node.

9. The computer readable medium as claimed in claim 7 wherein said instructions further cause the computing apparatus to communicate to other nodes that said first node wishes only to receive updates that have or exceed a predetermined importance value.

10. A computer readable medium for storing a set of programming instructions for execution by, or on behalf of, a first node on a self-organizing network having a plurality of nodes and at least one link interconnecting each of said nodes, said instructions causing a computing apparatus to forward messages from a source node to a destination node via neighbors depending on the latency to the destination node via said neighbors, wherein messages for a destination node are not sent to a neighbor node when the neighbor node is in a specified state regarding messages for said destination node.

11. The computer readable medium as claimed in claim 10 wherein the latency of the internal message queue of messages for a destination node is used to decide which neighbor messages for said destination node should be sent to.

12. The computer readable medium as claimed in claim 11 wherein messages for a destination node are sent to a neighbor node if the latency to said destination node from said neighbor node is equal or less then the latency of the message queue for messages being sent to said destination node.

13. The computer readable medium as claimed in claim 12 wherein messages for a destination node are not sent to a neighbor node when the neighbor node can not process an increased volume of messages for said destination node.

14. A self-organizing network comprising:

(a) a plurality of nodes;

(b) at least one link interconnecting neighbouring ones of said nodes;

(c) each of said nodes being operable to maintain information about each of said other nodes that is within a first portion of said nodes, said information including;

(i) a first identity of another one of said nodes within said first portion;

(ii) for each first identity, a second identity representing a neighbouring node that is a desired step to reach the said another one of said nodes respective to said first identity;

(d) each of said nodes being operable to maintain a third identity representing a neighbouring node that is a desired step to send a request for information about said nodes in a second portion of said nodes that is not included in said first portion,

wherein a network core is formed between neighbouring nodes that determine each other is a desired step to locate said nodes within said second portion.

15. The network of claim 14 wherein said information includes, for each said first identity, a value representing a distance-to-data marked stream for said node associated with said first identity.

16. The network of claim 15 wherein nodes associated with said first identity are ranked in an ascending order increasing according to said distance and said instructions are delivered to those nodes according to said rank.

17. A computer readable medium for storing a set of programming instructions for execution by, or on behalf of, a node forming part of a self-organizing network having a plurality of other nodes and at least one link interconnecting neighbouring ones of said nodes;

said programming instructions for causing a computing apparatus within said node to maintain information about each of said other nodes that are within a first portion of all of said other nodes, said information including;

(a) a first identity of another one of said nodes within said first portion;

(i) for each said first identity, a second identity representing a neighbouring node that is a desired step to reach the said another one of said nodes respective to said first identity;

 

said programming instructions for further causing said computing apparatus to maintain a third identity representing a neighbouring node that is a desired step to send a request for information about said nodes in a second portion of said nodes that are not included in said first portion and said programming instructions causing a computer apparatus to assign a value to said first node that can be taken into account during the selection of parent nodes in said network; and

wherein said third identity is determined based on which of said neighbouring nodes most frequently appears in each said second identity.

18. The computer readable medium of claim 17 wherein for each said first identity said value represents a distance-to-data marked stream for said node associated with said first identity.

19. The computer readable medium of claim 18 wherein nodes associated with said first identity are ranked in an ascending order increasing according to said distance and said instructions are delivered to those nodes according to said rank.

20. A computer readable medium for storing a set of programming instructions for execution by, or on behalf of, a first node on a self-organizing network having a plurality of nodes and at least one link interconnecting said nodes, said instructions causing a computing apparatus to select and remove information about one or more missing nodes in said network by delaying the sending of predetermined classes of updates to said network where a node update is delayed before being sent to a neighbor node if an update about said node has not been previously sent to said neighbor.

21. A computer readable medium for storing a set of programming instructions for execution by, or on behalf of, a first node on a self-organizing network having a plurality of nodes and at least one link interconnecting said nodes, said instructions causing a computing apparatus to select and remove information about one or more missing nodes in said network by delaying the sending of predetermined classes of updates to said network where a node update is delayed before being sent to a neighbor node if the previous update about said node sent to said neighbor belongs to a predetermined class of updates.

22. The computer readable medium as claimed in claim 21 where said predetermined class is a node update where said update indicates that no route is possible via said sending node.