Find in Library
Search millions of books, articles, and more
Indexed Open Access Databases
AN EFFICIENT CELL SELECTION IN CELLULAR NETWORK WITH BETTER SCALABILITY AND RE-ROUTING
oleh: KARTHIKEYAN A., SURYA Amutha M.
Format: | Article |
---|---|
Diterbitkan: | SORGING 2014-11-01 |
Deskripsi
This paper mainly concentrate about Cell selection strategy and Re-Routing process in the Cellular Network. Cell selection is the process of deciding the cell to provide services to every mobile station. After the mobile user or mobile station make a call, then nearby base station will allocate space for that particular call through base station controller. The ultimate aim is to find a maximum-profit subset of clients that can be fully satisfied by All-or-Nothing Demand Maximization algorithm (AoNDM) .Efficiency can be improved by Global Cell Selection mechanism. One of the important aspects of mobility management is mobility – ability to access service at anywhere, anyhow and anytime. The Edmonds–Karp algorithm is utilized to provide maximum flow from source to destination and deals the capacity of base station. For Re-Routing a predictive approach is used, where a Mcall is pre-established to potential new base stations by setting up a multicast tree with neighbouring base stations as leaf nodes. This Predictive approach reduces the latency caused by re-routing is in considerable level with strict time constraints. An extensive simulation study demonstrating the benefits of using our algorithms in high-loaded capacityconstrained of future 4G networks .Specifically, our algorithms obtain better usage of the network’s capacity, in comparison with the current cell selection algorithms and provide better results.