Network architecture

• US 7,961,650 B2
• Filed: 02/16/2005
• Issued: 06/14/2011
• Est. Priority Date: 02/16/2004
• Status: Active Grant

• Current Assignee: Christopher Michael Davies
• Original Assignee: Christopher Michael Davies
• Inventors: Davies, Christopher Michael
• Primary Examiner(s): Ton; Dang T
• Assistant Examiner(s): Zhao; Wei
• Application Number:
  US10/598,020
• Publication Number:
  US 20070286097A1
• Time in Patent Office: 2,309 Days
• Field of Search: 370/255, 709/243, 709/239, 455/566
• 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 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 other node 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 said third identity is determined based on which of said neighbouring nodes most frequently appears in each said second identity.

2. The network of claim 1 wherein each of said nodes is operable to exchange said information with its neighbouring nodes.

3. The network of claim 1 wherein said at least one link has a set of service characteristics such that any path between two of said nodes has a cumulative set of service characteristics.

4. The network of claim 3 wherein said information includes said cumulative set;

and said desired step associated with said second identity is based on which of said paths has a desired cumulative set of service characteristics.

5. The network of claim 3 wherein said service characteristics include at least one of bandwidth, latency and bit error rate.

6. The network of claim 1 wherein said nodes are at least one of computers, telephones, sensors, personal digital assistants.

7. The network of claim 1 wherein said at least one link is based on a wireless connection.

8. The network of claim 1 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.

9. The network of claim 8 wherein each said node is operable to deliver instructions to other nodes between said core and itself to maintain information about itself.

10. The network of claim 8 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.

11. The network of claim 10 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.

12. The network of claim 1 comprising at least 2,000 nodes interconnected by a plurality of links.

13. The network of claim 1 comprising at least 5,000 nodes interconnected by a plurality of links.

14. The network of claim 1 comprising at least 10,000 nodes interconnected by a plurality of links.

15. The network of claim 1 comprising at least 100,000 nodes interconnected by a plurality of links.

16. A computer readable medium, non-transitory storage 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

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

17. The computer readable medium of claim 16 wherein each of said nodes is operable to exchange said information with its neighbouring nodes.

18. The computer readable medium of claim 16 wherein said at least one link has a set of service characteristics such that any path between two of said nodes has a cumulative set of service characteristics.

19. The computer readable medium of claim 18 wherein said information includes said cumulative set;

and said desired step associated with said second identity is based on which of said paths has a desired cumulative set of the service characteristics.

20. The computer readable medium of claim 18 wherein said service characteristics include bandwidth.

21. The computer readable medium of claim 18 wherein said service characteristics include latency.

22. The computer readable medium of claim 18 wherein said service characteristics include bit error rate.

23. The computer readable medium of claim 16 wherein said nodes are computers.

24. The computer readable medium of claim 16 wherein said nodes are telephones.

25. The computer readable medium of claim 16 wherein said nodes are sensors.

26. The computer readable medium of claim 16 wherein said nodes are personal digital assistants.

27. The computer readable medium of claim 16 wherein said at least one link is based on wireless connections.

28. The computer readable medium of claim 16 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.

29. The computer readable medium of claim 28 wherein each said node is operable to deliver instructions to other nodes between said core and itself to maintain information about itself.

30. The computer readable medium of claim 28 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.

31. The computer readable medium of claim 30 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.

32. The computer readable medium of claim 16 comprising at least 2,000 nodes interconnected by a plurality of links.

33. The computer readable medium of claim 16 comprising at least 5,000 nodes interconnected by a plurality of links.

34. The computer readable medium of claim 16 comprising at least 10,000 nodes interconnected by a plurality of links.

35. The computer readable medium of claim 16 comprising at least 100,000 nodes interconnected by a plurality of links.