发明申请
US20090190496A1 Method of Organizing Nodes of a Network into Groupings of Nodes, Computer Program for Implementing such a Method and Communication Device Forming a Node of a Network of Nodes 有权
将网络节点组织成节点组合的方法,用于实现这样的方法的计算机程序和形成节点网络的节点的通信设备

  • 专利标题: Method of Organizing Nodes of a Network into Groupings of Nodes, Computer Program for Implementing such a Method and Communication Device Forming a Node of a Network of Nodes
  • 专利标题(中): 将网络节点组织成节点组合的方法,用于实现这样的方法的计算机程序和形成节点网络的节点的通信设备
  • 申请号: US12281617
    申请日: 2007-03-01
  • 公开(公告)号: US20090190496A1
    公开(公告)日: 2009-07-30
  • 发明人: Tinku Mohamed-RasheedYvon GourhantLaurent Reynaud
  • 申请人: Tinku Mohamed-RasheedYvon GourhantLaurent Reynaud
  • 申请人地址: FR Paris
  • 专利权人: FRANCE TELECOM
  • 当前专利权人: FRANCE TELECOM
  • 当前专利权人地址: FR Paris
  • 优先权: FR0601927 20060303
  • 国际申请: PCT/FR2007/050862 WO 20070301
  • 主分类号: H04L12/28
  • IPC分类号: H04L12/28
Method of Organizing Nodes of a Network into Groupings of Nodes, Computer Program for Implementing such a Method and Communication Device Forming a Node of a Network of Nodes
摘要:
A method of organizing nodes of a network into clusters of nodes comprises a step (130) of calculating, for each node, a weight, representing the aptness of this node to be the master node of a grouping, and a step (190) 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 (140 180) of storing, in each node, an information cue (14) containing an identifier of the node of highest weight known by this node and the value of this highest weight, a step (150) of transmitting, by each node to nodes adjacent to this node, the information cue (14) stored in this node, and a step (170) of comparing, for each node, the information cues (14) transmitted to this node during the transmitting step (150) 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 (180), transmitting (150) and comparing (170) are repeated successively a predetermined number (k) of times, on conclusion of which the step (190) 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.
信息查询
0/0