Research On Multi-Qos Routing Based On Improved Dijkstra Algorithm In WMN

WMN (Wireless Mesh Network) is considered to be "The Wireless Version of Internet" , which is a new type of wireless communication network and capable of self-organization and self-cure . WMN is a kind of wireless multi-hop network technology which completely suitable for the civil correspondence, essentially belongs to the mobile Ad hoc network, the biggest difference between them is the WMN user' s terminal mobility lower than Ad hoc user.Generally, WMN is not an independent network shape existence, but the wireless extendsion in the Internet core network. Ordinarily, there are many gateway connected to the Internet on high speed, and user in home or office by the wireless access point. The region which the gateway' s signal is not capable of covered, the user pitch point responsibly communicates service relaying or retransmits. So it realizes a wide range to be inexpensive and the fast signal cover. Obviously, this kind of network has omitted expensive infrastructure construction investment in the network construction initial period. Compared to the traditional spot to the multi-spot way on wireless access , it has many incomparable merit.The main content in this dissertation is proposed to a algorithm which improved from the Dijkstra algorithm in WMN' s multi-Qos routing. And carries on the analysis and the confirmation to it. Dijkstra algorithm is a classical algorithm which is used for resolve the question of the shortest path from the single source . It based on a parameter, but the computer network Qos routing involves to many parameters(band width, time extension, probability of unreceived packets and so on) to restrain. So this dissertation computes many Qos parameters according to the proportion weighting in WMN. Thus obtains the cost in every link. And take it as the power value to calculates the Dijkstra the shortest path. Thus , it it not only considered the various parameters influence to Qos, but also reduced computation' s time , which is compared to the original Dijkstra algorithm , throw deleted the inconformed link .This dissertation introduced WMN at first, and analyzed the routing protocols, characteristics and so on in the WMN. Then it has carried on the full elaboration to the improvement Dijkstra algorithm in the multi- Qos routing application. Finally it carries on the confirmation and the analysis to the algorithm, and take a detailed explanation to the essential flow.