CFP last date
20 December 2024
Reseach Article

Hybrid Scheduling for Heterogeneous Asymmetric Mobile Communication

by R.kavitha, M.v.ramana Murthy, Mahaboob Sharief Shaik
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 119 - Number 19
Year of Publication: 2015
Authors: R.kavitha, M.v.ramana Murthy, Mahaboob Sharief Shaik
10.5120/21179-4204

R.kavitha, M.v.ramana Murthy, Mahaboob Sharief Shaik . Hybrid Scheduling for Heterogeneous Asymmetric Mobile Communication. International Journal of Computer Applications. 119, 19 ( June 2015), 36-39. DOI=10.5120/21179-4204

@article{ 10.5120/21179-4204,
author = { R.kavitha, M.v.ramana Murthy, Mahaboob Sharief Shaik },
title = { Hybrid Scheduling for Heterogeneous Asymmetric Mobile Communication },
journal = { International Journal of Computer Applications },
issue_date = { June 2015 },
volume = { 119 },
number = { 19 },
month = { June },
year = { 2015 },
issn = { 0975-8887 },
pages = { 36-39 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume119/number19/21179-4204/ },
doi = { 10.5120/21179-4204 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T23:04:31.469484+05:30
%A R.kavitha
%A M.v.ramana Murthy
%A Mahaboob Sharief Shaik
%T Hybrid Scheduling for Heterogeneous Asymmetric Mobile Communication
%J International Journal of Computer Applications
%@ 0975-8887
%V 119
%N 19
%P 36-39
%D 2015
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Rapid development in wireless communication technology has paved a path for the increase in mobile users to access the information from anywhere and at anytime. Data broadcasting plays a vital role in asymmetrical communication environment. Here server disseminates the information required by the mobile users at a faster rate as the bandwidth of the downlink channel is much more than the uplink. In data broadcasting, the mobile users put their request for the required data item and continuously listen for the response upon the channel from the server. In order to save the precious battery power of the mobile clients it should be that they have to be served quickly by the server. That is the access time of the requested data item should be minimized. This paper focus on the lengths of the data items which uses stretch as the metric to devise a server broadcasting algorithm in order to achieve optimal results. Simulation results are obtained to evaluate the performance of the proposed algorithm.

References
  1. S. Acharya, R. Alonso, M. Franklin, and S. Zdonik. Broadcast disks: Data management for asymmetric communications environments. In Proceedings of ACM SIGMOD Conference on Management of Data, pages 199–210, San Jose,CA, USA, May 1995.
  2. S. Acharya, M. Franklin, and S. Zdonik. Balancing push and pull for data broadcast. In Proceedings of ACM SIGMOD Conference on Management of Data, pages 183–194, Tucson, AZ, USA, May 1997.
  3. S. Acharya and S. Muthukrishnan. Scheduling ondemand broadcasts: New metrics and algorithms. In Proceedings of the 4th Annual ACM/IEEE International Conference on Mobile Computing and Networking (MobiCom'98), pages 43–54, Dallas, TX, USA, October 1998.
  4. D. Aksoy and M. Franklin. R x W: A scheduling approach for largescale ondemand data broadcast. IEEE/ACM Transactions on Networking, 7(6):846–860, December 1999.
  5. S. Hameed and N. H. Vaidya. Efficient algorithms for scheduling data broadcast. ACM/Baltzer Journal of Wireless Networks (WINET), 5(3):183–193, 1999.
  6. Q. L. Hu, D. L. Lee, andW. ­C. Lee. Performance evaluation of a wireless hierarchical data dissemination system. In Proceedings of the 5th Annual ACM/IEEE International Conference on Mobile Computing and Networking (MobiCom'99), pages 163–173, Seattle, WA, USA, August 1999.
  7. T. Imielinski and S. Viswanathan. Adaptive wireless information systems. In Proceedings of the Special Interest Group in DataBase Systems (SIGDBS) Conference, pages 1941, Tokyo, Japan, October 1994.
  8. Navrati Saxena, Cristina M, Kalyan Basu, Sajal K. Das. A Dynamic Hybrid Scheduling Algorithm for heterogeneous asymmetric environment,, Vol:20 April-2005 , IJPDES.
  9. Wai Gen Yee, Shamakanth, B Navathe, Edward Omian Ciniski and Christipher Jermaine. Efficient Data Allocation over multiple channel at Broadcast Servers. IEEE Transactions on Computers, Volume 51, No. 10, October 2002.
  10. W. ­C. Lee, Q. L. Hu, and D. L. Lee. A study of channel allocation methods for data dissemination in mobile computing environments. ACM/Baltzer Journal of Mobile Networks and Applications (MONET), 4(2):117–129, 1999.
  11. C. W. Lin and D. L. Lee. Adaptive data delivery in wireless communication environments. In Proceedings of the 20th IEEE International Conference on Distributed Computing Systems (ICDCS'2000), pages 444–452, Taipei, Taiwan, April 2000.
  12. C. J. Su, L. Tassiulas, and V. J. Tsotras. Broadcast scheduling for information distribution. ACM/Baltzer Journal of Wireless Networks (WINET), 5(2):137–147, 1999.
  13. N. H. Vaidya and S. Hameed. Scheduling data broadcast in asymmetric communication environments. ACM/Baltzer Journal ofWireless Networks (WINET), 5(3):171–182, 1999.
  14. J. W. Wong. Broadcast delivery. Proceedings of the IEEE, 76(12):1566–1577, December 1988.
  15. YiqiongWu, Jing Zhao, Min Shao, and Guohong Cao, "Stretch-Optimal Scheduling for On-Demand Data Broadcasts", ?? 2005 Springer Science
  16. G. Zipf, Human Behaviour and the Principle of Least Effort, Addison-Wesley.
  17. Y. Guo, S. K. Das and M. C. Pinotti. A New Hybrid Broadcast scheduling Algorithm for Asymmetric Communication Systems: Push and Pull Data based on Optimal Cut-Off Point. In Mobile Computing and Communications Review (MC2R) Vol. 5, No. 4, 2001.
  18. W. Ni, Q. Fang and S. V. Vrbsky, "A Lazy Data Approach for On-demand Data Broadcasting", Pro. c of 23rd Intl. Conf. on Distributed Computing Systems Workshops (ICDCSW03)
Index Terms

Computer Science
Information Sciences

Keywords

Access time Hashing Hybrid push-pull model Multiple channels