Tabu based Search for discovering Regular Plans in mobile clients

In a mobile computing system, broadcasting has become one of the most interesting and challenging research issue. The server continuously broadcasts data to mobile users. The data can be inserted into customized size relations and broadcasted as Regular Broad cast Plan (RBP) with multiple channels. Two algorithms, the Basic Regular (BRA) and the Partition Value Algorithm (PVA), can provide a static and dynamic RBP construction with multiple constraints solutions respectively. Servers have to work with many broadcasting plan operations. The operations become more complicated when there are many kinds of services. The Tabu Search algorithm (TSRP) can discover RBPs basically with the minimum number of channels. In addition, with the move operations it can also discover more than one RBPs with minimum number of channels including different composition RBPs. Theorems can provide direct conditions that can state the existence of the necessary criteria of having RBP and RBPs with different composition without considering those criteria. From all the above modern servers can be upgraded in regards to RBPs discovery with fewer channels. This will also strengthen self-monitoring providing energy saving with many accessible channels.