 |
|
|
|
|
|
 Title: |
US6028857:
Self-organizing network
[ Derwent Title ]
|
| Country: |
US United States of America
|
| |
| Inventor: |
Poor, Robert D.; Cambridge, MA
|
| Assignee: |
Massachusetts Institute of Technology, Cambridge, MA
other patents from MASSACHUSETTS INSTITUTE OF TECHNOLOGY (357270) (approx. 2,706)
News, Profiles, Stocks and More about this company
|
| Published / Filed: |
2000-02-22
/ 1997-07-25
|
| Application Number: |
US1997000899782
|
| IPC Code: |
Advanced:
H04L 12/28;
H04L 12/56;
H04M 15/00;
IPC-7:
H04J 3/24;
|
| ECLA Code: |
H04L45/02; H04L45/20; H04L45/26; H04L45/36; H04M15/00; T04M215/01L; T04W4/24; T04W8/26; T04W40/34;
|
| U.S. Class: |
Current:
370/351;
370/400;
Original:
370/351;
370/400;
|
| Field of Search: |
370/351,252,254,256,349,350,389,352,353,395,400,392
455/445
|
| Priority Number: |
| 1997-07-25 |
US1997000899782 |
|
| 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.
|
| Attorney, Agent or Firm: |
Cesari and McKenna ;
|
| Primary / Asst. Examiners: |
Ton, Dang; Ho, Tuan Q.
|
| INPADOC Legal Status: |
Show legal status actions
Family Legal Status Report
|
| Designated Country: |
AL AP BA BB BG BR CA CN CU CZ EA EE EP GE HU ID IL IS JP KP KR LC LK LR LT LV MG MK MN MX NO NZ OA PL RO SG SI SK SL
|
| Family: |
Show 3 known family members
|
First Claim:
Show all 3 claims |
What is claimed is:
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:
- 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.
|
| Background / Summary: |
Show background / summary
|
| Drawing Descriptions: |
Show drawing descriptions
|
| Description: |
Show description
|
| Forward References: |
Show 129 U.S. patent(s) that reference this one
|
|
|
|
|
|
|
| Foreign References: |
None
|
| Other Abstract Info: |
DERABS G1999-143364
|
| Other References: |
Radia Perlman, Interconnections: Bridges and Routers, pp. 211-223.
Dube R. et al. "Signal Stability-Based Adaptive Routing (SSA) For Ad Hoc Mobile Networks", IEEE Personal Communications, Vo. 4, No. 1, Feb. 1997, pp. 36-45,.
(10 pages)
Cited by 6 patents
[ISI abstract]
Balasubramanian Rajogopalan et al. "A New Responsive Distrubted Shortest-Path Routing Algorithm*", Computer Communcations Review, Vo. 19, No. 4, Sep. 1, 1989, pp. 237-246.
|
|
 Nominate this for the Gallery...
|
|
