A Routing Algorithm for Multi-Hop Mobile Ad-Hoc Networks Using Weighted Delaunay Triangulation
A multi-hop mobile ad-hoc network is a collection of wireless mobile hosts forming a temporary network without the aid of any centralized administration or standard support services. In such an environment, it is necessary for each mobile node to act both as a host and as router. Such a network is both kinetic and dynamic in nature. Kinetic as the nodes are constantly moving; dynamic as the nodes might appear/disappear arbitrarily. Each node in an ad-hoc network has to discover and maintain routes to other nodes in the network in order to communicate with these nodes. Routing protocols for an ad-hoc network must also deal with the resource limitations of mobile nodes like low energy, low bandwidth, and high error rates.