CFP last date
22 April 2024
Call for Paper
May Edition
IJCA solicits high quality original research papers for the upcoming May edition of the journal. The last date of research paper submission is 22 April 2024

Submit your paper
Know more
The week's pick
Responsive image
Enhancing Privacy Preservation: Multi-Attribute Protection with P-Sensitive K-Anonymity

Twinkle Patel Kiran Amin
Random Articles
Reseach Article

A Study on Resource Allocation Algorithms in Wireless Relay Networks

by J. Deepa, J. Sutha
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 57 - Number 13
Year of Publication: 2012
Authors: J. Deepa, J. Sutha
10.5120/9171-3572

J. Deepa, J. Sutha . A Study on Resource Allocation Algorithms in Wireless Relay Networks. International Journal of Computer Applications. 57, 13 ( November 2012), 1-5. DOI=10.5120/9171-3572

@article{ 10.5120/9171-3572,
author = { J. Deepa, J. Sutha },
title = { A Study on Resource Allocation Algorithms in Wireless Relay Networks },
journal = { International Journal of Computer Applications },
issue_date = { November 2012 },
volume = { 57 },
number = { 13 },
month = { November },
year = { 2012 },
issn = { 0975-8887 },
pages = { 1-5 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume57/number13/9171-3572/ },
doi = { 10.5120/9171-3572 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T21:00:18.857516+05:30
%A J. Deepa
%A J. Sutha
%T A Study on Resource Allocation Algorithms in Wireless Relay Networks
%J International Journal of Computer Applications
%@ 0975-8887
%V 57
%N 13
%P 1-5
%D 2012
%I Foundation of Computer Science (FCS), NY, USA
Abstract

In this paper, the multicast routing problem in wireless relay networks is considered. The resource allocation problem in IEEE 802. 16j WIMAX Networks is discussed. The relay stations are used to improve the transmission quality in WIMAX networks. Most existing approaches try to reduce the energy consumption of a multicast tree. In contrast, the maximization problem to increase the number of recipients within the given resource is addressed. In recent years various resource allocation schemes for maximization problem is discussed. To have a comprehensive understanding of resource allocation schemes, a comparison of these schemes is discussed detail in this paper.

References
  1. Baseline Document for Draft Standard for Local and Metropolitan Area networks, IEEE Std. 802. 16j- 06/026r2, 2007.
  2. G. Li and H. Liu, "Resource allocation for OFDMA relay networks with fairness constraints," IEEE J. Sel. Areas Commun. , vol. 24, no. 11, pp. 2061–2069, Nov. 2006.
  3. H. Lee and D. -H. Cho, "Reliable multicast services using CDMA codes in IEEE 802. 16 OFDMA system," in Proc. IEEE VTC 2005-Spring, 2005.
  4. K. Miyao, H. Nakayama, N. Ansari, and N. Kato, "LTRT: An efficient and reliable topology control algorithm for ad-hoc networks," IEEE Trans. Wireless Commun. , vol. 8, no. 12, pp. 6050–6058, Dec. 2009.
  5. J. E. Wieselthier, G. D. Nguyen, et al, "On the Construction of Energy-Efficient Broadcast and Multicast Trees in Wireless Networks," in Proceedings of IEEE INFOCOM 2000, March 2000, pp. 585-594.
  6. O. Egecioglu and T. Gonzalez, "Minimum-energy broadcast in simple graphs with limited node power", in Parallel and Distributed Computing and Systems (PDCS 2001), pp. 334-338, Anaheim, CA, August 2001.
  7. D. Li, X. Jia and H. Liu, "Energy Efficient Broadcast Routing in Static Ad Hoc Wireless Networks," IEEE Transactions on Mobile Computing, Vol. 3, No. 2, 2004.
  8. Seong-Ping Chuah, "Energy-Efficient and Resource Allocation and Scheduling for Multicast of Scalable Video Over Wireless Networks," in IEEE Trans, Multimedia on. vol. 14, no. 4, pp. 1324-1336, Aug 2012.
  9. M. K. Awad and X. Shen, "OFDMA based two-hop cooperative relay networks resource allocation," in Proc. IEEE ICC, 2008, pp. 4414–4418.
  10. "Constructing minimum-energy broadcast trees in wireless ad hoc networks," in Proceedings of the 3rd ACM International Symposium on Mobile Adhoc Networking & Computing, 2002, pp. 112-122.
  11. M. R Garey and D. S. Johnson (1979). "Computers and Intractability: A Guide to the Theory of NP Completeness. " W. H. Freeman. ISBN 0-7167-1045-5. A6: MP9, pp. 247.
  12. Wen-Hsing kuo and Jeng-Farn Lee, "Multicast Routing Scheme for Recipient Maximization in Wireless Relay Networks," IEEE Trans. vehicular technology on. vol. 59, no. 8, pp. 4002-4011, Oct 2010.
  13. Wen-Hsing kuo and Jeng-Farn Lee, "Multicast Recipient Maximization in IEEE 802. 16j Wimax Relay Networks," IEEE Trans. vehicular technology on, vol. 59, no. 1, pp. 335-343, Jan 2010.
  14. T. S. Rappport, Wireless Communications: Principles and Practices. 0nglewood Cliffs, NJ: Prentice Hall, 1996.
Index Terms

Computer Science
Information Sciences

Keywords

Study Resource

Powered by PhDFocusTM