z-logo
open-access-imgOpen Access
Quasi-Dynamic Scheduling in Wireless Broadcast Networks
Author(s) -
Bikromadittya Mondal,
Sarit Chakraborty,
Sharmistha Bhattacharjee
Publication year - 2012
Publication title -
international journal of computer applications
Language(s) - English
Resource type - Journals
ISSN - 0975-8887
DOI - 10.5120/6130-8360
Subject(s) - computer science , scheduling (production processes) , wireless , wireless network , computer network , telecommunications , mathematical optimization , mathematics
The broadcasting nature of wireless networks provides an inherent advantage of utilizing the broadcast gain. To improve the efficiency of the network gain associated with multiuser diversity should be optimally exploited simultaneously keeping in mind the problems of wireless networks. One of the most notable problems which we have focused in this paper is the degradation of Signal-to-Noise Ratio (SNR). This paper proposes a quasi-dynamic scheduling algorithm ensuring the maintenance of a good SNR in all transmissions following the first transmission and then opportunistically selects a receiver of each transmission as the transmitter for the following transmission. Following this algorithm we have attained a throughput comparable to dynamic-optimal multicast algorithm at a lower message complexity.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom