ALLOCATION OF DYNAMIC CHANNELS FOR TDMA- BASED MULTI-HOP CELLULAR NETWORKS

Mohammed Imtiaz Ali Ahsan

Dept. of ECE, Muffakham Jah College of Engg & Tech, Hyd, AP. India, imtiaz424@gmail.com

ABSTRACT - In this paper, I proposed a multihop dynamic channel assignment (MDCA) scheme for time division multiple access (TDMA) - based multihop cellular networks. The proposed MDCA assigns channels to calls based on interference information in surrounding cells, provided by the interference information table (IIT) in the network. Two different channel searching strategies, sequential channel searching (SCS) and packing based channel searching (PCS), for use in MDCA is proposed and implemented. The channel - searching algorithm can be formulated as an optimization problem and it can be proved that the proposed scheme can result in a sub-optimal solution. Furthermore, the MDCA can efficiently alleviate the call blocking in larger areas, this analysis compares the feature of fixed channel assignment scheme and dynamic channel assignment scheme, hence proves that dynamic channel allocation is more optimal. There is also an implementation of dynamic channel allocation based on the service request. Key Words Multihop Cellular Networks, Channel assignment, MANET clustering INTRODUCTION In order to achieve efficient resource utilization in all sorts of deployment scenarios and QoS requirements in the future wireless cellular systems, new resource allocation methods must be developed. However, optimum point has to be found before considering the implementation practicality. Importance of resource scheduling was appreciated with the support of high data rate services in the evolution of UMTS standard to High Speed Downlink Packet Access (HSDPA) [1] and Enhanced Uplink [2]. A variety of resource allocation strategies and schemes, mainly for downlink, can be found in references [3]-[8]. In [3] a system with multiple traffic classes was considered

and resource allocations were based on the specific characteristics of traffic flows resulting in minimization of power consumption or maximization of system capacity. Under mixed service traffic including both real-time and non-real time services, efficient resource allocation from a shared resource pool is a challenging task due to varied and stringent QoS requirements. In [4] authors proposed a fixed resource partitioning method in which total resource pool was partitioned between different service classes and independent resource schedulers were responsible for each resource partition whereas in [5], scheduling was more unified and partitioning was dynamic to enhance spectral efficiency. Another approach towards resource allocation, called utility based approach, tries to maximize the total network utility and thereby enhancing resource allocation. For example, pricing is a well-known utility function used in [6] for resource allocation. In [7] authors used users QoS as utility function and then convert the resource allocation problem into a noncooperative game where each user tries to maximize its own utility. A downlink resource allocation method based on dynamic pricing was proposed in [6] aiming to maximize the summation of users utility. On the link level, adaptive transmission is one of the most recent technologies being investigated for enhancing the spectral efficiency in future cellular systems [7]. Fast scheduling together with adaptive modulation-coding, facilitates exploitation of channel variations resulting in multiuser diversity gains [6]. PROBLEM OUTLINE In an interference-limited system such as UMTS, the uplink cell capacity is basically limited by the total received uplink power at the base station due to the transmit power limitation of user terminals [6]. In decentralized scheduling, each base

station assigns radio resources to its users on a priority basis until the estimated Rise over Thermal noise (RoT) level reaches a pre-defined target. Recent studies in Enhanced Uplink UTRA, also called High Speed Uplink Packet Access (HSUPA), show that the decentralized scheduling has better performance compared with centralized one [2]. The subject of centralized versus decentralized scheduling has been studied extensively in recent years both in 3rd Generation Project Partnership (3GPP) standard body for HSUPA and in the literature [2]. The performance of centralized packet scheduler of the UMTS system is evaluated in [2] the performance of a decentralized scheduling is evaluated and compared with the centralized one in [5]. Extensive simulation results on interference outage, throughput and packet delay performance of a reference decentralized scheduling together with the proposed IIT Matrix approach are provided and compared. It should be noted that although HSUPA system is used to demonstrate the performance of the IIT Matrix, the concept is generic for singlecarrier spread spectrum based systems where cell RoT is widely used as a good load indication directly linked to cell load. In multi-carrier systems however, the load on subcarriers can differ significantly and therefore RoT (averaged) is no longer a good measure for load over all subcarriers. One can think of an effective RoT, encourage by the introduction of effective SINR in multicarrier systems to provide a better and more accurate link system mapping. MULTIHOP CELLULAR COMMUNICATION Wireless networks are characterized with their wireless last hops within the communication chain from any arbitrary node to any mobile terminal. This means that the mobile terminals are connected to the fixed network with a wireless link. This link is most of the time a radio channel. Radio channels are frequency bands used for communication that are separated from each other with guard bands. If two sources try to send data over the same channel at the same time, then the data sent cannot be received by the receiving end properly. Although there are alternative ways to access the medium and define the channel concept differently, this definition is enough for the discussion of the cellular concept.

