CFP last date
20 January 2025
Reseach Article

Quasi-Dynamic Scheduling in Wireless Broadcast Networks

by Bikromadittya Mondal, Sarit Chakraborty, Sharmistha Bhattacharjee
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 43 - Number 9
Year of Publication: 2012
Authors: Bikromadittya Mondal, Sarit Chakraborty, Sharmistha Bhattacharjee
10.5120/6130-8360

Bikromadittya Mondal, Sarit Chakraborty, Sharmistha Bhattacharjee . Quasi-Dynamic Scheduling in Wireless Broadcast Networks. International Journal of Computer Applications. 43, 9 ( April 2012), 13-17. DOI=10.5120/6130-8360

@article{ 10.5120/6130-8360,
author = { Bikromadittya Mondal, Sarit Chakraborty, Sharmistha Bhattacharjee },
title = { Quasi-Dynamic Scheduling in Wireless Broadcast Networks },
journal = { International Journal of Computer Applications },
issue_date = { April 2012 },
volume = { 43 },
number = { 9 },
month = { April },
year = { 2012 },
issn = { 0975-8887 },
pages = { 13-17 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume43/number9/6130-8360/ },
doi = { 10.5120/6130-8360 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T20:32:57.700630+05:30
%A Bikromadittya Mondal
%A Sarit Chakraborty
%A Sharmistha Bhattacharjee
%T Quasi-Dynamic Scheduling in Wireless Broadcast Networks
%J International Journal of Computer Applications
%@ 0975-8887
%V 43
%N 9
%P 13-17
%D 2012
%I Foundation of Computer Science (FCS), NY, USA
Abstract

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.

References
  1. Jiang Yu, YouyunXu, Wei Xie, Static Throughput Optimal Scheduling For Wireless Multicast, Future Information Networks, 2009. ICFIN 2009. First International Conference, 14-17 Oct. 2009 , page(s):146-149.
  2. Tze-Ping Low, Man-On Pun, C. -C. Jay Kuo, Optimized Opportunistic Multicast Scheduling Over Cellular Networks, Acoustics, Speech and Signal Processing, 2009. ICASSP 2009. IEEE International Conference,19-24 April 2009.
  3. Praveen Kumar Gopala and Hesham El Gamal, "Opportunistic Multicasting", in Proc. TheAsilomar Conference On Signals, Systems and Computers, Pacific Grove, CA, November 2004.
  4. Praveen Kumar Gopala and Hesham El Gamal, "On the Throughput-delay tradeoff in Cellular multicast", in Proc. International Conference On Wireless Networks, Communications and Mobile Computing, Maui, HI, June 2005.
  5. Errol. L. Llyod, "Broadcast Scheduling for TDMA in Wireless Multihop Networks", Ch-16, Handbook of Wireless Networks And Mobile Computing, edited by Ivan Stojmenovic.
  6. Tse, D. and P. C. Viswanath, Fundamentals of Wireless Communication. 2005: Cambridge University Press.
  7. Viswanath, P. , D. N. C. Tse and R. Laroia, Opportunistic beamforming using dumb antennas. Information Theory, IEEE Transactions on,2002. 48(6): p. 1277-1294.
  8. Singh, S. C. S. Raghavendra and J. Stepanek. Power-Aware Broadcasting In mobile Adhoc networks,1999.
  9. Javad Akbari Torkestani, Mohammad Reza. Mobility based multicast routing algorithm for wireless mobile Ad-hoc Networks. Computer Communications, Volume 33, Issue 6, 15 April 2010, P. 721-735.
Index Terms

Computer Science
Information Sciences

Keywords

Rayleigh Distribution Curve Channel Fading Signal-to-noise Ratio multiuser Diversity Gain Optimal Throughput