Fairness Improvement and Efficient Rerouting in Mobile Ad Hoc Networks

Mobile ad hoc networking allows nodes to form temporary networks and communicate with each other possibly via multiple hops. By using a special node called the gateway, an ad hoc network can be connected to the Internet so that packets generated in the ad hoc network can be relayed to the Internet and vice versa. However, a problem may arise in which the network bandwidth is not used fairly among the nodes. That is, nodes near the gateway may overuse the bandwidth while nodes far away from the gateway scarcely share the bandwidth. Furthermore, if the destination node is located in the same ad hoc domain as the source, existing route selection methods result in high overhead or long routes. Addressing these problems, we propose an efficient tree construction algorithm that constructs a tree structure rooted at the gateway in order to improve the fairness of the bandwidth usage. We also devise a rerouting algorithm that dynamically finds new and better routes for the internal traffic within the same ad hoc domain.