Non-collision Resources Scheduling Algorithm for WIA-PA Networks
Zhao Jindong · Journal of Chinese Computer Systems · 2010
In WIA-PA networks,which use TDMA and FDMA mechanism to transmit data,it is very hard to schedule the timeslots and the channels used by the links because of the multi-hop mesh topology.In this paper,the two types of conflict are analyzed and a resources scheduling algorithm is presented.The proposed algorithm exploits the route characteristics of data transmitting in wireless multi-hop mesh networks and uses BFS(Breadth First Search) method to construct the uplink route,and then it colors the vertexes of the route graph to schedule the time slots of the superframe.It assigns three different channels to the links with three successive depths to avoid radio interference.By scheduling the links using the presented algorithm,the nodes of the network can transmit data respectively without conflicting with the others using three channels,and the number of time slots their needed is no more than,where is the maximum degree of network route graph.Finally,the analysis and the simulation result of the proposal are given.