Font Size: a A A

Study On Resource Scheduling Method In Wireless Data Aggregation Networks

Posted on:2019-09-07Degree:DoctorType:Dissertation
Country:ChinaCandidate:S DingFull Text:PDF
GTID:1368330602482894Subject:Signal and Information Processing
Abstract/Summary:PDF Full Text Request
As a new type of wireless network technology with unique characteristics and development prospects,wireless data aggregation networks(WSNs,Ad hoc,Mesh,et al)are gradually applied in various fields of national economic and social life,and it has also become a hot area for academic research.In a wireless data aggregation network,how to schedule network resources such as channels and TDMA time slots to maximize network monitoring quality,minimize network collisions,and optimize network data aggregation performance is an important research topic.The paper comprehensively summarizes the theoretical and technological status in this field,and focuses on the mathematical models and algorithms for wireless node channel and time slot scheduling problems.Theoretical analysis and extensive experiments under different network conditions demonstrate the comprehensive efficiency of the algorithm.Main research work and innovations of the paper lie in:(1)Aiming at the problem of multi-channel scheduling for monitoring nodes in wireless data aggregation networks,a channel selection algorithm based on Simultaneous Perturbation Stochastic Approximation(SPSA)is proposed.Two-dimensional grid coding is designed to construct the solution space.The algorithm uses a stochastic perturbation strategy to obtain an approximate gradient of the objective function,which can guide the search process to gradually approximate the optimal solution.The algorithm requires only known monitoring nodes and their neighbor nodes,as well as neighbor users' working channel information(which can be obtained by full frequency sweep).The algorithm is suitable for solving complex multidimensional optimization problems with low complexity and fast convergence.A large number of experiments demonstrate that the algorithm can realize the optimal channel selection of monitoring nodes in the wireless data aggregation network with high Quality of Network(QoM).(2)Proposed a distributed vertex coloring algorithm based on static non-cooperative game theory,on the problem of multi-channel TDMA time-slot scheduling problem in the process of data collection in wireless monitoring networks.First of all,based on wireless monitoring network topology,build a routing tree to form an interference graph,so as to convert the resource scheduling problem into vertex of interference graph double-coloring problem.The goal is to minimize network traffic conflict.Then,the communication conflict of each vertex is used as the revenue function of the game to construct the Nash Equilibrium state,and the vertices are selected in a probabilistic manner to adjust the allocation scheme.The global communication collision number is used to determine whether the scheme has reached Pareto Efficiency,after multiple adjustments.The optimized selection of channels and time slots can be completed after several adjustments.A series of comparative experimental results under different network conditions demonstrate that the algorithm can effectively reduce network conflicts,improve network throughput,reduce network transmission delay and scheduling length,achieving a higher data gathering performance of the wireless monitoring networks.(3)The data aggregation network resource scheduling algorithm test bed"DAN-RSM testbed" is designed,including the design and implementation of software and hardware systems,which can provide application testing of medium-scale network resource scheduling algorithm.Based on the experimental platform,the practical validity tests of the algorithm and strategy proposed in the paper are carried out and a series of experimental data are obtained,which further validates the comprehensive validity and deficiencies of the algorithm proposed in the paper and lay the foundation for the future research and related scientific work.This paper studies resource scheduling methods in wireless data aggregation networks,proposes corresponding models,algorithms and experimental tests,and constructs a corresponding theoretical method system.Related achievements have a certain role and reference value in promoting the development of wireless network technology.
Keywords/Search Tags:wireless data aggregation network, multi-channel, TDMA time slot, vertex coloring, network collision
PDF Full Text Request
Related items