通信学报 ›› 2017, Vol. 38 ›› Issue (3): 7-15.doi: 10.11959/j.issn.1000-436x.2017069

• 学术论文 •    下一篇

基于动态规划的矿井无线再编程最优基站选址算法

韩江洪1,2,段章领1,卫星1,2,陆阳1,2,张建军1,2   

  1. 1 合肥工业大学计算机与信息学院,安徽 合肥 230009
    2 安全关键工业测控技术教育部工程研究中心,安徽 合肥 230009
  • 修回日期:2017-01-04 出版日期:2017-03-01 发布日期:2017-04-13
  • 作者简介:韩江洪(1954-),男,安徽庐江人,合肥工业大学教授、博士生导师,主要研究方向为网络与通信、嵌入式系统、无线网络等。|段章领(1990-),男,安徽颍上人,合肥工业大学博士生,主要研究方向为无线网络优化、安全关键通信协议。|卫星(1980-),男,安徽肥西人,合肥工业大学副教授、硕士生导师,主要研究方向为物联网工程、离散事件动态系统。|陆阳(1967-),男,安徽合肥人,合肥工业大学教授、博士生导师,主要研究方向为安全关键工业测控技术、离散事件控制系统理论与应用、自组织网络理论与应用、二进神经网络理论与应用。|张建军(1963-),男,浙江宁波人,合肥工业大学教授、硕士生导师,主要研究方向为汽车电子、物联网工程、计算机集成制造。
  • 基金资助:
    国家重点研发计划专项基金资助项目(2016YFC0801804);国家自然科学基金资助项目(61370088);国家国际科技合作专项基金资助项目(2014DFB10060)

Optimal base station selection based on dynamic programming for reprogramming in mine wireless network

Jiang-hong HAN1,2,Zhang-ling DUAN1,Xing WEI1,2,Yang LU1,2,Jian-jun ZHANG1,2   

  1. 1 School of Computer and Information,Hefei University of Technology,Hefei 230009,China
    2 Engineering Research Center of Safety-Critical Industry Measure and Control Technology of Ministry of Education,Hefei 230009,China
  • Revised:2017-01-04 Online:2017-03-01 Published:2017-04-13
  • Supported by:
    The National Key Research Development Program of China(2016YFC0801804);The National Science and Technology Cooperation Project(2014DFB10060)

摘要:

广泛应用于安全关键系统的大规模无线网络需动态更新节点程序,采用无线再编程方式进行程序更新,具有高效性及灵活性。研究在节点均匀分布的矿井无线传感器网络环境下,如何选取最优的基站使整个网络再编程代价最小。首先由网络节点程序更新的接力覆盖过程推导出基站选址模型,其次将其转化为求解连通简单图任意节点不循环最长最短通路的最小值问题,最后给出基于动态规划的最优算法,包括最优子结构和重叠子问题。数值结果表明,与其他最优算法相比,该算法在网络复杂度急剧增大时仍保持平稳的时间消耗。

关键词: 无线再编程, 基站选址, 动态规划, 矿井无线传感器网络

Abstract:

The nodes of large-scale wireless network which widely used in safety-critical systems often update new code,the way of wireless reprogramming is efficiency and flexibility.The problem of selecting the optimal base station when nodes uniformly distributed in mine wireless network environment and all other nodes were reprogrammed efficiency.Firstly,the model of base station selecting was established by covering process of reprogramming.Then the problem was transformed into solving the minimum of longest non-cyclic path between node and base station in undirected circulant graph.Finally,the optimal algorithm based on dynamic programming which included optimal substructure and overlapping subproblems was proposed.Numerical analysis and experimental results show that the time consumption of proposed algorithm is more stable than other optimal algorithm when the complexity of network is increased sharply.

Key words: wireless reprogramming, base station location, dynamic programming, mine wireless sensor network

中图分类号: 

No Suggested Reading articles found!