Abstract: The resource allotment method for telecasting the video. Using the combination of multicast and unicast model is essential one in Wireless networking. to relay the video from source to destination by allocating bandwidth process in the WIMAX relay network .we identify the problems in this method they contains a bandwidth allocating problem. Like limited and unlimited bandwidth. To solve this problem we need to find the maximization of through put in a network and find the near optimal solution for maximization problem to solve the problem the existing purpose greedy weighted algorithm to allocate the bandwidth allocation from base station to subscriber station. This method may contain a unicast model to implement the process. the greedy weighted algorithm can avoid redundant bandwidth allocation the performance may very low to archive the process and the proposed system is examined by existing the algorithm by bounded version is called bounded greedy weighted algorithm can provide multicast model to transmits the video from source to destination in high performance so when we compare to greedy weighted algorithm. The bounded weighted algorithm allocating method can archive the process of resource allotment method for telecasting video.
Keywords: bandwidth allocation bounded weighted algorithm, TCP/IP, Relay Telecasting.
Title: An Efficient Relay Selection and Clustering Technique for Spectrum Sharing Network
Author: Mrs. P. SIVAGAMI, R. SHARMILA
International Journal of Computer Science and Information Technology Research
ISSN 2348-1196 (print), ISSN 2348-120X (online)
Research Publish Journals
