A Backbone Routing Protocol Based on the Connected Dominating Set in Ad Hoc Networks

To solve the broadcast storm problem, some researchers proposed an approach that the dominating set is selected as the forwarding nodes to rebroadcast the packet to control the number of packets effectively. Then, the number of packets transmission, the power consumption, and the contention and the collision problem can be reduced. However, their methods may need more overhead for creating the dominating set. This paper proposes an efficient approach to improve the above problem. Basically, we design an election algorithm to select a connected dominating set from ad hoc networks. The election algorithm is based on the AODV, with which the hello message may contain the election information to select the connected dominating set. In this way, the backbone can be established with the minimum cost. After the backbone is created, the number of rebroadcast packets can be reduced effectively.