Routing Tactic And Optimized Research In Mobile Ad Hoc Networks

A mobile ad hoc network (MANET) is a special type of a temporary acentric wireless mobile network consisting of a collection of mobile hosts with radio interfaces. The problems currently existing in the network layer of MANETs include topology control, data communication, and service access. Routing is one of the challenges in data communication, which mainly deals with route discovery and packet forwarding.Connected dominating set (CDS) based routing strategy, a hierarchical routing method, can reduce routing of an MANET to that of a subnet only consisting of a dominating set of the MANET. And besides, it can decrease the number of nodes in a communication route, improve routing efficiency, lower the probability of route failure, and enhance the performance of entire network. CDS based routing strategy is now becoming a hot research area for all the researchers around the world to explore.This dissertation studies routing strategies and focuses on algorithms for constructing CDS of an MANET and optimizing algorithms. Two algorithms are proposed to produce minimal CDSs respectively in bi-directional link and unidirectional environment. Each of the algorithm takes full advantage of nodes' power and chooses the nodes with higher power as gateway ones, so as to reduce the probability of communication route failure, to shorten the delay time of packets forwarding, and to decrease the cost of network management. Simulation results show that a smaller connected dominating set can be achieved from any MANET.The results of this dissertation exhibit theoretical and practical significance for designing, optimizing and applying routing strategy in ad hoc networks. In addition, these results also play an important role in management of MANETs.