Research On Dynamic Address Allocation Mechanism For Mobile Ad Hoc Networks

Mobile Ad Hoc Networks is a non-central, multi-hop temporary network by a set ofmobile intelligent terminal of self-organization.This flexible architecture applies toscenarios requiring rapidly deployable communications with high survivable, efficientdynamic networking. It plays an irreplaceable role on the battlefield, disaster relief,emergency and other special areas.Mobile Ad Hoc Networks displays a tremendous attractive application prospect，butit also brings some of the technical challenges.In order to establish a proper route tosupport data packet forwarding in MANET, each node must be configured with a validaddress.Before Mobile Ad Hoc Networks put into practical application, especially whenthe number of the node reaches hundreds of thousands, it can do nothing for manualconfiguration, so it is very fundamental and important issue to be allocated address fornodes with dynamic method. Despite some automatic allocation mechanism has beenspecially designed for Mobile Ad Hoc Networks, but still not a mature enough tobecome the standard. Therefore, how to dynamically configure a valid address forMobile Ad Hoc Networks node that is a hot issue in the field to be solved.This thesis started with elucidating the characteristics and applications of Mobile AdHoc Networks, describing some problem related to address allocation and classifyingthe existing solution. Then based on existing address auto-configuration mechanism forMobile Ad Hoc Networks, a binary tree model based dynamic address allocationmechanism was proposed. It separated node identifier from address and establishesaddress space model. According to the relative position of nodes in the networktopology, the node was dynamically allocated a unique address in order to reduce thecontrol overhead. With the number of nodes processing networking merge and split,address resource can be managed effectively. The simulation results showed that themechanism greatly reduced control and routing overhead, which had good scalabilityand were suitable for large scale Mobile Ad Hoc Networks.In addition, multi-path dynamic address allocation mechanism, an improvedapproach of Mobile Ad Hoc Networks, was proposed for the routing problem offrequent interruptions caused by using the shortest path. It made use of the resourcesconsumed in the routing discovery, without resorting to additional communication overhead finding multiple paths to reach the destination node. The analysis andsimulation showed that only in the case of increasing the node memory requirements,improved the efficiency of packet transmission, reduced delay and enhanced the routingperformance.