Please use this identifier to cite or link to this item:
|Title:||Towards Realizable, Low-Cost Broadcast Systems for Dynamic Environments|
|Authors:||Liaskos, Christos K.|
Petridou, Sophia G.
Papadimitriou, Georgios I.
|Subjects:||FRASCATI::Natural sciences::Computer and information sciences|
|Source:||IEEE/ACM Transactions on Networking|
|Abstract:||A main design issue in a wireless data broadcasting system is to choose between push-based and pull-based logic: The former is used as a low-cost solution, while the latter is preferred when performance is of utmost importance. Therefore, the most significant advantage of a push system is the minimal cost. This fact implies that hardware limitations do exist in the case of push systems. As a consequence, every related proposed algorithm should primarily be cost-effective. This attribute, however, has been overlooked in related research. In this paper, popular broadcast scheduling approaches are tested from an implementation cost aspect, and the results render them only conditionally realizable. Moreover, a new, cost-effective, adaptivity oriented schedule constructor is proposed as a realistic, minimal-cost solution.|
|Appears in Collections:||Department of Applied Informatics |
Files in This Item:
|TON-2011-BroadcastSystems.pdf||369,45 kB||Adobe PDF||View/Open|
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.