Distributed dynamic channel allocation problem can be solved in many different ways. Algorithms described in this paper provides the solution, but many future work is to be done. Deadlock avoidance is very important factor, as it can slow down (or even stop) migration of resources. Managing broken cells is a problem that is to be researched also, because it can force large inefficiency in system. Proposed extensions of GRME and other solutions to this problem will be researched in the nearer future.
Author: Grzegorz CHMAJ
REFERENCES
[1] Technological vortal: http://tevo.net
[2] DONG X., LAI T.H, , JIANG J, Distributed Dynamic Carrier Allocation in Mobile Cellular Networks: Search vs. Update. 17th Int’l Conf. Distributed Computer Systems, pp. 108-115, May 1997
[3] JIANG J, LAI T.H., SOUNDARAJAN N., On Distributed Dynamic Chanel Allocation In Mobile Cellular Networks. IEEE Transactions on parallel and distributed systems, IEEE 2003
[4] KATZELA I., NAGHSHINEH M., Channel Assignment Schemes for Cellular mobile Telecommunication Systems, IEEE Personal Comm, June 1996
[5] DONG X, LAI T.H., An Efficient Priority-Based Dynamic Channel Allocation for Mobile Cellular Networks, Proc IEEE INFOCOM ’97 Conf., 1997.