Research On The Routing Protocol Of Ad Hoc Mobile Network

In recent years, wireless communication technology has rapidly developed, and new technologies continue to emerge. It can be categorized into two parts: one is center-controlled network such as Wireless Local Area Network and GSM, the other is self-organized wireless network with no access points such as Ad hoc network.Ad hoc wireless mobile networks can provide a flexible and convenient communication without the support of the conventional infrastructure, which is the most important characteristic of this kind of network. This technology broadens the application fields of mobile communications, thus it gets more and more attention and has more and more applications. But the uniqueness of Wireless Ad hoc Network makes it impossible to be used in traditional networks. So some new protocols and technologies need to be developed further. As a result, various route protocols and related analysis of Ad hoc network have been hotspots in related areas of network.In this paper, we focus on the route protocols and algorithms of Ad hoc network. On-demand routing is widely developed in bandwidth constrained mobile wireless Ad hoc networks because of its effectiveness and efficiency. Most proposed on-demand route protocols, however, use single path for each session which makes use of under-utilize resources, and also cannot cope with congestion and link breakage. However, multipath route can overcome these problems, which can be used to improve the effective bandwidth usage of communication pairs and increase delivery reliability thus it can reach QoS guarantee.At present, some of the Ad hoc route algorithms also have disadvantages. For example, control packets are heavy load, the relevant of the multipath is too strong to satisfy the network performance. For these deficiencies, we introduce the Link-disjoint multipath source routing (DSMR) algorithm and point-disjoint multipath source routing (PDM) algorithm, which based on the most popular on-demand Dynamic Source Routing (DSR) algorithm, and makes fully exposition and comparison of the route discovery and route maintenance of these two algorithms. Then, we respectively do some experiments on the improved algorithms using the network simulation tool (NS2). By comparing the statistic parameters such as the average end-to-end delay, transfer rate of data package and spending of route protocol, finally, these two improved algorithms prove the rationality and validity.