Research On Adaptive Resource Allocation Technique Of Distributed Network

Mobile Ad Hoc Network(MANET)is a distributed network with the characteristics of decentralization,no infrastructure,adaptive networking,dynamic topology,etc.It is widely used in drone clusters,mobile communication Sense network and other fields.The key design that affects the performance of MANET lies in the physical resource allocation mechanism.Existing distributed time division multiple access(Time Division Multiple Access,TDMA)resource allocation schemes do not fully consider the adaptability to dynamic services,especially the service priority elements.In practical applications,resource access for high-priority services often requires priority guarantee to ensure the real-time performance of important information.In view of the above problems,this paper conducts relevant research on the adaptive resource allocation technique of distributed network.The main research contents and contributions include:Firstly,a frame structure suitable for dynamic distributed TDMA time slot allocation algorithm is designed.A frame structure optimization algorithm based on distributed point coloring is proposed to improve resource utilization.In order to design a frame structure with high slot multiplexing rate,the optimization of the frame structure for dynamic slot scheduling is modeled as a vertex coloring problem in graph theory.Based on the Distributed Color Constraint Heuristic Slot Assignment(DSA-CCH)coloring algorithm,the constraint on the initial coloring node is enhanced by introducing the Nodelevel reference factor,and an improved distributed color constraint heuristic is proposed(Modified Distributed Color Constraint Heuristic(MD-CCH)algorithm.Experimental simulations show that as the number of nodes increases,the proposed MD-CCH algorithm can optimize the number of time slots required for the corresponding transmission phase of the frame structure and improve the utilization of time slot resources.Secondly,a Service Priority based Dynamic TDMA Scheduling(SP-DS)algorithm is proposed,which has the following characteristics:1)In the time slot broadcasting algorithm,the reference factor of the service priority information time slot allocation is introduced.At the same time,a random token generation algorithm is used to resolve the reservation conflicts of nodes with the same priority within two hops.2)In the slot reservation algorithm,combined with the characteristics of MANET's end-to-end multi-hop routing cooperative transmission,the source node and the routing node are considered as a link to consider the slot reservation sequence.3)In the time slot allocation algorithm,an adaptive time slot allocation algorithm based on the binary tree model is proposed based on the data size and real-time requirements of different business priority information.Experimental simulation results confirm the effectiveness of the proposed SP-DS algorithm to implement dynamic resource scheduling based on business priority.When the number of network nodes is 250,the SP-DS algorithm is superior to several typical slot allocation algorithms in terms of slot allocation efficiency.When the number of nodes is 50,the network throughput and end-to-end delay of the SP-DS algorithm are superior to several typical slot allocation algorithms.The division of service has important application requirements in a distributed network scenario.This paper has important theoretical and practical significance for the research of dynamic resource allocation strategy based on service priority in the MANET scenario.