 Currency trading system, methods, and software |
| OF PREFERRED EMBODIMENTS The Currency Trading System of a preferred embodiment (hereinafter "T... |
|
| System and method for multiple asynchronous text chat conversations |
| Terminology It proves useful to introduce a set of terms as a basis for the detailed description ... |
|
| Virtual directory |
| FIG. 1 is a network schematic of an embodiment of a virtual directory system ("VDS") 10. VDS 10 is ... |
|
| Method for graph-based table recognition |
| The present invention is directed to a method for document structure recognition based on a graph ... |
|
| Contents-based video story browsing system |
| OF PREFERRED EMBODIMENT Reference will now be made in detail to the preferred embodiments of the ... |
|
| Fundamental entity-relationship models for the generic audio visual data signal description |
| An object of the present invention is to provide content description schemes for generic multimedia ... |
|
| Method and apparatus for identifying words described in a page description language file |
| The present invention provides a method and apparatus for identifying words stored in a page ... |
|
| Intelligent compilation of procedural functions for query processing systems |
| To overcome the limitations in the prior art described above, and to overcome other limitations ... |
|
| Network switch using network processor and methods |
| One purpose of this invention is to provide a scalable switch architecture for use in a data ... |
|
| Transform processor system having reduced processing bandwith |
| The present invention is generally directed to various levels of features; including display ... |
|
|
Self-organizing network
| Details |
Inventors: Poor, Robert D.;
Assignee: Massachusetts Institute of Technology (Cambridge, MA)
Primary Examiner: Ton; Dang
Assistant Examiner: Ho; Tuan Q.
Attorney, Agent or Firm: Cesari and McKenna
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. |
|
DETAILED DESCRIPTION A network incorporating the invention is a wireless network that uses an ad-hoc "contour" routing algorithm which allows a message to reach its destination, even when the network topology is incompletely described or rapidly changing.
The nodes do not maintain routing tables, but rather cost tables that indicate the "costs" of transmission to other nodes in the network.
For example, assume that node A is separate from node B by several intermediate nodes and that node A is to send a message to node B.
Node A cannot reach node B directly.
However, it has stored information from previously received messages that node B is four hops away.
Node A sends the message to all its neighbors, the message being encapsulated in a network level frame that says, in effect, "forward this message to node B if you can do so in fewer than four hops.
" All of node A's immediate neighbors receive the message, since the RF transmissions are essentially omnidirectional, but only those nodes that are "closer" to node B will be able to deliver the message in three hops or fewer.
Those that are "farther away" would require five hops, for example.
Thus, those neighbors that are "on the way" to node B relay the message.
In this case the message is encased in a frame that says, in effect, "forward this message to node B if you can do so in two hops or fewer".
The process continues until the message reaches node B.
With this process, the intermediate nodes between node A and node B can also keep track of the return path to node A.
When originating node A transmits the message, each of its neighbors makes an entry in a cost table to the effect that node A is one hop away.
The cost tables in the second tier of intermediate nodes are updated with entries to note that node A is two hops away.
This process continues, so that by the time the message arrives at its destination, node B and all the intermediate nodes have retained entries indicating the number of hops to send a message to node A.
As stated above, each of the nodes maintains a table of the number of hops to each of the other nodes in the system
|
| Related patents |
|
|
VLAN frame format
OF THE EMBODIMENTS OF THE INVENTION Described herein is a method and frame format for preserving in a data frame the virtual local area network (VLAN) associated with ...
|
|
|
Method for managing pages of a designated memory object according to selected memory management policies
In general, in a first aspect, the invention features a method for use in a computer. A user of the computer stores a selection in a permanent memory structure, ...
|
|
|
Integrated multidimensional database
Overview A multi-user, computer-implemented database (DA) allows laboratory (lab) researchers to plan, implement, manage, track, review, and interpret research within ...
|
|
|
System for electronically managing, finding, and/or displaying biomolecular interactions
What is claimed is: 1. A system for electronically managing, finding, and/or visualizing biomolecular interactions comprising a computer system including at least one ...
|
|
|
File management method and program that manage multiple files as single combination file
The present invention is created in order to resolve the problem identified above, and an object thereof is to provide a file management program, a computer-readable ...
|
|
|
Bios storage array
In the following detailed description, numerous specific details are described in order to provide a thorough understanding of the invention. However, the present ...
|
|
|
Optimization of information bases
The following Detailed Description begins with an overview of the invention and then proceeds to a detailed description of a preferred embodiment thereof. OVERVIEW OF TH...
|
|
|
Apparatus and method for checking microcode with a generated restriction checker
The present invention enables a restriction checker generator to be provided for generating a restriction checker for checking microcode instructions, each comprising a ...
|
|
|
Apparatuses, methods, computer programming, and propagated signals for modeling motion in computer applications
OF PREFERRED EMBODIMENTS . . . 6.1 OVERVIEW . . . 6.1.1 The OpenMotion System . . . 6.1.2 The API And Its Relation To Application, Modeling, and Rendering Programs . . ....
|
|
|
On-line transaction processing system for security trading
To achieve the objects and in accordance with the purpose of the invention embodied and broadly described herein, the present invention includes a method of customizing ...
|
|
|
File Sharing 
