Open Access Open Access  Restricted Access Subscription or Fee Access

Channel Assignment Scheme for Reusability Technique Using Prioritized Algorithm

P. Jesu Jayarin, Dr. T. Ravi

Abstract


In this paper we use the randomized algorithm for solving the channel allocation problem in the network. Minimum Slot Waiting First (MSWF) is used for overcome the problem which is caused by randomized algorithm, where the node whose is not first prioritized because it allocates the channel randomly. By using channel reuse technique we can improve the quality of service. Then we reuse the channel by using the given methods FDMA and TDMA.Here we propose an optimal channel allocation scheme which can give the best performance for improving the Quality of service and throughput. By using the given technique multihop cooperative transmission, the system throughput can be improved. The multiple expand path links reduces outage probability. Channel allocation architecture provides better reliability and maintains cell capacity for high bandwidth using throughput values. The channel assignment problem in a class of wireless cellular networks form as such regular grids which can be obtained by adding two edges to connect two pair of diagonal vertices of every square cell in the square grids. Simulation results show that allocation algorithm is effective to improve the bandwidth efficiency of the networks.

Keywords


Channel Allocation, Frequency Reuse, MSWF and Throughput Calculation

Full Text:

PDF

References


Mahmoud Al-Ayyoub and Himanshu Gupta”Joint Routing Channel

Assignment and Scheduling for Throughput Maximization in General Interference Model”, IEEE Transaction on Mobile Computing vol. 9,no. 4, pp. 553-565, April. 2010.

Third Generation Partnership Project (3GPP); Technical Specification Group Radio Access Network, “Opportunity Driven Multiple Access (ODMA),” Sophia Antipolis, Valbbonne (3G TR 25.924 Version 1.0.0), 1999.

M. Al-Riyami, A.M. Safwat, and H.S. Hassanein, “Channel Assignment in MultiHop TDD W-CDMA Cellular Networks,”Proc. IEEE Int’l Conf. Comm. (ICC ’05), pp. 1428-1432, May 2005.

D. Bre´laz, “New Methods to Color the Vertices of a Graph,”Comm. ACM, vol. 22, no. 4, pp. 251-256, Apr. 1979.

S. De, O. Tonguz, H. Wu, and C. Qiao, “Integrated Cellular and Ad Hoc Relay (iCAR) Systems: Pushing the Performance Limits of Conventional Wireless Networks,” Proc. IEEE Hawaii Int’l Conf.System Sciences (HICSS ’02), pp. 3899-3906, Jan. 2002.

X. Fu, A.G. Bourgeois, P. Fan, and Y. Pan, “Using a Genetic Algorithm Approach to Solve the Dynamic Channel-Assignment Problem,” Int’l J. Mobile Comm., vol. 4, no. 3, pp. 333-353, 2006.

H. Holma and A. Toskala, WCDMA for UMTS, Radio Access for Third Generation Mobile Communications, third ed. John Wiley & Sons, 2004.

Y.D. Lin and Y.C. Hsu, “Multihop Cellular: A New Architecture for Wireless Communications,” Proc. IEEE INFOCOM, pp. 1273-1282, Mar. 2000.

X.J. Li and P.H.J. Chong, “Performance Analysis of Multihop Cellular Network with Fixed Channel Assignment,” Wireless Networks, vol. 16, pp. 511-526, Feb. 2010.

X.J. Li and P.H.J. Chong, “A Dynamic Channel Assignment Scheme for TDMA-Based Multihop Cellular Networks,” IEEE Trans. Wireless Comm., vol. 7, no. 6, pp. 1999-2003, June 2008.

X.J. Li, B.-C. Seet, and P.H.J. Chong, “Multihop Cellular Networks: Technology and Economics,” Computer Networks, vol. 52, no. 9, pp. 1825-1837, June 2008.

The MOSEK Optimization Software, http://www.mosek.com,Feb. 2009.

L. Noor and A. Anpalagan, “Dynamic Channel Allocation in TDD-CDMA Systems,” IEEE Canadian Rev., pp. 9-11, Summer 2004.


Refbacks

  • There are currently no refbacks.


Creative Commons License
This work is licensed under a Creative Commons Attribution 3.0 License.