电子与信息学报
電子與信息學報
전자여신식학보
JOURNAL OF ELECTRONICS & INFORMATION TECHNOLOGY
2013年
1期
159-165
,共7页
包学才%戴伏生*%韩卫占
包學纔%戴伏生*%韓衛佔
포학재%대복생*%한위점
无线Mesh网络%可靠性约束%网络拓扑控制%不相交路径
無線Mesh網絡%可靠性約束%網絡拓撲控製%不相交路徑
무선Mesh망락%가고성약속%망락탁복공제%불상교로경
Wireless mesh network%Reliability constraint%Network topology control%Disjoint path
为合理规划无线Mesh网络,确保在节约无线资源前提下网络长期可靠地运行,该文定义了无线Mesh网络不同节点之间的归一化相对可靠性约束条件计算公式,建立了网络拓扑控制优化的模型,并配套研究了可靠性约束下拓扑控制的计算方法.该方法把Prim最小生成树方法融入到最大流最小割算法过程中,计算节点间每跳链路距离最短的不相交路径,通过不相交路径数与网络拓扑可靠性的相关性,得到可靠性约束下的拓扑优化.阐述了计算方法的正确性,并给出时间及空间复杂度.通过仿真验证及对比分析,在指定2×sqrt(N)对节点间为4条不相交路径及其他节点间2条不相交路径的可靠性约束条件下,不同网络规模的吞吐量及时延平均性能分别提升15.3%及20.1%,表明了可靠性约束下的拓扑控制方法更加合理性与灵活性,更能满足实际无线网络拓扑控制的要求.
為閤理規劃無線Mesh網絡,確保在節約無線資源前提下網絡長期可靠地運行,該文定義瞭無線Mesh網絡不同節點之間的歸一化相對可靠性約束條件計算公式,建立瞭網絡拓撲控製優化的模型,併配套研究瞭可靠性約束下拓撲控製的計算方法.該方法把Prim最小生成樹方法融入到最大流最小割算法過程中,計算節點間每跳鏈路距離最短的不相交路徑,通過不相交路徑數與網絡拓撲可靠性的相關性,得到可靠性約束下的拓撲優化.闡述瞭計算方法的正確性,併給齣時間及空間複雜度.通過倣真驗證及對比分析,在指定2×sqrt(N)對節點間為4條不相交路徑及其他節點間2條不相交路徑的可靠性約束條件下,不同網絡規模的吞吐量及時延平均性能分彆提升15.3%及20.1%,錶明瞭可靠性約束下的拓撲控製方法更加閤理性與靈活性,更能滿足實際無線網絡拓撲控製的要求.
위합리규화무선Mesh망락,학보재절약무선자원전제하망락장기가고지운행,해문정의료무선Mesh망락불동절점지간적귀일화상대가고성약속조건계산공식,건립료망락탁복공제우화적모형,병배투연구료가고성약속하탁복공제적계산방법.해방법파Prim최소생성수방법융입도최대류최소할산법과정중,계산절점간매도련로거리최단적불상교로경,통과불상교로경수여망락탁복가고성적상관성,득도가고성약속하적탁복우화.천술료계산방법적정학성,병급출시간급공간복잡도.통과방진험증급대비분석,재지정2×sqrt(N)대절점간위4조불상교로경급기타절점간2조불상교로경적가고성약속조건하,불동망락규모적탄토량급시연평균성능분별제승15.3%급20.1%,표명료가고성약속하적탁복공제방법경가합이성여령활성,경능만족실제무선망락탁복공제적요구.
In order to plan wireless mesh network rationally and ensure that the network could work reliably in the long-term under the condition of saving wireless resource, a calculation formula is defined for normalized relative reliability constraint among different nodes. Meanwhile, the optimization model of network topology control is established and the calculating method is proposed for topology control with reliability constraint. The method integrates Prim's algorithm for minimum spanning tree into max-flow min-cut algorithm. After calculating the disjoint paths in which each-hop-link is the shortest distance, the topology optimization is obtained by considering the correlation between the number of disjoint paths and the reliability of network topology. Not only the correction is proved, but also time and space complexities of the proposed method are analyzed. By simulation and comparative analysis, the average performance of throughput and delay ascend respectively 15.3%and 20.1%under the reliability constraint in which four disjoint paths need to be met among 2 × sqrt (N) pairs of nodes and two disjoint paths among other nodes. It demonstrates that the proposed method is both more reasonable and flexible. Furthermore, it meets the requirement well for the topology control of actual wireless network.