| 摘要: |
| 首先指出了Ad Hoe分群网络中节点故障对网络的影响，着重分析了群首节点、网关节点发生故障时所导致的网络分割，使得通信受阻，并针对这一现象提出了重新选举关键节点的补偿算法，最后对补偿前后的网络性能进行仿真、比较，结果表明采用这一算法的网络有较好的鲁棒性，性能明显优于补偿前。 |
| 关键词: Ad Hoc分群网络 群首节点 网关节点 补偿算法 鲁棒性 |
| DOI：10.3969/j.issn.1001-893X. |
| Received:July 22, 2005Revised:September 30, 2005 |
| 基金项目: |
|
| A Re-election Algorithm for Nodes Failure in Cluster-Based Ad Hoc Networks |
|
| () |
| Abstract: |
| The influence of nodes failure on the Ad Hoe network is described with emphasis on the disconnection caused by failure of cluster - heads or gateway nodes. To solve this problem, a re - election algorithm is presented, and the result of simulation and comparison shows that the network with robustness has obvious advantage over what it was. |
| Key words: cluster - based Ad Hoe network cluster - heads gateway nodes re - election algorithm robustness |
