Research On Key Technologies Of Distributed Election And Scheduling In Multi-Hop Cooperative Networks

Distributed multi-hop cooperative network is a new type of network which has the characteristics of flexible structure,easy installation,high resistance to destruction,and low cost.It is widely used in internet of things,military communications,emergency rescue and other scenarios.The MAC(Media Access Control)layer is mainly used for resource scheduling and network maintenance to ensure normal transmission of control signaling and data.At present,the research on MAC layer of distributed multi-hop cooperative network is limited to the design of protocol architecture and the analysis of mechanism theoretical model,which is difficult to meet the needs of engineering practice.In practical applications,from the aspect of improving network performance,the existing MAC layer mechanisms still have many shortcomings.This paper studies the efficiency and delay problems of the distributed multi-hop cooperative network election mechanism and resource scheduling mechanism in practical applications,and analyzes the process of election mechanism and the composition of end-to-end service delay.On this basis,combined with the MAC layer protocol,from the aspect of improving election efficiency and reducing delay,this paper gives the optimal design scheme of the election mechanism,resource scheduling mechanism and path finding mechanism.By comparing with other mechanisms,the performance and applicable scenarios of the optimization mechanism are analyzed.The research content of the thesis mainly includes the following three aspects: First,aiming at the efficiency problem of the election mechanism,this paper analyzes the key factors that affect the election mechanism by using the model.Based on this,an election mechanism based on load priority is proposed,so that nodes with service can complete election process preferentially and shorten the node's scheduling cycle.At the same time,priority adjustment parameters are introduced in the improved mechanism to ensure that low-priority nodes can also compete for slot transmission opportunities within a certain time.Second,this paper analyzes the composition of end-to-end service delay from the protocol,and optimizes the delay of each part.To solve the problem of large resource scheduling delay in the resource scheduling mechanism based on negotiation,an adaptive scheduling mechanism is proposed to reduce scheduling delay through different slot authorization methods.For the problem of slow establishment of network layer routing,based on the idea of cross layer design,a MAC layer path findingmechanism is proposed.Each node obtains topological connection in the local topology table,and find paths to other nodes in the network according to the path finding algorithm,so as to shorten path finding delay.Third,a multicast scheduling mechanism is designed for multiple service models that may appear in actual engineering applications.It includes inter-layer primitive and scheduling mechanism design,which reducing resource overhead while maintaining good compatibility with existing scheduling mechanisms.Above research content has been achieved and verified through the engineering platform and simulation platform.The experimental results show that the optimization mechanisms proposed in this paper can improve the election efficiency and reduce the end-to-end service delay to a certain extent.