Enhancing Dynamic Base Station Relay station Association in Cellular Network for Load Balancing

Enhancing Dynamic Base Station Relay station Association in Cellular Network for Load Balancing

Deepshikha Ukey

Computer Science And Engineering(Information Security) Disha institute Of Management And Technology

Raipur, India

Prof. Somesh Dewangan

Computer Science And Engineering(Information Security) Disha institute Of Management And Technology

Raipur, India

Abstract Wireless will be the term helpful to describe just about any computer system where there is no physical " cable " connection involving sender along with receiver, but alternatively the system is connected by stereo waves and/or microwaves to maintain communications. In right now day among wireless system is cell phone network. A cell phone network is a mobile network that gives services through the use of a large number of base gas stops with constrained power, each covering a limited spot. This area is called a mobile or portable. The constrained power means that we can re-use exactly the same frequency several cells far from the base station with no causing disturbance. This document present technique for the load balancing within cellular system. This discusses concerning the various approach developed within decade involving year along with propose a technique for enhancing force balancing within cellular system using base station along with relay train station association.

Keywords Cellular networks, load balancing, dynamic relay station association dynamic channel borrowing; load balancing; neural-fuzzy controllers; channel allocation; wireless cellular networks; radio resource management.

1. INTRODUCTION

   Wireless could be the term utilized to describe any computer system where there isn't any physical born connection involving sender and also receiver, but alternatively the system is linked by radio stations waves and/or microwaves to keep communications. Wireless social networking utilizes certain equipment for instance NICs, APs and also routers in place of wires (copper or even optical fiber) regarding connectivity. The difference involving wired and also wireless can be that inside wired, the conversation between a couple devices can be via cables during wireless simply no direct physical connection is needed. Wireless networks offer huge convenience benefits over common wired networks. If build correctly, a wireless network can be quite reliable compared to wired. in this particular wireless world essentially the most common utilized wireless netwoek could be the cellular system A cell phone network is a mobile network to provide services by using numerous base programs with limited power, each covering only a limited location. This area is termed a mobile. The limited power means that we can re-use identical frequency some cells faraway from the starting station without causing disturbance. The cell phone network moved through 3 generations. The 1st generation regarding cellular networks is analog inside nature. To allow more

   cellular telephone subscribers, digital TDMA (time scale multiple access) and also CDMA (code scale multiple access) technologies are widely-used in the next generation (2G) to raise the system capacity. With digital technology, digitized voice is usually coded and also encrypted. Therefore, the 2G cell phone network is usually more protected. The third generation (3G) integrates cell phones into the net world by giving high pace packet-switching info transmission besides circuit-switching style transmission. The 3G cell phone networks are deployed in most parts regarding Asia, The european countries, and america since 2002 and will be widely deployed within the coming years.

   Fig : A Cellular Network

   A new cellular cellular network consists of a collection involving geometric regions, called cells (typically hexagonalshaped), each serviced by way of base place (BS) located at the centre. Several cells (or BS's) are again linked with a cellular switching centre (MSC) which usually acts to be a gateway on the cellular network towards existing wire- line networks like Open Switched Cell phone Network (PSTN), Integrated Services Digital Multilevel (ISDN) or even the World-wide-web. In mobile mobile marketing communications field, frequency channels can be a scarce useful resource. To utilize frequency stations efficiently, many sales channel assignment schemes like fixed sales channel assignment (FCA), dynamic sales channel assignment (DCA) in addition to hybrid sales channel assignment (HCA) happen to be proposed to assign frequencies to cells which has a goal to maximize the frequency reuse [1]. Channel job must fulfill some constraints to stop interference involving channels. The next constraints have got usually thought to be in sales channel assignment problem:

   1. This cochannel limit: The exact same radio frequency are not reused in the cells in a certain length from the other.

   2. Surrounding channel limit: Any set of two channels in adjacent cells need to have a specific distance.

   3. This cosite limit: Any set of two channels in the same cell need to have a specific distance. Each and every base place covers a geographical selection called a cell. Neighboring cells overlap with each other, which assures continuity while users move in one cell to a new. The people require conversation channels for the base channels, whereas every base place can work the people within the geographical selection. Users that experience the in a overlapping location, can be routed to either among the base channels. The users which are in a non- overlapping area ought to be routed towards corresponding starting station, and are in in which sense focused. Blocking occurs if a base station does not have any free sales channel to allocate with a user. The best way users are allocated over the base channels influences your blocking possibility. The allocation on the users could be guided from the load evening out principle. This principle says to balance your workload over the base channels, or, much more colloquially, divide weight as evenly as is possible, aiming to optimize performance measures on the system. Due to the fact we look at base channels with finitely quite a few channels, our primary objective in this analysis is usually to minimize your blocking possibility.

2. LOAD BALANCING

   Within computer networking, load balancing is really a technique to be able to distributed do the job between many computers, processes, hard hard drives or additional resources to acquire optimal learning resource utilization and decrease calculating time. The function is completed by the strain balancers. Load balancing is dividing the number of work a computer needs to do between 2 or more computers to ensure more do the job gets done inside the same amount of time and, generally, all consumers get dished up faster. Load balancing can be implemented having hardware, software package, or a variety of both. Usually, load balancing is the reason why for laptop or computer server clustering.

3. TYPES OF LOAD BALANCING ALGORITHEMS

   The basic idea of a load balancing is to equalize loads at all computers by transferring loads to idle or heavily loaded computers. Load balancing algorithms can broadly be classified into three categories.

   • Static algorithms

   • Dynamic algorithms

   • Adaptive algorithms

   1. Static Algorithms:

      With static algorithms, load handling decisions are generally hard-wired inside the algorithm utilizing a priori familiarity with the system. The overhead entailed in static algorihms is actually nil.

   2. Dynamic Algorithms:

      Dynamic algorithms make use of system talk about information (the loads at nodes) to create load managing decisions. Energetic algorithms possess t he or she potential to be able to outperform the particular static algorithms, since they are able to exploit the short-run fluctuations within the system to raise performance. Nevertheless they incur overhead within the collection, storage devices and evaluation of process state.

   3. Adaptive Algorithms:

   Adaptive algorithms are a special course of vibrant algorithms which usually adapt their own activities by means of dynamically modifying the parameters with the algorithm geared to the modifying system point out. Our results show your algorithms are competent for bettering throughput. Underneath high weight, the progress is up to 50% pertaining to uniform buyer distributions, or over to a order of magnitude pertaining to non uniform distribution of clients spots.

   Another weight balancing technique is Lingering load controlling technique. This weight balancing technique won't make any use of software or perhaps hardware node as well as the customer is permitted to select their own respective server and obtain services through that server. This process can be quite transparent and also useful through client standpoint as the item discloses your presence of multiple servers for the backend. This system assigns every new buyer with different group of server on a round the boy wonder allocation groundwork. This process of load balancing means that each brand-new client can be assigned using specific server with out server can be overloaded using particular buyer.

4. LOAD BALANCING SCHEMES

   A. Bubble Oscillation Algorithm

   Virtually any un-served traffic from your network could be absorbed from your geographic heap balancing just as that vacuum cleaner pressure involving bubbles will be filled through bubble oscillations. Geographic heap balancing could possibly be known like a brand-new tactic for visitors heap evening out gives active heap redistribution instantly based on the current geographic readers conditions. It enables you to improve your performance for virtually any distributed approaches containing non-uniformly distributed traffic, for resolving your traffic scorching spots. bubble oscillation formula for geographic heap balancing during mobile cellular phone network. The method capacity could be improved through adjusting your cell decoration based on the current geographic readers distribution. The close to optimum cellular phone coverage can be purchased when when using the bubble oscillation formula. The geographic heap balancing is completed by emulating your bubble oscillations, since the procedure connected with basic stations re-allocating un- served readers units is very like that linked to bubbles filling

   up the cleaners between they. The effects from pc simulations include demonstrated what's so great about the geographic heap balancing system plus the efficiency and also accuracy using the algorithm. The bubble oscillation formula described here works extremely well for your geographic heap balancing method at some other environments or perhaps other similar multidimensional useful resource allocation troubles.

   B. User Association techaniqu:

   user association schemes is accomplish load balancing in HetNets through a network-wide utility maximization problem. this first take into account the cell affiliation and resource allocation jointly, and suggest an second bound about performance. Then that formulate a new logarithmic utility maximization problem where the equal resource allocation will be optimal, and design a new distributed criteria via twin decomposition, on the relaxation of physical difficulties. The dispersed algorithm will be proved for you to converge to your near-optimal answer, with lower complexity that is linear to how many users and how many BSs. Finally, this structure is extended towards the range expansion technique, which calls for limited changes towards the existing program architecture through introducing biasing components to modest BSs. In this consider two forms of biasing components (SINR and rate), and evaluate the effects of BSs density and send power around the biasing factors by using our load-aware affiliation scheme. observation shows that the optimum biasing components are nearly in addition to the BS densities with the various divisions, but highly dependent on the per-tier send powers. With your optimal biasing components, the network nearly achieves the optimal load-aware effectiveness.

   C.Relay Based Dynamic Load Balancing Scheme

   Throughout relay-based weight balancing Scheme no resolve division associated with channels is done and most transmissions work about the same spectrum. In accordance with an association control algorithm, MUs and RSs can easily reassociate through hot tissues to neighboring cooler tissues to balance the strain. Simulation final results show which our scheme can easily improve performance of border MUs drastically. A amazing feature in the scheme can be that RSs are used to transfer over-loaded targeted visitors from sizzling cells for you to neighboring chilly cells. A on-line algorithm which dynamically adjustments the links of Rss with BSs and associations associated with MUs with RSs and BSs can be proposed. Simulation final results show which our scheme can easily significantly improve performance associated with boundary MUs and also the MUs fairness without penalizing full system throughput.

   D.Load Balancing Based on Clustering Methods

   Holistic load-balancing algorithm which will help congested tissue handle site visitors dynamically. The algorithm is set up on clustering techniques which permits it for being placed upon any fast technology which includes LTE, WiMAX as well as GSM. The algorithm can be automatically inflated and activated when necessary for any cell about the system. It

   might be implemented in a very distributed as well as semi- distributed vogue. The initiating cycle as a result algorithm can be left for your operator to settle on; the origin variations are often slow so you shouldn't have for easily self-optimizing group (SON) algorithms. Using some kind of pair-wise solution to adjust this handover border significantly improves the performance with all the system in comparison to conventional methods which use the cell-wise procedure. This procedure shows a loss of the CBR exceeding beyond 85% in most cells. Moreover, a all round reduction regarding 75% on the inside CBR can be achieved about the overall technique. Results display a distribution with all the load with all the congested cellular or lightweight to the neighbor just one step only, which drastically reduces this signaling more than head and also losing regarding resources on the inside lightly- loaded cells in comparison to conventional tactics..

   E. Cell Breathing Techniques

   A brand new technique which achieves fill balancing by simply reducing your cell measurement of overloaded APs, which will be conceptually just like the so-called mobile breathing approaches in cell networks. The scheme won't require virtually any modification with the user area neither the conventional, but the item only requires the capacity of dynamically altering the transmitting power in the AP beacon mail messages. Unlike existing cell breathing methods, which in turn utilize neighborhood optimization heuristics, develop algorithms which guarantee to get the optimal beacon power settings, which minimize the strain of the most extremely congested APs, within polynomial time period. This offered rigorous analysis in the problem along with presented two algorithms which find network-wide deterministic optimal solutions. The initial algorithm minimizes the strain of nearly all congested AP(s) within the network, along with the second formula produces an optimal min-max (priority) fill balanced answer. These optimal slutions are generally obtained only while using minimal information which can be readily available with no special the assistance of the consumers or modification in the standard. With this assumes your control around the transmission power in the AP beacon mail messages, which needs to be possible using simple software package update connected with APs. The simulations demonstrate that even only a few power degrees, e. grams., between 5 for you to 10, will do to obtain near optimal load handling solutions, which can be another indication in the practicality of our scheme. Used, this cell-breathing scheme is usually deployed within network supervision tool connected with WLANs along with activated every time the APs encounter unbalanced fill.

   F. Load Balancing by Dynamic Base Station Relay Station Associations:

   almost any relay-assisted load balancing plan in cellphone networks. The swap stations might be dynamically relating to different groundwork stations. The stress transferring received from over-loaded cellphone material for you to neighboring under-loaded cellphone material is located the

   acknowledgement by dynamically transforming the beds base station-relay section associations. This distributed solution, in which regularly each swap station only has to exchange facts which involves neighboring groundwork stations in conjunction with makes almost any re-association selection independently, investigate the tension balancing issue by Rss or atom association in the cellular network to cut back the at all times call avoiding probability. This would be the method to be able to calculate this blocking likelihood reduced merely by re-association of the RS, and describe the condition as almost any weighted greatest independent fixed problem. Using this type of distributed solution, each RS only has to exchange information with nearby BSs and create a re- association selection independently. Simulation rewards show that in the cellular multilevel where website visitors distributes non-uniformly, the final call avoiding probability might be significantly reduced by utilizing our supplied schemes.

5. PROBLEM DEFFINETION

   Next generation wireless networks could have more- small cells to provide ubiquitous excessive data-rate services. This trend leads to more dynamic variation connected with traffic weight in each time sector and room domain. On the other hand, most active cellular networks are intended by assuming a fixed traffic weight.

   There has become several studies on multi-cell systems, which might be classified in to two varieties: –

   1. The first can be a traditional weight balancing issue, and

   2. The 2nd is ICI mitigation problem bringing in much interest recently.

      In cellular systems, mobile customers in hot cells may endure low throughput as a result of load disproportion problem. Also other sorts of problems are usually exist within cellular systems:-

      • Expected Throughput

      • Lack of resource utilization

      • Uncertainty

      • Failure of base station

      • Failure of overloaded cell

      • No rotational node scheme

      • Congestion Problem.

   But also performance gap exist in the cellular network. So, I would like to use any specific algorithms to reduce the performance.

6. PRAPOSED WORK

Existing algorithm is not sufficient and also not provable. So, I am doing research on the same to improve for productivity using any specific algorithm; Like:-

1. Using Distributed algorithm instead of centralized greedy algorithm.

2. Using load balancing (LB) Algorithm, in which two algorithms were reviewed: the Heaviest-first LB and the QoS- aware LB.

3. Using optimal offline and practical online algorithm.

Our consideration is; By using any specific algorithm, we get:-

1. Minimization of Problem.

2. Reduced Call blocking probability.

3. Reduced Performance gap and Improvement in Throughput.

Optimization (routing)

ACKNOWLADGEMENT

I am very much grateful to Department of CSE, DIMAT to give me opportunity to work on Load balancing in cellular network. I sincerely express my gratitude to Mr. Somesh Dewangan Dept. of M.Tech CSE, DIMAT for giving constant inspiration for this work. I am also thankful to Mrs. Preeti Tuli, Dept. of CSE, DIMAT for helping me directly and indirectly during this work. I am really thankful to my all friends for their blessing and support.

REFFERENCE

1. T. S. Rappaport, Wireless communications : principles and practice. Upper Saddle River, N.J., London: Prentice Hall PTR, Prentice-Hall International, 1996.

2. M. Chryssomallis, Smart antennas, IEEE Antennas and Propagation Magazine, vol. 42, no. 3, pp. 129136, June 2000.

3. T. Yum and W. Wong, Hot-spot traffic relief in cellular systems, IEEE Journal on Selected Areas in Communications, vol. 11, no. 6, pp. 934 940, August 1993.

4. A. Lindsay-Stewart, W. C. Y. Lee, M. A. Schulz, and C. Xu,

   Incremental capacity gains for high blocking sites using dynamic channel sharing, IEEE Transactions on Vehicular Technology, vol. 50, no. 1, pp. 111, January 2001.

5. Y. Argyropoulos, S. Jordan, and S. Kumar, Dynamic channel allocation in interference-limited cellular systems with uneven traffic distribution, IEEE Transactions on Vehicular Technology, vol. 48, no. 1, pp. 224 232, January 1999.

6. F. Delli Priscoli, N. Magnani, V. Palestini, and F. Sestini, Application of dynamic channel allocation strategies to the GSM cellular network, IEEE Journal on Selected Areas in Communications, vol. 15, pp. 1558 1567, October 1997.

7. D. Everitt and D. Manfield, Performance analysis of cellular mobile communication systems with dynamic channel assignment, IEEE Journal on Selected Areas in Communications, vol. 7, no. 8, pp. 1172 1180, October 1989.

8. Y. Chen and L. Cuthbert, Optimum size of soft handover zone in powercontrolled UMTS downlink systems, Electronics Letters, vol. 38, no. 2, pp. 8990, Jan 2002.

9. D. wan Tcha, S. yon Kang, and G. whan Jin, Load analysis of the soft handoff scheme in a CDMA cellular system, IEEE Journal on Selected Areas in Communications, vol. 19, no. 6, pp. 1147 1152, June 2001.

10. A. Le, D. Kum, Y. Cho, and C. Toh, Routing with Load-Balancing in Multi-Radio Wireless Mesh Networks, IEICE TRANS. COMMUN., No. 3, 2009.

11. D. Nandiraju, L. Santhanam, N. Nandiraju, D.P. Agrawal, Achieving load balancing in wireless mesh networks with multiple gateways, in: Proceedings of IEEE International Workshop on Wireless Mesh- Networks and Applications (WiMa06), 2006.

12. Galvez,J.J, Ruiz,P.M.; Skarmeta, A distributed algorithm for gateway load-balancing in Wireless Mesh Networks, Wireless Days, 2008, pp. 1- 5.

13. L. T. Nguyen, Beuran R, ShinodaY, A load-aware routing metric for wireless mesh networks, in: proc. of IEEE symposium on Computers and Communications, 2008, pp. 429 435.

14. Liang Ma, Denko M.K, A Routing Metric for Load Balancing in Wireless Mesh Networks, in: proc. of IEEE 1stInternational conference on Advanced Information Networking and Applications Workshops, 2007, pp. 409 414.

15. 3GPP TR 36.814, Further advancements for E-UTRA physical layer aspects, v9.0.0, Mar. 2010.

16. Z. Yang, et al., Load Balancing by Dynamic Base Station Relay Station Associations in

    Cellular Networks, IEEE Wireless Commun. Letters., vol. 2, no. 2, pp. 2162-2337, April 2013.

17. K. Son, et al., Dynamic association for load balancing and interference avoidance in multi-cell networks, IEEE Trans. Wireless Commun., vol. 8, no. 7, pp. 35663576, July 2009.

18. Z. Yang, et al., Throughput improvement by joint relay selection and link scheduling in relay-assisted cellular networks, IEEE Trans Veh. Technol., vol. 61, no. 6, pp. 28242835, July 2012.

19. Z. Yang, et al., A New Relay Based Dynamic Load Balancing Scheme in Cellular Networks, IEEE Trans. Veh. Technol., vol. 72, no. 6, pp. 42443574, Sept. 2010.

20. H. Gong, et al., Dynamic Load Balancing through Association Control of Mobile

    Users in Wi-Fi Networks,IEEE Trans. On Consumer Electronics, vol. 54, no. 2, pp. 00983063, May 2008.

21. X. Wu, et al., MACA: an efficient channel allocation scheme in cellular networks, in Proc. 2000 IEEE Globecom, pp. 13851389.

22. O. Altrad, et al., Load Balancing Based on Clustering Methods for LTE Networks, IEEE Journal of Selected Areas in Telecommun., vol. 3, no. 2, Feb. 2013.

23. K. Son, et al., Base Station Operation and User Association Mechanisms for Energy-Delay Tradeoffs in Green Cellular Networks, IEEE Journal of Selected Areas in Commun., vol. 29, no. 8, pp. 0733- 8716, Sept. 2011.