Improving method of MPR algorithm
The invention discloses an improving method of MPR algorithm, wherein a multi-point relay (MPR) node is selected based on a plurality of maximum covering nodes, and link status and node status are added as judging basis, and the node having the maximum coverage and the best status is selected as the...
Gespeichert in:
Hauptverfasser: | , , , |
---|---|
Format: | Patent |
Sprache: | chi ; eng |
Schlagworte: | |
Online-Zugang: | Volltext bestellen |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | The invention discloses an improving method of MPR algorithm, wherein a multi-point relay (MPR) node is selected based on a plurality of maximum covering nodes, and link status and node status are added as judging basis, and the node having the maximum coverage and the best status is selected as the MPR node; the link status can be measured by link bandwidth, link time delay and link packet loss ratio; the node status can be measured by one index or a plurality of indexes among the calculating capability of the neighbor node, the residual energy, and the node load. The invention is advantageous in that on the basis of guaranteeing the maximum coverage, the MPR can select the node of best status, and thereby the network performance can be better.
本发明公开了种MPR算法的改进方法,在本方法中,多点中继(MPR)节点的选择在有多个最大覆盖度节点基础上,增加链路状态和节点状态作为判断的依据,选择覆盖度最大且状态最优的节点作为MPR节点;所述链路状态可以用链路带宽、链路时延和链路丢包率来衡量;所述节点状态可以用邻居节点的计算能力、剩余能量、节点负载中的种指标或多种指标来衡量。采用本方法,在保证最大覆盖度的基础上,MPR选择状态最优的节点,使得网络性能更优。 |
---|