Research On Node Localization And Link Schedule In Wireless Sensor Networks

The wireless sensor networks which has the characteristics of easy deployment,self-organizing,low-cost,strong self-healing capability have broad application prospects in military reconnaissance,environment monitoring,medical treatment,space exploration,etc.The great application value and development prospects vigorously promote the launch of correlation research on wireless sensor networks.Node localization is the basis for numerous applications of wireless sensor networks,while the link schedule is the key support technology.It is crucial to design node localization and link schedule mechanisms fitting for wireless sensor networks' characteristics.This thesis focused on the problem of node location in wireless sensor networks,designed utility function and game strategy,proposed a localization algorithm based on game.This algorithm judging the relationship of measuring distance and estimated distance and introduced the concept of credibility to description the degree of accuracy of node localization.In the process of game,we analyzed the different influence of each node's for global error,designed utility function and theoretically proves the existence of Nash equilibrium.In order to avoid fall into local optimum in the process of node localization,unknown nodes were fully considered the interact of each neighbor node and designed the strategy space determination.The algorithm finally make the entire network nodes fast convergence.A series of simulation results demonstrate the effectiveness of our proposed algorithms.This thesis on the basis of the demand of data transmission of wireless sensor networks,aimed at minimize the cycle of link schedule and proposed a heuristic link scheduling algorithm of joint time slot and cannel allocation.This thesis firstly used integer programming to fast solve the optimal routing topology in current combinations and theoretically minimum dispatching cycle.It analyzed the relationship of link schedule,channel allocation and dispatching cycle.Based on this routing topology,we proposed a maximum interference degree priority based heuristic time slot and channel allocation algorithm is presented.By using the mechanism of time slot multiplexing and channel allocation,our algorithm makes more noninterference links transferred by parallel and acquired smaller dispatching cycle,enhance the utilization of network resource.Finally,simulation experiments are analyzed to verify the proposed algorithms.