Efficient broadcast with forward node set in clustered mobile ad hoc networks

Abstract

The clustered architecture of a mobile ad hoc network (MANET) has the virtue of keeping the node information locally which is suitable for scalability. Reducing broadcast redundancy can avoid the broadcast storm problem and save scarce resources such as bandwidth and energy. We propose an approach that chooses a subset of nodes, called forward node set, to relay the broadcast packet. Each clusterhead computes its forward node set that connects its adjacent clusterheads. A non-clusterhead node just relays the broadcast packet if it is selected as a forward node or else it does nothing. Therefore, the broadcast operation can be restricted only to clusterheads and nodes in locally selected forward node sets. We also utilize the information of clusterheads that are piggybacked with the broadcast packet to further reduce each forward node set. Simulation shows its performance improvement against other broadcast algorithms.