Research On Topology Control Algorithms Of Wireless Ad Hoc Network

As a kind of multiple hops peer to peer network (who doesn’t rely on anyinfrastructure), Wireless Ad Hoc network has been paid more and more attentions,because of its convenient and flexible networking methods, strong adaptive capacity andself-healing capability advantages. In Wireless Ad Hoc network, save energyconsumption and reduce interference is relatively important two research aspects. Towidespread Wireless Ad Hoc networks into practical application, they becometwo urgent problems to be solved. In this paper, the topology control technology ofWireless Ad Hoc network is studied with the the optimization goals of reducing thenode energy consumption, strengthing the network fault tolerance capacity anddecreasing the network interference. The main acheievements and results are listed asfollows:1、To As far as possible prolong network lifetime and enhance the network faulttolerance, we propose an adaptive topology control algorithm, Residual Energy-awareShortest Path (RESP).Based on considering both the transmission power and residualenergy of nodes, RESP balances the energy consumption between the nodes byperiodically adjusting topology, avoiding the network segmentation caused by excessiveuse those nodes with less residual energy, significantly prolong the network lifetime; inadditional, the algorithm strengthens the network fault tolerance by constructing a kconnected network topology structure, so as to improve the overall performance of thenetwork.2、Considering the link scheduling problem and channel allocation problem isusually need to consider the interference between two links, and focus on the existinginterference type topology control algorithms,no one can provide a good underlyingtopology.So, at first, this paper defines a new interference model, the model canquantify interference between links; besides, based on the interference model we putsforward a heuristic algorithm to reduce network interference. On the basis of ensuringthe network Euclidean t-spanners characteristics, the algorithm deletes the link with biginterference degree as much as possible, thus reducing the interference of the network.