Hole Avoiding Routing In Mobile Ad-Hoc Networks

Mobile Ad-hoc NETworks (MANETs) are a kind of wireless self-organizing networks that depend on no infrastructure. They are typically characterized by its multi-hop, no-center, self-organization and mobility. Such convenience and fast to built, and unrestricted by the time and space, these networks can be applied in emergency rescue, battle field, explorations and objects monitoring of long distance or dangerous environments.Routing is the key technique of MANETs and one of the most important factors affecting the performance of the network. As the dynamic and variable topology, it is very challenging to solve the local optimum problem in MANETs. The thesis mainly focuses on solve the bypassing hole problem in large-scale mobile ad-hoc networks based on the hole-shadowing routing.This thesis proposes a hole reshaping routing in large-scale mobile ad-hoc Networks (HRR), where the node in the boundary of a hole sends a control packet by the right rule and collect the information of the node in boundary of the hole, then reshapes the hole with ellipse, and locally broadcasts the information of holes outside. It effectively solves the local optimum problem, shorten the routing path and reduce the routing delay.This thesis also proposes a routing protocol with hole-bypassing based on anchor in large-scale mobile ad-hoc Networks. It first finds the anchor nodes by anchor discovery arithmetic (GAR). And then finds the path among the anchor nodes. Finally the data packet can forwarded to the destination node by greedy forwarding arithmetic. So the protocol shortens the path further.The simulation results show that the proposed protocols effectively solve the local optimum problem, and can also get good performance in large scale MANETs.