电子学报
電子學報
전자학보
ACTA ELECTRONICA SINICA
2014年
6期
1118-1124
,共7页
贾杰%代恩亮%陈剑%王兴伟%赵林亮
賈傑%代恩亮%陳劍%王興偉%趙林亮
가걸%대은량%진검%왕흥위%조림량
无线传感器网络%链路调度%路由树%整数规划
無線傳感器網絡%鏈路調度%路由樹%整數規劃
무선전감기망락%련로조도%로유수%정수규화
wireless sensor network%link scheduling%routing tree%integer programming
链路调度技术是提高无线传感器网络数据传输可靠性的重要途径。传统的链路调度算法主要关注如何寻找无干扰传输条件下的最小调度帧,而忽视路径选择对链路调度的影响,会导致部分链路的干扰集过大,降低了时隙复用性。针对这一难题,系统分析了链路调度与路径选择及网络能耗的关系,提出联合路径优化的高能效链路调度模型。为加快求解速度,首先通过变量删减及模型转化,提出基于整数规划的最优路由树构建算法;进一步,根据整数规划求解的路由树与链路需求,提出基于最大干扰度优先的启发式链路调度算法。大量仿真实验验证了本文算法的有效性。
鏈路調度技術是提高無線傳感器網絡數據傳輸可靠性的重要途徑。傳統的鏈路調度算法主要關註如何尋找無榦擾傳輸條件下的最小調度幀,而忽視路徑選擇對鏈路調度的影響,會導緻部分鏈路的榦擾集過大,降低瞭時隙複用性。針對這一難題,繫統分析瞭鏈路調度與路徑選擇及網絡能耗的關繫,提齣聯閤路徑優化的高能效鏈路調度模型。為加快求解速度,首先通過變量刪減及模型轉化,提齣基于整數規劃的最優路由樹構建算法;進一步,根據整數規劃求解的路由樹與鏈路需求,提齣基于最大榦擾度優先的啟髮式鏈路調度算法。大量倣真實驗驗證瞭本文算法的有效性。
련로조도기술시제고무선전감기망락수거전수가고성적중요도경。전통적련로조도산법주요관주여하심조무간우전수조건하적최소조도정,이홀시로경선택대련로조도적영향,회도치부분련로적간우집과대,강저료시극복용성。침대저일난제,계통분석료련로조도여로경선택급망락능모적관계,제출연합로경우화적고능효련로조도모형。위가쾌구해속도,수선통과변량산감급모형전화,제출기우정수규화적최우로유수구건산법;진일보,근거정수규화구해적로유수여련로수구,제출기우최대간우도우선적계발식련로조도산법。대량방진실험험증료본문산법적유효성。
Link scheduling technology plays an important role in improving data transmission reliability in wireless sensor networks .Traditional link scheduling algorithms mainly focus on how to find the minimum scheduling frame under the condition of interference-free transmission ,but ignore the impact of route selection on link scheduling ,which leads to an expansion of interfer-ence set for some links and reduces the slot reusability .In response to this problem ,the relationship between link scheduling ,route selection and energy consumption is analyzed systematically ,and an energy-efficient link scheduling model combined with routing optimization is presented .Through variables deletion and model transformation ,an optimal routing tree construction algorithm is pro-posed to accelerate the solution speed based on integer programming .Furthermore ,according to the routing tree and link demands achieved by integer programming ,a heuristic slot allocation algorithm is proposed based on maximum degree of interference ,to min-imize the scheduling period .Extensive simulation results are presented to demonstrate the effectiveness of our proposed algorithm .