SIA OpenIR  > 其他
Alternative TitleResearch and Realization on Networks management of Wireless HART
Thesis Advisor王宏
Keyword无线hart 路由 资源调度 安全管理
Call NumberTN43/F56/2016
Degree Discipline机械电子工程
Degree Name博士
Degree Grantor中国科学院沈阳自动化研究所
Place of Conferral沈阳
Other AbstractWireless HART possesses the advantage of transmission reliability and robustness. The secure and reliable operation of wireless HART is obtained by networks routing technology, communication resource scheduling and security management. In this paper, the major research contents and contributions include the following aspects. Research the routing algorithm. At present, the routing algorithm of wireless HART is mainly based on the hierarchical algorithm wherein the routing between layers depends on RSSI. In the thesis the routing between layers is selected according to RSSI and path stability on the base of hierarchical algorithm. A graph routing algorithm and a source routing algorithm based on RSSI and path stability are proposed in the paper. The experiment result demonstrates that the algorithm is characterized by its better data transmission reliability between ends than the routing algorithm based on RSSI. Research the resource schedule algorithm of wirelessHART network. In the data link layer of wireless HART TDMA mechanism is utilized for resource scheduling and the communication resource scheduling is the key factor of communication performance. In current, the resource scheduling algorithm of wireless HART is mainly employed in the node data transmission of fixed cycle. In this paper, the super frame allocation algorithm wherein the uplink cycle of node data is variable is proposed. In addition the maximum slot interval between routing paths in super frame allocation is ensured by the uplink data characteristic of super frame. Experiment results demonstrate that the resource allocation problem of variable node data uplink cycle in wireless HART is solved and data transmission immunity between ends is improved. In wireless HART networks, adding and deleting node communication resources are key parts for realizing resource scheduling. In current, the deleting strategy of communication resource is a simple deletion of communication resource wherein the influence of the resource type is not considered. In this paper, different resources of wireless HART nodes are treated respectively. The management resource of routing independent is deleted directly. In order to removing the interference of resource deletion to data communication, resource deleting of source routing and graph routing is realized by the strategy that is adding resource followed by deleting resource. In the research of security management, although wireless HART protocol provides the key of security management, it does not accord the management method. The paper proposes the authentication strategy of the joining device and it ensures the device long address corresponds with its join key. At the same time the application security key management library is applied and related parameters of the library are accorded. In addition the paper proposes the method how to apply, generate, store, renew and delete key. The equipment running time is pseudo random source and the key is generated by hash function. In this paper the network access points and network manager are designed and routing algorithm, resource scheduling algorithm and security key management are verified in the networks manager design.
Contribution Rank1
Document Type学位论文
Recommended Citation
GB/T 7714
封岸松. 无线HART网络管理的研究与实现[D]. 沈阳. 中国科学院沈阳自动化研究所,2016.
Files in This Item:
File Name/Size DocType Version Access License
无线HART网络管理的研究与实现.pdf(2487KB)学位论文 开放获取CC BY-NC-SAApplication Full Text
Related Services
Recommend this item
Usage statistics
Export to Endnote
Google Scholar
Similar articles in Google Scholar
[封岸松]'s Articles
Baidu academic
Similar articles in Baidu academic
[封岸松]'s Articles
Bing Scholar
Similar articles in Bing Scholar
[封岸松]'s Articles
Terms of Use
No data!
Social Bookmark/Share
All comments (0)
No comment.

Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.