WIPO logo
Mobile | Deutsch | Español | Français | 日本語 | 한국어 | Português | Русский | 中文 | العربية |
PATENTSCOPE

Search International and National Patent Collections
World Intellectual Property Organization
Options
Query Language
Stem
Sort by:
List Length
Latest bibliographic data on file with the International Bureau   

Pub. No.: WO/1999/005829 International Application No.: PCT/US1998/015345
Publication Date: 04.02.1999 International Filing Date: 23.07.1998
Chapter 2 Demand Filed: 12.02.1999
IPC:
H04L 12/56 (2006.01)
H ELECTRICITY
04
ELECTRIC COMMUNICATION TECHNIQUE
L
TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
12
Data switching networks
54
Store-and-forward switching systems
56
Packet switching systems
Applicants: MASSACHUSETTS INSTITUTE OF TECHNOLOGY[US/US]; 77 Massachusetts Avenue Cambridge, MA 02139, US
Inventors: POOR, Robert; US
Agent: CESARI, Robert, A. ; Cesari and McKenna, LLP 30 Rowes Wharf Boston, MA 02110, US
Priority Data:
08/899,78225.07.1997US
Title (EN) COST BASED ROUTING PROTOCOL
(FR) PROTOCOLE D'ACHEMINEMENT FONDE SUR LE COUT
Abstract:
(EN) A wireless network in which each message transmitted by a node is received by all the neighboring nodes. Each node maintains a table containing entries specifying the cost of transmission from that node to each of the other nodes in the network. Each message frame includes a field containing the remaining cost of transmission of the frame to the destination node for the message. When a node receives a message frame for which it is not the destination it compares the remaining cost with the cost contained in the table entry for the destination node. If the table entry cost is less than the remaining cost, the node decrements the remaining cost and retransmits the frame. Otherwise it discards the frame.
(FR) L'invention concerne un réseau sans fil dans lequel chaque message transmis par un noeud est reçu par tous les noeuds avoisinants. Chaque noeud tient une table contenant des entrées spécifiant le coût de la transmission entre ce noeud et chaque autre noeud du réseau. Chaque trame de message comprend un champ contenant le coût de transmission restant pour acheminer la trame vers le noeud destinataire. Lorsqu'un noeud reçoit une trame de message dont il n'est pas destinataire, il compare de coût restant avec le coût inscrit dans la table pour le noeud destinataire. Si le coût entré dans la table est inférieur au coût restant, le noeud décrémente le coût restant et retransmet la trame. Si tel n'est pas le cas, il élimine la trame.
front page image
Designated States: AL, AU, BA, BB, BG, BR, CA, CN, CU, CZ, EE, GE, HU, ID, IL, IS, JP, KP, KR, LC, LK, LR, LT, LV, MG, MK, MN, MX, NO, NZ, PL, RO, SG, SI, SK, SL, TR, TT, UA, UZ, VN, YU
African Regional Intellectual Property Organization (ARIPO) (GH, GM, KE, LS, MW, SD, SZ, UG, ZW)
Eurasian Patent Office (AM, AZ, BY, KG, KZ, MD, RU, TJ, TM)
European Patent Office (EPO) (AT, BE, CH, CY, DE, DK, ES, FI, FR, GB, GR, IE, IT, LU, MC, NL, PT, SE)
African Intellectual Property Organization (BF, BJ, CF, CG, CI, CM, GA, GN, GW, ML, MR, NE, SN, TD, TG)
Publication Language: English (EN)
Filing Language: English (EN)