If a large area is to be included in the wireless communication system, then there are a few possibilities to manage this. The first possibility is to have a single big transceiver antenna. This case is similar to the radio transmitters that service a large area. Let this antenna with its proper equipment be called Base Station (BS). On the other hand, if multiple users of the system want to use it, there should be enough channels available for each connection. Otherwise, the users should wait until the channels become available. If only one base station is present in a certain area, then there should be enough number of channels available in order to keep the rejection probability at a reasonable level, which is infeasible most of the time. Since the number of channels are scarce most of the time and the number of users willing to use the system cannot be predetermined easily, it is necessary to reuse the limited number of channels in the system. If the antennas of the base stations are placed far enough from each other such that the interference level is below a certain level, both communication sessions can continue over the same channel simultaneously. Let the area in which a base station is active as a cell. The power level of the received signal can be expressed as in [5]:
d (2.1) d0 The term Pr is the power level received at a distance of d from the antenna, P0 is the measured power level at a distance of d0 and the is the path loss exponent, which is in the order of two to four in the urban environments. In order to continue proper communication, the signal level from the base station serving the calls in the cell should be so large that another base station using the same channels should be almost imperceptible. It is enough to consider only the nearest neighboring base stations that use the same channels because the signal power level received from other base stations will be at most 4- times that of the next such base station according to Formula of 2.1. In order not to leave any gaps between the cells, several strategies are developed. The frequency set is divided into subsets and each base station is assigned a certain subset. The placement of the base stations is one of the problems that has to be solved and is investigated in [7]. The ideal shapes of the cells are hexagons. With hexagonal layout a certain area can be covered Pr P0

completely without leaving a gap. Furthermore, this shape can easily be obtained if the omni-directional antennas of the base stations are placed such that the boundaries of the cells are determined by the signal power of corresponding base stations. Another advantage of this shape is that the differences between the closest and farthest points on the boundaries are minimal among the shapes that can cover an area without any gap. This assures that the power level difference on the boundaries of a cell is minimal. In reality, though, the shapes of the cells are anything but hexagon due to terrestrial factors.

S I

D R i0

3N i0

(2.4)

Figure1: A Cellular Layout (Cluster Size=7) If the whole frequency set is completely used by N cells, then these cells constitute a cluster and the cluster size in that system is N and is a very important system parameter. It shows a typical cellular layout with cluster size equal to seven. The numbers in the hexagonal cells indicate the channel set used within the cell. For hexagonal cells, the cluster size can be calculated as follows:
N i2 ij j2 , i, j Z

If the value of Q is small, the system capacity increases since the value of N is also small and the channels can more frequently be used over a given area. On the other hand, if the value of Q is large, this leads to better transmission quality since the S/I ratio increases. At the same time system capacity decreases [5]. The choice of N depends on the quality of the transceivers used and the terrestrial factors. It should be chosen as small as possible and as large as necessary. When the necessary S/I is determined, the cluster size is also determined and vice versa. It is very interesting to note that calculation of the required signal to interference ratio is independent of actual radii and distances. Once the cluster size is determined, the designer is free to choose any radius for the cells. Hence, the cell radius is an engineering parameter in the cellular network design problems. All the wireless communication networks based on the cellular concept are called cellular networks.

RESOURCE ALLOCATION STRATEGY The key idea of CMCN is to achieve the characteristics of the macrocell/microcell hierarchical overlaid system [7] by applying MANET clustering [4] to TCNs. As shown in Fig. 1, a BS in TCNs covers the entire macrocell with a radius rM. The transmission ranges of traffic and control channels are the same and equal to rM for both the BSs and MSs. In CMCN, a macrocell is divided into seven microcells with a radius of rm. Each virtual microcell can be divided into two regions: inner half and outer half. The inner half is near the central microcell. The transmission range of the traffic channels in CMCN for both the BSs and MSs is equal to rm. The transmission range of the control channels for the BSs and MSs is equal to rM so that the BS can communicate with all the MSs within its macrocell area for control information exchange. In this study, the microcells are virtually formed by the BSs based on the geographic information using IIT, e.g. global positioning system (GPS).

(2.2)

The co-channel reuse factor Q is the ratio of the distance D between the cell centers that use the same frequency set to the larger radius R of the hexagonal cell. Q and N are related to each other with the following formula.
Q D R 3N

(2.3)

The signal to interference ratio S/I is the measure of requested signal to co-channel interference ratio. Furthermore, if there are i0 immediate neighbors using the same co-channel set, S/I can be approximated as:

