A Group Dynamic Source Routing Protocol for Mobile Ad Hoc Networks

Abstract

In this paper, we have proposed a new group dynamic source routing protocol, G-DSR, using a clustering technique for highly dynamic and large ad hoc networks. We focus on pursuing routing stability, making a fast recovery of link failure, and reducing packet overhead caused by the increase of packet header size in traditional source routing protocols. The entire nodes in a network are divided into a disjoint set of clusters, each of them being assigned a unique cluster label. A routing path is represented by a sequence of cluster labels and the nodes having an identical cluster label are responsible for delivering packets cooperatively to the cluster whose cluster label is the next one in the routing path. Because of a high probability of the existence of multiple paths between adjacent clusters, most of link failures are fixed rapidly. The protocol, we believe, is attractive for dealing with real-time traffic in military or commercial wireless networks that consist of a large number of fast moving wireless stations. We compared the protocol by resorting to simulation with some existing protocols. The result is proven to be highly dependable.