The design of this kind of network is highly complex due to their spontaneous and dynamic behaviour, since they are automatically stablished without any infrastructure and the devices forming it can roam freely as well as appear/disappear from the network at any time. The existence of networks of this kind is based on the use of broadcasting algorithms that allow to know the network topology in every moment. The problem's difficulty is aggravated by the low resources available to the devices forming the network (both autonomy and computing power), which causes resource utilization to be one of the main minimization objectives for the algorithms. A good broadcasting algorithm should maximize the number of devices reached and minimize the use of the network and the processing time. Therefore, we propose the optimization of a broadcasting protocol (named DFCN) according to these criteria. For this we will use a network simulator (Madhoc) that will emulate the behaviour of the broadcasting protocol in several scenarios inspired from the real world: a mall, an urban scenario and a road network.
In addition, we foresee the possible use of these optimization techniques in networks containing dynamic UMTS bridges, which are interconnections between different networks and whose use must be minimized due to their high cost.