DESIGN APPROACH Since the mobile terminals are free to move, it is not guaranteed that any MT involved in a communication session will remain in the cell. When an MT goes over to another cell while a call proceeds, the call is passed to the new base station. This procedure is called handoff. The average number of handoffs during a session depends on the cell radii, mobility pattern of the mobile terminals and the call duration. Two thresholds are set for the handoff procedure. When the power level drops below the first threshold, the handoff procedure is triggered. As long as the power level remains above the second threshold, which is lower than the first one, the perception of the signal is enough for proper communication. In order to provide seamless communication, the received signal powers are monitored and handoff must be completed before the signal level drops below the second threshold. Another important issue is that, data should not be lost during the handoff. According to the properties and aims of the application and network, deployment of buffers may be necessary [3]. When the scopes of the cellular networks are extended to include multicasting also, different considerations are necessary. Buffering is also deployed in cases of multicasting data to many mobile terminals over heterogeneous data rates. The synchronization of data during handoffs is a very challenging problem. Possible solutions to this problem are presented in this approach. RESULT ANALYSIS In order to present the characteristics of the two-layer multihop cellular networks, several computational experiments were carried out. First of all a sample problem and the corresponding solution is presented. Furthermore several groups of tests are performed. To develop a simulation model a generalized architecture is designed as shown below,

The first group of experiments deals with the effect of the isolated parameters on the objective function. For all of these parameters, the relationship between the parameters supplied to the algorithm and the cost of the system is compared. Their effect on the cost is compared with the cost of the system in hand. The comparison is made by comparing the costs under different arrival rates. The aim of the experiments in the second group was to observe the solutions of the algorithm in a large part of the parameter space. By doing so, the behavior of the two-layer multihop systems is presented. The selected solution technique is compared with other alternative solution techniques and the single-layer multihop systems. Lastly, the time complexity of the algorithm is estimated partially by experimental measurements and partially by analysis of the algorithms used in the solution technique.
Route overhead plot for the system 9 8 7 6
Route overhead

Non-Monitored Monitored-IIT

5 4 3 2 1 0

5 6 7 communication time

10

Figure 3: Observed route overhead in the network / Communication time. Further analysis to the suggested approach is carried out for a designed communication system with monitoring and not monitoring the offered load. Various quality metrics and the obtained performances are as shown below.
communication time plot 5 4.5 4 Non-Monitored Monitored-IIT

Propogation Delay (Sec)

3.5 3 2.5 2 1.5 1 0.5 0

1 Methods

Figure 2: System Architecture

Figure 4: Obtained communication time plot for a distributed network at node density of 30 nodes

Throughput plot for the system 40 35 30

Sytem Throughput

Non-Monitored Monitored-IIT

REFERENCES [1] Xue Jun Li, and Peter Han Joo Chong, IEEE Transactions on Wireless Communications, Vol.7, NO.6, June 2008. [2] The Portio Research Limited, Worldwide Mobile Market Forecasts 2006-2011, Market Study, UK, 2006.

25 20 15 10 5 0

5 6 7 communication time

10

Figure 5: obtained throughput of the developed system for both monitored and non-monitored communication.

[3] H. Wu, S. De, C. Qiao, E. Yanmaz, and O. Tonguz, Managed mobility: a novel concept in integrated wireless systems, in Proc. IEEE MASS04, pp. 537-539, Fort Lauderdale, FL, Oct. 2004. [4] H. Luo, R. Ramjee, P. Sinha, L. E. Li, and S. Lu, in Proc. ACM MOBICOM03, pp.353-367,CA, Sept. 2003. [5]Rose,C.and R.Yate, Location Uncertainty in Mobile Networks: IEEE Communications Magazine, pp.94-101, February 1997. [6] Special Issue on Mobile Computing, Internal Report Number MPG-94-18, 1996 [7] Pollini,P.P, Trends in Handover Design, 1996,http://www.ieee.org/comsoc/pollini.ht
[8] ayrc, E. and C. Ersoy, Cell Grouping in PCS

CONCLUSION & FUTURE SCOPE Due to the multiple requesting of channels, they are getting blocked at the link points and this results in very high network overhead. In this work an allocation strategy for channel is developed based on requesting micro-cell of IIT. The required channels are monitored and allocated at the switching terminals based on the channel searching strategy developed. The feasibility of applying allocation scheme for multihop cellular communication system is developed. A multihop dynamic channel allocation scheme with two channel searching strategies is developed. For clustered network, results show that MCN with adaptive allocation can improve the system capacity greatly as compared to FCA and DCA communication system. The suggested approach is developed for multihop traffics in cellular architecture. The work could be further improved by improving the allocation strategies incorporating allocation with availability and resource allocation such as required power; data rate etc. For further improvement, the channel allocation at micro cell level could also be developed as sub channel access strategy for resource utilization.

Networks, Proceedings of the Second Symposium on Computer Networks, pp. 14-41, Ankara, Turkey, 1997.

ACKNOWLEDGEMENTS The Author is thankful to Prof. Dr. Kaleem Fatima, Head Dept. of ECE, MJCET for her encouragement and is also highly thankful to the management of Muffakham Jah College of Engineering and Technology for their financial support.