Self-organizing network

• US 6,028,857 A
• Filed: 07/25/1997
• Issued: 02/22/2000
• Est. Priority Date: 07/25/1997
• Status: Expired due to Term

• Current Assignee: Massachusetts Institute of Technology
• Original Assignee: Massachusetts Institute of Technology
• Inventors: Poor, Robert D.
• Primary Examiner(s): Ton, Dang
• Assistant Examiner(s): Ho, Tuan Q.
• Application Number:
  US08/899,782
• Time in Patent Office: 942 Days
• Field of Search: 370/351, 370/252, 370/254, 370/256, 370/349, 370/350, 370/389, 370/352, 370/353, 370/395, 370/400, 370/392, 455/445
• US Class Current: 370/351
• CPC Class Codes: H04L 45/02 Topology update or discovery
• CPC Class Codes: H04L 45/20 Hop count for routing purposes, e.g. TTL
• CPC Class Codes: H04L 45/26 Route discovery packet
• CPC Class Codes: H04L 45/36 Backward learning
• CPC Class Codes: H04M 15/00 Arrangements for metering, time-control or time indication ; Metering, charging or billing arrangements for voice wireline or wireless communications, e.g. VoIP
• CPC Class Codes: H04M 2215/0168 On line or real-time flexible customization or negotiation according to wishes of subscriber
• CPC Class Codes: H04W 4/24 Accounting or billing
• CPC Class Codes: H04W 40/34 Modification of an existing route
• CPC Class Codes: H04W 8/26 Network addressing or numbering for mobility support

Abstract

A self-organizing wireless network includes a plurality of nodes, each of which is configured to originate messages, be a destination of messages and relay messages. Each message is transmitted in a frame that includes the cost of conveying the message to the destination node for the message and also the cost so far expended in the conveying of the message. Each time the message frame is transmitted, either by the originating node or by a relaying node, the node ascertains whether the cost to convey the message from that node to the destination node is less than the conveying cost contained in the received frame. If it is, the node retransmits the frame after having incremented the incurred cost by the relay cost of that node and decremented the cost to convey by the same value. Otherwise the node discards the message.

Claims

1. A network comprising a plurality of nodes, each node including transmitting means and receiving means, the transmitting means including:

A) a routing table containing a plurality of entries, each entry corresponding to another node in the network and containing the cost of transmission to that other node,

B) means for forming message frames for transmission of messages to destination nodes, each frame including;

1. a message

2. the identity of the destination node for the message,

3. the identification of the node that originated the message,

4. the cost of conveying of the message to the destination node, and

5. the cost so far incurred in conveying of the message from the originating node to the destination node.

2. The network defined in claim 1 in which each node further includes means for receiving messages transmitted from other nodes, said receiving means including means for:

A) if the destination node identified in a received massage frame is not the identity of the node, and

B) if the routing table in the node contains an entry, corresponding to the destination node, that indicates that the cost of the transmission to the destination node is less than the cost of conveying contained in the message frame;

1. updating the message frame by incrementing the incurred cost in the message frame by a relay cost associated with the receiving node;

2. updating the message frame by decrementing the cost of conveying the message frame to the destination by the relay cost; and

3. causing the message to be retransmitted from the node.

3. The system defined in claim 2 in which

A) each frame includes a sequence number corresponding to the sequence of messages transmitted from the originating node;

and

B) each routing entry table contains at least the most recent sequence number of messages received by the node from the node to which the table entry corresponds and

C) each node includes means for inhibiting retransmission of a message in which the sequence number equals a sequence number contained in the routing table entry corresponding to the node identified in the message frame as the originating node.