The patent badge is an abbreviated version of the USPTO patent document. The patent badge does contain a link to the full patent document.

The patent badge is an abbreviated version of the USPTO patent document. The patent badge covers the following: Patent number, Date patent was issued, Date patent was filed, Title of the patent, Applicant, Inventor, Assignee, Attorney firm, Primary examiner, Assistant examiner, CPCs, and Abstract. The patent badge does contain a link to the full patent document (in Adobe Acrobat format, aka pdf). To download or print any patent click here.

Date of Patent:
Dec. 14, 2010

Filed:

Mar. 01, 2007
Applicants:

Tinku Mohamed-rasheed, Trento, IT;

Yvon Gourhant, Lannion, FR;

Laurent Reynaud, Trevou-Treguignec, FR;

Inventors:

Tinku Mohamed-Rasheed, Trento, IT;

Yvon Gourhant, Lannion, FR;

Laurent Reynaud, Trevou-Treguignec, FR;

Assignee:

France Telecom, Paris, FR;

Attorney:
Primary Examiner:
Assistant Examiner:
Int. Cl.
CPC ...
H04L 12/28 (2006.01);
U.S. Cl.
CPC ...
Abstract

A method of organizing nodes of a network into clusters of nodes comprises a step () of calculating, for each node, a weight, representing the aptness of this node to be the master node of a grouping, and a step () of electing a master node of a grouping, such that the weight of this master node is greater than or equal to the weights of the other nodes of the grouping. The method furthermore comprises a step () of storing, in each node, an information cue () containing an identifier of the node of highest weight known by this node and the value of this highest weight, a step () of transmitting, by each node to nodes adjacent to this node, the information cue () stored in this node, and a step () of comparing, for each node, the information cues () transmitted to this node during the transmitting step () with the information cue stored in this node, so as to determine a new node of highest weight known by this node. The steps of storing (), transmitting () and comparing () are repeated successively a predetermined number (k) of times, on conclusion of which the step () of electing a master node is carried out, in the course of which a node (M) whose stored information cue contains its own identifier is chosen to be a master node.


Find Patent Forward Citations

Loading…