Title :
Consistency in Regular Plans for Mobile Clients
Author :
Tsiligaridis, John
Author_Institution :
Math. & Comput. Sci., Heritage Univ., Toppenish, WA, USA
Abstract :
The broadcast problem including the plan design is considered. The data are inserted and numbered into customized size relations at a predefined order. The server ability to create a full, regular Broadcast Plan (RBP) with single and multiple channels after some data transformations is examined. The Basic Regular Algorithm (BRA) prepares an RBP and enables users to catch their items while avoiding wasting energy by their devices. In the case of multiple channels, a dynamic grouping solution is proposed, called the Partition Value Algorithm (PVA). under a multiplicity constraint. In order to provide consistency in data values the Rebroadcasting of Regular Data Algorithm (RRD) is presented. This last property, in addition to the self-monitoring, and self-organizing, can be offered by servers today providing also channel availability and lower energy consumption by using a smaller, with equal bandwidth, number of channels. Simulation results are provided.
Keywords :
channel allocation; mobile radio; radio broadcasting; wireless channels; RBP; basic regular algorithm; broadcast problem; channel availability; mobile clients; multiple channels; partition value algorithm; regular broadcast plan; regular data algorithm; Arrays; Broadcasting; Channel allocation; Heuristic algorithms; Partitioning algorithms; Servers; Silicon;
Conference_Titel :
Wireless Communications Networking and Mobile Computing (WiCOM), 2010 6th International Conference on
Conference_Location :
Chengdu
Print_ISBN :
978-1-4244-3708-5
Electronic_ISBN :
978-1-4244-3709-2
DOI :
10.1109/WICOM.2010.5600149